7106 search results - page 85 / 1422 » Restricted Complexity, General Complexity |
COLING
1996
13 years 11 months ago
1996
Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algor...
DLT
2009
13 years 7 months ago
2009
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
AUTOMATICA
2002
13 years 10 months ago
2002
This paper considers the problem of designing a controller for an unknown plant based on input/output measurements. The new design method we propose is direct (no model identificat...
ICALP
2007
Springer
14 years 4 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
COMPLEXITY
2007
13 years 10 months ago
2007
Distributed computing systems are becoming bigger and more complex. While the complexity of large-scale distributed systems has been acknowledged to be an important challenge, the...