1639 search results - page 147 / 328 » Anytime Heuristic Search |
180
click to vote
AIPS
2008
15 years 8 months ago
2008
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
170
click to vote
KER
2007
15 years 6 months ago
2007
AI planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will tra...
178
click to vote
RTSS
2008
IEEE
16 years 25 days ago
2008
IEEE
—Wormhole switching with fixed priority preemption has been proposed as a possible solution for real-time on-chip communication. However, none of current priority assignment pol...
139
click to vote
CAEPIA
2007
Springer
15 years 10 months ago
2007
Springer
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...
148
click to vote
CONSTRAINTS
2007
15 years 6 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...