Sciweavers

362 search results - page 22 / 73
» Optimal network topologies for local search with congestion
Sort
View
ESA
1999
Springer
105views Algorithms» more  ESA 1999»
15 years 5 months ago
Provably Good and Practical Strategies for Non-Uniform Data Management in Networks
This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objec...
Friedhelm Meyer auf der Heide, Berthold Vöcki...
KIVS
2007
Springer
15 years 7 months ago
Improved Locality-Aware Grouping in Overlay Networks
Abstract The performance of peer-to-peer and overlay networks depends to a great extent on their awareness of the underlying network’s properties. Several schemes for estimating ...
Matthias Scheidegger, Torsten Braun
NN
2002
Springer
136views Neural Networks» more  NN 2002»
15 years 1 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
AUSAI
2004
Springer
15 years 6 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. ...
CAMP
2005
IEEE
15 years 7 months ago
Reinforcement Learning for P2P Searching
— For a peer-to-peer (P2P) system holding massive amount of data, an efficient and scalable search for resource sharing is a key determinant to its practical usage. Unstructured...
Luca Gatani, Giuseppe Lo Re, Alfonso Urso, Salvato...