Sciweavers

1142 search results - page 39 / 229
» Set Variables and Local Search
Sort
View
JAIR
2000
123views more  JAIR 2000»
13 years 9 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill
BMCBI
2010
116views more  BMCBI 2010»
13 years 10 months ago
A hybrid approach to protein folding problem integrating constraint programming with local search
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel
ICDM
2007
IEEE
116views Data Mining» more  ICDM 2007»
14 years 4 months ago
Cross-Mining Binary and Numerical Attributes
We consider the problem of relating itemsets mined on binary attributes of a data set to numerical attributes of the same data. An example is biogeographical data, where the numer...
Gemma C. Garriga, Hannes Heikinheimo, Jouni K. Sep...
ESANN
2004
13 years 11 months ago
Dimensionality reduction and classification using the distribution mapping exponent
: Probability distribution mapping function, which maps multivariate data distribution to the function of one variable, is introduced. Distributionmapping exponent (DME) is somethi...
Marcel Jirina
EOR
2007
111views more  EOR 2007»
13 years 10 months ago
Linear programming based algorithms for preemptive and non-preemptive RCPSP
: In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable i...
Jean Damay, Alain Quilliot, Eric Sanlaville