14774 search results - page 2660 / 2955 » Computational complexity and evolutionary computation |
196
click to vote
ASPDAC
2007
ACM
15 years 11 months ago
2007
ACM
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
212
click to vote
ESORICS
2007
Springer
15 years 11 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...
246
click to vote
ASPLOS
2006
ACM
15 years 11 months ago
2006
ACM
This paper proposes new network interface controller (NIC) designs that take advantage of integration with the host CPU to provide increased flexibility for operating system kerne...
196
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
223
click to vote
CAISE
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We discuss a case study for the hospital scenario where workflow model components are distributed across various computers or devices (e.g. mobile phones, PDAs, sensors, ...