Sciweavers

1624 search results - page 245 / 325
» Fairness in multi-agent systems
Sort
View
EMSOFT
2006
Springer
15 years 10 months ago
Efficient distributed deadlock avoidance with liveness guarantees
We present a deadlock avoidance algorithm for distributed systems that guarantees liveness. Deadlock avoidance in distributed systems is a hard problem and general solutions are c...
César Sánchez, Henny B. Sipma, Zohar...
NSDI
2008
15 years 8 months ago
Nysiad: Practical Protocol Transformation to Tolerate Byzantine Failures
The paper presents and evaluates Nysiad,1 a system that implements a new technique for transforming a scalable distributed system or network protocol tolerant only of crash failur...
Chi Ho, Robbert van Renesse, Mark Bickford, Danny ...
BCSHCI
2008
15 years 7 months ago
Enabling storytelling by Aphasics in an augmented home environment
We present the design of a system for Aphasics that assist them in storytelling. Storytelling, in the sense of being able to relate recent and past experiences to relevant others,...
Abdullah Al Mahmud, Dzmitry Aliakseyeu, Jean-Berna...
FMSD
2006
103views more  FMSD 2006»
15 years 6 months ago
Compositional SCC Analysis for Language Emptiness
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...
Chao Wang, Roderick Bloem, Gary D. Hachtel, Kavita...
AIL
2000
78views more  AIL 2000»
15 years 6 months ago
Representation of formal dispute with a standing order
Computational dialectics is a relatively new field. It is, among others, concerned with the formal representation of argument and dispute. The goal is to suggest algorithms, proce...
Gerard Vreeswijk