79 search results - page 11 / 16 » cp 2006 |
CP
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...
CP
2006
Springer
14 years 2 months ago
2006
Springer
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
CP
2006
Springer
14 years 2 months ago
2006
Springer
Interactive configuration is the concept of assisting a user in selecting values for parameters that respect given constraints. It was originally inspired by the product configurat...
CP
2006
Springer
14 years 2 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
IEEEARES
2006
IEEE
14 years 5 months ago
2006
IEEE
This paper extends the work described in “An Approach to the Formalisation of a Certification Policy”, 7th International Symposium on System and Information Security (SSI 2005...