13026 search results - page 2367 / 2606 » Creativity and Artificial Intelligence |
142
click to vote
CP
2007
Springer
16 years 27 days 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...
160
click to vote
CP
2007
Springer
16 years 27 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...
163
Voted
CP
2007
Springer
16 years 27 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...
171
click to vote
CP
2007
Springer
16 years 27 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...
149
Voted
CP
2007
Springer
16 years 27 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...