Sciweavers

1302 search results - page 10 / 261
» Fair Equivalence Relations
Sort
View
CORR
2008
Springer
50views Education» more  CORR 2008»
13 years 7 months ago
When are two algorithms the same?
People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of progra...
Andreas Blass, Nachum Dershowitz, Yuri Gurevich
LICS
2006
IEEE
14 years 1 months ago
Temporal Logics and Model Checking for Fairly Correct Systems
We motivate and study a generic relaxation of correctness of reactive and concurrent systems with respect to a temporal specification. We define a system to be fairly correct if...
Daniele Varacca, Hagen Völzer
TWC
2008
155views more  TWC 2008»
13 years 7 months ago
Redefinition of max-min fairness in multi-hop wireless networks
In this paper, it is shown that it is challenging to evaluate service fairness in multi-hop wireless networks due to intra-flow contention and unequal channel capacity. The convent...
Ping Wang, Hai Jiang, Weihua Zhuang, H. Vincent Po...
PE
2006
Springer
127views Optimization» more  PE 2006»
13 years 7 months ago
Design and analysis of a class-aware recursive loop scheduler for class-based scheduling
In this paper, we consider the problem of devising a loop scheduler that allocates slots to users according to their relative weights as smoothly as possible. Instead of the exist...
Raphael Rom, Moshe Sidi, Hwee Pink Tan
ICALP
1998
Springer
13 years 12 months ago
A Hierarchy of Equivalences for Asynchronous Calculi
We generate a natural hierarchy of equivalences for asynchronous name-passing process calculi from simple variations on Milner and Sangiorgi's definition of weak barbed bisim...
Cédric Fournet, Georges Gonthier