Sciweavers

1632 search results - page 233 / 327
» Evolutionary optimization of flavors
Sort
View
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
14 years 26 days ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom
CPM
1999
Springer
129views Combinatorics» more  CPM 1999»
14 years 16 days ago
On the Structure of Syntenic Distance
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
David Liben-Nowell
GECCO
2009
Springer
14 years 3 days ago
Evolving heuristically difficult instances of combinatorial problems
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
Bryant A. Julstrom
GECCO
2006
Springer
177views Optimization» more  GECCO 2006»
13 years 12 months ago
Hyper-ellipsoidal conditions in XCS: rotation, linear approximation, and solution structure
The learning classifier system XCS is an iterative rulelearning system that evolves rule structures based on gradient-based prediction and rule quality estimates. Besides classifi...
Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson
GECCO
2006
Springer
202views Optimization» more  GECCO 2006»
13 years 12 months ago
Inference of genetic networks using S-system: information criteria for model selection
In this paper we present an evolutionary approach for inferring the structure and dynamics in gene circuits from observed expression kinetics. For representing the regulatory inte...
Nasimul Noman, Hitoshi Iba