Now showing items 21-40 of 3583

    • First Report on Epos: Aspects of Generality And Efficiency in Programming Language Implementation 

      Martin, Johannes J. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74016-R
      No abstract available.
    • Implementation of Fortran Random Number Generators on Computers with One's Complement Arithmetic 

      Nance, Richard E.; Overstreet Jr., Claude (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74011-R
      No abstract available.
    • Working-Set-Like Memory Management Algorithms 

      Lam, Felix L.; Ferrari, Domenico (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74025-R
      This paper considers the design and evaluation of memory management algorithms to be applied to multiprogramming computer systems with virtual memory. The operation of the Denning working set algorithm is studied and ...
    • Learning as a Problem Solving Tool 

      Claybrook, Billy G. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74018-R
      This paper explores the use of learning as a practical tool in problem solving. The idea that learning should and eventually will be a vital component of most Artificial Intelligence programs is pursued. Current techniques ...
    • On the Minimal Total Path Length of a Spanning Tree 

      Kang, Andy N. C.; Ault, David A. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74032-R
      The notions of a balance node and the total path length with respect to a node u of a spanning tree are defined. We show that the total path length of a spanning tree with respect to u is minimal if and only if u is a ...
    • The Role of Automatic Digitizers in Computer Aided-design 

      Williams, Charles M. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74026-R
      The incorporation of facilities for automatically digitizing documents can considerably enhance the power of computer graphics in computer-aided-design. A hardware-software process is described which rapidly and economically ...
    • Definability of Boolean Function Over Many-value Boolean Algebra 

      Kang, Andy N. C.; Shen, Stewart N.T. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74007-R
      In this paper, the definability of functions over B_s is first briefly discussed. We then give necessary and sufficient conditions on the definable functions over B_2, boolean algebra of four values. An efficient algorithm ...
    • Some Experimental Observations on the Behavior of Composite Random Number Generators 

      Nance, Richard E.; Overstreet Jr., Claude (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74014-R
      A series of experiments with composite random number generators utilizing shuffling tables is described. The factors investigated are: (1) the magnitude of the modulus (equivalently, the word-size of the machine), (2) ...
    • On Making Bairstow's Method Work 

      Ault, David A. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74003-R
      No abstract available.
    • The Role of Automatic Digitizers in Demography 

      Williams, Charles M. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74028-R
      The incorporation of facilities for automatically digitizing maps and drawings can considerably enhance the power of the computer in demographical research. A hardware-software process is described which can rapidly, ...
    • A Note on Ledgard's Minilanguage 2 And a Proposal for an Alternative 

      Lee, John A. N. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74017-R
      This note reviews and discusses the concepts of assignment statements which occur within programming languages and as exemplified by Minilanguage 2 by Ledgard [3]. Observing that the description of assignment by Ledgard ...
    • Analysis of an Enumeration Algorithm for Unordered K-partitions of N 

      Kang, Andy N. C.; Kang, C. K. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74009-R
      In many combinatorial problems, the need to compute the number of unrestricted partitions of n or to enumerate over the set of unrestricted partitions of n occurs frequently. Let two positive integers k and n be given, ...
    • Searching One Multiplier in Glm 

      Greenberg, Harvey J. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74024-R
      A unified approach is developed for one-dimensional GLM. The major result is a convergence theorem for interval reduction. Comparative analysis of bisection, linear interpolation and tangential approximation reveals the ...
    • Root-heavy Directory Tree on Direct Access Storage Devices 

      Shen, Stewart N.T. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74004-R
      No abstract available.
    • The Logical Foundations of Microlanguages 

      Wesselkamper, Thomas C. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74020-R
      After the consideration of two recent examples of instruction sets for microprogrammable computers, the article sketches known and new results about complete sets of functions which appear to be applicable to microlanguage ...
    • A DOS-M Primer 

      Cline, Ben E. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74006-R
      No abstract available.
    • The Use of Computer Modulated Drawing in the Teaching of Art 

      Williams, Charles M. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74030-R
      A hardware-software process is described which automatically creates computer modulated drawings from an artist's own works. The process allows a drawing to act as a constant source of data for a series of renditions of ...
    • GLM Versus Continuous Approximation for Convex Integer Programs 

      Greenberg, Harvey J. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74022-R
      GLM is compared to continuous approximation for convex, integer programs. After noting the stronger bound provided by GLM, Lagrangian duality and a gap closing heuristic is used to demonstrate how GLM may provide a better ...
    • A File Definition Facility for File Structures 

      Claybrook, Billy G. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74001-R
      This paper describes a file definition facility (FDF) for defining files as graph structures. The structure of the file is explicitly declared in the file definition. Primitive functions(from graph theory), operators, and ...
    • The Mixed Method of Random Number Generation: A Tutorial 

      Overstreet Jr., Claude; Nance, Richard E. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74013-R
      Several motivations are recognized for user-defined random number generators in preference to built-in generators. The mixed method of random number generation is discussed) and the conditions for achieving full period ...