39 search results - page 7 / 8 » Reaching Envy-Free States in Distributed Negotiation Setting... |
110
click to vote
QEST
2006
IEEE
15 years 6 months ago
2006
IEEE
A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a ...
95
Voted
EPEW
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Recently, there is an explosive development of fluid approaches to computer and distributed systems. These approaches are inherently stochastic and generate continuous st...
HIPC
2007
Springer
15 years 6 months ago
2007
Springer
- With the increased complexity of platforms coupled with data centers’ servers sprawl, power consumption is reaching unsustainable limits. Memory is an important target for plat...
101
Voted
CORR
2008
Springer
15 years 10 days ago
2008
Springer
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...
106
Voted
SIROCCO
2004
15 years 1 months ago
2004
The problem of routing traffic through a congested network is studied. The framework is that introduced by Koutsoupias and Papadimitriou where the network is constituted by m paral...