660 search results - page 19 / 132 » Hybrid CSP Solving |
NPL
2002
13 years 9 months ago
2002
A novel multistage feedforward network is proposed for efficient solving of difficult classification tasks. The standard Radial Basis Functions (RBF) architecture is modified in or...
Book
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
SARA
2007
Springer
14 years 4 months ago
2007
Springer
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
CP
2005
Springer
14 years 3 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
WLP
2004
Springer
14 years 3 months ago
2004
Springer
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...