The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for bound with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1952-1964 (17) 1965-1967 (18) 1968 (15) 1969 (16) 1970-1971 (23) 1972 (23) 1973 (26) 1974 (26) 1975 (35) 1976 (41) 1977 (24) 1978 (28) 1979 (20) 1980 (36) 1981 (47) 1982 (31) 1983 (34) 1984 (55) 1985 (79) 1986 (68) 1987 (78) 1988 (118) 1989 (150) 1990 (191) 1991 (177) 1992 (220) 1993 (233) 1994 (287) 1995 (323) 1996 (285) 1997 (359) 1998 (452) 1999 (528) 2000 (560) 2001 (711) 2002 (783) 2003 (940) 2004 (1232) 2005 (1543) 2006 (1824) 2007 (1783) 2008 (2047) 2009 (1391) 2010 (549) 2011 (423) 2012 (470) 2013 (533) 2014 (512) 2015 (498) 2016 (508) 2017 (546) 2018 (521) 2019 (574) 2020 (632) 2021 (571) 2022 (681) 2023 (650) 2024 (174)
Publication types (Num. hits)
article(11654) book(2) incollection(79) inproceedings(12937) phdthesis(47)
Venues (Conferences, Journals, ...)
CoRR(1652) IEEE Trans. Inf. Theory(781) SODA(341) IEEE Trans. Signal Process.(333) FOCS(304) STOC(265) ISIT(239) Discret. Math.(211) IEEE Trans. Commun.(210) Discret. Comput. Geom.(207) ICALP(203) J. ACM(200) IEEE Trans. Wirel. Commun.(194) STACS(187) SCG(178) ISAAC(174) More (+10 of total 2757)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 14493 occurrences of 5604 keywords

