Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title
Now showing items 1732-1751 of 3804
-
Issues in the Design and Implementation of Act 2
(1983-06-01)Act2 is a highly concurrent programming language designed to exploit the processing power available from parallel computer architectures. The language supports advanced concepts in software engineering, providing ... -
The Iterate Manual
(1990-10-01)This is the manual for version 1.1 of Iterate, a powerful iteration macro for Common Lisp. Iterate is similar to Loop but provides numerous additional features, is well integrated with Lisp, and is extensible. -
Iterative Collaborative Ranking of Customers and Providers
(2006-07-04)This paper introduces a new application: predicting the Internet provider-customer market. We cast the problem in the collaborative filtering framework, where we use current and past customer-provider relationships to ... -
Iterative Projection Methods for Structured Sparsity Regularization
(2009-10-14)In this paper we propose a general framework to characterize and solve the optimization problems underlying a large class of sparsity based regularization algorithms. More precisely, we study the minimization of learning ... -
ITS 1.4 Reference Manual
(1968-06-01)This reference manual is intended for those who have some knowledge of PDP-6 machine language and are either interested in the ITS monitor for its own sake, or who wish to write machine language programs to run under it. ... -
ITS 1.5 Reference Manual
(1969-07-01)This reference manual consists of two parts. The first (sections 1 through 6) is intended for those who are either interested in the ITS 1.5 time sharing monitor for its own sake or who wish to write machine language ... -
ITS Status Report
(1972-04-01)ITS is a time-shared operating system designed for the Artificial Intelligence Laboratory DEC PDP-10/PDP-6 installation and tailored to its special requirements. This status report described the design philosophy behind ... -
The J%JOIN Package
(MIT Artificial Intelligence Laboratory, 1971-04-02)The J%JOIN program creates links between the elements of a set of line segments on the basis of their geometric proximity. According to the value of the third argument, (T or NIL), the program will either place a set of ... -
Javari: Adding Reference Immutability to Java
(2006-09-05)This paper describes a programming language, Javari, that is capable of expressing and enforcing immutability constraints. The specific constraint expressed is that the abstract state of the object to which an immutable ... -
Jenga: Harnessing Heterogeneous Memories through Reconfigurable Cache Hierarchies
(2015-12-19)Conventional memory systems are organized as a rigid hierarchy, with multiple levels of progressively larger and slower memories. Hierarchy allows a simple, fixed design to benefit a wide range of applications, because ... -
Jigsaw: Scalable Software-Defined Caches (Extended Version)
(2013-09-01)Shared last-level caches, widely used in chip-multiprocessors (CMPs), face two fundamental limitations. First, the latency and energy of shared caches degrade as the system scales up. Second, when multiple workloads share ... -
jMWE v1.0.0
(2011)jMWE is a Java library for constructing and testing Multi-Word Expression detectors. The library has three main facilities: (1) a detector API, (2) a MWE index facility, and (3) a test harness. This is version 1.0.0 of the ... -
Jokes and the Logic of the Cognitive Unconscious
(1980-11-01)Freud's theory of jokes explains how they overcome the mental "censors" that make it hard for us to think "forbidden" thoughts. But his theory did not work so well for humorous nonsense as for other comical subjects. ... -
Jordan Form of (i+j over j) over Z[subscript p]
(MIT Artificial Intelligence Laboratory, 1985-07)The Jordan Form over field Z[subscript p] of J[superscript p][subscript p]n is diagonal for p > 3 with characteristic polynomial, ϕ(x) = x[superscript 3] - 1, for p prime, n natural number. These matrices have dimension ... -
Justified Generalization: Acquiring Procedures from Examples
(1985-01-01)This thesis describes an implemented system called NODDY for acquiring procedures from examples presented by a teacher. Acquiring procedures form examples involves several different generalization tasks. Generalization ... -
K+1 Heads are Better Than K
(1976-09)There are languages which can be recognized by a deterministic (k+1)-headed one-way finite automaton but which cannot be recognized by a k-headed one-way (deterministic or non-deterministic) finite automaton. Furthermore, ... -
K-Lines: A Theory of Memory
(1979-06-01)Most theories of memory suggest that when we learn or memorize something, some "representation" of that something is constructed, stored and later retrieved. This raises questions like: How is information represented? ... -
KAM: Automatic Planning and Interpretation of Numerical Experiments Using Geometrical Methods
(1989-08-01)KAM is a computer program that can automatically plan, monitor, and interpret numerical experiments with Hamiltonian systems with two degrees of freedom. The program has recently helped solve an open problem in ... -
KBEmacs: A Step Toward the Programmer's Apprentice
(1985-05-01)The Knowledge-Based Editor in Emacs (KBEmacs) is the current demonstration system implemented as part of the Programmer's Apprentice project. KBEmacs is capable of acting as a semi-expert assistant to a person who is ... -
Keeping Mobile Robots Connected
(2009-06-17)Designing robust algorithms for mobile agents with reliable communication is difficult due to the distributed nature of computation, in mobile ad hoc networks (MANETs) the matter is exacerbated by the need to ensure ...
