4266 search results - page 101 / 854 » The container loading problem |
137
click to vote
SIAMCOMP
1998
15 years 2 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
143
Voted
CIAC
2010
Springer
14 years 11 months ago
2010
Springer
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
102
click to vote
CSL
2009
Springer
15 years 9 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
101
click to vote
IROS
2008
IEEE
15 years 8 months ago
2008
IEEE
— A series of kinodynamic sampling-based planners have appeared over the last decade to deal with high dimensional problems for robots with realistic motion constraints. Yet, ofï...
100
click to vote
AUSAI
1998
Springer
15 years 6 months ago
1998
Springer
Decision tree grafting adds nodes to inferred decision trees. Previous research has demonstrated that appropriate grafting techniques can improve predictive accuracy across a wide ...