Now showing items 10-12 of 1835

    • Garbage Collection in a Very Large Address Space 

      Bishop, Peter B. (MIT Artificial Intelligence Laboratory, 1975-09)
      The address space is broken into areas that can be garbage collected separately. An area is analogous to a file on current systems. Each process has a local computation area for its stack and temporary storage that is ...
    • Assigning Hierarchical Descriptions to Visual Assemblies of Blocks with Occlusion 

      Dunlavey, Michael R. (MIT Artificial Intelligence Laboratory, 1975-10)
      This memo describes a program for parsing simple two-dimensional piles of blocks into plausible nested subassemblies. Each subassembly must be one of a few types known to the program, such as stack, tower, or arch. Each ...
    • Application of Data Flow Computation to the Shaded Image Problem 

      Strat, Thomas M. (MIT Artificial Intelligence Laboratory, 1978-05)
      This paper presents a method of producing shaded images of terrain at an extremely fast rate by exploiting parallelism. The architecture of the Data Flow Computer is explained along with an appropriate "program" to compute ...