Sciweavers

3780 search results - page 48 / 756
» Algorithms for Game Metrics
Sort
View
JMLR
2011
106views more  JMLR 2011»
13 years 3 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
13 years 11 days 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
SDM
2009
SIAM
154views Data Mining» more  SDM 2009»
14 years 6 months ago
AMORI: A Metric-Based One Rule Inducer.
The requirements of real-world data mining problems vary extensively. It is plausible to assume that some of these requirements can be expressed as application-specific performan...
Niklas Lavesson, Paul Davidsson
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
14 years 1 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
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
14 years 6 months ago
Fast SDP Algorithms for Constraint Satisfaction Problems
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
David Steurer