606 search results - page 75 / 122 » Complexity Results for Checking Distributed Implementability |
112
Voted
SIGCOMM
1996
ACM
15 years 6 months ago
1996
ACM
Hierarchical Packet Fair Queueing (H-PFQ)algorithms have the potential to simultaneously support guaranteed realtime service, rate-adaptive best-eort, and controlled linksharing s...
133
click to vote
MIDDLEWARE
2009
Springer
15 years 8 months ago
2009
Springer
The innate dynamicity and complexity of mobile ad-hoc networks (MANETs) has resulted in numerous ad-hoc routing protocols being proposed. Furthermore, numerous variants and hybrids...
136
Voted
ICARCV
2006
IEEE
15 years 7 months ago
2006
IEEE
— The Bayesian occupancy filter (BOF) [1] has achieved promising results in the object tracking applications. This paper presents a new development of BOF which inherits origina...
111
click to vote
ICDCS
2010
IEEE
15 years 5 months ago
2010
IEEE
Web applications are no longer simple hyperlinked documents. They have progressively evolved to become highly complex—web pages combine content from several sources (with varyin...
116
click to vote
SIROCCO
2008
15 years 3 months ago
2008
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...