185 search results - page 34 / 37 » Parameterized Complexity of Constraint Satisfaction Problems |
101
click to vote
EDOC
2007
IEEE
15 years 1 months ago
2007
IEEE
The decentralized process of configuring enterprise applications is complex and error-prone, involving multiple participants/roles and numerous configuration changes across multipl...
ESORICS
2007
Springer
15 years 1 months ago
2007
Springer
We propose the role-and-relation-based access control (R2 BAC) model for workflow systems. In R2 BAC, in addition to a user's role memberships, the user's relationships w...
ICCAD
2004
IEEE
15 years 6 months ago
2004
IEEE
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
SCP
1998
14 years 9 months ago
1998
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...