52 search results - page 2 / 11 » Oblivious Randomized Direct Search for Real-Parameter Optimi... |
EMO
2001
Springer
13 years 9 months ago
2001
Springer
When we try to implement a multi-objective genetic algorithm (MOGA) with variable weights for finding a set of Pareto optimal solutions, one difficulty lies in determining appropri...
ECAI
2006
Springer
13 years 9 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
ICML
2001
IEEE
14 years 6 months ago
2001
IEEE
Direct policy search is a practical way to solve reinforcement learning problems involving continuous state and action spaces. The goal becomes finding policy parameters that maxi...
ECCC
2011
12 years 11 months ago
2011
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
JCO
1998
13 years 5 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...