4 search results - page 1 / 1 » Unifying the Causal Graph and Additive Heuristics |
86
Voted
AIPS
2008
14 years 12 months ago
2008
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
69
Voted
AIPS
2008
14 years 12 months ago
2008
We consider a generalization of the PDB homomorphism abstractions to what is called "structural patterns". The bais in abstracting the problem in hand into provably trac...
70
Voted
AIPS
2008
14 years 12 months ago
2008
Planning as heuristic search is a powerful approach to solving domain independent planning problems. In recent years, various successful heuristics and planners like FF, LPG, FAST...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...