2252 search results - page 216 / 451 » Lower Bounds for Dynamic Algorithms |
132
click to vote
UAI
2003
15 years 5 months ago
2003
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
134
click to vote
IPSN
2005
Springer
15 years 9 months ago
2005
Springer
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
105
click to vote
COR
2007
15 years 3 months ago
2007
Both the material usage and the complexity of the cutting process should be considered in generating cutting patterns. This paper presents an exact algorithm for constrained two-d...
125
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
This paper studies the dynamic bin packing problem, in which items arrive and depart at arbitrary time. We want to pack a sequence of unit fractions items (i.e., items with sizes ...
139
Voted
WASA
2009
Springer
15 years 10 months ago
2009
Springer
Information collection in the disaster area is an important application of pigeon networks - a special type of delay tolerant networks (DTN). The aim of this paper is to explore hi...