169 search results - page 6 / 34 » Decentralized Search with Random Costs |
ISSRE
2002
IEEE
13 years 11 months ago
2002
IEEE
Formal analysis of software is a powerful analysis tool, but can be too costly. Random search of formal models can reduce that cost, but is theoretically incomplete. However, rand...
ARCS
2004
Springer
14 years 3 days ago
2004
Springer
Searching in decentralized peer-to-peer networks is a challenging problem. In common applications such as Gnutella, searching is performed by randomly forwarding queries to all pee...
ATAL
2003
Springer
13 years 12 months ago
2003
Springer
This paper examines a method of clustering within a fully decentralized multi-agent system. Our goal is to group agents with similar objectives or data, as is done in traditional ...
BERTINORO
2005
Springer
14 years 7 days ago
2005
Springer
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...
AAAI
1998
13 years 8 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...