Sciweavers

2930 search results - page 302 / 586
» The optimal sequence compression
Sort
View
173
Voted
VLSID
1999
IEEE
111views VLSI» more  VLSID 1999»
15 years 10 months ago
A New Approach for CMOS Op-Amp Synthesis
A new approach for CMOS op-amp circuit synthesis has proposed here. The approach is based on the observation that the rst order behavior of a MOS transistor in the saturation regi...
Pradip Mandal, V. Visvanathan
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 9 months ago
Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This techniqu...
Jason Amunrud, Bryant A. Julstrom
175
Voted
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
15 years 9 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
EUROGP
2008
Springer
137views Optimization» more  EUROGP 2008»
15 years 8 months ago
A Comparison of Cartesian Genetic Programming and Linear Genetic Programming
Two prominent genetic programming approaches are the graph-based Cartesian Genetic Programming (CGP) and Linear Genetic Programming (LGP). Recently, a formal algorithm for construc...
Garnett Carl Wilson, Wolfgang Banzhaf
ACL
2006
15 years 7 months ago
A Discriminative Global Training Algorithm for Statistical MT
This paper presents a novel training algorithm for a linearly-scored block sequence translation model. The key component is a new procedure to directly optimize the global scoring...
Christoph Tillmann, Tong Zhang