10585 search results - page 1937 / 2117 » The Orc Programming Language |
112
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...
107
Voted
CP
2007
Springer
15 years 10 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...
111
click to vote
CP
2007
Springer
15 years 10 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...
117
Voted
CP
2007
Springer
15 years 10 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...
CP
2007
Springer
15 years 10 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...