Sciweavers

547 search results - page 4 / 110
» Efficient Model Update for General Link-Insertion Networks
Sort
View
GIS
2008
ACM
14 years 8 months ago
Continuous proximity monitoring in road networks
In this paper, we consider the following scenario: a set of mobile objects continuously track their positions in a road network and are able to communicate with a central server. ...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
UAI
2003
13 years 8 months ago
Updating with incomplete observations
Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete (or setvalued). This is a fundamental pro...
Gert de Cooman, Marco Zaffalon
APIN
1999
107views more  APIN 1999»
13 years 7 months ago
Massively Parallel Probabilistic Reasoning with Boltzmann Machines
We present a method for mapping a given Bayesian network to a Boltzmann machine architecture, in the sense that the the updating process of the resulting Boltzmann machine model pr...
Petri Myllymäki
WAW
2010
Springer
311views Algorithms» more  WAW 2010»
13 years 5 months ago
Game-Theoretic Models of Information Overload in Social Networks
We study the effect of information overload on user engagement in an asymmetric social network like Twitter. We introduce simple game-theoretic models that capture rate competition...
Christian Borgs, Jennifer T. Chayes, Brian Karrer,...
IJCAI
2001
13 years 8 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz