Sciweavers

50 search results - page 8 / 10
» Heuristics and Symmetries in Classical Planning
Sort
View
AIPS
2011
13 years 2 months ago
Searching for Plans with Carefully Designed Probes
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...
Nir Lipovetzky, Hector Geffner
IPPS
1999
IEEE
14 years 2 months ago
A Parallel Hybrid Evolutionary Metaheuristic for the Period Vehicle Routing Problem
Abstract. This paper presents a Parallel Hybrid Evolutionary Metaheuristic for the Period Vehicle Routing Problem PVRP. The PRVP generalizes the classical Vehicle Routing Problem b...
Dalessandro Soares Vianna, Luiz Satoru Ochi, L&uac...
NIPS
1997
13 years 11 months ago
Generalized Prioritized Sweeping
Prioritized sweeping is a model-based reinforcement learning method that attempts to focus an agent’s limited computational resources to achieve a good estimate of the value of ...
David Andre, Nir Friedman, Ronald Parr
GIS
2007
ACM
14 years 2 months ago
Optimal traversal planning in road networks with navigational constraints
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
Leyla Kazemi, Cyrus Shahabi, Mehdi Sharifzadeh, Lu...
BIRTHDAY
2006
Springer
14 years 2 months ago
Best-First Rippling
Rippling is a form of rewriting that guides search by only performing steps that reduce the syntactic differences between formulae. Termination is normally ensured by a measure th...
Moa Johansson, Alan Bundy, Lucas Dixon