Sciweavers

866 search results - page 122 / 174
» On Dynamic Shortest Paths Problems
Sort
View
CORR
2010
Springer
160views Education» more  CORR 2010»
14 years 10 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
SOFSEM
2005
Springer
15 years 7 months ago
Anonymous Communication with On-line and Off-line Onion Encoding
Abstract. Anonymous communication with onions requires that a user application determines the whole routing path of an onion. This scenario has certain disadvantages, it might be d...
Marek Klonowski, Miroslaw Kutylowski, Filip Zag&oa...
EUROSYS
2007
ACM
15 years 10 months ago
Dynamic and adaptive updates of non-quiescent subsystems in commodity operating system kernels
Continuously running systems require kernel software updates applied to them without downtime. Facilitating fast reboots, or delaying an update may not be a suitable solution in m...
Kristis Makris, Kyung Dong Ryu
BMCBI
2005
189views more  BMCBI 2005»
15 years 1 months ago
Quantitative inference of dynamic regulatory pathways via microarray data
Background: The cellular signaling pathway (network) is one of the main topics of organismic investigations. The intracellular interactions between genes in a signaling pathway ar...
Wen-Chieh Chang, Chang-Wei Li, Bor-Sen Chen
TPDS
2008
124views more  TPDS 2008»
15 years 1 months ago
TROP: A Novel Approximate Link-State Dissemination Framework For Dynamic Survivable Routing in MPLS Networks
In this paper, a novel approximate link-state dissemination framework, called TROP, is proposed for shared backup path protection (SBPP) in Multi-Protocol Label Switching (MPLS) ne...
János Tapolcai, Pin-Han Ho, Anwar Haque