895 search results - page 39 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
EUROGP
2005
Springer
15 years 4 months ago
2005
Springer
We describe an approach to understanding evolved programs for a real world object detection problem, that of finding orthodontic landmarks in cranio-facial X-Rays. The approach in...
EUSFLAT
2007
15 years 7 days ago
2007
This paper concerns problem of selection of optimal subset of irredundant unconditional diagnostic tests by means of evolutionary approach. The method of correction of features’...
135
click to vote
ICIP
2009
IEEE
15 years 12 months ago
2009
IEEE
Fast level set methods replace continuous PDEs by a discrete formulation, improving the execution times. The regularization in fast level set methods was so far handled indirectly...
FSTTCS
2010
Springer
14 years 8 months ago
2010
Springer
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...
SWAT
2004
Springer
15 years 4 months ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...