Sciweavers

533 search results - page 54 / 107
» Playing games with approximation algorithms
Sort
View
WSCG
2001
134views more  WSCG 2001»
13 years 9 months ago
Synthetic Images of Underwater Scenes: A First Approximation
The creation and rendering of realistic water scenes is one of the challenging tasks in Computer Graphics. To reproduce the illumination and colour inside water bodies an algorith...
Eva Cerezo, Francisco J. Serón
CIG
2005
IEEE
14 years 1 months ago
Further Evolution of a Self-Learning Chess Program
Previous research on the use of coevolution to improve a baseline chess program demonstrated a performance rating of 2550 against Pocket Fritz 2.0 (PF2). A series of 12 games (6 wh...
David B. Fogel, Timothy J. Hays, Sarah L. Hahn, Ja...
FOCS
2008
IEEE
14 years 2 months ago
Unique Games with Entangled Provers are Easy
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
Julia Kempe, Oded Regev, Ben Toner
WINE
2010
Springer
149views Economy» more  WINE 2010»
13 years 5 months ago
Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games
We study Facility Location games, where a number of facilities are placed in a metric space based on locations reported by strategic agents. A mechanism maps the agents' locat...
Dimitris Fotakis, Christos Tzamos
AAAI
1996
13 years 9 months ago
Exploiting Graph Properties of Game Trees
The state space of most adversary games is a directed graph. However, due to the success of simple recursive algorithms based on Alpha-Beta, theoreticians and practitioners have c...
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de...