Sciweavers

2412 search results - page 56 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
ESORICS
2009
Springer
14 years 10 months ago
Set Covering Problems in Role-Based Access Control
Abstract. Interest in role-based access control has generated considerable research activity in recent years. A number of interesting problems related to the well known set cover p...
Liang Chen, Jason Crampton
CP
2007
Springer
14 years 4 months ago
A Compression Algorithm for Large Arity Extensional Constraints
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
George Katsirelos, Toby Walsh
ASIACRYPT
2011
Springer
12 years 10 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer
WOTUG
2007
13 years 11 months ago
A Process-Oriented Architecture for Complex System Modelling
Abstract. A fine-grained massively-parallel process-oriented model of platelets (potentially artificial) within a blood vessel is presented. This is a CSP inspired design, expres...
Carl G. Ritson, Peter H. Welch
ATAL
2010
Springer
13 years 11 months ago
Parameterizing the winner determination problem for combinatorial auctions
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
David Loker, Kate Larson