Sciweavers

10 search results - page 1 / 2
» On the usefulness of opponent modeling: the Kuhn Poker case ...
Sort
View
ATAL
2008
Springer
13 years 6 months ago
On the usefulness of opponent modeling: the Kuhn Poker case study
The application of reinforcement learning algorithms to Partially Observable Stochastic Games (POSG) is challenging since each agent does not have access to the whole state inform...
Alessandro Lazaric, Mario Quaresimale, Marcello Re...
AUSAI
2001
Springer
13 years 9 months ago
An Investigation of an Adaptive Poker Player
: Other work has shown that adaptive learning can be highly successful in developing programs which are able to play games at a level similar to human players and, in some cases, e...
Graham Kendall, Mark Willdig
ML
2006
ACM
13 years 4 months ago
Universal parameter optimisation in games based on SPSA
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
Levente Kocsis, Csaba Szepesvári
ATAL
2010
Springer
13 years 5 months ago
Planning against fictitious players in repeated normal form games
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
Enrique Munoz de Cote, Nicholas R. Jennings
DILS
2006
Springer
13 years 8 months ago
Improving Text Mining with Controlled Natural Language: A Case Study for Protein Interactions
Linking the biomedical literature to other data resources is notoriously difficult and requires text mining. Text mining aims to automatically extract facts from literature. Since ...
Tobias Kuhn, Loïc Royer, Norbert E. Fuchs, Mi...