13090 search results - page 2382 / 2618 » Usable artificial intelligence |
156
click to vote
CP
2007
Springer
16 years 23 days ago
2007
Springer
Shaving and constructive disjunction are two main refutation principles used in constraint programming. The shaving principle allows us to compute the singleton arc-consistency (SA...
158
click to vote
CP
2007
Springer
16 years 23 days ago
2007
Springer
: This report introduces a geometrical constraint kernel for handling the location in space and time of polymorphic k-dimensional objects subject to various geometrical and time co...
168
click to vote
CP
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. The SEQUENCE constraint is useful in modelling car sequencing, rostering, scheduling and related problems. We introduce half a dozen new encodings of the SEQUENCE constra...
147
click to vote
CP
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
127
click to vote
CP
2007
Springer
16 years 23 days ago
2007
Springer
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...