1639 search results - page 23 / 328 » Anytime Heuristic Search |
121
Voted
NIPS
2004
15 years 5 months ago
2004
Simple lexicographic decision heuristics that consider cues one at a time in a particular order and stop searching for cues as soon as a decision can be made have been shown to be...
130
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
149
Voted
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
139
Voted
AI
2002
Springer
15 years 3 months ago
2002
Springer
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
121
Voted
CGO
2007
IEEE
15 years 10 months ago
2007
IEEE
Program-specific or function-specific optimization phase sequences are universally accepted to achieve better overall performance than any fixed optimization phase ordering. A ...