Sciweavers

100 search results - page 11 / 20
» Combination of Lower Bounds in Exact BDD Minimization
Sort
View
EOR
2002
105views more  EOR 2002»
13 years 10 months ago
Two-dimensional packing problems: A survey
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
Andrea Lodi, Silvano Martello, Michele Monaci
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
14 years 5 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...
ASPDAC
2009
ACM
92views Hardware» more  ASPDAC 2009»
14 years 5 months ago
Hybrid LZA: a near optimal implementation of the leading zero anticipator
The Leading Zero Anticipator (LZA) is one of the main components used in floating point addition. It tends to be on the critical path, so it has attracted the attention of many r...
Amit Verma, Ajay K. Verma, Philip Brisk, Paolo Ien...
ICALP
2005
Springer
14 years 4 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
COCO
2004
Springer
156views Algorithms» more  COCO 2004»
14 years 4 months ago
Multiparty Quantum Coin Flipping
We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: • We propose and motivate a definition for quantum broadcast. Our model of quantum ...
Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, He...