430 search results - page 40 / 86 » Constructing Dynamic Optimization Test Problems Using the Mu... |
131
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
139
click to vote
JCO
1998
15 years 2 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
146
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
109
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
104
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
We present the first hardware-in-the-loop evolutionary optimization on an ornithopter. Our experiments demonstrate the feasibility of evolving flight through genetic algorithms an...