Sciweavers

64 search results - page 13 / 13
» Learning to commit in repeated games
Sort
View
PODC
2009
ACM
14 years 5 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...
GECCO
2010
Springer
244views Optimization» more  GECCO 2010»
13 years 5 months ago
Implicit fitness and heterogeneous preferences in the genetic algorithm
This paper takes an economic approach to derive an evolutionary learning model based entirely on the endogenous employment of genetic operators in the service of self-interested a...
Justin T. H. Smith
CAV
2007
Springer
121views Hardware» more  CAV 2007»
13 years 11 months ago
Algorithms for Interface Synthesis
Abstract. A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We comp...
Dirk Beyer, Thomas A. Henzinger, Vasu Singh
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 5 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...