2084 search results - page 112 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
121
Voted
BIRTHDAY
2009
Springer
15 years 9 months ago
2009
Springer
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...
133
Voted
RTAS
2006
IEEE
15 years 8 months ago
2006
IEEE
The rapid need for high bandwidth and low latency communication in distributed real-time systems is driving system architects towards high-speed switches developed for high volume...
123
Voted
MOBIHOC
2008
ACM
16 years 2 months ago
2008
ACM
Recent discovery of the mixture (power-law and exponential) behavior of inter-meeting time distribution of mobile nodes presents new challenge to the problem of mobility modeling ...
140
Voted
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
108
Voted
CP
2004
Springer
15 years 8 months ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...