Sciweavers

2796 search results - page 82 / 560
» The coolest path problem
Sort
View
INFOCOM
2002
IEEE
15 years 9 months ago
Constraint-based path selection methods for on-demand provisioning in WDM networks
Abstract-- We propose a framework for decentralized path selection and on-demand wavelength channel provisioning in WDM networks with routing constraints. Within this framework, th...
Admela Jukan, Gerald Franzl
ECCV
2000
Springer
15 years 9 months ago
Minimal Paths in 3D Images and Application to Virtual Endoscopy
This paper presents a new method to find minimal paths in 3D images, giving as initial data one or two endpoints. This is based on previous work [1] for extracting paths in 2D ima...
Thomas Deschamps, Laurent D. Cohen
MASS
2010
186views Communications» more  MASS 2010»
15 years 2 months ago
VAN: Vehicle-assisted shortest-time path navigation
Traffic congestion is a very serious problem in large cities. With the number of vehicles increasing rapidly, especially in cities whose economy is booming, the situation is gettin...
Wenping Chen, Sencun Zhu, Deying Li
INFORMS
2008
55views more  INFORMS 2008»
15 years 4 months ago
Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
April K. Andreas, J. Cole Smith
EVOW
2004
Springer
15 years 10 months ago
Scatter Search and Memetic Approaches to the Error Correcting Code Problem
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is tackl...
Carlos Cotta