Sciweavers

255 search results - page 6 / 51
» Genetic Algorithm for Restrictive Channel Routing Problem
Sort
View
JCO
2002
48views more  JCO 2002»
13 years 7 months ago
A Genetic Algorithm for the Weight Setting Problem in OSPF Routing
M. Ericsson, Mauricio G. C. Resende, Panos M. Pard...
IJMC
2006
84views more  IJMC 2006»
13 years 7 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
GECCO
2003
Springer
162views Optimization» more  GECCO 2003»
14 years 18 days ago
Optimization of Spare Capacity in Survivable WDM Networks
A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for ...
H. W. Chong, Sam Kwong
GECCO
2005
Springer
182views Optimization» more  GECCO 2005»
14 years 28 days ago
Improving EAX with restricted 2-opt
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...
Chen-hsiung Chan, Sheng-An Lee, Cheng-Yan Kao, Hua...
ICCAD
2007
IEEE
165views Hardware» more  ICCAD 2007»
13 years 11 months ago
BioRoute: a network-flow based routing algorithm for digital microfluidic biochips
Due to the recent advances in microfluidics, digital microfluidic biochips are expected to revolutionize laboratory procedures. One critical problem for biochip synthesis is the dr...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang