Sciweavers

533 search results - page 59 / 107
» Playing games with approximation algorithms
Sort
View
FUN
2010
Springer
233views Algorithms» more  FUN 2010»
14 years 14 days ago
The Complexity of Flood Filling Games
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
David Arthur, Raphaël Clifford, Markus Jalsen...
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
14 years 8 days ago
Reinforcement learning for games: failures and successes
We apply CMA-ES, an evolution strategy with covariance matrix adaptation, and TDL (Temporal Difference Learning) to reinforcement learning tasks. In both cases these algorithms se...
Wolfgang Konen, Thomas Bartz-Beielstein
GLOBECOM
2010
IEEE
13 years 5 months ago
Cooperation Stimulation in Cognitive Networks Using Indirect Reciprocity Game Modelling
In cognitive networks, since nodes generally belong to different authorities and pursue different goals, they will not cooperate with others unless cooperation can improve their ow...
Yan Chen, K. J. Ray Liu
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
AAAI
1997
13 years 9 months ago
Combining Approximate Front End Signal Processing with Selective Reprocessing in Auditory Perception
When dealing with signals from complex environments, where multiple time-dependent signal signatures can interfere with each other in stochastically unpredictable ways, traditiona...
Frank Klassner, Victor R. Lesser, Hamid Nawab