Sciweavers

1624 search results - page 284 / 325
» Fairness in multi-agent systems
Sort
View
PODC
2010
ACM
14 years 10 months ago
The k-bakery: local-spin k-exclusion using non-atomic reads and writes
Mutual exclusion is used to coordinate access to shared resources by concurrent processes. k-Exclusion is a variant of mutual exclusion in which up to k processes can simultaneous...
Robert Danek
CN
2008
97views more  CN 2008»
14 years 10 months ago
Towards real-time dynamic spectrum auctions
In this paper, we propose a low-complexity auction framework to distribute spectrum in real-time among a large number of wireless users with dynamic traffic. Our design consists o...
Sorabh Gandhi, Chiranjeeb Buragohain, Lili Cao, Ha...
CORR
2008
Springer
97views Education» more  CORR 2008»
14 years 10 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez
ENTCS
2008
170views more  ENTCS 2008»
14 years 10 months ago
A Coq Library for Verification of Concurrent Programs
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
Reynald Affeldt, Naoki Kobayashi
IJAMC
2008
85views more  IJAMC 2008»
14 years 9 months ago
Scalable reputation management with trustworthy user selection for P2P MMOGs
: Recent research on Peer-to-Peer Massively Multiplayer Online Games (P2P MMOGs) has tried to find more scalable and affordable solutions to build virtual environments via the reso...
Guan-Yu Huang, Shun-Yun Hu, Jehn-Ruey Jiang