Sciweavers

135 search results - page 8 / 27
» String Noninclusion Optimization Problems
Sort
View
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
15 years 1 months ago
Motivation and framework for using genetic algorithms for microcode compaction
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
Steven J. Beaty, Darrell Whitley, Gearold Johnson
WABI
2004
Springer
15 years 2 months ago
Finding Optimal Pairs of Patterns
We consider the problem of finding the optimal pair of string patterns for discriminating between two sets of strings, i.e. finding the pair of patterns that is best with respect...
Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, ...
DIS
2004
Springer
15 years 3 months ago
Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance
We consider the problem of discovering the optimal pair of substring patterns with bounded distance α, from a given set S of strings. We study two kinds of pattern classes, one is...
Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö,...
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
15 years 2 months ago
Evolutionary codings and operators for the terminal assignment problem
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
Bryant A. Julstrom
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
14 years 10 months ago
Experiments with indexed FOR-loops in genetic programming
We investigated how indexed FOR-loops, such as the ones found in procedural programming languages, can be implemented in genetic programming. We use them to train programs that le...
Gayan Wijesinghe, Victor Ciesielski