Sciweavers

193 search results - page 7 / 39
» Fast searches for effective optimization phase sequences
Sort
View
GECCO
2006
Springer
171views Optimization» more  GECCO 2006»
15 years 5 months ago
A hybrid genetic search for multiple sequence alignment
This paper proposes a hybrid genetic algorithm for multiple sequence alignment. The algorithm evolves guide sequences and aligns input sequences based on the guide sequences. It a...
Seung-Hyun Moon, Sung-Soon Choi, Byung Ro Moon
IPCO
2010
153views Optimization» more  IPCO 2010»
14 years 11 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
Christoph Buchheim, Alberto Caprara, Andrea Lodi
147
Voted
BMCBI
2005
132views more  BMCBI 2005»
15 years 1 months ago
Kalign - an accurate and fast multiple sequence alignment algorithm
Background: The alignment of multiple protein sequences is a fundamental step in the analysis of biological data. It has traditionally been applied to analyzing protein families f...
Timo Lassmann, Erik L. L. Sonnhammer
117
Voted
SC
2005
ACM
15 years 7 months ago
Integrated Loop Optimizations for Data Locality Enhancement of Tensor Contraction Expressions
A very challenging issue for optimizing compilers is the phase ordering problem: In what order should a collection of compiler optimizations be performed? We address this problem ...
Swarup Kumar Sahoo, Sriram Krishnamoorthy, Rajkira...
96
Voted
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 5 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