Sciweavers

533 search results - page 42 / 107
» Playing games with approximation algorithms
Sort
View
PPPJ
2003
ACM
14 years 29 days ago
A noughts and crosses Java applet to teach programming to primary school children
We report on a continuing study into teaching programming to pre-teens school-children, with some as young as seven years old. As part of the study we aim to test childrens’ alg...
J. Paul Gibson
DAGSTUHL
2007
13 years 9 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
CEC
2007
IEEE
14 years 2 months ago
Experiments with Monte Carlo Othello
— In this paper, we report on our experiments with using Monte Carlo simulation (specifically the UCT algorithm) as the basis for an Othello playing program. Monte Carlo methods ...
Philip Hingston, Martin Masek
COLT
2004
Springer
14 years 1 months ago
Deterministic Calibration and Nash Equilibrium
Abstract. We provide a natural learning process in which the joint frequency of empirical play converges into the set of convex combinations of Nash equilibria. In this process, al...
Sham Kakade, Dean P. Foster
INFOCOM
2007
IEEE
14 years 2 months ago
A Constant Approximation Algorithm for Interference Aware Broadcast in Wireless Networks
— Broadcast protocols play a vital role in multihop wireless networks. Due to the broadcast nature of radio signals, a node’s interference range can be larger than its transmis...
Zhenming Chen, Chunming Qiao, Jinhui Xu, Taekkyeun...