Sciweavers

4650 search results - page 536 / 930
» Generating and evaluating evaluative arguments
Sort
View
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
16 years 8 days ago
Enhancing differential evolution performance with local search for high dimensional function optimization
In this paper, we proposed Fittest Individual Refinement (FIR), a crossover based local search method for Differential Evolution (DE). The FIR scheme accelerates DE by enhancing...
Nasimul Noman, Hitoshi Iba
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
16 years 8 days ago
Evolutionary change in developmental timing
This paper presents a mutation-based evolutionary algorithm that evolves genotypic genes for regulating developmental timing of phenotypic values. The genotype sequentially genera...
Kei Ohnishi, Kaori Yoshida
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
16 years 8 days ago
Evolving neural network ensembles for control problems
In neuroevolution, a genetic algorithm is used to evolve a neural network to perform a particular task. The standard approach is to evolve a population over a number of generation...
David Pardoe, Michael S. Ryoo, Risto Miikkulainen
ICS
2005
Tsinghua U.
16 years 8 days ago
A heterogeneously segmented cache architecture for a packet forwarding engine
As network traffic continues to increase and with the requirement to process packets at line rates, high performance routers need to forward millions of packets every second. Eve...
Kaushik Rajan, Ramaswamy Govindarajan
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
16 years 8 days ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang