846 search results - page 103 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
209
click to vote
PPDP
2010
Springer
15 years 4 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
155
click to vote
SOFSEM
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. The increasing complexity of today’s embedded systems applications imposes the requirements and constraints of distributed, heterogeneous subsystem interaction to softw...
147
click to vote
ICS
2004
Tsinghua U.
15 years 11 months ago
2004
Tsinghua U.
The growing dominance of wire delays at future technology points renders a microprocessor communication-bound. Clustered microarchitectures allow most dependence chains to execute...
144
click to vote
APCSAC
2004
IEEE
15 years 10 months ago
2004
IEEE
In the context of general-purpose processing, an increasing number of diverse functional units are added to cover a wide spectrum of applications. However, it is still possible to ...
172
click to vote
IANDC
2006
15 years 6 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...