2273 search results - page 281 / 455 » On the Expressiveness and Complexity of ATL |
352
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
179
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
180
click to vote
CASES
2009
ACM
16 years 29 days ago
2009
ACM
Embedded processors have become increasingly complex, resulting in variable execution behavior and reduced timing predictability. On such processors, safe timing specifications e...
164
click to vote
MOBICOM
2005
ACM
16 years 20 hour ago
2005
ACM
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
179
click to vote
SG
2005
Springer
15 years 12 months ago
2005
Springer
Parametric design systems model a design as a constrained collection of schemata. Designers work in such systems at two levels: definition of schemata and constraints; and search w...