Sciweavers

533 search results - page 15 / 107
» Playing games with approximation algorithms
Sort
View
KI
2008
Springer
13 years 7 months ago
Automatic Bidding for the Game of Skat
In recent years, researchers started to study the game of Skat. The strength of existing Skat playing programs is definitely the card play phase. The bidding phase, however, has be...
Thomas Keller, Sebastian Kupferschmid
ICMCS
2005
IEEE
110views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Combining Caption and Visual Features for Semantic Event Classification of Baseball Video
In baseball game, an event is defined as the portion of video clip between two pitches, and a play is defined as a batter finishing his plate appearance. A play is a concatenation...
Wen-Nung Lie, Sheng-Hsiung Shia
AIIDE
2006
13 years 9 months ago
The Self Organization of Context for Learning in MultiAgent Games
Reinforcement learning is an effective machine learning paradigm in domains represented by compact and discrete state-action spaces. In high-dimensional and continuous domains, ti...
Christopher D. White, Dave Brogan
JMLR
2011
106views more  JMLR 2011»
13 years 2 months ago
A Bayesian Approximation Method for Online Ranking
This paper describes a Bayesian approximation method to obtain online ranking algorithms for games with multiple teams and multiple players. Recently for Internet games large onli...
Ruby C. Weng, Chih-Jen Lin
AIIDE
2007
13 years 10 months ago
Automatic Design of Balanced Board Games
AI techniques are already widely used in game software to provide computer-controlled opponents for human players. However, game design is a more-challenging problem than game pla...
Joe Marks, Vincent Hom