Results
Found 24722 publication records. Showing 24719 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
45Alexandre Renaux, Philippe Forster, Pascal Larzabal, Christ D. Richmond, Arye Nehorai A Fresh Look at the Bayesian Bounds of the Weiss-Weinstein Family. Search on Bibsonomy IEEE Trans. Signal Process. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
45Jun Wu 0010, Tei-Wei Kuo Real-Time Scheduling of CPU-Bound and I/O-Bound Processes. Search on Bibsonomy RTCSA The full citation details ... 1999 DBLP  DOI  BibTeX  RDF CPU-Bound Process, I/O-Bound Process, Real-Time Systems, Real-Time Scheduling, Priority Ceiling Protocol
42Satoshi Fujita, Masayuki Masukawa, Shigeaki Tagashira A Fast Branch-and-Bound Algorithm with an Improved Lower Bound for Solving the Multiprocessor Scheduling Problem. Search on Bibsonomy ICPADS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF lower bound on the execution time, quadratic algorithm, Branch-and-bound algorithm, multiprocessor scheduling problem
41Yufeng Wu, Dan Gusfield A new recombination lower bound and the minimum perfect phylogenetic forest problem. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Lower bound on the minimum number of recombination, Ancestral recombination graph, Computational complexity, Recombination, Population genetics
40Xijin Yan, Jun Yang, Zhen Zhang 0010 An outer bound for multisource multisink network coding with minimum cost consideration. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF K-pairs transmission, max-flow min-cut bound, multisource multisink network, network sharing bound, three-layer network, network coding, side information
38Juliana Tay, Yang Miang Goh, Sufiana Safiena, Helen Bound Designing digital game-based learning for professional upskilling: A systematic literature review. Search on Bibsonomy Comput. Educ. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
38Jim Bound, Yanick Pouffary, Steve Klynsma, Tim Chown, David Green IPv6 Enterprise Network Analysis - IP Layer 3 Focus. Search on Bibsonomy RFC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
38Jim Bound IPv6 Enterprise Network Scenarios. Search on Bibsonomy RFC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
38Robert E. Gilligan, Susan Thomson 0002, Jim Bound, Jack McCann, W. Richard Stevens Basic Socket Interface Extensions for IPv6. Search on Bibsonomy RFC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
38Ralph E. Droms, Jim Bound, Bernie Volz, Ted Lemon, Charles E. Perkins, Mike Carney Dynamic Host Configuration Protocol for IPv6 (DHCPv6). Search on Bibsonomy RFC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
38Robert E. Gilligan, Susan Thomson 0002, Jim Bound, W. Richard Stevens Basic Socket Interface Extensions for IPv6. Search on Bibsonomy RFC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
38Charles E. Perkins, Jim Bound DHCP for IPv6. Search on Bibsonomy ISCC The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
38Paul Vixie, Susan Thomson 0002, Yakov Rekhter, Jim Bound Dynamic Updates in the Domain Name System (DNS UPDATE). Search on Bibsonomy RFC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
38Robert E. Gilligan, Susan Thomson 0002, Jim Bound, W. Richard Stevens Basic Socket Interface Extensions for IPv6. Search on Bibsonomy RFC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
38Daniel T. Harrington, James P. Bound, John J. McCann, Matt Thomas Internet Protocol Version 6 and the Digital UNIX Implementation Experience. Search on Bibsonomy Digit. Tech. J. The full citation details ... 1996 DBLP  BibTeX  RDF
38Jim Bound, Brian E. Carpenter, Daniel T. Harrington, Jack Houldsworth, Alan Lloyd OSI NSAPs and IPv6. Search on Bibsonomy RFC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
38Jim Bound IPng BSD Host Implementation Analysis. Search on Bibsonomy RFC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
38William A. J. Bound Discussing security with top management. Search on Bibsonomy Comput. Secur. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
38William A. J. Bound, Dennis R. Ruth Making risk analysis a useful management tool with microcomputer electronic worksheet packages. Search on Bibsonomy Comput. Secur. The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
37Gil Wiechman, Igal Sason An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
36Yunpeng Pan, Leyuan Shi On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems. Search on Bibsonomy Math. Program. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Time-indexing, Scheduling, Combinatorial optimization
35Débora P. Ronconi A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF lower bound, branch-and-bound, blocking, makespan, flowshop
35Satoshi Fujita, Masayuki Masukawa, Shigeaki Tagashira A Fast Branch-and-Bound Scheme for the Multiprocessor Scheduling Problem with Communication Time. Search on Bibsonomy ICPP Workshops The full citation details ... 2003 DBLP  DOI  BibTeX  RDF lower bound on the execution time, Branch-and-bound algorithm, communication time, multiprocessor scheduling problem
35Ahmed El-Amawy Clocking Arbitrarily Large Computing Structures Under Constant Skew Bound. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF constant skew bound, arbitrarily large computing structures, communicating cells, skew upper bound, maximum clocking rate, 2-D mesh framework, node design, nonplanar structures, parallel architectures, stability, hypercubes, network topology, synchronisation, hypercube networks, clocks, clock skew, global synchronization
34Firouz Behnamfar, Fady Alajaji, Tamás Linder An Efficient Algorithmic Lower Bound for the Error Rate of Linear Block Codes. Search on Bibsonomy IEEE Trans. Commun. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
34Alex S. Fukunaga Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver. Search on Bibsonomy CPAIOR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
33Sumit Gulwani, Florian Zuleger The reachability-bound problem. Search on Bibsonomy PLDI The full citation details ... 2010 DBLP  DOI  BibTeX  RDF disjunctive invariants, resource bound analysis, pattern matching, transitive closure, ranking functions
33Deji Chen 0001, Aloysius K. Mok, Tei-Wei Kuo Utilization Bound Re-visited . Search on Bibsonomy RTCSA The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Scheduling, Utilization bound
33Michel Langevin, Eduard Cerny A recursive technique for computing lower-bound performance of schedules. Search on Bibsonomy ACM Trans. Design Autom. Electr. Syst. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF lower-bound on performance, microcode optimization, scheduling, resource constraints, dataflow graph
33Dipankar Sarkar 0001, S. C. De Sarkar A Set of Inference Rules for Quantified Formula Handling and Array Handling in Verification of Programs Over Integers. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF quantified formula handling, array handling, undecidability problem, automated verifier, quantified formulas, bound-extension rule, bound-modification, theorem proving, program verification, program verification, first-order logic, inference mechanisms, decidability, inference rules, integer arithmetic
32Kai Kwong Lau, Mohan J. Kumar, N. R. Achuthan Parallel implementation of branch and bound algorithm for solving vehicle routing problem on NOWs. Search on Bibsonomy ISPAN The full citation details ... 1997 DBLP  DOI  BibTeX  RDF parallel branch and bound, super-linear speedup, real time, load balancing, optimisation, Networks of Workstations, vehicle routing problem, VRP, operations research, operational research, branch and bound algorithm
32Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam The price of anarchy in network creation games. Search on Bibsonomy PODC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF routing, nash equilibrium, network design, price of anarchy
31Cong Ling 0001 Generalized Union Bound for Space-Time Codes. Search on Bibsonomy IEEE Trans. Commun. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
31Yufeng Wu, Dan Gusfield A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem. Search on Bibsonomy COCOON The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
31Zhaoxuan Shen, Ching-Chuen Jong Functional area lower bound and upper bound on multicomponentselection for interval scheduling. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
30Heeralal Janwa, Arbind K. Lal On Generalized Hamming Weights and the Covering Radius of Linear Codes. Search on Bibsonomy AAECC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Generalized Hamming weights, chain condition, generalized Griesmer bound, covering radius, cyclic codes, optimal codes, Griesmer bound
30Teresa Alsinet, Felip Manyà, Jordi Planes A Max-SAT Solver with Lazy Data Structures. Search on Bibsonomy IBERAMIA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF data structures, heuristics, lower bound, branch and bound, Max-SAT
29Arnaud Venet, Guillaume P. Brat Precise and efficient static array bound checking for large embedded C programs. Search on Bibsonomy PLDI The full citation details ... 2004 DBLP  DOI  BibTeX  RDF difference-bound matrices, abstract interpretation, program verification, pointer analysis, array-bound checking
29Dong-Won Park, Swaminathan Natarajan, Arkady Kanevsky, Myung Jun Kim A generalized utilization bound test for fixed-priority real-time scheduling. Search on Bibsonomy RTCSA The full citation details ... 1995 DBLP  DOI  BibTeX  RDF generalized utilization bound test, fixed-priority real-time scheduling, utilization bound test, rate-monotonic priority assignment, exact schedulability criterion, task deadlines, linear programming, linear programming, processor scheduling, multiprogramming
29Richard Cleve, John Watrous Fast parallel circuits for the quantum Fourier transform. Search on Bibsonomy FOCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF fast parallel circuits, quantum Fourier transform, QFT, circuit depth, constant error, depth bound, polynomial size, classical polynomial-time processing, depth complexity, arbitrary modulus, lower bound, theorem proving, quantum computing, Fourier transforms, upper bound, circuit complexity, circuit complexity, quantum circuits, factoring algorithm
29Nancy A. Lynch Simulation Techniques for Proving Properties of Real-Time Systems. Search on Bibsonomy REX School/Symposium The full citation details ... 1993 DBLP  DOI  BibTeX  RDF timing-based system, untimed system, invariant assertion, progress function, execution correspondence, Simulation, real-time system, lower bound, invariant, mutual exclusion, upper bound, clock synchronization, leader election, time bound
29Ramesh Krishnamurti An Approximation Algorithm for Scheduling Tasks on Varying Partition Sizes in Partitionable Multiprocessor Systems. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1992 DBLP  DOI  BibTeX  RDF parameter dependent bound, asymptotically tight bound, partition sizes, partitionable multiprocessor systems, multiple partitions, minimum completion time schedule, worst-case performance bound, scheduling, parallel algorithms, computational complexity, approximation algorithm, parallelization, controller, multiprocessing systems, NP-hard, task scheduling, polynomial time algorithm, processors, multiprocessing programs
29Fang-Wei Fu 0001, Shu-Tao Xia The characterization of binary constant weight codes meeting the bound of Fu and Shen. Search on Bibsonomy Des. Codes Cryptogr. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF 05B30, 05B05, AMS Classifications 94B65
29Olav Geil, Christian Thommesen On the Feng-Rao Bound for Generalized Hamming Weights. Search on Bibsonomy AAECC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
29Lap-Chung Lam, Tzi-cker Chiueh Checking Array Bound Violation Using Segmentation Hardware. Search on Bibsonomy DSN The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
29Ilia Rapoport, Yaakov Oshman A new estimation error lower bound for interruption indicators in systems with uncertain measurements. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
28Giri Tiruvuri, Moon Chung Estimation of lower bounds in scheduling algorithms for high-level synthesis. Search on Bibsonomy ACM Trans. Design Autom. Electr. Syst. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF lower-bound estimated, scheduling, dynamic programming, high-level synthesis
28S. Murtaza, Alfons G. Hoekstra, Peter M. A. Sloot Compute Bound and I/O Bound Cellular Automata Simulations on FPGA Logic. Search on Bibsonomy ACM Trans. Reconfigurable Technol. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF FPGA-based hardware accelerator, lattice Boltzman simulations, High-performance computing, cellular automata
28Xiuzhen Huang, Jing Lai Maximum Common Subgraph: Upper Bound and Lower Bound Results. Search on Bibsonomy IMSCCS (1) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
28Zi Li, Yueming Cai Maximum-likelihood detection based on branch and bound algorithm for MIMO systems. Search on Bibsonomy Sci. China Ser. F Inf. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF active set, branch and bound, detection, Cholesky factorization, multiple-input multiple-output (MIMO), dual
28Thi Viet Nga Nguyen, François Irigoin Efficient and effective array bound checking. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF interprocedural analysis, Array bound checking
28Miodrag J. Mihaljevic, Marc P. C. Fossorier, Hideki Imai A Novel Broadcast Encryption Based on Time-Bound Cryptographic Keys. Search on Bibsonomy DRMTICS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF time-limited services, cryptographic keys management, time-bound keys, one-way mappings, broadcast encryption, pseudorandom number generators
28Stefan Tschöke, Reinhard Lüling, Burkhard Monien Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network. Search on Bibsonomy IPPS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF distributed branch-and-bound algorithm, 1024 processor network, 1-tree relaxation, direct-neighbor dynamic load-balancing strategy, parallel algorithms, parallelization, travelling salesman problems, travelling salesman problem, massively parallel computer, sequential algorithm
27Minseok Song 0001, Naehyuck Chang, Heonshik Shin A new queue discipline for various delay and jitter requirements in real-time packet-switched networks. Search on Bibsonomy RTCSA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF fairness requirements, real-time packet-switched networks, data packet scheduling, service priority, jitter bound, Rate-controlled Frame-based Weighted Round Robin, frame-based WRR server, constant buffer space, scheduling, asynchronous transfer mode, delays, queueing theory, packet switching, bandwidth, ATM networks, rate controller, jitter, telecommunication traffic, end-to-end delays, delay bound
27Jürgen Bierbrauer, Holger Schellwat Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications. Search on Bibsonomy CRYPTO The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Low bias, almost independent arrays, Hermitian codes, Suzuki codes, Weil-Carlitz-Uchiyama bound, exponential sum method, Zyablov bound, authentication, Fourier transform, hashing, resiliency, Reed-Solomon codes
27Yahui Zhu, Mohan Ahuja On Job Scheduling on a Hypercube. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF LDF algorithm, job preemption, minimum finish time schedule, list scheduling algorithm, absolute bound, scheduling, computational complexity, distributed algorithms, lower bound, NP-complete, hypercube, hypercube networks, scheduling algorithms, job scheduling
27Xian Cheng, Oliver C. Ibe Reliability of a Class of Multistage Interconnection Networks. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF extra-stage interconnectionnetworks, fault-free path, input-output pair, networkreliability, broadcast reliability, recursive expression, lower bound, probability, multiprocessor interconnection networks, upper bound, multistage interconnection networks, tight bounds, reliability theory, terminal reliability
27Shao Liu, Minghua Chen 0001, Sudipta Sengupta, Mung Chiang, Jin Li 0001, Philip A. Chou P2P Streaming Capacity under Node Degree Bound. Search on Bibsonomy ICDCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF P2P Streaming Capacity, Node Degree Bound, Node Out-Degree Bound, P2P Streaming
27William S. Evans, Leonard J. Schulman Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF signal propagation, noisy formulas depth, information signal, exact bounds, decay, lower bound, Markov chains, upper bound
27Jin-yi Cai, Martin Fürer, Neil Immerman An Optimal Lower Bound on the Number of Variables for Graph Identification Search on Bibsonomy FOCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF optimal lower bound, graph identification, lower bound, first-order logic
27Rina Panigrahy, Kunal Talwar, Udi Wieder A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
27Femke van Raamsdonk Higher-Order Rewriting. Search on Bibsonomy RTA The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
26Enrico Paolini, Marc P. C. Fossorier, Marco Chiani Doubly-Generalized LDPC Codes: Stability Bound Over the BEC. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
26Stéphanie Bay, Cédric Herzet, Jean-Marc Brossier, Jean-Pierre Barbot, Benoit Geller Analytic and Asymptotic Analysis of Bayesian Cramér-Rao Bound for Dynamical Phase Offset Estimation. Search on Bibsonomy IEEE Trans. Signal Process. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
26Iftach Haitner, Jonathan J. Hoch, Gil Segev 0001 A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
26Dominique Quadri, Éric Soutif, Pierre Tolla A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems. Search on Bibsonomy SOFSEM (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
26Syed Ali Jafar, Andrea J. Goldsmith Isotropic fading vector broadcast Channels: The scalar upper bound and loss in degrees of freedom. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
26Tarek F. Abdelzaher, Vivek Sharma 0004, Chenyang Lu 0001 A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Real-time scheduling, schedulability analysis, utilization bounds, aperiodic tasks
26Rajiv Gupta 0001 Optimizing Array Bound Checks Using Flow Analysis. Search on Bibsonomy LOPLAS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF available checks, check hoisting, very busy checks, dataflow analysis
26Jun (Jim) Xu, Richard J. Lipton On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms. Search on Bibsonomy SIGCOMM The full citation details ... 2002 DBLP  DOI  BibTeX  RDF quality of service, computational complexity, decision tree, packet scheduling, delay bound
26Jimmy Shinn-Hwa Wang, Wayne Wei-Ming Dai Transformation of min-max optimization to least-square estimation and application to interconnect design optimization. Search on Bibsonomy ICCD The full citation details ... 1995 DBLP  DOI  BibTeX  RDF min-max optimization transformation, interconnect design optimization, tighter bound, circuit layout CAD, minimisation, least squares approximations, multichip modules, multichip modules, least-square estimation, minimax techniques
26Z. C. Xuan, K. H. Lee, Jaime Peraire A Posteriori Output Bound for Partial Differential Equations Based on Elemental Error Bound Computing. Search on Bibsonomy ICCSA (1) The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
26Franz Baader Unification, Weak Unification, Upper Bound, Lower Bound, and Generalization Problems. Search on Bibsonomy RTA The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
25Andrew Paul Smith Fast construction of constant bound functions for sparse polynomials. Search on Bibsonomy J. Glob. Optim. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Constrained global optimization, Interval arithmetic, Relaxation, Lazy evaluation, Multivariate polynomials, Bernstein polynomials, Bound functions
25Zhangzhi Zhang, Xiaoguang Dai, S. W. Cheung, T. I. Yuk A new union bound based on Hölder inequality for space-time codes. Search on Bibsonomy IWCMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Hölder inequality, union bound, space-time codes, PEP
25Iwan M. Duursma, Radoslav Kirov An Extension of the Order Bound for AG Codes. Search on Bibsonomy AAECC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF order bound, Suzuki curve, Algebraic geometric code
25Sumit Gulwani, Sagar Jain, Eric Koskinen Control-flow refinement and progress invariants for bound analysis. Search on Bibsonomy PLDI The full citation details ... 2009 DBLP  DOI  BibTeX  RDF control-flow refinement, progress invariants, formal verification, program verification, termination, bound analysis
25Krzysztof Walkowiak Branch-and-Bound Algorithm for Anycast Flow Assignment in Connection-Oriented Networks. Search on Bibsonomy ICCSA (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF branch-and-bound, anycast, connection-oriented network
25Yutaka Jitsumatsu, Tohru Kohda Chip-Asynchronous Version of Welch Bound: Gaussian Pulse Improves BER Performance. Search on Bibsonomy SETA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Welch bound equality (WBE) sequence, total squared correlation (TSC), pulse shaping filter, asynchronous DS/CDMA system
25Rui Fan 0004, Nancy A. Lynch An Omega (n log n) lower bound on the cost of mutual exclusion. Search on Bibsonomy PODC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF lower bound techniques, information theory, time complexity, mutual exclusion
25Pascal Babu, Laurent Péridy, Eric Pinson A Branch and Bound Algorithm to Minimize Total Weighted Tardiness on a Single Processor. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Lagrangian decomposition, scheduling, branch & bound
25Keivan Navaie, Ahmad R. Sharafat An Upper Bound on Air Interface Blocking Probability in Multiservice CDMA Networks. Search on Bibsonomy Int. J. Wirel. Inf. Networks The full citation details ... 2003 DBLP  DOI  BibTeX  RDF multiservice CDMA, Blocking probability, Chernoff bound
25Yanhong A. Liu, Gustavo Gomez Automatic Accurate Cost-Bound Analysis for High-Level Languages. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2001 DBLP  DOI  BibTeX  RDF cost bound, performance analysis and measurements, program analysis and transformation, space analysis, timing analysis, time analysis, worst-case execution time, program optimization, Cost analysis
25Jan Jonsson, Kang G. Shin A Parametrized Branch-and-Bound Strategy for Scheduling Precedence-Constrained Tasks on a Multiprocessor System. Search on Bibsonomy ICPP The full citation details ... 1997 DBLP  DOI  BibTeX  RDF real-time scheduling precedence-constrained tasks, branch-and-bound strategy, multiprocessor systems, hard real-time systems
25Rajat Kumar Pal, Sudebkumar Prasant Pal, Ajit Pal An Algorithm for Finding a Non-Trivial Lower Bound for Channel Routing. Search on Bibsonomy VLSI Design The full citation details ... 1997 DBLP  DOI  BibTeX  RDF three-layer restricted dogleg routing model, nontrivial lower bound, channel routing problem, two-layer Manhattan routing model, three-layer no-dogleg HVH routing model, two-layer restricted dogleg routing model, vertical constraint graph, VLSI, polynomial time algorithm, VLSI design
25Sanghyun Ahn, David Hung-Chang Du A Multicast Tree Algorithm Considering Maximum Delay Bound for Real-Time Applications. Search on Bibsonomy LCN The full citation details ... 1996 DBLP  DOI  BibTeX  RDF multicast tree algorithm, maximum delay bound, multiple multicast tree concept, tree maintenance cost, DBMT problem, shortest path tree-based DBMT, minimal Steiner tree-based DBMT, MST DBMT, SPT DBMT, performance analysis, group communication, NP-hardness, heuristic algorithms, real-time applications, multicast routing, telecommunication traffic, real-time traffic
25Michèle Dion, Marc Gengler, Stéphane Ubéda Comparing two Probabilistic Models of the Computational Complexity of the Branch and Bound Algorithm. Search on Bibsonomy CONPAR The full citation details ... 1994 DBLP  DOI  BibTeX  RDF modelization, complexity, parallel computing, combinatorial optimization, Branch and bound algorithm
25Ronald Armstrong, Su Gao, Lei Lei A zero-inventory production and distribution problem with a fixed customer sequence. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Zero-inventory production and distribution problem, Product lifespan, Branch and bound search procedure, Heuristic lower bound, Time windows
25Teresa Alsinet, Felip Manyà, Jordi Planes An efficient solver for weighted Max-SAT. Search on Bibsonomy J. Glob. Optim. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Weighted Branch and bound, Data structures, Heuristics, Lower bound, Max-SAT
25Cunsheng Ding, Mordecai J. Golin, Torleiv Kløve Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets. Search on Bibsonomy Des. Codes Cryptogr. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Welch bound, Karystinos-Pados bound, code division multiple access, codes, binary sequences
25Ciprian Borcea, Ileana Streinu On the number of embeddings of minimally rigid graphs. Search on Bibsonomy SCG The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Cayley-Menger variety, lower bound, upper bound, graph embedding, rigidity, distance geometry
25Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks On the totalk-diameter of connection networks. Search on Bibsonomy ISTCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF k edge-disjoint paths, minimal sum of lengths, fault-tolerant routing problems, k-connected simple graph, total/sub k/-diameter, graph theory, lower bound, ATM networks, upper bound, nodes, compact routing, connection network
25Aloysius K. Mok, Deji Chen 0001 A multiframe model for real-time tasks. Search on Bibsonomy RTSS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF multiframe model, periodic task model, worst-case execution time bound, number sequence, preemptive fixed priority scheduling policy, scheduling, schedulability problem, utilization bound, real-time tasks
25Kamal Kumar Jain, V. Rajaraman Lower and Upper Bounds on Time for Multiprocessor Optimal Schedules. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF lower time bound, upper time bound, multiprocessor optimal schedules, minimum processing time, directed acyclic task graph, worst case behavior, minimum processor number, randomly generated dense task graphs, scheduling, performance evaluation, parallel algorithms, parallel processing, directed graphs, minimisation
25Shyamal K. Chowdhury The Mean Resequencing Delay for M/H_K/infty Systems. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF mean resequencing delay, packet transmission times, Poisson stream, K-stage hyperexponential transmission time distribution, equal capacity links, asymptotic bound analysis, computer networks, queueing theory, packet switching, upper bound, electronic messaging, destination nodes
24Satyanarayana V. Lokam Graph Complexity and Slice Functions. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
23Itai Ashlagi, Shahar Dobzinski, Ron Lavi An optimal lower bound for anonymous scheduling mechanisms. Search on Bibsonomy EC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF scheduling, incentive compatibility
23Emanuele Viola, Avi Wigderson One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
23Laura Bozzelli, Salvatore La Torre Decision Problems for Lower/Upper Bound Parametric Timed Automata. Search on Bibsonomy ICALP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
23Manfred Kunde A New Bound for Pure Greedy Hot Potato Routing. Search on Bibsonomy STACS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 24719 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license