169 search results - page 4 / 34 » Decentralized Search with Random Costs |
ATAL
2007
Springer
14 years 27 days ago
2007
Springer
Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by ...
NPC
2004
Springer
14 years 1 days ago
2004
Springer
This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling t...
APWEB
2003
Springer
13 years 12 months ago
2003
Springer
Search engines are among the most important applications or services on the web. Most existing successful search engines use global ranking algorithms to generate the ranking of do...
CCR
2006
13 years 6 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
MOBICOM
2004
ACM
14 years 4 days ago
2004
ACM
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...