Sciweavers

1245 search results - page 41 / 249
» Playing with Conway's problem
Sort
View
UAIS
2011
237views more  UAIS 2011»
13 years 2 months ago
Game accessibility: a survey
Over the last three decades, video games have evolved from a pastime into a force of change that is transforming the way people perceive, learn about, and interact with the world a...
Bei Yuan, Eelke Folmer, Frederick C. Harris
ICASSP
2011
IEEE
12 years 11 months ago
Social norm and long-run learning in peer-to-peer networks
We start by formulating the resource sharing in peer-to-peer (P2P) networks as a random-matching gift-giving game, where self-interested peers aim at maximizing their own long-ter...
Yu Zhang, Mihaela van der Schaar
ICASSP
2011
IEEE
12 years 11 months ago
Logarithmic weak regret of non-Bayesian restless multi-armed bandit
Abstract—We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. At each time, a player chooses K out of N (N > K) arms to play. The state of each ar...
Haoyang Liu, Keqin Liu, Qing Zhao
CCS
2011
ACM
12 years 7 months ago
Automatically optimizing secure computation
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
Florian Kerschbaum
COLT
2008
Springer
13 years 9 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal