408 search results - page 18 / 82 » A lookahead strategy for solving large planning problems |
102
click to vote
AUSAI
2008
Springer
14 years 11 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
109
click to vote
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
ENTCS
2006
14 years 9 months ago
2006
New heuristics and strategies have enabled major advancements in SAT solving in recent years. However, experimentation has shown that there is no winning solution that works in al...
81
Voted
HICSS
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper we consider the complete supply chain for a large pulp producer in Sweden. The supply chain is divided up in two parts, the pulp production planning problem and the ...
AAAI
2006
14 years 11 months ago
2006
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...