Sciweavers

1972 search results - page 102 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
RECOMB
2002
Springer
14 years 9 months ago
Comparison of minisatellites
In the class of repeated sequences that occur in DNA, minisatellites have been found polymorphic and became useful tools in genetic mapping and forensic studies. They consist of a...
Eric Rivals, Sèverine Bérard
CVPR
2000
IEEE
14 years 11 months ago
Improved Motion Stereo Matching Based on a Modified Dynamic Programming
A new method for computing precise depth map estimates of 3D shape of a moving object is proposed. 3D shape recovery in motion stereo is formulated as a matching optimization prob...
Mikhail Mozerov, Vitaly Kober, Tae-Sun Choi
FGR
2006
IEEE
205views Biometrics» more  FGR 2006»
14 years 3 months ago
Tracking Using Dynamic Programming for Appearance-Based Sign Language Recognition
We present a novel tracking algorithm that uses dynamic programming to determine the path of target objects and that is able to track an arbitrary number of different objects. The...
Philippe Dreuw, Thomas Deselaers, David Rybach, Da...
JCP
2007
143views more  JCP 2007»
13 years 9 months ago
Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
Nicolas Chapados, Yoshua Bengio
GECCO
2003
Springer
123views Optimization» more  GECCO 2003»
14 years 2 months ago
Analysis of the (1+1) EA for a Dynamically Bitwise Changing OneMax
Abstract. Although evolutionary algorithms (EAs) are often successfully used for the optimization of dynamically changing objective function, there are only very few theoretical re...
Stefan Droste