Sciweavers

365 search results - page 4 / 73
» Numerical Solving of Geometric Constraints
Sort
View
SAC
2008
ACM
13 years 7 months ago
A constraint hierarchies approach to geometric constraints on sketches
We propose an approach that uses preferences on the constraints in order to deal with over-constrained geometric constraint problems. This approach employs constraint hierarchies,...
Christophe Jermann, Hiroshi Hosobe
IJCGA
2006
79views more  IJCGA 2006»
13 years 8 months ago
Well-constrained Completion and Decomposition for under-constrained Geometric Constraint Problems
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...
Gui-Fang Zhang, Xiao-Shan Gao
ICAL
2011
301views more  ICAL 2011»
12 years 7 months ago
On the LVI-based numerical method (E47 algorithm) for solving quadratic programming problems
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
Yunong Zhang, Senbo Fu, Zhijun Zhang, Lin Xiao, Xu...
ECAI
2000
Springer
14 years 11 days ago
Extensions of Constraint Solving for Proof Planning
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning benefits from the general functionalities of a constraint solver s...
Erica Melis, Jürgen Zimmer, Tobias Mülle...
CIRA
2007
IEEE
136views Robotics» more  CIRA 2007»
14 years 2 months ago
Algebraic interval constraint driven exploration in human-agent collaborative problem solving
—To enable effective human-agent collaboration, new human-centric computing paradigms are needed. This paper presents a soft constraint representation scheme based on generalized...
Yan Wang