697 search results - page 84 / 140 » On the Theory of Average Case Complexity |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The study of factoring relations between subshifts or cellular automata is central in symbolic dynamics. Besides, a notion of intrinsic universality for cellular automata based on ...
CASES
2010
ACM
13 years 6 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Traditional communication theory focuses on minimizing transmit power. However, communication links are increasingly operating at shorter ranges where transmit power can be signif...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...
JMLR
2010
13 years 2 months ago
2010
The problem of characterizing learnability is the most basic question of statistical learning theory. A fundamental and long-standing answer, at least for the case of supervised c...