Sciweavers

909 search results - page 6 / 182
» Games for extracting randomness
Sort
View
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 1 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
ICIP
2010
IEEE
13 years 4 months ago
Detecting pitching frames in baseball game video using Markov random walk
Pitching is the starting point of an event in baseball games. Hence, locating pitching shots is a critical step in content analysis of a baseball game video. However, pitching fra...
Chih-Yi Chiu, Po-Chih Lin, Wei-Ming Chang, Hsin-Mi...
AI
2002
Springer
13 years 6 months ago
Parallel Randomized Best-First Minimax Search
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
Yaron Shoham, Sivan Toledo
COCO
2010
Springer
198views Algorithms» more  COCO 2010»
13 years 10 months ago
Derandomized Parallel Repetition Theorems for Free Games
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
Ronen Shaltiel
ATAL
2009
Springer
14 years 1 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...