Sciweavers

185 search results - page 34 / 37
» Parameterized Complexity of Constraint Satisfaction Problems
Sort
View
EDOC
2007
IEEE
13 years 11 months ago
Automated Model-Based Configuration of Enterprise Java Applications
The decentralized process of configuring enterprise applications is complex and error-prone, involving multiple participants/roles and numerous configuration changes across multipl...
Jules White, Douglas C. Schmidt, Krzysztof Czarnec...
ESORICS
2007
Springer
13 years 11 months ago
Satisfiability and Resiliency in Workflow Systems
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...
Qihua Wang, Ninghui Li
ICCAD
2004
IEEE
125views Hardware» more  ICCAD 2004»
14 years 4 months ago
Temporal floorplanning using the T-tree formulation
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 ...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang
ATAL
2006
Springer
13 years 11 months ago
Examining DCSP coordination tradeoffs
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Michael Benisch, Norman M. Sadeh
SCP
1998
107views more  SCP 1998»
13 years 7 months ago
A Distributed Arc-Consistency Algorithm
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...
T. Nguyen, Yves Deville