Sciweavers

35 search results - page 1 / 7
» The Reason for the Benefits of Minimax Search
Sort
View
IJCAI
1989
13 years 5 months ago
The Reason for the Benefits of Minimax Search
based on an abstract concept of quiescence. In the following we sketch this and a related model, describe the design of our experiments, and present the results of our simulation s...
Anton Scheucher, Hermann Kaindl
CG
2000
Springer
13 years 8 months ago
A Least-Certainty Heuristic for Selective Search
: 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 confidence in the c...
Paul E. Utgoff, Richard P. Cochran
AAAI
1996
13 years 5 months ago
Incorporating Opponent Models into Adversary Search
This work presents a generalized theoretical framework that allows incorporation of opponent models into adversary search. We present the M algorithm, a generalization of minimax ...
David Carmel, Shaul Markovitch
EWCBR
2008
Springer
13 years 6 months ago
Provenance, Trust, and Sharing in Peer-to-Peer Case-Based Web Search
Despite the success of modern Web search engines, challenges remain when it comes to providing people with access to the right information at the right time. In this paper, we desc...
Peter Briggs, Barry Smyth
ECIR
2003
Springer
13 years 5 months ago
Improving the Evaluation of Web Search Systems
Linkage analysis as an aid to web search has been assumed to be of significant benefit and we know that it is being implemented by many major Search Engines. Why then have few TREC...
Cathal Gurrin, Alan F. Smeaton