846 search results - page 131 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
103
click to vote
INFORMS
1998
14 years 10 months ago
1998
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...
127
click to vote
AI
2011
Springer
14 years 6 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
117
click to vote
SIAMCOMP
2012
13 years 1 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
168
click to vote
ASPLOS
2009
ACM
15 years 11 months ago
2009
ACM
Even though graphics processors (GPUs) are becoming increasingly popular for general purpose computing, current (and likely near future) generations of GPUs do not provide hardwar...
100
click to vote
FSTTCS
2008
Springer
15 years 5 days ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...