2519 search results - page 391 / 504 » Martingales and Locality in Distributed Computing |
131
click to vote
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
166
click to vote
CONCUR
2005
Springer
15 years 8 months ago
2005
Springer
d Abstract) Vijay Saraswat1 and Radha Jagadeesan2 1 IBM T.J. Watson Research Lab 2 School of CTI, DePaul University Abstract. We present the concurrency and distribution primitives...
260
click to vote
IPM
2007
15 years 3 months ago
2007
We consider a network of autonomous peers forming a logically global but physically distributed search engine, where every peer has its own local collection generated by independe...
140
click to vote
PODC
2011
ACM
14 years 6 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
125
Voted
PPAM
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Memetic Algorithms are the most frequently used hybrid of Evolutionary Algorithms (EA) for real-world applications. This paper will deal with one of the most important ob...