Sciweavers

4 search results - page 1 / 1
» Probabilistic Opponent-Model Search in Bao
Sort
View
IWEC
2004
13 years 6 months ago
Probabilistic Opponent-Model Search in Bao
In Probabilistic Opponent-Model search(PrOM search) the opponent is modelled by a mixed strategy of N opponent types 0 . . .
Jeroen Donkers, H. Jaap van den Herik, Jos W. H. M...
ACG
2003
Springer
13 years 10 months ago
Opponent-Model Search in Bao: Conditions for a Successful Application
Abstract Opponent-Model search is a game-tree search method that explicitly uses knowledge of the opponent. There is some risk involved in using Opponent-Model search. Both the pre...
H. H. L. M. Donkers, H. Jaap van den Herik, Jos W....
AAAI
2006
13 years 6 months ago
Prob-Maxn: Playing N-Player Games with Opponent Models
Much of the work on opponent modeling for game tree search has been unsuccessful. In two-player, zero-sum games, the gains from opponent modeling are often outweighed by the cost ...
Nathan R. Sturtevant, Martin Zinkevich, Michael H....
ACL
2008
13 years 6 months ago
A Probabilistic Model for Fine-Grained Expert Search
Expert search, in which given a query a ranked list of experts instead of documents is returned, has been intensively studied recently due to its importance in facilitating the ne...
Shenghua Bao, Huizhong Duan, Qi Zhou, Miao Xiong, ...