Sciweavers

54 search results - page 5 / 11
» Solving First-Order Constraints in the Theory of the Evaluat...
Sort
View
CPAIOR
2008
Springer
13 years 9 months ago
Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
Tino Teige, Martin Fränzle
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 7 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
AAAI
1996
13 years 8 months ago
Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving comm...
Subbarao Kambhampati
IJCV
2006
94views more  IJCV 2006»
13 years 7 months ago
Four Points in Two or Three Calibrated Views: Theory and Practice
Suppose two perspective views of four world points are given and that the intrinsic parameters are known but the camera poses and the world point positions are not. We prove that t...
David Nistér, Frederik Schaffalitzky
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 7 months ago
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...
Thanasis Balafoutis, Kostas Stergiou