Search results for "Bound"

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