Sciweavers

2725 search results - page 126 / 545
» Constraint Solving for Interpolation
Sort
View
SMA
2005
ACM
151views Solid Modeling» more  SMA 2005»
15 years 9 months ago
A constructive approach to calculate parameter ranges for systems of geometric constraints
Geometric constraints are at the heart of parametric and feature-based CAD systems. Changing values of geometric constraint parameters is one of the most common operations in such...
Hilderick A. van der Meiden, Willem F. Bronsvoort
BPM
2006
Springer
115views Business» more  BPM 2006»
15 years 7 months ago
Modeling, Matching and Ranking Services Based on Constraint Hardness
A framework for modeling Semantic Web Service is proposed. It is based on Description Logic (DL), hence it is endowed with a formal semantics and, in addition, it allows for expres...
Claudia d'Amato, Steffen Staab
IJCAI
1997
15 years 5 months ago
Computational Complexity of Multi-way, Dataflow Constraint Problems
Although it is acknowledged that multi-way dataflow constraints are useful in interactive applications, concerns about their tractability have hindered their acceptance. Certain l...
Gilles Trombettoni, Bertrand Neveu
COR
2006
98views more  COR 2006»
15 years 4 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
IPL
2007
71views more  IPL 2007»
15 years 3 months ago
Relaxations of semiring constraint satisfaction problems
Abstract. The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. In this framework ...
Louise Leenen, Thomas Andreas Meyer, Aditya Ghose