Sciweavers

881 search results - page 69 / 177
» Solving satisfiability problems with preferences
Sort
View
CG
2011
Springer
13 years 11 days ago
A projected back-tracking line-search for constrained interactive inverse kinematics
Inverse kinematics is the problem of manipulating the pose of an articulated figure in order to achieve a desired goal disregarding inertia and forces. One can approach the probl...
Morten Engell-Nørregård, Kenny Erlebe...
IJCAI
1989
13 years 10 months ago
An Approximate Solver for Symbolic Equations
This paper describes a program, called NEWTON, that finds approximate symbolic solutions to parameterized equations in one variable. N E W T O N derives an initial approximation b...
Elisha Sacks
CDC
2008
IEEE
117views Control Systems» more  CDC 2008»
14 years 3 months ago
Simulation-aided reachability and local gain analysis for nonlinear dynamical systems
Abstract— We analyze reachability properties and local input/output gains of systems with polynomial vector fields. Upper bounds for the reachable set and nonlinear system gains...
Weehong Tan, Ufuk Topcu, Peter Seiler, Gary J. Bal...
CADE
2010
Springer
13 years 10 months ago
MCMT: A Model Checker Modulo Theories
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
Silvio Ghilardi, Silvio Ranise
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
13 years 6 months ago
Reduction of interpolants for logic synthesis
Craig Interpolation is a state-of-the-art technique for logic synthesis and verification, based on Boolean Satisfiability (SAT). Leveraging the efficacy of SAT algorithms, Craig In...
John D. Backes, Marc D. Riedel