8647 search results - page 114 / 1730 » The Container Selection Problem |
146
click to vote
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 ...
104
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...
104
click to vote
IROS
2008
IEEE
15 years 9 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ï...
103
click to vote
AUSAI
1998
Springer
15 years 7 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 ...
120
click to vote
AAAI
2004
15 years 4 months ago
2004
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...