169 search results - page 11 / 34 » Decentralized Search with Random Costs |
114
Voted
WIOPT
2005
IEEE
15 years 7 months ago
2005
IEEE
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 wireless network. We consider the class of controlled flo...
93
Voted
IROS
2006
IEEE
15 years 8 months ago
2006
IEEE
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
130
Voted
CPC
1999
15 years 1 months ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
117
click to vote
CCGRID
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
130
Voted
GCC
2003
Springer
15 years 7 months ago
2003
Springer
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...