4940 search results - page 149 / 988 » On the Complexity of Universal Programs |
124
click to vote
FPL
2004
Springer
15 years 10 months ago
2004
Springer
Complex SoC and platform-based designs require integration of configurable IP cores from multiple sources. Even automatic compilation flows from a high-level description to HW/SW s...
149
click to vote
ICALP
2004
Springer
15 years 10 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
160
click to vote
IFIP
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
161
Voted
FUIN
2010
15 years 2 months ago
2010
Abstract. Developing a good formalism and an efficient decision procedure for the instance checking problem is desirable for practical application of description logics. The data c...
128
Voted
CACM
2006
15 years 5 months ago
2006
ional thinking is using abstraction and decomposition when attacking a large complex task or designing a large complex system. It is separation of concerns. It is choosing an appro...