196 search results - page 3 / 40 » A finite set of functions with an EXPTIME-complete compositi... |
CONSTRAINTS
2007
13 years 9 months ago
2007
In this paper we present Cardinal, a general finite sets constraint solver just made publicly available in ECLiPSe Prolog, suitable for combinatorial problem solving by exploiting ...
JSYML
2000
13 years 9 months ago
2000
It is consistent that there is a set mapping from the four-tuples of n into the finite subsets with no free subsets of size tn for some natural number tn. For any n < it is con...
INFORMATICALT
2002
13 years 9 months ago
2002
The new strategy for non-uniform initial FE mesh generation is presented in this paper. The main focus is set to a priori procedures that define the sizing function independent on ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
ECCV
2004
Springer
14 years 11 months ago
2004
Springer
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...