Sciweavers

714 search results - page 103 / 143
» Lexicographically-ordered constraint satisfaction problems
Sort
View
CP
2003
Springer
14 years 3 months ago
Improved Algorithms for Max-restricted Path Consistency
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
Fabrizio Grandoni, Giuseppe F. Italiano
AAAI
2006
13 years 11 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
SARA
2005
Springer
14 years 3 months ago
Approximate Model-Based Diagnosis Using Preference-Based Compilation
Abstract. This article introduces a technique for improving the efficiency of diagnosis through approximate compilation. We extend the approach of compiling a diagnostic model, as...
Gregory M. Provan
CEC
2005
IEEE
14 years 3 months ago
Complexity transitions in evolutionary algorithms: evaluating the impact of the initial population
Abstract- This paper proposes an evolutionary approach for the composition of solutions in an incremental way. The approach is based on the metaphor of transitions in complexity di...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
13 years 10 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang