3229 search results - page 565 / 646 » Theories with the Independence Property |
177
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
175
click to vote
CCS
2006
ACM
15 years 10 months ago
2006
ACM
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...
243
click to vote
EMSOFT
2006
Springer
15 years 10 months ago
2006
Springer
Distributed real-time systems require a predictable and verifiable mechanism to control the communication medium. Current real-time communication protocols are typically independe...
174
click to vote
SWAT
2000
Springer
15 years 10 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
167
click to vote
ATAL
2009
Springer
15 years 9 months ago
2009
Springer
Many real-world applications of multiagent systems require independently designed (heterogeneous) and operated (autonomous) agents to interoperate. We consider agents who offer bu...