16666 search results - page 2689 / 3334 » Descriptive and Computational Complexity |
315
click to vote
STOC
1993
ACM
15 years 11 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
193
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 ...
211
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...
245
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...
194
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...