Results 1  10
of
352,710
Probability Metrics and Recursive Algorithms
"... In this paper it is shown by several examples that probability metrics are a useful tool to study the asymptotic behaviour of (stochastic) recursive algorithms. The basic idea of this approach is to find a `suitable ' probability metric which yields contraction properties of the transformation ..."
Abstract

Cited by 53 (9 self)
 Add to MetaCart
In this paper it is shown by several examples that probability metrics are a useful tool to study the asymptotic behaviour of (stochastic) recursive algorithms. The basic idea of this approach is to find a `suitable ' probability metric which yields contraction properties
MAXIMALLY FAST RECURSIVE ALGORITHMS
"... Every recursive algorithm has a maximum sample frequency determined by the computational loops in the algorithm. The algorithm may, however, be modified in order to reach the true maximal sample frequency. In this paper, we introduce a technique using the distributive and associative properties ..."
Abstract
 Add to MetaCart
Every recursive algorithm has a maximum sample frequency determined by the computational loops in the algorithm. The algorithm may, however, be modified in order to reach the true maximal sample frequency. In this paper, we introduce a technique using the distributive and associative properties
COLLISION AVOIDANCE RECURSIVE ALGORITHM
"... This paper presents a technique for providing collision avoidance of arbitrary objects in a computer graphics system. The recursive algorithm implements the method of avoiding the collisions by taking an alternate path and therefore among the available alternate paths, the shortest one is chosen. Un ..."
Abstract
 Add to MetaCart
This paper presents a technique for providing collision avoidance of arbitrary objects in a computer graphics system. The recursive algorithm implements the method of avoiding the collisions by taking an alternate path and therefore among the available alternate paths, the shortest one is chosen
A Fast Recursive Algorithm For
"... The WeylHorn theorem characterizes a relationship between the eigenvalues and the singular values of an arbitrary matrix. Based on that characterization, a fast recursive algorithm is developed to construct numerically a matrix with prescribed eigenvalues and singular values. Beside being theoretic ..."
Abstract
 Add to MetaCart
The WeylHorn theorem characterizes a relationship between the eigenvalues and the singular values of an arbitrary matrix. Based on that characterization, a fast recursive algorithm is developed to construct numerically a matrix with prescribed eigenvalues and singular values. Beside being
Termination of Nested and Mutually Recursive Algorithms
, 1996
"... This paper deals with automated termination analysis for functional programs. Previously developed methods for automated termination proofs of functional programs often fail for algorithms with nested recursion and they cannot handle algorithms with mutual recursion. We show that termination proofs ..."
Abstract

Cited by 44 (9 self)
 Add to MetaCart
This paper deals with automated termination analysis for functional programs. Previously developed methods for automated termination proofs of functional programs often fail for algorithms with nested recursion and they cannot handle algorithms with mutual recursion. We show that termination proofs
FPGAbased Implementation of Recursive Algorithms
 Elsevier Journal Microprocessors and Microsystems
, 2004
"... The paper suggests a novel method for implementing recursive algorithms in hardware. The required support for recursion has been provided through a modular and a hierarchical specification of a control unit that can be translated to an implementation of the respective hardware circuit on the basis o ..."
Abstract

Cited by 23 (16 self)
 Add to MetaCart
The paper suggests a novel method for implementing recursive algorithms in hardware. The required support for recursion has been provided through a modular and a hierarchical specification of a control unit that can be translated to an implementation of the respective hardware circuit on the basis
A Parallel/Recursive Algorithm
, 2003
"... An algorithm is discussed for converting a class of recursive processes to a parallel system. It is argued that this algorithm can be superior to certain methods currently found in the literature for an important subset of problems. The cases of homogeneous and nonhomogenous two term recursion are t ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
An algorithm is discussed for converting a class of recursive processes to a parallel system. It is argued that this algorithm can be superior to certain methods currently found in the literature for an important subset of problems. The cases of homogeneous and nonhomogenous two term recursion
Truncated Recursive Algorithms For Scheduling
, 1994
"... this paper, I develop a general approach to the computation of optimal inspection schedules. Throughout the discussion, I will refer to it as truncated recursive method, since it is based on two elements: the first is truncating the evaluation of the risk function at a finite horizon, large enough t ..."
Abstract
 Add to MetaCart
of the convergence properties of the resulting algorithm. In Section 3, I consider an application to the basic model. Finally, in Section 4, I illustrate the accuracy of the result by means of numerical examples. 2 The Truncated Recursive Approach
Recursive Algorithm for Generating Partitions of an Integer
"... Abstract. This article first reviews the problem of partitioning a positive integer in general. And then recursive algorithms for P(n,k), generating exactly k partitions of a positive number n are presented. The most efficient recursive algorithm’s computational running time is Θ(k×p(n,k)) which is ..."
Abstract
 Add to MetaCart
Abstract. This article first reviews the problem of partitioning a positive integer in general. And then recursive algorithms for P(n,k), generating exactly k partitions of a positive number n are presented. The most efficient recursive algorithm’s computational running time is Θ(k×p(n,k)) which
Results 1  10
of
352,710