Sciweavers

72 search results - page 6 / 15
» Ant Algorithms for Search in Unstructured Peer-to-Peer Netwo...
Sort
View
AUSAI
2004
Springer
14 years 1 months ago
An ACO Algorithm for the Most Probable Explanation Problem
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...
ICNP
2005
IEEE
14 years 1 months ago
Exploiting Dynamic Querying like Flooding Techniques in Unstructured Peer-to-Peer Networks
In unstructured peer-to-peer networks, controlled flooding aims at locating an item at the minimum message cost. Dynamic querying is a new controlled flooding technique. While i...
Hongbo Jiang, Shudong Jin
CEC
2010
IEEE
13 years 4 months ago
Evolved Bayesian Network models of rig operations in the gulf of Mexico
The operation of drilling rigs is highly expensive. It is therefore important to be able to identify and analyse variables affecting rig operations. We investigate the use of Genet...
François A. Fournier, John A. W. McCall, An...
MIDDLEWARE
2005
Springer
14 years 1 months ago
An Optimal Overlay Topology for Routing Peer-to-Peer Searches
Unstructured peer-to-peer networks are frequently used as the overlay in various middleware toolkits for emerging applications, from content discovery to query result caching to di...
Brian F. Cooper
CN
2007
148views more  CN 2007»
13 years 7 months ago
Optimizing random walk search algorithms in P2P networks
In this paper we develop a model for random walk-based search mechanisms in unstructured P2P networks. This model is used to obtain analytical expressions for the performance metr...
Nabhendra Bisnik, Alhussein A. Abouzeid