Sciweavers

1624 search results - page 132 / 325
» Fairness in multi-agent systems
Sort
View
SAINT
2006
IEEE
16 years 29 days ago
Fair Overload Handling Using Proof-of-Work Functions
Overload can reduce the overall performance of a computer system up to a point where the whole service might collapse. Thus, for example the load on a server must be controlled to...
Sebastian Golze, Gero Mühl
176
Voted
CISS
2008
IEEE
16 years 1 months ago
Achieving network stability and user fairness through admission control of TCP connections
—This paper studies a network under TCP congestion control, in which the number of flows per user is explicitly taken into account. We present a control law for this variable th...
Andrés Ferragut, Fernando Paganini
163
Voted
FROCOS
2005
Springer
16 years 14 days ago
Proving Liveness with Fairness Using Rewriting
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...
Adam Koprowski, Hans Zantema
181
Voted
LPAR
2005
Springer
16 years 13 days ago
Termination of Fair Computations in Term Rewriting
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
Salvador Lucas, José Meseguer
ICDCSW
2007
IEEE
16 years 1 months ago
Towards Fair Event Dissemination
Event dissemination in large scale dynamic systems is typically claimed to be best achieved using decentralized peer-to-peer architectures. The rationale is to have every particip...
Sébastien Baehni, Rachid Guerraoui, Boris K...