Sciweavers

256 search results - page 15 / 52
» Comparison of Heuristic and Optimal Subcarrier Assignment Al...
Sort
View
GECCO
2000
Springer
170views Optimization» more  GECCO 2000»
14 years 7 days ago
A Comparison of Genetic Algorithms for the Dynamic Job Shop Scheduling Problem
The majority of the research using evolutionary algorithms for the Job Shop Scheduling Problem (JSSP) has studied only the static JSSP. Few evolutionary algorithms have been appli...
Manuel Vázquez, L. Darrell Whitley
DAC
2010
ACM
14 years 17 days ago
Eyecharts: constructive benchmarking of gate sizing heuristics
—Discrete gate sizing is one of the most commonly used, flexible, and powerful techniques for digital circuit optimization. The underlying problem has been proven to be NP-hard ...
Puneet Gupta, Andrew B. Kahng, Amarnath Kasibhatla...
STOC
1990
ACM
108views Algorithms» more  STOC 1990»
14 years 20 days ago
Optimal Randomized Algorithms for Local Sorting and Set-Maxima
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
Wayne Goddard, Valerie King, Leonard J. Schulman
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
13 years 8 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono
INFOCOM
2002
IEEE
14 years 1 months ago
Routing and Wavelength Assignment in WDM Rings with Heterogeneous Wavelength Conversion Capabilities
—In this paper, we study the routing and wavelength assignment (RWA) tasks in WDM rings with heterogeneous wavelength conversion capabilities. By heterogeneous, we mean that diff...
Dirceu Cavendish, Bhaskar Sengupta