Sciweavers

1698 search results - page 85 / 340
» Growing Complex Games
Sort
View
172
Voted
ICML
2003
IEEE
15 years 9 months ago
The Significance of Temporal-Difference Learning in Self-Play Training TD-Rummy versus EVO-rummy
Reinforcement learning has been used for training game playing agents. The value function for a complex game must be approximated with a continuous function because the number of ...
Clifford Kotnik, Jugal K. Kalita
133
Voted
IE
2007
15 years 5 months ago
Two families: dynamical policy models in interactive storytelling
In this paper we introduce a mathematical model of conflict that enhances Richardson’s model of Arms Race accounting for interactive scenarios, such as the ones provided by CRP...
Fabio Zambetta, Adam Nash, Paul Smith
126
Voted
IJCAI
2007
15 years 5 months ago
Argumentation Based Contract Monitoring in Uncertain Domains
Few existing argumentation frameworks are designed to deal with probabilistic knowledge, and none are designed to represent possibilistic knowledge, making them unsuitable for man...
Nir Oren, Timothy J. Norman, Alun D. Preece
AAAI
2006
15 years 5 months ago
Exploring GnuGo's Evaluation Function with a SVM
While computers have defeated the best human players in many classic board games, progress in Go remains elusive. The large branching factor in the game makes traditional adversar...
Christopher Fellows, Yuri Malitsky, Gregory Wojtas...
150
Voted
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
15 years 1 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...