Sciweavers

1410 search results - page 14 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
STOC
2001
ACM
161views Algorithms» more  STOC 2001»
15 years 9 months ago
Quantitative solution of omega-regular games
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
Luca de Alfaro, Rupak Majumdar
ICASSP
2011
IEEE
14 years 1 months ago
A new speaker identification algorithm for gaming scenarios
Speaker identification is a well-established research problem but has not been a major application used in gaming scenarios. In this paper, we propose a new algorithm for the ope...
Hoang Do, Ivan Tashev, Alex Acero
JMLR
2011
106views more  JMLR 2011»
14 years 4 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
AGI
2011
14 years 1 months ago
Multigame Playing by Means of UCT Enhanced with Automatically Generated Evaluation Functions
General Game Playing (GGP) contest provides a research framework suitable for developing and testing AGI approaches in game domain. In this paper, we propose a new modification of...
Karol Waledzik, Jacek Mandziuk
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
15 years 2 months ago
Computational Complexity of Two-Dimensional Platform Games
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Michal Forisek