Sciweavers

697 search results - page 15 / 140
» Improving EAs for Sequencing Problems
Sort
View
EVOW
2006
Springer
13 years 11 months ago
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Prob...
Marc Schoenauer, Pierre Savéant, Vincent Vi...
ICIP
2008
IEEE
14 years 2 months ago
Blind deconvolution of video sequences
We present a new blind deconvolution method for video sequence. It is derived following an inverse problem approach in a Bayesian framework. This method exploits the temporal cont...
Ferreol Soulez, Eric Thiebaut, Yves Tourneur, Alai...
GECCO
1999
Springer
126views Optimization» more  GECCO 1999»
14 years 5 days ago
Improving Genetic Algorithms by Search Space Reductions (with Applications to Flow Shop Scheduling)
Crossover operators that preserve common components can also preserve representation level constraints. Consequently, these constraints can be used to beneficially reduce the sea...
Stephen Y. Chen, Stephen F. Smith
RECOMB
2005
Springer
14 years 8 months ago
Using Multiple Alignments to Improve Gene Prediction
The multiple species de novo gene prediction problem can be stated as follows: given an alignment of genomic sequences from two or more organisms, predict the location and structur...
Samuel S. Gross, Michael R. Brent
ICDE
2005
IEEE
176views Database» more  ICDE 2005»
14 years 1 months ago
LAPIN-SPAM: An Improved Algorithm for Mining Sequential Pattern
Sequence pattern mining is an important research problem because it is the basis of many other applications. Yet how to efficiently implement the mining is difficult due to the ...
Zhenglu Yang, Masaru Kitsuregawa