1639 search results - page 48 / 328 » Anytime Heuristic Search |
AIPS
2010
14 years 1 hour ago
2010
The problem of effectively combining multiple heuristic estimators has been studied extensively in the context of optimal planning, but not in the context of satisficing planning....
JAIR
2006
13 years 9 months ago
2006
Real-time search methods are suited for tasks in which the agent is interacting with an initially unknown environment in real time. In such simultaneous planning and learning prob...
HEURISTICS
2002
13 years 9 months ago
2002
We present a cooperative parallel tabu search method for the fixed charge, capacitated, multicommodity network design problem. Several communication strategies are analyzed and co...
CG
2004
Springer
14 years 3 months ago
2004
Springer
In this paper a new method is described for move ordering, called the relative history heuristic. It is a combination of the history heuristic and the butterfly heuristic. Instead...
HEURISTICS
2002
13 years 9 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...