3229 search results - page 120 / 646 » The Theory of Timed Automata |
190
click to vote
SIGSOFT
2008
ACM
15 years 6 months ago
2008
ACM
If an organization depends on the service quality provided by another organization it often enters into a bilateral service level agreement (SLA), which mitigates outsourcing risk...
190
click to vote
SACMAT
2009
ACM
16 years 28 days ago
2009
ACM
Many access control policy languages, e.g., XACML, allow a policy to contain multiple sub-policies, and the result of the policy on a request is determined by combining the result...
171
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
173
click to vote
MCU
2004
15 years 7 months ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
146
click to vote
ITNG
2007
IEEE
16 years 21 days ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...