Sciweavers

649 search results - page 49 / 130
» Focusing in Asynchronous Games
Sort
View
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
14 years 1 months ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 9 months ago
The MIMO Iterative Waterfilling Algorithm
Abstract--This paper considers the noncooperative maximization of mutual information in the vector Gaussian interference channel in a fully distributed fashion via game theory. Thi...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
TACAS
2009
Springer
134views Algorithms» more  TACAS 2009»
14 years 3 months ago
Compositional Predicate Abstraction from Game Semantics
ional Predicate Abstraction from Game Semantics Adam Bakewell and Dan R. Ghica University of Birmingham, U.K. We introduce a technique for using conventional predicate abstraction ...
Adam Bakewell, Dan R. Ghica
ACMACE
2004
ACM
14 years 2 months ago
Robot's play: interactive games with sociable machines
Personal robots for human entertainment form a new class of computer-based entertainment that is beginning to become commercially and computationally practical. We expect a princi...
Andrew G. Brooks, Jesse Gray, Guy Hoffman
AICOM
2006
132views more  AICOM 2006»
13 years 9 months ago
Evolution of a supply chain management game for the Trading Agent Competition
TAC SCM is a supply chain management game for the Trading Agent Competition (TAC). The purpose of TAC is to spur high quality research into realistic trading agent problems. We dis...
Joakim Eriksson, Niclas Finne, Sverker Janson