284 search results - page 29 / 57 » Modularity of Completeness Revisited |
JAIR
2010
13 years 8 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...
DATE
2006
IEEE
14 years 3 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...
LICS
2005
IEEE
14 years 3 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...
CIC
2004
13 years 11 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...
CSR
2007
Springer
14 years 4 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...