526 search results - page 82 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
136
click to vote
RECOMB
2005
Springer
16 years 4 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
152
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
Evolutionary Algorithms’ (EAs’) application to real world optimization problems often involves expensive fitness function evaluation. Naturally this has a crippling effect on ...
173
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
In this paper we present a novel face classification system
where we represent face images as a spatial arrangement
of image patches, and seek a smooth non-linear functional
map...
179
click to vote
GPCE
2009
Springer
15 years 7 months ago
2009
Springer
Mapping problem-space features into solution-space features is a fundamental configuration problem in software product line engineering. A configuration problem is defined as g...
145
click to vote
AIPS
2008
15 years 6 months ago
2008
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...