Sciweavers

580 search results - page 111 / 116
» Choosing a random peer
Sort
View
ISIPTA
2003
IEEE
120views Mathematics» more  ISIPTA 2003»
14 years 20 days ago
Towards a Chaotic Probability Model for Frequentist Probability: The Univariate Case
We adopt the same mathematical model of a set M of probability measures as is central to the theory of coherent imprecise probability. However, we endow this model with an objecti...
Pablo Ignacio Fierens, Terrence L. Fine
ATAL
2003
Springer
14 years 19 days ago
Towards a pareto-optimal solution in general-sum games
Multiagent learning literature has investigated iterated twoplayer games to develop mechanisms that allow agents to learn to converge on Nash Equilibrium strategy profiles. Such ...
Sandip Sen, Stéphane Airiau, Rajatish Mukhe...
FUN
2010
Springer
233views Algorithms» more  FUN 2010»
14 years 5 days ago
The Complexity of Flood Filling Games
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
David Arthur, Raphaël Clifford, Markus Jalsen...
LICS
2000
IEEE
13 years 11 months ago
Concurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
Luca de Alfaro, Thomas A. Henzinger
ASPLOS
2000
ACM
13 years 11 months ago
Symbiotic Jobscheduling for a Simultaneous Multithreading Processor
Simultaneous Multithreading machines fetch and execute instructions from multiple instruction streams to increase system utilization and speedup the execution of jobs. When there ...
Allan Snavely, Dean M. Tullsen