914 search results - page 95 / 183 » Branch and Bound on the Network Model |
109
click to vote
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—We present the first unified modeling framework for the computation of the throughput capacity of random wireless ad hoc networks in which information is disseminated by means...
ISAAC
2007
Springer
15 years 4 months ago
2007
Springer
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
SIGMETRICS
2010
ACM
15 years 2 months ago
2010
ACM
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
190
click to vote
TKDE
2012
13 years 6 days ago
2012
—Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of som...
UAI
1998
14 years 11 months ago
1998
There is evidence that the numbers in probabilistic inference don't really matter. This paper considers the idea that we can make a probabilistic model simpler by making fewe...