500 search results - page 40 / 100 » A parallel quadratic programming method for dynamic optimiza... |
102
click to vote
GECCO
2006
Springer
15 years 2 months ago
2006
Springer
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...
117
click to vote
GECCO
2005
Springer
15 years 4 months ago
2005
Springer
This paper presents a comprehensive, multivariate account of how initial population material is used over the course of a genetic programming run as while various factors influenc...
105
click to vote
IPPS
2007
IEEE
15 years 5 months ago
2007
IEEE
DNA sequence alignment is a very important problem in bioinformatics. The algorithm proposed by Smith-Waterman (SW) is an exact method that obtains optimal local alignments in qua...
CVIU
2008
14 years 11 months ago
2008
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
108
click to vote
KDD
2004
ACM
15 years 11 months ago
2004
ACM
We devise a boosting approach to classification and regression based on column generation using a mixture of kernels. Traditional kernel methods construct models based on a single...