4229 search results - page 309 / 846 » On the Optimality of Spiral Search |
104
Voted
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
135
Voted
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
103
click to vote
EOR
2010
15 years 1 months ago
2010
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
187
click to vote
TELSYS
2011
14 years 8 months ago
2011
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
Particle Swarm Optimization (PSO) is a population-based optimization method in which search points employ a cooperative strategy to move toward one another. In this paper we show ...