63 search results - page 8 / 13 » cp 2004 |
CP
2004
Springer
15 years 3 months ago
2004
Springer
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
CP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We present a cooperation technique using an accurate management of nogoods to solve a hard real-time problem which consists in assigning periodic tasks to processors in t...
CP
2004
Springer
15 years 3 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
CPAIOR
2004
Springer
15 years 3 months ago
2004
Springer
We describe using Case Based Reasoning to explore structure at the instance level as a means to distinguish whether to use CP or IP to solve instances of the Bid Evaluation Problem...
SPAA
2004
ACM
15 years 3 months ago
2004
ACM
We compare the number of cache misses M1 for running a computation on a single processor with cache size C1 to the total number of misses Mp for the same computation when using p ...