Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title
Now showing items 1289-1308 of 3804
-
The FINDSPACE Problem
(1973-03-01)The FINDSPACE problem is that of establishing a volume in space where an object of specified dimensions will fit. The problem seems to have two subproblems: the hypothesis generation problem of finding a likely spot to ... -
Fine Grained Robotics
(MIT Artificial Intelligence Laboratory, 1991-02)Fine grained robotics is the idea of solving problems utilizing multitudes of very simple machines in place of one large complex entity. Organized in the proper way, simple machines and simple behaviors can lead to emergent ... -
Fine-Grain Dynamic Leakage Reduction
(2002-01) -
Fine-Grained Control of Java Applets Using a Simple Constraint Language
(1997-06)The use of the internet has increased extensively with a growing number of inexperienced users surfing the Web. Lurking in Web pages, Java applets are automatically executed on users' machines. As a result, popular Web ... -
Fine-Grained Failover Using Connection Migration
(2000-11)This paper presents a set of techniques for providing fine-grained failover of long-running connections across a distributed collection of replica servers, and is especially useful for fault-tolerant and load-balanced ... -
Fingerprints Theorems for Zero-Crossings
(1983-10-01)We prove that the scale map of the zero-crossings of almost all signals filtered by the second derivative of a gaussian of variable size determines the signal uniquely, up to a constant scaling and a harmonic function. ... -
Finite Horizon Control Design for Optimal Discrimination between Several Models
(2006-02-28)Multiple-Model fault detection is a powerful method for detecting changes, such as faults, in dynamic systems. In many cases, the ability of such a detection scheme to distinguish between possible models for the system ... -
Finite Tree Automata and W-Automata
(1972-09)Chapter I is a survey of finite automata as acceptors of finite labeled trees. Chapter II is a survey of finite automata as acceptors of infinite strings on a finite alphabet. Among the automata models considered in ... -
First Class Copy & Paste
(2006-05-22)The Subtext project seeks to make programming fundamentally easier by altering the nature of programming languages and tools. This paper defines an operational semantics for an essential subset of the Subtext language. It ... -
First Version of a Data Flow Procedure Language
(1975-05)A language for representing computational procedures based on the concept of data flow is presented in terms of a semantic model that permits concurrent execution of noninterfering program parts. Procedures in the language ... -
Fixed Parameter Algorithms for Minor-Closed Graphs (of Locally Bounded Treewidth)
(2003-06)Frick and Grohe showed that for each property phi that is definable in first-order logic, and for each class of minor-closed graphs of locally bounded treewidth, there is an O(n^(1+epsilon))-time algorithm deciding whether ... -
Flavors: Message Passing in the Lisp Machine
(1980-11-01)The object oriented programming style used in the Smalltalk and Actor languages is available in Lisp Machine Lisp, and used by the Lisp Machine software system. It is used to perform generic operations on objects. Part ... -
Fleets: Scalable Services in a Factored Operating System
(2011-03-09)Current monolithic operating systems are designed for uniprocessor systems, and their architecture reflects this. The rise of multicore and cloud computing is drastically changing the tradeoffs in operating system design. ... -
Flexibility and Efficiency in a Computer Program for Designing Circuits
(1977-06-01)This report is concerned with the problem of achieving flexibility (additivity, modularity) and efficiency (performance, expertise) simultaneously in one AI program. It deals with the domain of elementary electronic circuit ... -
Flexible Execution of Plans with Choice and Uncertainty
(2011-01-15)Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties, while improving robustness and reducing the need for an overly conservative plan. Executives have improved robustness by expanding ... -
Flexible MIPS Soft Processor Architecture
(2008-06-16)The flexible MIPS soft processor architecture borrows selected technologies from high-performance computing to deliver a modular, highly customizable CPU targeted towards FPGA implementations for embedded systems; the ... -
FLIP - A Format List Processor
(1967-07-01)This memo describes a notion of programming language for expressing, from within a LISP system, string manipulation such as those performed in COMIT. The COMIT formalism has been extended in several ways: the patterns (the ... -
Flowtune: Flowlet Control for Datacenter Networks
(2016-08-15)Rapid convergence to a desired allocation of network resources to endpoint traffic has been a long-standing challenge for packet-switched networks. The reason for this is that congestion control decisions are distributed ... -
Floyd-Hoare Logic Defines Semantics
(1986-05)The first-order patrial correctness assertions provable in Floyd-Hoare logic about an uninterpreted while-program scheme determine the scheme up to equivalence. This settles an open problem of Meyer and Halpern. The simple ... -
Floyd-Hoare Verifiers "Considered Harmful"
(1978-01-01)The Floyd-Hoare methodology completely dominates the field of program verification and has contributed much to our understanding of how programs might be analyzed. Useful but limited verifiers have been developed using ...
