Now showing items 971-990 of 2626

    • HAKMEM 

      Beeler, M.; Gosper, R.W.; Schroeppel, R. (1972-02-01)
      Here is some little know data which may be of i nterest to computer hackers. The items and examples are so sketchy that to decipher them may require more sincerity and curiosity than a non-hacker can muster. Doubtless, ...
    • HAMPI: A Solver for String Constraints 

      Ernst, Michael D.; Kiezun, Adam; Ganesh, Vijay; Guo, Philip J.; Hooimeijer, Pieter (2009-02-04)
      Many automatic testing, analysis, and verification techniques for programs can be effectively reduced to a constraint-generation phase followed by a constraint-solving phase. This separation of concerns often leads to more ...
    • Hand Eye Coordination 

      Speckert, Glen (MIT Artificial Intelligence Laboratory, 1976-07)
      This paper describes a simple method of converting visual coordinates to arm coordinates which does not require knowledge of the position of the camera(s). Comparisons are made to other methods and two camera, three ...
    • Hardware and Program Memo About SERVO 

      Beeler, Michael (1967-03-01)
      SERVO is intended as an engineering and programming analyzing and debugging aid for use with devices connected through the input and output multiplexers to the PDP-6. Cannel numbers and values to output, as well as ...
    • Hardware Memo - Input Multiplexer Status 

      Noftsker, Russell (1966-10-01)
      Note: Computer control of Input Multiplexer and Output Sample and Hold is available when clock and test switches on the I/O box are in "Computer Input" and "Computer Output" positions, respectively. Manual operation of the ...
    • Harvesting Application Information for Industry-Scale Relational Schema Matching 

      Kushman, Nate; Adib, Fadel; Katabi, Dina; Barzilay, Regina (2013-09-10)
      Consider the problem of migrating a company's CRM or ERP database from one application to another, or integrating two such databases as a result of a merger. This problem requires matching two large relational schemas with ...
    • Hash-Coding Functions of a Complex Variable 

      Martin, William A. (1964-06-25)
      A common operation in non-numerical analysis is the comparison of symbolic mathematical expressions. Often equivalence under the algebraic and trigonometric relations can be determined with the high probability by hash-coding ...
    • Height and Gradient from Shading 

      Horn, Berthold K.P. (1989-05-01)
      The method described here for recovering the shape of a surface from a shaded image can deal with complex, wrinkled surfaces. Integrability can be enforced easily because both surface height and gradient are represented. ...
    • Heracles: Fully Synthesizable Parameterized MIPS-Based Multicore System 

      Kinsy, Michel; Pellauer, Michael (2010-12-08)
      Heracles is an open-source complete multicore system written in Verilog. It is fully parameterized and can be reconfigured and synthesized into different topologies and sizes. Each processing node has a 7-stage pipeline, ...
    • Herbert: A Second Generation Mobile Robot 

      Brooks, Rodney A.; Connell, Jonathan; Ning, Peter (1988-01-01)
      In mobile robot research we believe the structure of the platform, its capabilities, the choice of sensors, their capabilities, and the choice of processors, both onboard and offboard, greatly constrains the direction of ...
    • Hermeneutics: From Textual Explication to Computer Understanding? 

      Mallery, John C.; Hurwitz, Roger; Duffy, Gavan (1986-05-01)
      Hermeneutics, a branch of continental European philosophy concerned with human understanding and the interpretation of written texts, offers insights that may contribute to the understanding of meaning, translation, ...
    • A Heterarchical Program for Recognition of Polyhedra 

      Shirai, Yoshiaki (MIT Artificial Intelligence Laboratory, 1972-06)
      Recognition of polyhedra by a heterarchical program is presented. The program is based on the strategy of recognizing objects step by step, at each time making use of the previous results. At each stage, the most obvious ...
    • A Heterarchical Program for Recognition of Polyhedra 

      Shirai, Yoshiaki (1972-06-01)
      Recognition of polyhedra by a heterarchical program is presented. The program is based on the strategy of recognizing objects step by step, at each time making use of the previous results. At each stage, the most obvious ...
    • Heterarchy in the M.I.T. Robot 

      Winston, Patrick H. (MIT Artificial Intelligence Laboratory, 1971-03)
    • Heterogeneous Multi-Robot Cooperation 

      Parker, Lynne E. (1994-02-01)
      This report addresses the problem of achieving cooperation within small- to medium- sized teams of heterogeneous mobile robots. I describe a software architecture I have developed, called ALLIANCE, that facilitates ...
    • A Heuristic Program that Constructs Decision Trees 

      Winston, Patrick (1969-03-01)
      Suppose there is a set of objects, {A, B,...E} and a set of tests, {T1, T2,...TN). When a test is applied to an object, the result is wither T or F. Assume the test may vary in cost and the object may vary in probability ...
    • A Heuristic Program to Solve Geometric Analogy Problems 

      Evans, T.G. (1962-10-01)
      A program to solve a wide class of intelligence-test problems of the "geometric-analogy" type ("figure A is to figure B as figure C is to which of the following figures?") is being constructed. The program, which is written ...
    • Heuristic Techniques in Computer Aided Circuit Analysis 

      Sussman, Gerald Jay; Stallman, Richard Matthew (1975-03-01)
      We present EL, a new kind of circuit analysis program. Whereas other circuit analysis systems rely on classical, formal analysis techniques, EL employs heuristic "inspection" methods to solve rather complex DC bias ...
    • Heuristics for Job-Shop Scheduling 

      Pasch, Kenneth Alan (1988-01-01)
      Two methods of obtaining approximate solutions to the classic General Job-shop Scheduling Program are investigated. The first method is iterative. A sampling of the solution space is used to decide which of a collection ...
    • Hidden Clues in Random Line Stereograms 

      Nishihara, H.K.; Poggio, T. (1983-08-01)
      Successful fusion of random-line stereograms with breaks in the vernier acuity range has been previously interpreted to suggest that the interpolation process underlying hyperacuity is parallel and preliminary to ...