1639 search results - page 61 / 328 » Anytime Heuristic Search |
82
Voted
AIPS
2007
15 years 2 months ago
2007
We present an any-time concurrent probabilistic temporal planner that includes continuous and discrete uncertainties and metric functions. Our approach is a direct policy search t...
118
click to vote
JAIR
2006
15 years 15 days ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
126
Voted
ENDM
2010
14 years 10 months ago
2010
In the past decade, significant progress has been achieved in developing generic primal heuristics that made their way into commercial mixed integer programming (MIP) solver. Exte...
77
Voted
EVOW
2005
Springer
15 years 6 months ago
2005
Springer
A hyperheuristic is a high level procedure which searches over a space of low level heuristics rather than directly over the space of problem solutions. The sequence of low level h...
117
Voted
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...