32 search results - page 2 / 7 » Geometric constraint solving via C-tree decomposition |
CSCLP
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
SMA
2005
ACM
13 years 11 months ago
2005
ACM
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
ICCV
2003
IEEE
14 years 7 months ago
2003
IEEE
We present a new approach to 3D scene modeling based on geometric constraints. Contrary to the existing methods, we can quickly obtain 3D scene models that respect the given const...
SMA
2005
ACM
13 years 11 months ago
2005
ACM
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...
CP
2005
Springer
13 years 11 months ago
2005
Springer
This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constra...