76 search results - page 9 / 16 » Extending to Soft and Preference Constraints a Framework for... |
EAAI
2008
13 years 7 months ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
CSCLP
2004
Springer
14 years 24 days ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
MICCAI
2007
Springer
14 years 8 months ago
2007
Springer
Accurately describing interactions between medical devices and anatomical structures, or between anatomical structures themselves, is an essential step towards the adoption of comp...
ICCV
2009
IEEE
15 years 11 days ago
2009
IEEE
Clustering performance can often be greatly improved by
leveraging side information. In this paper, we consider constrained
clustering with pairwise constraints, which specify
s...
GMP
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract. We present an efficient and robust algorithm for computing continuous visibility for two- or three-dimensional shapes whose boundaries are NURBS curves or surfaces by li...