846 search results - page 40 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
100
click to vote
ACSC
2006
IEEE
15 years 5 months ago
2006
IEEE
Trust networks consist of transitive trust relationships between people, organisations and software agents connected through a medium for communication and interaction. By formali...
WSC
2007
15 years 1 months ago
2007
Co-design modeling is considered key toward handling the complexity and scale of network systems. The ability to separately specify the software and hardware aspects of computer n...
PODS
2007
ACM
15 years 11 months ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
ICLP
1999
Springer
15 years 3 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
98
Voted
FCCM
2000
IEEE
15 years 3 months ago
2000
IEEE
Custom computing systems exhibit significant speedups over traditional microprocessors by mapping compute-intensive sections of a program to reconfigurable logic [Hauck98]. Howeve...