4229 search results - page 73 / 846 » On the Optimality of Spiral Search |
73
Voted
CP
2009
Springer
15 years 6 months ago
2009
Springer
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
ECML
1998
Springer
15 years 3 months ago
1998
Springer
Feature selection is a problem of choosing a subset of relevant features. Researchers have been searching for optimal feature selection methods. `Branch and Bound' and Focus a...
GECCO
2008
Springer
15 years 10 days ago
2008
Springer
In this paper we propose a novel iterative search procedure for multi-objective optimization problems. The iteration process – though derivative free – utilizes the geometry o...
ECAI
2006
Springer
15 years 3 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...
CEC
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract—In the real world, many applications are nonstationary optimization problems. This requires that optimization algorithms need to not only find the global optimal soluti...