Sciweavers

106 search results - page 18 / 22
» Weighted Constraint Satisfaction with Set Variables
Sort
View
ECAI
2004
Springer
13 years 11 months ago
Encoding Quantified CSPs as Quantified Boolean Formulae
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
SPLC
2008
13 years 9 months ago
Automated Diagnosis of Product-Line Configuration Errors in Feature Models
Feature models are widely used to model software product-line (SPL) variability. SPL variants are configured by selecting feature sets that satisfy feature model constraints. Conf...
Jules White, Douglas C. Schmidt, David Benavides, ...
CHI
2005
ACM
14 years 8 months ago
A method to standardize usability metrics into a single score
Current methods to represent system or task usability in a single metric do not include all the ANSI and ISO defined usability aspects: effectiveness, efficiency & satisfactio...
Jeff Sauro, Erika Kindlund
AAAI
2006
13 years 9 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
CPC
2006
110views more  CPC 2006»
13 years 7 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin