1071 search results - page 49 / 215 » Theories of Automatic Structures and Their Complexity |
APN
2008
Springer
14 years 11 months ago
2008
Springer
Shared decision diagram representations of a state-space have been shown to provide efficient solutions for model-checking of large systems. However, decision diagram manipulation ...
102
click to vote
AUTOMATICA
2008
14 years 9 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
78
Voted
MOBIHOC
2009
ACM
15 years 10 months ago
2009
ACM
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
POPL
1996
ACM
15 years 1 months ago
1996
ACM
Module systems are a powerful, practical tool for managing the complexity of large software systems. Previous attempts to formulate a type-theoretic foundation for modular program...
HICSS
2000
IEEE
15 years 2 months ago
2000
IEEE
In this paper we claim the importance of a cognitive view of trust (its articulate, analytic and founded view), in contrast with a mere quantitative and opaque view of trust suppo...