2842 search results - page 314 / 569 » Expansion and Search in Networks |
186
click to vote
WIOPT
2005
IEEE
16 years 10 days ago
2005
IEEE
In our prior work, we presented a highly effective local search based heuristic algorithm called the Largest Expanding Sweep Search (LESS) to solve the minimum energy broadcast (M...
163
Voted
ESA
2005
Springer
16 years 9 days ago
2005
Springer
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
182
click to vote
SIGIR
2003
ACM
16 years 18 hour ago
2003
ACM
The empirical investigation of the effectiveness of information retrieval (IR) systems requires a test collection, a set of query topics, and a set of relevance judgments made by ...
175
click to vote
CAISE
2003
Springer
16 years 6 hour ago
2003
Springer
While current search engines seem to easily handle the size of the data available on the Internet, they cannot provide fresh results. The most up-to-date data always resides on the...
160
Voted
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...