36 search results - page 7 / 8 » Using Inferred Disjunctive Constraints To Decompose Constrai... |
SARA
2005
Springer
13 years 10 months ago
2005
Springer
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...
CONEXT
2010
ACM
13 years 3 months ago
2010
ACM
Traditional DSL troubleshooting solutions are reactive, relying mainly on customers to report problems, and tend to be labor-intensive, time consuming, prone to incorrect resoluti...
AI
2005
Springer
13 years 5 months ago
2005
Springer
Because of privacy concerns, agents may not want to reveal information that could be of use in problem solving. As a result, there are potentially important tradeoffs between main...
IJCAI
2007
13 years 6 months ago
2007
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de ...
CPAIOR
2010
Springer
13 years 3 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...