Sciweavers

4266 search results - page 410 / 854
» The container loading problem
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 7 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
ALGORITHMICA
1998
143views more  ALGORITHMICA 1998»
15 years 6 months ago
On Minimum-Area Hulls
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
Esther M. Arkin, Yi-Jen Chiang, Martin Held, Josep...
IWPEC
2010
Springer
15 years 4 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
ISCA
2009
IEEE
152views Hardware» more  ISCA 2009»
16 years 1 months ago
Scaling the bandwidth wall: challenges in and avenues for CMP scaling
As transistor density continues to grow at an exponential rate in accordance to Moore’s law, the goal for many Chip Multi-Processor (CMP) systems is to scale the number of on-ch...
Brian M. Rogers, Anil Krishna, Gordon B. Bell, Ken...
DATE
2007
IEEE
104views Hardware» more  DATE 2007»
16 years 1 months ago
Dynamic reconfiguration in sensor networks with regenerative energy sources
In highly power constrained sensor networks, harvesting energy from the environment makes prolonged or even perpetual execution feasible. In such energy harvesting systems, energy...
Ani Nahapetian, Paolo Lombardo, Andrea Acquaviva, ...