Sciweavers

1968 search results - page 254 / 394
» The Complexity of Valued Constraint Models
Sort
View
ESORICS
2007
Springer
15 years 1 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
JFP
2000
91views more  JFP 2000»
14 years 9 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren
ISSRE
2010
IEEE
14 years 8 months ago
Characterizing Failures in Mobile OSes: A Case Study with Android and Symbian
Abstract—As smart phones grow in popularity, manufacturers are in a race to pack an increasingly rich set of features into these tiny devices. This brings additional complexity i...
Amiya Kumar Maji, Kangli Hao, Salmin Sultana, Saur...
SIAMCOMP
2012
13 years 13 days ago
Randomized Competitive Algorithms for Generalized Caching
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
EDBT
2008
ACM
111views Database» more  EDBT 2008»
15 years 10 months ago
Schema polynomials and applications
Conceptual complexity is emerging as a new bottleneck as data-base developers, application developers, and database administrators struggle to design and comprehend large, complex...
Kenneth A. Ross, Julia Stoyanovich