Sciweavers

506 search results - page 31 / 102
» Automated Search for Heuristic Functions
Sort
View
SAGA
2001
Springer
14 years 2 days ago
Yet Another Local Search Method for Constraint Solving
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
Philippe Codognet, Daniel Diaz
GECCO
2005
Springer
128views Optimization» more  GECCO 2005»
14 years 1 months ago
Hybrid multiobjective genetic algorithm with a new adaptive local search process
This paper is concerned with a specific brand of evolutionary algorithms: Memetic algorithms. A new local search technique with an adaptive neighborhood setting process is introdu...
Salem F. Adra, Ian Griffin, Peter J. Fleming
CAD
1998
Springer
13 years 7 months ago
Knot-removal surface fairing using search strategies
Abstract. This paper presents two automatic fairing algorithms for parametric C2 -continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot rein...
Stefanie Hahmann, Stefan Konz
ICCS
2004
Springer
14 years 1 months ago
The Computational Complexity of Orientation Search in Cryo-Electron Microscopy
Abstract. In this paper we study the problem of determining threedimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central ...
Taneli Mielikäinen, Janne Ravantti, Esko Ukko...
EMMCVPR
2009
Springer
14 years 2 months ago
General Search Algorithms for Energy Minimization Problems
We describe a scheme for solving Energy Minimization problems, which is based on the A∗ algorithm accomplished with appropriately chosen LP-relaxations as heuristic functions. Th...
Dmitrij Schlesinger