Sciweavers

225 search results - page 3 / 45
» A Least-Certainty Heuristic for Selective Search
Sort
View
IPL
2006
80views more  IPL 2006»
13 years 5 months ago
BubbleSearch: A simple heuristic for improving priority-based greedy algorithms
We introduce BubbleSearch, a general approach for extending priority-based greedy heuristics. Following the framework recently developed by Borodin et al., we consider priority al...
Neal Lesh, Michael Mitzenmacher
AI
2002
Springer
13 years 5 months ago
Improving heuristic mini-max search by supervised learning
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...
Michael Buro
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
13 years 9 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
JAIR
2006
111views more  JAIR 2006»
13 years 5 months ago
Learning in Real-Time Search: A Unifying Framework
Real-time search methods are suited for tasks in which the agent is interacting with an initially unknown environment in real time. In such simultaneous planning and learning prob...
Vadim Bulitko, Greg Lee
CONSTRAINTS
2006
77views more  CONSTRAINTS 2006»
13 years 5 months ago
The Impact of Search Heuristics on Heavy-Tailed Behaviour
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
Tudor Hulubei, Barry O'Sullivan