Sciweavers

5785 search results - page 673 / 1157
» Approximability of Probability Distributions
Sort
View
INFOCOM
2006
IEEE
16 years 27 days ago
Sketch Guided Sampling - Using On-Line Estimates of Flow Size for Adaptive Data Collection
— Monitoring the traffic in high-speed networks is a data intensive problem. Uniform packet sampling is the most popular technique for reducing the amount of data the network mo...
Abhishek Kumar, Jun Xu
NIPS
1990
15 years 8 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro
AAMAS
2010
Springer
15 years 7 months ago
Coordinated learning in multiagent MDPs with infinite state-space
Abstract In this paper we address the problem of simultaneous learning and coordination in multiagent Markov decision problems (MMDPs) with infinite state-spaces. We separate this ...
Francisco S. Melo, M. Isabel Ribeiro
JAIR
2008
93views more  JAIR 2008»
15 years 6 months ago
A Rigorously Bayesian Beam Model and an Adaptive Full Scan Model for Range Finders in Dynamic Environments
This paper proposes and experimentally validates a Bayesian network model of a range finder adapted to dynamic environments. All modeling assumptions are rigorously explained, and...
Tinne De Laet, Joris De Schutter, Herman Bruyninck...
SIAMAM
2000
128views more  SIAMAM 2000»
15 years 6 months ago
Advection-Diffusion Equations for Internal State-Mediated Random Walks
Abstract. In many biological examples of biased random walks, movement statistics are determined by state dynamics that are internal to the organism or cell and that mediate respon...
Daniel Grünbaum