Sciweavers

589 search results - page 14 / 118
» Local Search Algorithms for SAT: An Empirical Evaluation
Sort
View
EVOW
2008
Springer
13 years 9 months ago
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
Renaud Lenne, Christine Solnon, Thomas Stützl...
JMLR
2008
159views more  JMLR 2008»
13 years 7 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
ICCAD
2001
IEEE
144views Hardware» more  ICCAD 2001»
14 years 4 months ago
Faster SAT and Smaller BDDs via Common Function Structure
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
CEC
2007
IEEE
14 years 1 months ago
Incrementally maximising hypervolume for selection in multi-objective evolutionary algorithms
— Several multi-objective evolutionary algorithms compare the hypervolumes of different sets of points during their operation, usually for selection or archiving purposes. The ba...
Lucas Bradstreet, R. Lyndon While, Luigi Barone
TIME
2002
IEEE
14 years 8 days ago
Applying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...