1300 search results - page 90 / 260 » Constraint satisfaction problems and global cardinality cons... |
AIPS
2009
14 years 11 months ago
2009
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
CSCLP
2004
Springer
15 years 1 months ago
2004
Springer
Covering arrays have been studied for their applications to drug screening and software and hardware testing. In this paper, we model the problem as a constraint program. Our propo...
101
Voted
ANOR
2011
14 years 5 months ago
2011
Abstract. Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization te...
112
click to vote
TNN
2010
14 years 4 months ago
2010
Abstract--Recurrent neural networks have become a prominent tool for optimizations including linear or nonlinear variational inequalities and programming, due to its regular mathem...
AAAI
1997
14 years 11 months ago
1997
Constraint satisfaction research has focussed on consistency checking using k-consistency and its variations such as arc-consistency, and path-consistency. We define a new form of...