3731 search results - page 143 / 747 » cases 2006 |
184
click to vote
MSCS
2010
15 years 4 months ago
2010
ABSTRACT. In this note we prove that any Turing machine which uses only a finite computational space for every input cannot solve an uncomputable problem even in case it runs in a...
134
click to vote
NA
2010
15 years 4 months ago
2010
We propose a new O(n)-space implementation of the GKO-Cauchy algorithm for the solution of linear systems where the coefficient matrix is Cauchy-like. Moreover, this new algorithm...
188
click to vote
CNIS
2006
15 years 7 months ago
2006
Multidimensional Packet Classification is one of the most critical functions for network security devices such as firewalls and intrusion detection systems. Due to the worst case ...
174
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
189
click to vote
ENTCS
2006
15 years 6 months ago
2006
We consider the issue of exploiting the structural form of ESTEREL programs to partition the algorithmic RSS (reachable state space) fix-point construction used in model-checking t...