4117 search results - page 183 / 824 » On the Satisfiability of Complex Constraints |
188
click to vote
CP
2005
Springer
16 years 3 days ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
227
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
173
click to vote
CP
1999
Springer
15 years 10 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
165
click to vote
PUK
2000
15 years 8 months ago
2000
In a real planning problem, there exists a set of constraints (both temporal constraints and resource usage constraints) which must be satisfied in order to obtain a feasible plan....
205
click to vote
WEBI
2010
Springer
15 years 4 months ago
2010
Springer
High-dimensional data usually incur learning deficiencies and computational difficulties. We present a novel semi-supervised dimensionality reduction technique that embeds high-dim...