Sciweavers

914 search results - page 81 / 183
» Branch and Bound on the Network Model
Sort
View
NIPS
1998
14 years 11 months ago
Approximate Learning of Dynamic Models
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
Xavier Boyen, Daphne Koller
INFOCOM
2007
IEEE
15 years 4 months ago
Broadcast Flooding Revisited: Survivability and Latency
—This paper addresses the dynamics of broadcast flooding in random wireless ad hoc networks. In particular, we study the subset of nodes covered by a flood as well as timing is...
Petteri Mannersalo, Alireza Keshavarz-Haddad, Rudo...
MST
2010
78views more  MST 2010»
14 years 8 months ago
Sensitivity of Wardrop Equilibria
We study the sensitivity of equilibria in the well-known game theoretic traffic model due to Wardrop. We mostly consider single-commodity networks. Suppose, given a unit demand fl...
Matthias Englert, Thomas Franke, Lars Olbrich
IPSN
2004
Springer
15 years 3 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
MSWIM
2009
ACM
15 years 4 months ago
On the impact of far-away interference on evaluations of wireless multihop networks
It is common practice in wireless multihop network evaluations to ignore interfering signals below a certain signal strength threshold. This paper investigates the thesis that thi...
Douglas M. Blough, Claudia Canali, Giovanni Resta,...