Sciweavers

89 search results - page 4 / 18
» Evidence for Invariants in Local Search
Sort
View
AAAI
2004
13 years 10 months ago
MAX-2-SAT: How Good Is Tabu Search in the Worst-Case?
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...
Monaldo Mastrolilli, Luca Maria Gambardella
AUSAI
2004
Springer
14 years 1 months ago
Longer-Term Memory in Clause Weighting Local Search for SAT
Abstract. This paper presents a comparative study between a state-ofthe-art clause weighting local search method for satisfiability testing and a variant modified to obtain longe...
Valnir Ferreira Jr., John Thornton
CP
2006
Springer
14 years 7 days ago
Differentiable Invariants
Abstract. Invariants that incrementally maintain the value of expresder assignments to their variables are a natural abstraction to build high-level local search algorithms. But th...
Pascal Van Hentenryck, Laurent Michel
CP
2007
Springer
14 years 2 months ago
Model-Driven Visualizations of Constraint-Based Local Search
Visualization is often invaluable to understand the behavior of optimization algorithms, identify their bottlenecks or pathological behaviors, and suggest remedial techniques. Yet ...
Grégoire Dooms, Pascal Van Hentenryck, Laur...
BMCBI
2006
178views more  BMCBI 2006»
13 years 8 months ago
MannDB - A microbial database of automated protein sequence analyses and evidence integration for protein characterization
Background: MannDB was created to meet a need for rapid, comprehensive automated protein sequence analyses to support selection of proteins suitable as targets for driving the dev...
Carol L. Ecale Zhou, Marisa Lam, Jason Smith, Adam...