Now showing items 2428-2447 of 38934

    • Algebra for P. B. 210-211 

      Cornell University. Biometrics Unit.; Cornell University. Dept. of Biometrics.; Cornell University. Dept. of Biological Statistics and Computational Biology. (1957-05)
    • Algebra for Plant Breeding 210 

      Steel, R. G. D.; Cornell University. Biometrics Unit.; Cornell University. Dept. of Biometrics.; Cornell University. Dept. of Biological Statistics and Computational Biology. (1955-03)
    • Algebra Notes for Plant Breeding 210-1 

      Steel, R. G. D.; Cornell University. Biometrics Unit.; Cornell University. Dept. of Biometrics.; Cornell University. Dept. of Biological Statistics and Computational Biology. (1959)
    • Algebra. Plant Breeding 210-211 

      Thompson, K. H.; Cornell University. Biometrics Unit.; Cornell University. Dept. of Biometrics.; Cornell University. Dept. of Biological Statistics and Computational Biology. (1958)
    • An Algebraic Property of the Totally Symmetric Loops Associated with Kirkman-Steiner Triple Systems 

      Hedayat, A.; Cornell University. Biometrics Unit.; Cornell University. Dept. of Biometrics.; Cornell University. Dept. of Biological Statistics and Computational Biology. (1970)
    • Algebraic Specification of a Communication Scheduler 

      Mathai, Joseph; Moitra, Abha (Cornell University, 1984-06)
      A distributed programming language normally incorporates one mechanism by which processes communicate with each other. This mechanism can be used to transfer information or to synchronize the flow of control in the ...
    • Algorithm Development In Density Matrix Renormalization Group And Canonical Transformation Theory 

      Dorando, Jonathan (2010-08-05)
      In this thesis, we will describe several extensions of the Density Matrix Renormalization Group (DMRG) and Canonical Transformation Theory (CT). In the first part we describe a new way to solve for excited states in DMRG. ...
    • An Algorithm for Checking PL/CV Arithmetic Inferences 

      Chan, Tat-hung (Cornell University, 1977-10)
      This paper describes the operation and implementation of the arithmetic proof rule for the quantifier free integer arithmetic used in the PL/CV 2 program verification system. The general arithmetic satisfiability problem ...
    • An Algorithm for Coloring the Nodes of a Graph 

      Wagner, Robert A. (Cornell University, 1970-10)
      We study the problem of coloring the nodes of a graph such that two nodes joined by an arc are assigned different colors. An algorithm is presented which requires $~n^{3}$ time, where the graph contains $n$ nodes. This ...
    • An Algorithm for Determining Whether the Connectivity of a Graph is at Least k 

      Even, Shimon (Cornell University, 1973-09)
      The algorithm presented in this paper is for testing whether the connectivity of a large graph of $n$ vertices is at least $k$. First the case of undirected graphs is discussed, and then it is shown that a variation of ...
    • An Algorithm for Extracting Phrases in a Space-Optimal Fashion 

      Wagner, Robert A. (Cornell University, 1971-02)
      NO ABSTRACT SUPPLIED
    • An Algorithm for Processing Program Transformations 

      Efremidis, Sofoklis G.; Gries, David (Cornell University, 1993-10)
      An algorithm for processing program transformations as described by the transform construct is presented. The algorithm constructs a coordinate transformation of an abstract program based on a set of transforms and ...
    • An Algorithm for the Newton Resultant 

      Canny, John; Pedersen, Paul (Cornell University, 1993-10)
      Given a system of $n+1$ generic Laurent polynomials, for $i \,=\, 1, \ldots, n+1$, $$\eqlabel(\InputSystem) f_i(\x) \quad = \quad \sum_{q\in \A_i} c_{iq} \,x^q; \qquad q \,=\, (q_1,\ldots,q_n); \qquad \x^q \,=\, ...
    • An algorithm to find a 2-isomorphic image of a depth-first search tree 

      Ko, C. (Cornell University Operations Research and Industrial Engineering, 1990-09)
      This paper to appear in "Biometrics" 49.
    • The Algorithmic Analysis of Hybrid Systems 

      Alur, Rajeev; Courcoubetis, Costas; Halbwachs, Nicolas; Henzinger, Thomas A.; Ho, Pei-Hsin; Nicollin, Xavier; Olivero, Alfredo; Sifakis, Joseph; Yovine, Sergio (Cornell University, 1994-10)
      We present a general framework for the formal specification and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an analog environment. We model hybrid systems as finite automata ...
    • An Algorithmic Approach To Analyzing Social Phenomena 

      Oren, Sigal (2013-08-19)
      Online information and interaction is becoming more and more prominent in our lives. This development is made possible by the growth of large-scale userbased applications on the Web (including sites such as Wikipedia and ...
    • An Algorithmic Approach to some Problems in Terrain Navigation 

      Mitchell, J. (Cornell University Operations Research and Industrial Engineering, 1988-02)
      An Algorithmic Approach to some Problems in Terrain Navigation
    • Algorithmic approaches to optimal route planning 

      Mitchell, J. S. B. (Cornell University Operations Research and Industrial Engineering, 1990-10)
      Algorithmic approaches to optimal route planning
    • Algorithmic Education Theory 

      Novikoff, Timothy (2013-01-28)
      In order to build toward an algorithmic theory of education we construct simple, idealized mathematical models of students, learning, educational software and educational software usage data. The models are created by ...
    • Algorithmic Investigations in P-Adic Fields 

      Dubhashi, Devdatt P. (Cornell University, 1992-09)
      This thesis is concerned with algorithmic investigations in p-adically closed fields, of which Hensel's field of p-adic numbers is prototypical. The well known analogies between the field of real numbers and the field ...