Sciweavers

193 search results - page 28 / 39
» A Lower Bound for the Shortest Path Problem
Sort
View
130
Voted
PODC
2006
ACM
15 years 5 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
COMPGEOM
2004
ACM
15 years 3 months ago
Continuous path verification in multi-axis NC-machining
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...
Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperi...
119
Voted
OSN
2007
185views more  OSN 2007»
14 years 11 months ago
Comparison of ILP formulations for the RWA problem
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
Brigitte Jaumard, Christophe Meyer, B. Thiongane
CN
2010
88views more  CN 2010»
14 years 11 months ago
Two-link failure protection in WDM mesh networks with p-cycles
In WDM networks, it is important to protect connections against link failures due to the high bandwidth provided by a fiber link. Although many p-cycle based schemes have been pro...
Taiming Feng, Long Long, Ahmed E. Kamal, Lu Ruan
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
15 years 5 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...