Sciweavers

169 search results - page 13 / 34
» Decentralized Search with Random Costs
Sort
View
CIKM
2010
Springer
13 years 5 months ago
Document allocation policies for selective searching of distributed indexes
Indexes for large collections are often divided into shards that are distributed across multiple computers and searched in parallel to provide rapid interactive search. Typically,...
Anagha Kulkarni, Jamie Callan
ATAL
2010
Springer
13 years 7 months ago
Heuristic search for identical payoff Bayesian games
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
Frans A. Oliehoek, Matthijs T. J. Spaan, Jilles St...
PCI
2005
Springer
14 years 6 days ago
Gossip-Based Greedy Gaussian Mixture Learning
Abstract. It has been recently demonstrated that the classical EM algorithm for learning Gaussian mixture models can be successfully implemented in a decentralized manner by resort...
Nikos A. Vlassis, Yiannis Sfakianakis, Wojtek Kowa...
ICPADS
2006
IEEE
14 years 23 days ago
XYZ: A Scalable, Partially Centralized Lookup Service for Large-Scale Peer-to-Peer Systems
Peer-to-Peer (P2P) systems are characterized by direct access between peer computers, rather than through a centralized server. File sharing is the dominant P2P application on the...
Jianying Zhang, Jie Wu
CP
1997
Springer
13 years 11 months ago
Heavy-Tailed Distributions in Combinatorial Search
Abstract. Combinatorial search methods often exhibit a large variability in performance. We study the cost pro les of combinatorial search procedures. Our study reveals some intrig...
Carla P. Gomes, Bart Selman, Nuno Crato