Sciweavers

2922 search results - page 441 / 585
» Scalable Algorithms for Distribution Search
Sort
View
EUROPAR
2009
Springer
14 years 3 months ago
Uniform Sampling for Directed P2P Networks
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
Cyrus P. Hall, Antonio Carzaniga
ATAL
2005
Springer
14 years 2 months ago
Multiagent coordination by Extended Markov Tracking
We present here Extended Markov Tracking (EMT), a computationally tractable method for the online estimation of Markovian system dynamics, along with experimental support for its ...
Zinovi Rabinovich, Jeffrey S. Rosenschein
COLT
2005
Springer
14 years 2 months ago
A PAC-Style Model for Learning from Labeled and Unlabeled Data
Abstract. There has been growing interest in practice in using unlabeled data together with labeled data in machine learning, and a number of different approaches have been develo...
Maria-Florina Balcan, Avrim Blum
ICMCS
2009
IEEE
96views Multimedia» more  ICMCS 2009»
13 years 7 months ago
Optimizing segment caching for peer-to-peer on-demand streaming
In peer-to-peer (P2P) on-demand streaming applications, multimedia content is divided into segments and peers can seek any segments for viewing at anytime. Since different segment...
Ho-Shing Tang, Shueng-Han Gary Chan, Haochao Li
ATAL
2007
Springer
14 years 3 months ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...