419 search results - page 79 / 84 » An LP-Designed Algorithm for Constraint Satisfaction |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified for conservative problems (or, equivalently, for list homomorphism problems) by Andrei Bulatov. An ...
IFIP12
2009
13 years 6 months ago
2009
Abstract Intelligent calendar assistants have many years ago attracted researchers from the areas of scheduling, machine learning and human computer interaction. However, all effor...
CORR
2011
Springer
13 years 5 days ago
2011
Springer
We present a unifying approach to the efficient evaluation of propositional answer-set programs. Our approach is based on backdoors which are small sets of atoms that represent ...
UAI
1997
13 years 9 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
ISDA
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--In business analysis, models are sometimes oversimplified. We pragmatically approach many problems with a single financial objective and include monetary values for non-m...