Sciweavers

473 search results - page 26 / 95
» Local Search in Unstructured Networks
Sort
View
GLOBECOM
2006
IEEE
15 years 4 months ago
Evaluation of Dynamic Query Abolishment Methods in Heterogeneous Networks
— We compare the performance of various dynamic query abolishment mechanisms in different unstructured overlay network topologies such as found in several P2P systems. We speci...
Elena Meshkova, Janne Riihijärvi, Petri M&aum...
PPSN
2010
Springer
14 years 8 months ago
First-Improvement vs. Best-Improvement Local Optima Networks of NK Landscapes
Abstract. This paper extends a recently proposed model for combinatorial landscapes: Local Optima Networks (LON), to incorporate a first-improvement (greedyascent) hill-climbing a...
Gabriela Ochoa, Sébastien Vérel, Mar...
ICC
2007
IEEE
143views Communications» more  ICC 2007»
15 years 4 months ago
Application-Aware Topology Formation Algorithm for Peer-to-Peer Networks
—When constructing an unstructured P2P topology, one should consider the application running on top of it in order to achieve a good performance for the whole P2P system. It is n...
Kin Wah Kwong, Danny H. K. Tsang
MOBICOM
2004
ACM
15 years 3 months ago
Revisiting the TTL-based controlled flooding search: optimality and randomization
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
Nicholas B. Chang, Mingyan Liu
99
Voted
RIAO
2007
14 years 11 months ago
Content-Based Peer-to-Peer Network Overlay for Full-Text Federated Search
Peer-to-peer network overlays have mostly been designed to support search over document names, identifiers, or keywords from a small or controlled vocabulary. In this paper we pro...
Jie Lu, Jamie Callan