13306 search results - page 375 / 2662 » Theoretical Computer Science |
148
click to vote
MFCS
1998
Springer
15 years 10 months ago
1998
Springer
One-way cellular automata with restricted nondeterminism are investigated. The number of allowed nondeterministic state transitions is limited to a constant. It is shown that a lim...
160
click to vote
STACS
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. A solid object in 3-dimensional space may be described by a collection of all its topologically distinct 2-dimensional appearances, its aspect graph. In this paper, we st...
217
click to vote
RTA
1991
Springer
15 years 10 months ago
1991
Springer
Narrowing provides a complete procedure to solve equations modulo confluent and terminating rewriting systems. But it seldom terminates. This paper presents a method to improve th...
196
Voted
STACS
1991
Springer
15 years 10 months ago
1991
Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
174
click to vote
ACMSE
2008
ACM
15 years 8 months ago
2008
ACM
Numerical solution of any large, three-dimensional fluid flow problem is a computationally intensive task that typically requires supercomputer solution to achieve reasonable exec...