<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
<channel rdf:about="http://hdl.handle.net/1721.1/39813">
<title>AI Working Papers (1971 - 1995)</title>
<link>http://hdl.handle.net/1721.1/39813</link>
<description/>
<items>
<rdf:Seq>
<rdf:li rdf:resource="http://hdl.handle.net/1721.1/46712"/>
<rdf:li rdf:resource="http://hdl.handle.net/1721.1/41999"/>
<rdf:li rdf:resource="http://hdl.handle.net/1721.1/41998"/>
<rdf:li rdf:resource="http://hdl.handle.net/1721.1/41997"/>
</rdf:Seq>
</items>
<dc:date>2013-05-20T00:10:19Z</dc:date>
</channel>
<item rdf:about="http://hdl.handle.net/1721.1/46712">
<title>Dependency-Directed Backtracking in Non-Deterministic Scheme</title>
<link>http://hdl.handle.net/1721.1/46712</link>
<description>Dependency-Directed Backtracking in Non-Deterministic Scheme
Zabih, Ramin
Non-deterministic LISP can be used to describe a search problem without specifying the method used to solve the problem. We show that SCHEMER, a non-deterministic dialect of SCHEME, can support dependency-directed backtracking as well as chronological backtracking. Full code for a working SCHEMER interpreter that provides dependency-directed backtracking is included.
This is a greatly revised version of a thesis submitted to the Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science on January 2, 1987, in partial fulfillment of the requirements for the degree of Master of Science.
</description>
<dc:date>1988-08-01T04:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/1721.1/41999">
<title>Mini-Robot Group User's Guide Part 1: The 11/45 System</title>
<link>http://hdl.handle.net/1721.1/41999</link>
<description>Mini-Robot Group User's Guide Part 1: The 11/45 System
Billmers, Meyer A.
This USER'S GUIDE is in two parts. Part 1 describes the facilities of the mini-robot group 11/45 and the software available to persons using those facilities. It is intended for those writing their own programs to be run on the 11/45 system.
A.I. Laboratory Working Papers are produced for internal circulation, and may contain information that is, for example, too preliminary or too detailed for formal publication. Although some will be given a limited external distribution, it is not intended that they should be considered papers to which reference can be made in the literature.&#13;
This report describes research done at the Artificial Intelligence Laboratory of the Massachusetts Institute of Technology. Support for the laboratory's artificial intelligence research is provided in part by the Advanced Research Projects Agency of the Department of Defense under Office of Naval Research contract N00014-75-C-0643.
</description>
<dc:date>1978-06-01T04:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/1721.1/41998">
<title>Using Message Passing Instead of the GOTO Construct</title>
<link>http://hdl.handle.net/1721.1/41998</link>
<description>Using Message Passing Instead of the GOTO Construct
Hewitt, Carl
This paper advocates a programming methodology using message passing. Efficient programs are derived for fast exponentiation, merging ordered sequences, and path existence determination in a directed graph. The problems have been proposed by John Reynolds as interesting ones to investigate because they illustrate significant issues in programming. The methodology advocated here is directed toward the production of programs that are intended to execute efficiently in a computing environment with many processors. The absence of the GOTO construct does not seem to be constricting in any respect in the development of efficient programs using the programming methodology advocated here.
This report describes research conducted at the Artificial Intelligence Laboratory of the Massachusetts Institute of Technology. Support for this research was provided in part by the Office of Naval Research of the Department of Defense under Contract N00014-75-C-0522.
</description>
<dc:date>1978-04-01T05:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/1721.1/41997">
<title>Computer Detection of Bent Fingers in Lead Bonding Frames</title>
<link>http://hdl.handle.net/1721.1/41997</link>
<description>Computer Detection of Bent Fingers in Lead Bonding Frames
Mitnick, Walter L.
In the production of logic circuits in dual inline packages, various tedious assembly line tasks are performed by human operators using microscopes or television enlargements. One boring and difficult task is the detection of bent fingers in lead bonding frames to which integrated circuit chips are subsequently bonded. Bent fingers can cause stresses which may eventually lead to the failure of circuits. This paper discusses the inspection problem and presents a computerized bent finger detection method which could be adapted to free human operators from this task. More immediately, it presents a method of examining an object and determining whether or not it is in focus based solely on inspection of the object's digitized light intensity profiles.
This report describes research done at the Artificial Intelligence Laboratory of the Massachusetts Institute of Technology. Support for the laboratory's artificial intelligence research is provided in part by the Advanced Research Projects Agency of the Department of Defense under Office of Naval Research contract N00014-75-C-0643.
</description>
<dc:date>1976-01-01T05:00:00Z</dc:date>
</item>
</rdf:RDF>
