Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

76

CG
2000
Springer

favoriteEmaildiscussreport

115views Computer Graphics» more CG 2000»

A Least-Certainty Heuristic for Selective Search

15 years 3 months ago

A Least-Certainty Heuristic for Selective Search

Download www.cs.umass.edu

: We present a new algorithm for selective search by iterative expansion of leaf nodes. The algorithm reasons with leaf evaluations in a way that leads to high conﬁdence in the choice of move at the root. Performance of the algorithm is measured under a variety of conditions, as compared to minimax with α/β pruning, and to bestﬁrst minimax.

Paul E. Utgoff, Richard P. Cochran

Real-time Traffic

Algorithm | Algorithm Reasons | CG 2000 | Computer Graphics | Leaf Nodes |

claim paper

Related Content

» On the selection of hidden neurons with heuristic search strategies for approximation

» Scuba Search when selection meets innovation

» VariableSelection Heuristics in Local Search for SAT

» Partial Symbolic Pattern Databases for Optimal Sequential Planning

» Casebased selection of initialisation heuristics for metaheuristic examination timetabling

» A ConstraintBased Method for Project Scheduling with Time Windows

» Disco Novo GoGo Integrating Local Search and Complete Search with Restarts

» The Accuracy of Search Heuristics An Empirical Study on Knapsack Problems

» An Empirical Analysis of Some Heuristic Features for Local Search in LPG

Post Info
More Details (n/a)

Added	02 Aug 2010
Updated	02 Aug 2010
Type	Conference
Year	2000
Where	CG
Authors	Paul E. Utgoff, Richard P. Cochran

Comments (0)