Sciweavers

3055 search results - page 340 / 611
» Randomized Search Trees
Sort
View
186
Voted
MOBIHOC
2012
ACM
13 years 6 months ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn
172
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
Assisted peer-to-peer search with partial indexing
—In the past few years, peer-to-peer (P2P) networks have become a promising paradigm for building a wide variety of distributed systems and applications. The most popular P2P app...
Rongmei Zhang, Y. Charlie Hu
132
Voted
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 9 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
125
Voted
SPIN
2004
Springer
15 years 9 months ago
Explicit State Model Checking with Hopper
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...
Michael Jones, Eric Mercer
145
Voted
SKG
2006
IEEE
15 years 9 months ago
IAC: Interest-Aware Caching for Unstructured P2P
The simplicity and robustness of unstructured P2P system make it a preferable architecture for constructing real large scale file sharing system. Most of the existing paradigms re...
Xucheng Luo, Zhiguang Qin, Ji Geng, Jiaqing Luo