625 search results - page 68 / 125 » Approximating Travel Times Using Opportunistic Networking |
130
Voted
AAAI
2012
13 years 5 months ago
2012
Widespread accounts of the harmful effects of invasive species have stimulated both practical and theoretical studies on how the spread of these destructive agents can be containe...
126
Voted
RSFDGRC
2005
Springer
15 years 9 months ago
2005
Springer
We discuss the problems of spatio-temporal reasoning in the context of hierarchical information maps and approximate reasoning networks (AR networks). Hierarchical information maps...
139
click to vote
JMLR
2010
14 years 10 months ago
2010
We present a new approximate inference algorithm for Deep Boltzmann Machines (DBM's), a generative model with many layers of hidden variables. The algorithm learns a separate...
167
click to vote
MOBICOM
2006
ACM
15 years 9 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
139
Voted
SODA
2008
ACM
15 years 4 months ago
2008
ACM
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...