Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title
Now showing items 2560-2579 of 3804
-
A Planning System for Robot Construction Tasks
(MIT Artificial Intelligence Laboratory, 1973-05)This paper describes BUILD, a computer program which generates plans for building specified structures out of simple objects such as toy blocks. A powerful heuristic control structure enables BUILD to use a number of ... -
A Planning System for Robot Construction Tasks
(1973-05-01)This paper describes BUILD, a computer program which generates plans for building specified structures out of simple objects such as toy blocks. A powerful heuristic control structure enables BUILD to use a number of ... -
Pluggable type-checking for custom type qualifiers in Java
(2007-09-17)We have created a framework for adding custom type qualifiers to the Javalanguage in a backward-compatible way. The type system designer definesthe qualifiers and creates a compiler plug-in that enforces theirsemantics. ... -
PLY: A System of Plausibility Inference with a Probabilistic Basis
(1982-12)An overview is given of a system of plausibility inference that will be developed for use in planning. This system, to be called PLY, will be specifically designed to work with propositions of the form "when A is true ... -
Policy Improvement for POMDPs Using Normalized Importance Sampling
(2001-03-20)We present a new method for estimating the expected return of a POMDP from experience. The estimator does not assume any knowle ge of the POMDP and allows the experience to be gathered with an arbitrary set of policies. ... -
Policy-Protocol Interaction in Composite Processes
(1982-09-01)Message policy is defined to be the description of the disposition of messages of a single type, when received by a group of processes. Group policy applies to all the processes of a group, but for a single message ... -
POLYBRICK: Adventures in the Domain of Parallelepipeds
(1966-05-01)A collection of programs tries to recognize, which one more successfully than its predecessor, 3-dimensional parallelepipeds (solids limited by 6 planes, parallel two-by-two), using as data 2-dimensional idealized projections. ... -
Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk
(2005-11-26)We consider the non-uniform multicommodity buy-at-bulknetworkdesign problem. In this problem we are given a graph $G(V,E)$withtwo cost functions on the edges, a buy cost $b:E\longrightarrow \RR^+$and a rent cost$r:E\long ... -
POLYSEG
(1967-04-01)POLYSEG takes as input a list of dotted pairs of numbers. These pairs are assumed to be the co-ordinates of adjacent points along a single closed line. It is further assumed that the x and y co-ordinates of successive ... -
A Portable Compiler for the Language C
(1975-05)This paper describes the implementation of a compiler for the language C. The compiler has been designed to be able to be capable of producing assembly-language code for most register-oriented machines with only minor recoding. -
Portable High-Performance Programs
(1999-06)This dissertation discusses how to write computer programs that attain both high performance and portability, despite the fact that current computer systems have different degrees of parallelism, deep memory hierarchies, ... -
Pose Determination of a Grasped Object Using Limited Sensing
(1991-05-01)This report explores methods for determining the pose of a grasped object using only limited sensor information. The problem of pose determination is to find the position of an object relative to the hand. The information ... -
Pose-Invariant Face Recognition Using Real and Virtual Views
(1996-03-28)The problem of automatic face recognition is to visually identify a person in an input image. This task is performed by matching the input face against the faces of known people in a database of faces. Most existing ... -
The Position of the Sun
(MIT Artificial Intelligence Laboratory, 1978-03)The appearance of a surface depends dramatically on how it is illuminated. In order to interpret properly satellite and aerial imagery, it is necessary to know the position of the sun in the sky. This is particularly ... -
Possibilistic Beliefs and Higher-Level Rationality
(2014-06-09)We consider rationality and rationalizability for normal-form games of incomplete information in which the players have possibilistic beliefs about their opponents. In this setting, we prove that the strategies compatible ... -
Possibilistic Beliefs and Higher-Level Rationality
(2014-06-09)We consider rationality and rationalizability for normal-form games of incomplete information in which the players have possibilistic beliefs about their opponents. In this setting, we prove that the strategies compatible ... -
The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs
(1995-09)We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new type of homing sequence for robots, which helps ... -
The Power of the Queue
(1986-04)Queues, stacks (pushdown stores), and tapes are storage models which have direct applications in compiler design and the general desig of algorithms. Whereas stacks (pushdown store or last-in-first-out storage) have been ...
