Sciweavers

14548 search results - page 2638 / 2910
» The Optimal Path-Matching Problem
Sort
View
GECCO
2007
Springer
191views Optimization» more  GECCO 2007»
16 years 23 days ago
One-test-at-a-time heuristic search for interaction test suites
Algorithms for the construction of software interaction test suites have focussed on the special case of pairwise coverage; less is known about efficiently constructing test suite...
Renée C. Bryce, Charles J. Colbourn
GECCO
2007
Springer
147views Optimization» more  GECCO 2007»
16 years 23 days ago
Exact analysis of the sampling distribution for the canonical particle swarm optimiser and its convergence during stagnation
Several theoretical analyses of the dynamics of particle swarms have been offered in the literature over the last decade. Virtually all rely on substantial simplifications, incl...
Riccardo Poli, David S. Broomhead
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
16 years 23 days ago
XCSF with computed continuous action
Wilson introduced XCSF as a successor to XCS. The major development of XCSF is the concept of a computed prediction. The efficiency of XCSF in dealing with numerical input and con...
Trung Hau Tran, Cédric Sanza, Yves Duthen, ...
GECCO
2007
Springer
175views Optimization» more  GECCO 2007»
16 years 23 days ago
On the constructiveness of context-aware crossover
Crossover in Genetic Programming is mostly a destructive operator, generally producing children worse than the parents and occasionally producing those who are better. A recently ...
Hammad Majeed, Conor Ryan
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
16 years 23 days ago
Modeling XCS in class imbalances: population size and parameter settings
This paper analyzes the scalability of the population size required in XCS to maintain niches that are infrequently activated. Facetwise models have been developed to predict the ...
Albert Orriols-Puig, David E. Goldberg, Kumara Sas...
« Prev « First page 2638 / 2910 Last » Next »