Sciweavers

2796 search results - page 104 / 560
» The coolest path problem
Sort
View
WAOA
2005
Springer
86views Algorithms» more  WAOA 2005»
15 years 10 months ago
SONET ADMs Minimization with Divisible Paths
We consider an optical routing problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic...
Leah Epstein, Asaf Levin
INFOCOM
2003
IEEE
15 years 10 months ago
Network Management Information For Light-Path Assessment: Trade-off between Performance and Complexity
We investigate network management information for light-path assessment to dynamically set up end-to-end lightpaths across administrative domains. Our focus is on invetigating what...
Guanglei Liu, Chuanyi Ji, Vincent W. S. Chan
SC
2000
ACM
15 years 9 months ago
Landing CG on EARTH: A Case Study of Fine-Grained Multithreading on an Evolutionary Path
We report on our work in developing a fine-grained multithreaded solution for the communicationintensive Conjugate Gradient (CG) problem. In our recent work, we developed a simpl...
Kevin B. Theobald, Gagan Agrawal, Rishi Kumar, Ger...
IPPS
2005
IEEE
15 years 10 months ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
KBSE
2002
IEEE
15 years 9 months ago
Generating Test Data for Functions with Pointer Inputs
Generating test inputs for a path in a function with integer and real parameters is an important but difficult problem. The problem becomes more difficult when pointers are pass...
Srinivas Visvanathan, Neelam Gupta