Results 231 to 240 of about 23,253 (274)

Systematic recursion removal

Communications of the ACM, 1978
The recursion removal algorithm presented by Strong and Walker is amplified and applied to a relatively complex PL/I program. The aim is to demonstrate systematic recursion-removal techniques on something more complex than Knuth's “sturdy toddler” and to
H R Strong
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Recursive Filtering*

Statistica Neerlandica, 1978
AbstractThe purpose of this paper is to give an exposition of the theory behind the Kalman filter and its application to the so‐called LQG‐problem. This problem is concerned with the stochastic optimal control of a linear system with respect to a quadratic cost in the presence Gaussian disturbances.
openaire   +2 more sources

Recursion versus non-recursion in Pascal: recursion can be faster

ACM SIGPLAN Notices, 1987
A timing study of two Pascal programs on three machines provides some evidence that, for modern machines and compilers, the cost of removing recursion in non-trivial situations can sometimes be greater than the cost of the recursive procedure calls.
openaire   +1 more source

Recursion flattening

Proceedings of the 18th ACM Great Lakes symposium on VLSI, 2008
High-level synthesis tools automatically generate custom hardware circuits from high-level languages, including popular programming languages like standard ANSI C, but are unable to handle recursive functions. The convenience of recursive algorithms has made recursion a widespread programming practice, therefore limiting the applicability of high-level
Greg Stitt, Jason R. Villarreal
openaire   +1 more source

Recursive Boolean algebras with recursive atoms

Journal of Symbolic Logic, 1981
A Boolean algebra (henceforth abbreviated B.A.) is said to be recursive if B is a recursive subset of the natural numbers N and the operations ∧ (meet), ∨ (join), and ¬ (complement) are partial recursive. Let denote the set of atoms of and denote the ideal generated by the atoms of .
openaire   +2 more sources

Recursive Colorings of Highly Recursive Graphs

Canadian Journal of Mathematics, 1981
One of the attractions of finite combinatorics is its explicit constructions. This paper is part of a program to enlarge the domain of finite combinatorics to certain infinite structures while preserving the explicit constructions of the smaller domain. The larger domain to be considered consists of the recursive structures.
openaire   +2 more sources

Recursive Enumerability and Recursivity

1993
Abstract Having proved that Peano Arithmetic is incomplete, we can ask another question about the system. Is there any algorithm (mechanical procedure) by which we can determine which sentences are provable in the system and which are not? This brings us to the subject of recursive function theory, to which we now turn.
openaire   +1 more source

A Difference in Complexity Between Recursion and Tail Recursion

Theory of Computing Systems, 2016
Two types of recursive programs over abstract structures are considered in this paper -- the most general recursive programs and tail recursive programs (which are equivalent to iterative programs). There are structures over which these two types determine one and the same class of computable functions. However, is the price of the computations one and
openaire   +2 more sources

On a recursive sequence

Kybernetes, 2007
PurposeThe aim in this paper is to investigate the dynamics of difference equation yn+1=(pyn+yn−k)/(qyn+yn−k), n=0,1,2,… where k∈{1,2,3,…}, the initial conditions y−k, … ,y−1,y0 and the parameters p and q are non‐negative.Design/methodology/approachThe paper studies characteristics such as the character of semicycles, periodicity and the global ...
Mehdi Dehghan 0002, Reza Mazrooei-Sebdani   +1 more
openaire   +2 more sources

Recursion and Recursive Algorithms

1978
Before continuing with the treatment of search methods a full discussion of recursion is needed to prepare the ground for the next chapter on binary trees.
openaire   +1 more source