Sciweavers

735 search results - page 110 / 147
» Randomization in Parallel Stringology
Sort
View
PODC
1990
ACM
15 years 10 months ago
Sharing Memory Robustly in Message-Passing Systems
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
Hagit Attiya, Amotz Bar-Noy, Danny Dolev
ICDCS
2010
IEEE
15 years 10 months ago
LT Network Codes
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
Mary-Luc Champel, Kévin Huguenin, Anne-Mari...
PODC
2010
ACM
15 years 10 months ago
Bayesian ignorance
We quantify the effect of Bayesian ignorance by comparing the social cost obtained in a Bayesian game by agents with local views to the expected social cost of agents having glob...
Noga Alon, Yuval Emek, Michal Feldman, Moshe Tenne...
HIPC
2007
Springer
15 years 10 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
FTDCS
2004
IEEE
15 years 10 months ago
A New Perspective in Defending against DDoS
Distributed denial of service (DDoS) is a major threat to the availability of Internet services. The anonymity allowed by IP networking, together with the distributed, large scale...
Shigang Chen, Randy Chow