5904 search results - page 986 / 1181 » Requirements for a Composition Language |
CAISE
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The increasing need for device independence and personalization forces organizations to automatically adapt their Web Information Systems (WISs) to individual users and t...
CP
2005
Springer
14 years 3 months ago
2005
Springer
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...
CP
2005
Springer
14 years 3 months ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
CP
2005
Springer
14 years 3 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
CP
2005
Springer
14 years 3 months ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...