Sciweavers

1310 search results - page 129 / 262
» A parallel genetic algorithm to solve the set-covering probl...
Sort
View
GECCO
2010
Springer
129views Optimization» more  GECCO 2010»
15 years 2 months ago
A probabilistic functional crossover operator for genetic programming
The original mechanism by which evolutionary algorithms were to solve problems was to allow for the gradual discovery of sub-solutions to sub-problems, and the automated combinati...
Josh C. Bongard
GECCO
2010
Springer
220views Optimization» more  GECCO 2010»
15 years 1 months ago
Interday foreign exchange trading using linear genetic programming
Foreign exchange (forex) market trading using evolutionary algorithms is an active and controversial area of research. We investigate the use of a linear genetic programming (LGP)...
Garnett Carl Wilson, Wolfgang Banzhaf
CPHYSICS
2006
204views more  CPHYSICS 2006»
14 years 10 months ago
Genetically controlled random search: a global optimization method for continuous multidimensional functions
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
Ioannis G. Tsoulos, Isaac E. Lagaris
PPOPP
2005
ACM
15 years 3 months ago
A sampling-based framework for parallel data mining
The goal of data mining algorithm is to discover useful information embedded in large databases. Frequent itemset mining and sequential pattern mining are two important data minin...
Shengnan Cong, Jiawei Han, Jay Hoeflinger, David A...
JUCS
2002
179views more  JUCS 2002»
14 years 9 months ago
A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...
Bruce W. Watson