Sciweavers

283 search results - page 50 / 57
» Local Search in Histogram Construction
Sort
View
103
Voted
SAT
2010
Springer
158views Hardware» more  SAT 2010»
15 years 3 months ago
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
Dave A. D. Tompkins, Holger H. Hoos
ECML
2007
Springer
15 years 1 months ago
Sequence Labeling with Reinforcement Learning and Ranking Algorithms
Many problems in areas such as Natural Language Processing, Information Retrieval, or Bioinformatic involve the generic task of sequence labeling. In many cases, the aim is to assi...
Francis Maes, Ludovic Denoyer, Patrick Gallinari
AAAI
2004
15 years 1 months ago
Additive versus Multiplicative Clause Weighting for SAT
This paper examines the relative performance of additive and multiplicative clause weighting schemes for propositional satisfiability testing. Starting with one of the most recent...
John Thornton, Duc Nghia Pham, Stuart Bain, Valnir...
CCCG
2004
15 years 1 months ago
Computing the set of all distant horizons of a terrain
We study the problem of computing the set of all distant horizons of a terrain, represented as either: the set of all edges that appear in the set of all distant horizons; the con...
William S. Evans, Daniel Archambault, David G. Kir...
COR
2010
155views more  COR 2010»
14 years 11 months ago
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because o...
Jorge E. Mendoza, Bruno Castanier, Christelle Gu&e...