12993 search results - page 2360 / 2599 » Artificial Intelligence in China |
79
Voted
CP
2007
Springer
15 years 7 months 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...
CP
2007
Springer
15 years 7 months 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...
CP
2007
Springer
15 years 7 months 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...
85
Voted
CP
2007
Springer
15 years 7 months 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...
70
Voted
CP
2007
Springer
15 years 7 months 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...