1051 search results - page 71 / 211 » Foundations of Constraint Satisfaction |
MMMACNS
2005
Springer
14 years 3 months ago
2005
Springer
A new model for representing temporal access control policies is introduced. In this model, temporal authorizations are represented by time attributes associated with both subjects...
POPL
1992
ACM
14 years 2 months ago
1992
ACM
Jade is a language designed to support coarse-grain parallelism on both shared and distributed addressspace machines. Jade is data-oriented: a Jade programmer simply augments a se...
TACAS
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
CP
2009
Springer
14 years 5 months ago
2009
Springer
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
SARA
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...