6693 search results - page 3 / 1339 » On an anytime algorithm for control |
121
click to vote
EC
2007
14 years 9 months ago
2007
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
43
Voted
JACIII
2008
14 years 9 months ago
2008
IJCIS
2002
14 years 9 months ago
2002
ICCS
2003
Springer
15 years 2 months ago
2003
Springer
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...
CP
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...