Sciweavers

533 search results - page 36 / 107
» Playing games with approximation algorithms
Sort
View
ICASSP
2011
IEEE
14 years 7 months ago
Compressive sensing meets game theory
We introduce the Multiplicative Update Selector and Estimator (MUSE) algorithm for sparse approximation in underdetermined linear regression problems. Given f = Φα∗ + µ, the ...
Sina Jafarpour, Robert E. Schapire, Volkan Cevher
CSL
2006
Springer
15 years 6 months ago
Algorithms for Omega-Regular Games with Imperfect Information,
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about t...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
CIG
2005
IEEE
15 years 8 months ago
Case-Injection Improves Response Time for a Real-Time Strategy Game
We present a case-injected genetic algorithm player for Strike Ops, a real-time strategy game. Such strategy games are fundamentally resource allocation optimization problems and o...
Chris Miles, Sushil J. Louis
132
Voted
AAAI
2012
13 years 5 months ago
Learning Games from Videos Guided by Descriptive Complexity
In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for speciï...
Lukasz Kaiser
WAOA
2010
Springer
239views Algorithms» more  WAOA 2010»
15 years 1 months ago
Strategic Multiway Cut and Multicut Games
We consider cut games where players want to cut themselves off from different parts of a network. These games arise when players want to secure themselves from areas of potential i...
Elliot Anshelevich, Bugra Caskurlu, Ameya Hate