Sciweavers

72 search results - page 11 / 15
» Colour Naming considering the Colour Variability Problem
Sort
View
TSP
2010
13 years 2 months ago
Gaussian multiresolution models: exploiting sparse Markov and covariance structure
We consider the problem of learning Gaussian multiresolution (MR) models in which data are only available at the finest scale and the coarser, hidden variables serve both to captu...
Myung Jin Choi, Venkat Chandrasekaran, Alan S. Wil...
CP
2009
Springer
14 years 8 months ago
Constraints of Difference and Equality: A Complete Taxonomic Characterisation
Abstract. Many combinatorial problems encountered in practice involve constraints that require that a set of variables take distinct or equal values. The AllDifferent constraint, i...
Emmanuel Hebrard, Dániel Marx, Barry O'Sull...
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 6 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
CORR
2006
Springer
135views Education» more  CORR 2006»
13 years 8 months ago
Classification of Ordinal Data
Many real life problems require the classification of items into naturally ordered classes. These problems are traditionally handled by conventional methods intended for the class...
Jaime S. Cardoso
CEC
2007
IEEE
13 years 12 months ago
Fitness diversity based adaptation in Multimeme Algorithms: A comparative study
Abstract-- This paper compares three different fitness diversity adaptations in Multimeme Algorithms (MmAs). These diversity indexes have been integrated within a MmA present in li...
Ferrante Neri, Ville Tirronen, Tommi Kärkk&au...