Sciweavers

1569 search results - page 204 / 314
» Programming contest strategy
Sort
View
AAAI
2010
13 years 10 months ago
An Approximate Subgame-Perfect Equilibrium Computation Technique for Repeated Games
This paper presents a technique for approximating, up to any precision, the set of subgame-perfect equilibria (SPE) in repeated games with discounting. The process starts with a s...
Andriy Burkov, Brahim Chaib-draa
DAGSTUHL
2007
13 years 10 months ago
The Unique Games Conjecture with Entangled Provers is False
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
SNPD
2007
13 years 10 months ago
Parallel analysis of polymorphic viral code using automated deduction system
As malicious code has become more sophisticated and pervasive, faster and more effective system for forensics and prevention is important. Particularly, quick analysis of polymorp...
Ruo Ando
AAAI
2004
13 years 10 months ago
QUICKXPLAIN: Preferred Explanations and Relaxations for Over-Constrained Problems
Over-constrained problems can have an exponential number of conflicts, which explain the failure, and an exponential number of relaxations, which restore the consistency. A user o...
Ulrich Junker
AAAI
2006
13 years 10 months ago
Running the Table: An AI for Computer Billiards
Billiards is a game of both strategy and physical skill. To succeed, a player must be able to select strong shots, and then execute them accurately and consistently. Several robot...
Michael Smith