Sciweavers

1520 search results - page 124 / 304
» The Ring Loading Problem
Sort
View
132
Voted
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
15 years 9 months ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...
INFOCOM
2010
IEEE
15 years 2 months ago
Distributed Dynamic Speed Scaling
In recent years we have witnessed a great interest in large distributed computing platforms, also known as clouds. While these systems offer enormous computing power, they are howe...
Rade Stanojevic, Robert Shorten
145
Voted
COCOON
2006
Springer
15 years 8 months ago
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
Iyad A. Kanj, Luay Nakhleh, Ge Xia
143
Voted
JSAC
2006
157views more  JSAC 2006»
15 years 5 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
223
Voted
ICSC
1999
Springer
148views Image Analysis» more  ICSC 1999»
15 years 9 months ago
Applications of Aglet Technology
The Internet has evolved from an information space to a market space with thousands of electronic storefronts, auctions and other commercial services. This market space is not with...
Rosane Maria Martins, Magali Ribeiro Chaves, Luci ...