1418 search results - page 114 / 284 » The Dynamic Complexity of Formal Languages |
121
click to vote
APN
2005
Springer
15 years 10 months ago
2005
Springer
Current modeling techniques are not well equipped to design dynamic software architectures. In this work we present the basic concepts for a dynamic architecture modeling using net...
141
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
150
click to vote
IJCAI
1993
15 years 5 months ago
1993
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
141
click to vote
DAC
2008
ACM
16 years 5 months ago
2008
ACM
C++ based verification methodologies are now emerging as the preferred method for SOC design. However most of the verification involving the C++ models are simulation based. The c...
146
click to vote
PVLDB
2010
15 years 2 months ago
2010
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...