Sciweavers

3082 search results - page 263 / 617
» New Bounds for the Controller Problem
Sort
View
UAI
2003
15 years 8 months ago
Marginalizing Out Future Passengers in Group Elevator Control
Group elevator scheduling is an NP-hard sequential decision-making problem with unbounded state spaces and substantial uncertainty. Decision-theoretic reasoning plays a surprising...
Daniel Nikovski, Matthew Brand
BMCBI
2010
80views more  BMCBI 2010»
15 years 6 months ago
Sampling the conformation of protein surface residues for flexible protein docking
Background: The problem of determining the physical conformation of a protein dimer, given the structures of the two interacting proteins in their unbound state, is a difficult on...
Patricia Francis-Lyon, Shengyin Gu, Joel Hass, Nin...
WADS
2009
Springer
378views Algorithms» more  WADS 2009»
16 years 1 months ago
Two for One: Tight Approximation of 2D Bin Packing
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz
SOFSEM
2007
Springer
16 years 22 days ago
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
Markus Maier, Steffen Mecke, Dorothea Wagner
ICTCS
2005
Springer
16 years 4 days ago
Faster Deterministic Wakeup in Multiple Access Channels
We consider the fundamental problem of waking up n processors sharing a multiple access channel. We assume the weakest model of synchronization, the locally synchronous model, in ...
Gianluca De Marco, Marco Pellegrini, Giovanni Sbur...