Sciweavers

31 search results - page 2 / 7
» A Comparison of Algorithms for Multi-player Games
Sort
View
AAAI
2008
13 years 10 months ago
Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using
ion-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker Andrew Gilpin and Tuomas Sandholm Computer Science Dep...
Andrew Gilpin, Tuomas Sandholm
WDAG
2009
Springer
146views Algorithms» more  WDAG 2009»
14 years 2 months ago
Dynamics in Network Interaction Games
We study the convergence times of dynamics in games involving graphical relationships of players. Our model of local interaction games generalizes a variety of recently studied ga...
Martin Hoefer, Siddharth Suri
BMCBI
2006
137views more  BMCBI 2006»
13 years 7 months ago
Chaos game representation for comparison of whole genomes
Background: Chaos game representation of genome sequences has been used for visual representation of genome sequence patterns as well as alignment-free comparisons of sequences ba...
Jijoy Joseph, Roschen Sasikumar
ALDT
2009
Springer
207views Algorithms» more  ALDT 2009»
14 years 2 months ago
Anytime Self-play Learning to Satisfy Functional Optimality Criteria
We present an anytime multiagent learning approach to satisfy any given optimality criterion in repeated game self-play. Our approach is opposed to classical learning approaches fo...
Andriy Burkov, Brahim Chaib-draa
FDG
2009
ACM
14 years 2 months ago
Motion and scene complexity for streaming video games
This work provides detailed measurements of the motion and scene complexity for a wide variety of video games. Novel algorithms to measure motion and scene complexity are presente...
Mark Claypool