Sciweavers

6095 search results - page 89 / 1219
» Learning in Local Search
Sort
View
ICCD
2001
IEEE
103views Hardware» more  ICCD 2001»
14 years 5 months ago
Fixed-outline Floorplanning through Better Local Search
Classical floorplanning minimizes a linear combination of area and wirelength. When Simulated Annealing is used, e.g., with the Sequence Pair representation, the typical choice o...
Saurabh N. Adya, Igor L. Markov
CP
2009
Springer
14 years 3 months ago
Pin Assignment Using Stochastic Local Search Constraint Programming
Abstract. VLSI chips design is becoming increasingly complex and calling for more and more automation. Many chip design problems can be formulated naturally as constraint problems ...
Bella Dubrov, Haggai Eran, Ari Freund, Edward F. M...
ICTAI
2009
IEEE
14 years 3 months ago
Local Autarkies Searching for the Dynamic Partition of CNF Formulae
In this paper an original dynamic partition of formulae in Conjunctive Normal Form (CNF) is presented. It is based on the autarky concept first introduced by Monien and Speckenme...
Éric Grégoire, Bertrand Mazure, Lakh...
LION
2009
Springer
115views Optimization» more  LION 2009»
14 years 3 months ago
Flexible Stochastic Local Search for Haplotype Inference
Abstract. Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genoty...
Luca Di Gaspero, Andrea Roli
ICTAI
2006
IEEE
14 years 2 months ago
Computing Horn Strong Backdoor Sets Thanks to Local Search
In this paper a new approach for computing Strong Backdoor sets of boolean formula in conjunctive normal form (CNF) is proposed. It makes an original use of local search technique...
Lionel Paris, Richard Ostrowski, Pierre Siegel, La...