5595 search results - page 315 / 1119 » Comparing Subsumption Optimizations |
163
click to vote
WADS
2005
Springer
16 years 5 days ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
165
click to vote
GECCO
2004
Springer
16 years 2 days ago
2004
Springer
Application-specific, parameterized local search algorithms (PLSAs), in which optimization accuracy can be traded off with runtime, arise naturally in many optimization contexts....
181
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
The Portfolio Optimization problem consists of the selection of a group of assets to a long-term fund in order to minimize the risk and maximize the return of the investment. This...
166
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Developing scalable algorithms for solving partially observable Markov decision processes (POMDPs) is an important challenge. One promising approach is based on representing POMDP...
191
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...