13841 search results - page 364 / 2769 » Algorithms and Constraint Programming |
167
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposi...
177
click to vote
COMSIS
2006
15 years 6 months ago
2006
Traditional knowledge representations were developed to encode complete, explicit and executable programs, a goal that makes them less than ideal for representing the incomplete an...
190
click to vote
EPIA
1993
Springer
15 years 11 months ago
1993
Springer
Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in...
163
click to vote
ESANN
2008
15 years 8 months ago
2008
This paper describes a new topological map dedicated to clustering under instance-level constraints. In general, traditional clustering is used in an unsupervised manner. However,...
289
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...