Sciweavers

293 search results - page 12 / 59
» New results on optimizing rooted triplets consistency
Sort
View
SAT
2010
Springer
174views Hardware» more  SAT 2010»
13 years 5 months ago
A System for Solving Constraint Satisfaction Problems with SMT
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
Miquel Bofill, Josep Suy, Mateu Villaret
CDC
2008
IEEE
134views Control Systems» more  CDC 2008»
14 years 2 months ago
Feedback solutions of optimal control problems with DAE constraints
An optimal feedback control has been obtained for linear-quadratic optimal control problems with constraints described by differential-algebraic equations. For that purpose, a ne...
Galina A. Kurina, Roswitha März
IJCAI
2001
13 years 9 months ago
Making AC-3 an Optimal Algorithm
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically ef...
Yuanlin Zhang, Roland H. C. Yap
ECAI
2010
Springer
13 years 7 months ago
Knowledge Compilation Using Interval Automata and Applications to Planning
Knowledge compilation [6, 5, 14, 8] consists in transforming a problem offline into a form which is tractable online. In this paper, we introduce new structures, based on the notio...
Alexandre Niveau, Hélène Fargier, C&...
COMPGEOM
2006
ACM
13 years 9 months ago
On the ICP algorithm
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
Esther Ezra, Micha Sharir, Alon Efrat