Sciweavers

359 search results - page 16 / 72
» On Complete Primitives for Fairness
Sort
View
GLOBECOM
2010
IEEE
13 years 5 months ago
A Trading System for Fairly Scheduling Fixed-Sized Delay Tolerant Jobs at a Shared Link
Scheduling of delay-tolerant jobs has been proposed as a mechanism to alleviate pressure on congested network resources. However, when multiple competing users share these resource...
Jorge Londoño, Azer Bestavros, Nikolaos Lao...
AIML
2008
13 years 8 months ago
Proof systems for the coalgebraic cover modality
abstract. We investigate an alternative presentation of classical and positive modal logic where the coalgebraic cover modality is taken as primitive. For each logic, we present a ...
Marta Bílková, Alessandra Palmigiano...
DSN
2006
IEEE
14 years 1 months ago
High Throughput Total Order Broadcast for Cluster Environments
Total order broadcast is a fundamental communication primitive that plays a central role in bringing cheap software-based high availability to a wide array of services. This paper...
Rachid Guerraoui, Ron R. Levy, Bastian Pochon, Viv...
ICIAR
2005
Springer
14 years 27 days ago
Marrying Level Lines for Stereo or Motion
Efficient matching methods are crucial in Image Processing. In the present paper we outline a novel algorithm of ”stable marriages” that is also fair and globally satisfactory ...
Nikom Suvonvorn, Samia Bouchafa, Bertrand Zavidovi...
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 7 months ago
Automatic Verification of Correspondences for Security Protocols
We present a new technique for verifying correspondences in security protocols. In particular, correspondences can be used to formalize authentication. Our technique is fully auto...
Bruno Blanchet