669 search results - page 14 / 134 » New Constraint Programming Approaches for the Computation of... |
CP
2004
Springer
14 years 23 days 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...
IV
2003
IEEE
14 years 19 days ago
2003
IEEE
In this paper, we present a new framework for the use of Virtual Reality (VR) in engineering design for configuration applications. Traditional VR systems support the visual explo...
IEEEPACT
2002
IEEE
14 years 9 days ago
2002
IEEE
Java exception checks are designed to ensure that any faulting instruction causing a hardware exception does not terminate the program abnormally. These checks, however, impose so...
CP
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. Existing constraint programming systems offer a fixed set of inference engines implementing search strategies such as single, all, and best solution search. This is unfo...
CP
2003
Springer
14 years 18 days ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...