4208 search results - page 256 / 842 » Challenges in Evaluating Distributed Algorithms |
204
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
Schema merging is the process of consolidating multiple schemas into a unified view. The task becomes particularly challenging when the schemas are highly heterogeneous and autono...
181
click to vote
MOBIHOC
2010
ACM
15 years 4 months ago
2010
ACM
Barrier coverage is a critical issue in wireless sensor networks for various battlefield and homeland security applications. The goal is to effectively detect intruders that attem...
156
click to vote
GECCO
2007
Springer
16 years 14 days ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
159
click to vote
EDCC
1999
Springer
15 years 10 months ago
1999
Springer
In this paper we present a new fault tolerant clock synchronization algorithm called the Fault Tolerant Daisy Chain algorithm. It is intended for internal clock synchronization of...
145
click to vote
INFOCOM
2006
IEEE
16 years 10 days ago
2006
IEEE
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...