285 search results - page 14 / 57 » Intelligent Neighborhood Exploration in Local Search Heurist... |
ICTAI
2006
IEEE
15 years 6 months ago
2006
IEEE
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
111
Voted
ECAI
2004
Springer
15 years 5 months ago
2004
Springer
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
106
Voted
AIPS
2008
15 years 2 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...
109
click to vote
FLAIRS
2008
15 years 2 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
129
click to vote
AI
1998
Springer
15 years 4 days ago
1998
Springer
In this paper, we address the tradeo between exploration and exploitation for agents which need to learn more about the structure of their environment in order to perform more e e...