Sciweavers

17 search results - page 1 / 4
» Model-Based Search for Combinatorial Optimization: A Critica...
Sort
View
ANOR
2004
155views more  ANOR 2004»
13 years 10 months ago
Model-Based Search for Combinatorial Optimization: A Critical Survey
In this paper we introduce model-based search as a unifying framework accommodating some recently proposed metaheuristics for combinatorial optimization such as ant colony optimiza...
Mark Zlochin, Mauro Birattari, Nicolas Meuleau, Ma...
SARA
2007
Springer
14 years 4 months ago
Approximate Model-Based Diagnosis Using Greedy Stochastic Search
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are NPhard. To overcom...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...
ANTSW
2010
Springer
13 years 5 months ago
A Deterministic Metaheuristic Approach Using "Logistic Ants" for Combinatorial Optimization
Abstract. Ant algorithms are usually derived from a stochastic modeling based on some specific probability laws. We consider in this paper a full deterministic model of "logis...
Rodolphe Charrier, Christine Bourjot, Franç...
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
14 years 22 days ago
Stochastic local search in continuous domains: questions to be answered when designing a novel algorithm
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...
Petr Posik
GLVLSI
1998
IEEE
129views VLSI» more  GLVLSI 1998»
14 years 3 months ago
Tabu Search Based Circuit Optimization
In this paper we address the problem of optimizing mixed CMOS BiCMOS circuits. The problem is formulated as a constrained combinatorial optimization problem and solved using an ta...
Sadiq M. Sait, Habib Youssef, Munir M. Zahra