Sciweavers

18 search results - page 3 / 4
» Genetically controlled random search: a global optimization ...
Sort
View
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
13 years 10 months ago
Genetic algorithms using low-discrepancy sequences
The random number generator is one of the important components of evolutionary algorithms (EAs). Therefore, when we try to solve function optimization problems using EAs, we must ...
Shuhei Kimura, Koki Matsumura
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
13 years 11 months ago
On the behavioral diversity of random programs
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
Moshe Looks
ALMOB
2006
155views more  ALMOB 2006»
13 years 5 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...
ICANNGA
2007
Springer
161views Algorithms» more  ICANNGA 2007»
13 years 9 months ago
Evolutionary Induction of Decision Trees for Misclassification Cost Minimization
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
Marek Kretowski, Marek Grzes
CPHYSICS
2006
182views more  CPHYSICS 2006»
13 years 5 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris