A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Solving Combinatorial Problems with Time Constrains Using Estimation of Distribution Algorithms and Their Application in Video-Tracking Systems
[chapter]
2010
New Achievements in Evolutionary Computation
Introduction EDAs (Estimation of Distribution Algorithms) present the suitable features to deal with problems requiring a very efficient search: small populations and a few iterations, compared with the more classic approaches to Evolutionary Algorithms (EAs). The fundamental difference of EDAs with classical EAs is that the formers carry out a search of the probability distribution describing the optimal solutions while EAs directly make the search and provide the solutions to the problem with
doi:10.5772/8057
fatcat:sye4ie2qwfbpznhopi7iwjk2be