Sciweavers

140 search results - page 8 / 28
» A relation-algebraic approach to simple games
Sort
View
ICANN
2005
Springer
14 years 1 months ago
Evolution of Heuristics for Give-Away Checkers
The efficacy of two evolutionary approaches to the problem of generation of heuristical linear and non-linear evaluation functions in the game of give-away checkers is tested in th...
Magdalena Kusiak, Karol Waledzik, Jacek Mandziuk
AAAI
2008
13 years 10 months ago
Achieving Cooperation in a Minimally Constrained Environment
We describe a simple environment to study cooperation between two agents and a method of achieving cooperation in that environment. The environment consists of randomly generated ...
Steven Damer, Maria L. Gini
ATAL
2009
Springer
14 years 2 months ago
Multiagent learning in large anonymous games
In large systems, it is important for agents to learn to act effectively, but sophisticated multi-agent learning algorithms generally do not scale. An alternative approach is to ï...
Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern
EMMCVPR
2001
Springer
14 years 7 days ago
Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
Marcello Pelillo
CG
2004
Springer
13 years 11 months ago
Locally Informed Global Search for Sums of Combinatorial Games
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
Martin Müller 0003, Zhichao Li