284 search results - page 29 / 57 » Modularity of Completeness Revisited |
196
click to vote
JAIR
2010
15 years 6 months ago
2010
As historically acknowledged in the Reasoning about Actions and Change community, intuitiveness of a logical domain description cannot be fully automated. Moreover, like any other...
184
click to vote
DATE
2006
IEEE
16 years 1 months ago
2006
IEEE
Using additional store-checkpoinsts (SCPs) and compare-checkpoints (CCPs), we present an adaptive checkpointing for double modular redundancy (DMR) in this paper. The proposed app...
212
click to vote
LICS
2005
IEEE
16 years 1 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
196
click to vote
CIC
2004
15 years 9 months ago
2004
Interconnection architectures range from complete networks, that have a diameter of D = 1 but are impractical except when the number n of nodes is small, to low-cost, minimally co...
179
click to vote
CSR
2007
Springer
16 years 1 months ago
2007
Springer
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...