Sciweavers

2233 search results - page 3 / 447
» On the Complexity of Theory Curbing
Sort
View
ENTCS
2011
131views more  ENTCS 2011»
13 years 19 days ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computation...
Ed Blakey
FROCOS
2007
Springer
13 years 11 months ago
Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions
Abstract. We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call...
Viorica Sofronie-Stokkermans
AAAI
2012
11 years 8 months ago
The Complexity of Planning Revisited - A Parameterized Analysis
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...
Christer Bäckström, Yue Chen, Peter Jons...
DAC
2010
ACM
13 years 9 months ago
Networks on Chips: from research to products
Research on Networks on Chips (NoCs) has spanned over a decade and its results are now visible in some products. Thus the seminal idea of using networking technology to address th...
Giovanni De Micheli, Ciprian Seiculescu, Srinivasa...