Sciweavers

8838 search results - page 1493 / 1768
» Generalizing Domain Theory
Sort
View
ATAL
2006
Springer
15 years 10 months ago
On the complexity of practical ATL model checking
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
Wiebe van der Hoek, Alessio Lomuscio, Michael Wool...
CCS
2006
ACM
15 years 10 months ago
Resiliency policies in access control
We introduce the notion of resiliency policies in the context of access control systems. Such policies require an access control system to be resilient to the absence of users. An...
Ninghui Li, Mahesh V. Tripunitara, Qihua Wang
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
15 years 10 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 10 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
ATAL
2008
Springer
15 years 8 months ago
Undominated VCG redistribution mechanisms
Many important problems in multiagent systems can be seen as resource allocation problems. For such problems, the well-known Vickrey-Clarke-Groves (VCG) mechanism is efficient, in...
Mingyu Guo, Vincent Conitzer
« Prev « First page 1493 / 1768 Last » Next »