Sciweavers

2796 search results - page 77 / 560
» The coolest path problem
Sort
View
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 10 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
INFOCOM
2008
IEEE
15 years 11 months ago
SRLG Failure Localization in All-Optical Networks Using Monitoring Cycles and Paths
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...
Satyajeet Ahuja, Srinivasan Ramasubramanian, Marwa...
BROADNETS
2007
IEEE
15 years 11 months ago
Dedicated path protection for waveband switching in WDM networks (invited paper)
— This paper considers the problem of dedicated path-protection in a wavelength-division multiplexing (WDM) mesh network with waveband switching (WBS) functionality under shared ...
Mengke Li, Byrav Ramamurthy
ICCS
2001
Springer
15 years 9 months ago
A Feynman-Kac Path-Integral Implementation for Poisson's Equation
This study presents a Feynman–Kac path-integral implementation for solving the Dirichlet problem for Poisson’s equation. The algorithm is a modified “walk on spheres” (WO...
Chi-Ok Hwang, Michael Mascagni
TACAS
2007
Springer
110views Algorithms» more  TACAS 2007»
15 years 10 months ago
Counterexamples in Probabilistic Model Checking
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
Tingting Han, Joost-Pieter Katoen