Sciweavers

73 search results - page 8 / 15
» A Landscape Analysis of Constraint Satisfaction Problems
Sort
View
AUSAI
2007
Springer
15 years 1 months ago
Branching Rules for Satisfiability Analysed with Factor Analysis
Factor analysis is a statistical technique for reducing the number of factors responsible for a matrix of correlations to a smaller number of factors that may reflect underlying va...
Richard J. Wallace, Stuart Bain
NAACL
2003
14 years 11 months ago
Language choice models for microplanning and readability
This paper describes the construction of language choice models for the microplanning of discourse relations in a Natural Language Generation system that attempts to generate appr...
Sandra Williams
CP
2009
Springer
15 years 10 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný
DISOPT
2007
155views more  DISOPT 2007»
14 years 9 months ago
Linear-programming design and analysis of fast algorithms for Max 2-CSP
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
Alexander D. Scott, Gregory B. Sorkin
BVAI
2007
Springer
15 years 4 months ago
Classification with Positive and Negative Equivalence Constraints: Theory, Computation and Human Experiments
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
Rubi Hammer, Tomer Hertz, Shaul Hochstein, Daphna ...