Sciweavers

914 search results - page 105 / 183
» Branch and Bound on the Network Model
Sort
View
GLOBECOM
2009
IEEE
15 years 4 months ago
On the Efficiency of a Game Theoretic Approach to Sparse Regenerator Placement in WDM Networks
In this paper we provide a mathematical ILP model for the Regeneration Placement Problem (RPP) which minimizes the total number of regeneration nodes allocated in a translucent opt...
Diego Lucerna, Nicola Gatti, Guido Maier, Achille ...
ECRTS
1999
IEEE
15 years 10 months ago
Adding local priority-based dispatching mechanisms to P-NET networks: a fixed priority approach
In this paper we address the real-time capabilities of P-NET, which is a multi-master fieldbus standard based on a virtual token passing scheme. We show how P-NET's medium ac...
Eduardo Tovar, Francisco Vasques, Alan Burns
UAI
2008
15 years 7 months ago
Efficient Inference in Persistent Dynamic Bayesian Networks
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
Tomás Singliar, Denver Dash
CN
2007
122views more  CN 2007»
15 years 6 months ago
Impact of mobility on the performance of relaying in ad hoc networks - Extended version
— We consider a mobile ad hoc network consisting of three types of nodes: source, destination, and relay nodes. All the nodes are moving over a bounded region with possibly diffe...
Ahmad Al Hanbali, Arzad Alam Kherani, Robin Groene...
TMC
2010
135views more  TMC 2010»
15 years 4 months ago
Maximizing the Lifetime of Wireless Sensor Networks with Mobile Sink in Delay-Tolerant Applications
—This paper proposes a framework to maximize the lifetime the wireless sensor network (WSN) by using a mobile sink when the underlying applications tolerate delayed information d...
YoungSang Yun, Ye Xia