2181 search results - page 149 / 437 » The restriction scaffold problem |
100
Voted
STOC
2005
ACM
16 years 1 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
76
Voted
STOC
2005
ACM
16 years 1 months ago
2005
ACM
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...
88
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We define stochastic timed games, which extend two-player timed games with probabilities (following a recent approach by Baier et al), and which extend in a natural way continuous-...
86
Voted
PODS
2004
ACM
16 years 27 days ago
2004
ACM
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
104
Voted
SAC
2010
ACM
15 years 7 months ago
2010
ACM
Complex organizations need to establish access control policies in order to manage access to restricted resources. Role Based Access Control paradigm has been introduced in ’90 ...