Advanced Search
DSpace@MIT

Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title

Research and Teaching Output of the MIT Community

Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title

Sort by: Order: Results:

  • LaCurts, Katrina; Deng, Shuo; Balakrishnan, Hari (2013-02-12)
    A significant and growing number of applications deployed on cloud infrastructures are network-intensive. These applications are frequently bottlenecked by the speed of network connections between the machines on which ...
  • Hewitt, Carl (1970-08-01)
    PLANNER is a language for proving theorems and manipulating models in a robot. The language is built out of a number of problem-solving primitives together with a hierarchical control structure. Statements can be asserted ...
  • Hewitt, Carl (1967-07-01)
    The following is a description of SCHEMATISE, a proposal for a program that proves very elementary theorems though the use of planning. The method is most easily explained through an example die to Black.
  • Hewitt, Carl (1971-12-01)
    The task objective is the generalization and implementation of the full power of the problem solving formalism PLANNER in the next two years. We will show how problem solving knowledge can be effectively incorporated into ...
  • Buckley, Stephen J. (1987-01-01)
    This thesis presents a new high level robot programming system. The programming system can be used to construct strategies consisting of compliant motions, in which a moving robot slides along obstacles in its ...
  • Brooks, Rodney A. (1983-05-01)
    An efficient algorithm which finds collision free paths for a manipulator with 5 or 6 revolute joints is described. It solves the problem for four degree of freedom pick and place operations. Examples are given of paths ...
  • Chapman, David (1985-11-01)
    The problem of achieving conjunctive goals has been central to domain independent planning research; the nonlinear constraint-posting approach has been most successful. Previous planners of this type have been comlicated, ...
  • Brooks, Rodney A. (MIT Artificial Intelligence Laboratory, 1987-09)
    The idea of planning and plan execution is just an intuition based decomposition. There is no reason it has to be that way. Most likely in the long term, real empirical evidence from systems we know to be built that way ...
  • Sahar, Gideon; Hollerbach, John M. (1984-11-01)
    The minimum-time for a robot arm has been a longstanding and unsolved problem of considerable interest. We present a general solution to this problem that involves joint-space tesselation, a dynamic time-scaling ...
  • Anders, Ariel; Kaelbling, Leslie; Lozano-Perez, Tomas (2017-01-30)
    A crucial challenge in robotics is achieving reliable results in spite of sensing and control uncertainty. A prominent strategy for dealing with uncertainty is to construct a feedback policy, where actions are chosen as a ...
  • Fahlman, Scott E. (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 ...
  • Fahlman, Scott E. (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 ...
  • Rich, Charles (MIT Artificial Intelligence Laboratory, 1977-05)
    Brief Statement of the Problem: Stated most generally, the proposed research is concerned with understanding and representing the teleological structure of engineered devices. More specifically, I propose to study the ...
  • Shrobe, Howard Elliot (MIT Artificial Intelligence Laboratory, 1978-01)
    Brief Statement of the Problem: An interactive programming environment called the Programmer's Apprentice is described. Intended for use by the expert programmer in the process of program design and maintenance, the ...
  • Darrell, T.; Demirdjian, D.; Checka, N.; Felzenswalb, P. (2001-02-01)
    In a known environment, objects may be tracked in multiple views using a set of back-ground models. Stereo-based models can be illumination-invariant, but often have undefined values which inevitably lead to foreground ...
  • Papi, Matthew M.; Ali, Mahmood; Correa Jr., Telmo Luis; Perkins, Jeff H.; Ernst, Michael D. (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. ...
  • Shelton, Christian R. (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. ...
  • Barter, C.J. (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 ...
  • Guzman, Adolfo (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. ...
  • Hajiaghayi, MohammadTaghi; Kortsarz, Guy; Salavatipour, Mohammad R. (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 ...
MIT-Mirage