Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 31 for “"recursive function"”.

  1. Recursive Function Theory in Groups and Semigroups

    Made available in DSpace on 2014-12-14T13:09:44Z (GMT). No. of bitstreams: 1 8009113.pdf: 4391205 bytes, checksum: f69883a5f5369d54a26f31163d28de47 (MD5) Previous issue date: 1979

    uiuc Repository record for Recursive Function Theory in Groups and Semigroups (opens in a new tab)

  2. Towards a Theory of Recursive Function Complexity: Sigma Matrices and Inverse Complexity Measures

    … a data structure based on preimage sets of functions on a finite set. This structure, called the sigma matrix, is shown to be particularly well-suited for exploring the structural characteristics of recursive functions relevant to investigations of complexity. The matrix is easy to compute …

    uno Repository record for Towards a Theory of Recursive Function Complexity: Sigma Matrices and Inverse Complexity Measures (opens in a new tab)

  3. The Work of Emil L. Post on Combinatorial Systems: A Basis for Modern Recursive-Function Theory

    Made available in DSpace on 2014-12-11T18:23:54Z (GMT). No. of bitstreams: 1 7317121.pdf: 4783375 bytes, checksum: 9bc9d2b0273e973f20457514ef9f809c (MD5) Previous issue date: 1972

    uiuc Repository record for The Work of Emil L. Post on Combinatorial Systems: A Basis for Modern Recursive-Function Theory (opens in a new tab)

  4. Online coordinated search and rescue with stochastic demand at the University of Texas at Austin

    … is based on the use of an estimate of the recursive function to both approximate the value of the recursive function after a certain number of steps in the procedue and to discard policies with a high value for the estimate. We find that the heuristic performs well for relatively small …

    texas Repository record for Online coordinated search and rescue with stochastic demand at the University of Texas at Austin (opens in a new tab) Restricted access

  5. ALGEBRAIC PROPERTIES OF FAREY RECURSIVE FUNCTIONS

    … by an edge exactly when |ps - qr| = 1. A Farey recursive function assigns values in a commutative ring to these vertices so that, along any line formed by edges in the diagram, the values satisfy a second-order linear recurrence. Although these functions arise naturally in hyperbolic geometry, …

    montana Repository record for ALGEBRAIC PROPERTIES OF FAREY RECURSIVE FUNCTIONS (opens in a new tab)

  6. ALGEBRAIC PROPERTIES OF FAREY RECURSIVE FUNCTIONS

    … by an edge exactly when |ps - qr| = 1. A Farey recursive function assigns values in a commutative ring to these vertices so that, along any line formed by edges in the diagram, the values satisfy a second-order linear recurrence. Although these functions arise naturally in hyperbolic geometry, …

    montana-tech Repository record for ALGEBRAIC PROPERTIES OF FAREY RECURSIVE FUNCTIONS (opens in a new tab)

  7. Mapping recursive functions to reconfigurable hardware

    … arguments, context and a return address for function calls. This however limits the controlling hardware to running only a single function at any moment which eliminates an algorithm's ability to take advantage of the parallelism available between successive iterations of a recursive …

    unsw Repository record for Mapping recursive functions to reconfigurable hardware (opens in a new tab)

  8. Farey Recursion and Hyperbolic Dehn Filling

    … the layered solid torus. Our approach uses Farey recursive functions, and we present a Farey recursive function that provides a solution to the gluing equations for any hyperbolic Dehn filling admitting a triangulation by the layered solid torus. We provide examples that demonstrate our solution …

    montana Repository record for Farey Recursion and Hyperbolic Dehn Filling (opens in a new tab)

  9. Farey Recursion and Hyperbolic Dehn Filling

    … the layered solid torus. Our approach uses Farey recursive functions, and we present a Farey recursive function that provides a solution to the gluing equations for any hyperbolic Dehn filling admitting a triangulation by the layered solid torus. We provide examples that demonstrate our solution …

    montana-tech Repository record for Farey Recursion and Hyperbolic Dehn Filling (opens in a new tab)

  10. Generalised inversion frequency distribution

    … these entities. It centers around the generating function for the inversion count distribution for the permutation of the multisets. The main result is a recursive function for the parent/child relationship between the permutations of multisets. The thesis also studies the link between the …

    unsw Repository record for Generalised inversion frequency distribution (opens in a new tab)

  11. Green's functions and eigenvalue comparisons for higher order dynamic equations on time scales

    … developed by Stefan Hilger in 1988. For functions f : [special characters omitted] we introduce the delta derivative with the corresponding integral and state fundamental results. In Chapter 2 the existence of the Green's function is shown for both conjugate and focal boundary value …

    nebraska Repository record for Green's functions and eigenvalue comparisons for higher order dynamic equations on time scales (opens in a new tab)

  12. Formalizing Abstract Computability: Turing Categories in Coq

    The concept of a recursive function has been extensively studied using traditional tools of computability theory. However, with the development of category-theoretic methods it has become possible to study recursion in a more general (abstract) sense. The particular model this thesis is structured …

    ottawa-retro Repository record for Formalizing Abstract Computability: Turing Categories in Coq (opens in a new tab)

  13. Antics : a system for animating LISP programs

    … A three minute film showing the operation of the recursive function MEMBER was produced for a total cost of $12.00. The film is included as part of the thesis. The system is dependent on IBM 370/168 and Adage Graphics Terminal hardware, but the design, which is based on the organization of the …

    ubc Repository record for Antics : a system for animating LISP programs (opens in a new tab) Download PDF for Antics : a system for animating LISP programs (opens in a new tab)

  14. Frontiers For High-Level Synthesis of Digital Circuits

    … and sequential digital circuits from recursive behavioral specifications based on the functional programming paradigm. Recursion removal is accomplished by computing the fixpoints of recursion equations. The techniques used for computing the fixpoints are based on domain theory and …

    sask Repository record for Frontiers For High-Level Synthesis of Digital Circuits (opens in a new tab)

  15. Frontiers for high-level synthesis of digital circuits

    … and sequential digital circuits from recursive behavioral specifications based on the functional programming paradigm. Recursion removal is accomplished by computing the fixpoints of recursion equations. The techniques used for computing the fixpoints are based on domain theory and …

    sask Repository record for Frontiers for high-level synthesis of digital circuits (opens in a new tab)

  16. Variants of Partial Learning in Inductive Inference

    … learning. Consistent partial learning of recursive functions is classifi ed according to the mode of data presentation; the two main types of data texts considered are canonical text and arbitrary text. The issue of consistent partial learning from incomplete texts is also given a brief …

    nus Repository record for Variants of Partial Learning in Inductive Inference (opens in a new tab) Download file for Variants of Partial Learning in Inductive Inference (opens in a new tab)

  17. POSIX Regular Expression Matching and Lexing

    … we fix has to do with their use of the nub function that does not remove non-trivial duplicates. We improve the simplification rules by formulating them as simple recursive function and also by simplifying more instances of regular expressions. As a result we can establish a bound on the …

    kings Repository record for POSIX Regular Expression Matching and Lexing (opens in a new tab) Download PDF for POSIX Regular Expression Matching and Lexing (opens in a new tab)

  18. Oracle pointer machines

    … construction of Oracle SMMs by applying them to recursive function theory, specifically focusing on the complexity of computing real functions. The complexity analysis of computing real functions within a bounded domain using Oracle SMMs builds upon the work of Ko and Friedman published in 1982. …

    iastate Repository record for Oracle pointer machines (opens in a new tab)

  19. The power of parallel time

    … One implication is that there does not exist any recursive function that is ""inherently not parallelizable."""

    uiuc Repository record for The power of parallel time (opens in a new tab)

  20. Management of Requirements Changes in Sequence-Based Software Specifications

    … machines, regular expression sets, and prefix-recursive function sets. Enumeration minimization and compatibility are addressed as part of the transformation theory. Finally a safe controller example is demonstrated in great detail with respect to abstraction, enumeration, transformations from …

    utk-theses Repository record for Management of Requirements Changes in Sequence-Based Software Specifications (opens in a new tab)

Page 1 of 2