Sciweavers

4355 search results - page 534 / 871
» Increasing Kolmogorov Complexity
Sort
View
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
16 years 8 days ago
Designing resilient networks using a hybrid genetic algorithm approach
As high-speed networks have proliferated across the globe, their topologies have become sparser due to the increased capacity of communication media and cost considerations. Relia...
Abdullah Konak, Alice E. Smith
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
16 years 8 days ago
Evolutionary computation and the c-value paradox
The C-value Paradox is the name given in biology to the wide variance in and often very large amount of DNA in eukaryotic genomes and the poor correlation between DNA length and p...
Sean Luke
GECCO
2005
Springer
112views Optimization» more  GECCO 2005»
16 years 8 days ago
Towards an empirical measure of evolvability
Genetic representations that do not employ a one-to-one mapping of genotype to phenotype are known as indirect encodings, and can be much more efficient than direct encodings for ...
Joseph Reisinger, Kenneth O. Stanley, Risto Miikku...
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
16 years 8 days ago
Solving large scale combinatorial optimization using PMA-SLS
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
Jing Tang, Meng-Hiot Lim, Yew-Soon Ong, Meng Joo E...
HIPEAC
2005
Springer
16 years 8 days ago
Enhancing Network Processor Simulation Speed with Statistical Input Sampling
Abstract. While cycle-accurate simulation tools have been widely used in modeling high-performance processors, such an approach can be hindered by the increasing complexity of the ...
Jia Yu, Jun Yang 0002, Shaojie Chen, Yan Luo, Laxm...