Sciweavers

1439 search results - page 207 / 288
» Fast approximation of centrality
Sort
View
MASCOTS
2001
13 years 11 months ago
Large-Scale Simulation of Replica Placement Algorithms for a Serverless Distributed File System
Farsite is a scalable, distributed file system that logically functions as a centralized file server but that is physically implemented on a set of client desktop computers. Farsi...
John R. Douceur, Roger Wattenhofer
AAAI
1998
13 years 11 months ago
Bayesian Q-Learning
A central problem in learning in complex environmentsis balancing exploration of untested actions against exploitation of actions that are known to be good. The benefit of explora...
Richard Dearden, Nir Friedman, Stuart J. Russell
ADHOC
2010
163views more  ADHOC 2010»
13 years 10 months ago
A probabilistic method for cooperative hierarchical aggregation of data in VANETs
We propose an algorithm for the hierarchical aggregation of observations in dissemination-based, distributed traffic information systems. Instead of transmitting observed paramete...
Christian Lochert, Björn Scheuermann, Martin ...
CSL
2010
Springer
13 years 10 months ago
The Hidden Information State model: A practical framework for POMDP-based spoken dialogue management
This paper explains how Partially Observable Markov Decision Processes (POMDPs) can provide a principled mathematical framework for modelling the inherent uncertainty in spoken di...
Steve Young, Milica Gasic, Simon Keizer, Fran&cced...
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 10 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg