Sciweavers

844 search results - page 58 / 169
» Generalized crowding for genetic algorithms
Sort
View
GECCO
2003
Springer
268views Optimization» more  GECCO 2003»
15 years 3 months ago
A Generalized Feedforward Neural Network Architecture and Its Training Using Two Stochastic Search Methods
Shunting Inhibitory Artificial Neural Networks (SIANNs) are biologically inspired networks in which the synaptic interactions are mediated via a nonlinear mechanism called shuntin...
Abdesselam Bouzerdoum, Rainer Mueller
FOGA
2011
14 years 1 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
15 years 1 months ago
Robust symbolic regression with affine arithmetic
We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze e...
Cassio Pennachin, Moshe Looks, João A. de V...
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
15 years 3 months ago
Best SubTree genetic programming
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
Oana Muntean, Laura Diosan, Mihai Oltean
ANOR
2005
93views more  ANOR 2005»
14 years 9 months ago
Evolutionary Approaches to DNA Sequencing with Errors
In the paper, two evolutionary approaches to the general DNA sequencing problem, assuming both negative and positive errors in the spectrum, are compared. The older of them is base...
Jacek Blazewicz, Fred Glover, Marta Kasprzak