2957 search results - page 142 / 592 » The Complexity of Polynomial-Time Approximation |
129
click to vote
CATS
2008
15 years 6 months ago
2008
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
152
click to vote
AAAI
2006
15 years 6 months ago
2006
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
177
Voted
AI
2010
Springer
15 years 5 months ago
2010
Springer
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
250
click to vote
FOSSACS
2011
Springer
14 years 8 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
126
click to vote
FUIN
2006
15 years 5 months ago
2006
This paper considers the problem of how to establish calculi of approximation spaces. Approximation spaces considered in the context of rough sets were introduced by Zdzislaw Pawla...