Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title
Now showing items 201-220 of 2625
-
Automatic Qualitative Analysis of Ordinary Differential Equations Using Piecewise Linear Approximations
(1988-03-01)This paper explores automating the qualitative analysis of physical systems. It describes a program, called PLR, that takes parameterized ordinary differential equations as input and produces a qualitative description of ...
-
Automatic Qualitative Modeling of Dynamic Physical Systems
(1993-01-01)This report describes MM, a computer program that can model a variety of mechanical and fluid systems. Given a system's structure and qualitative behavior, MM searches for models using an energy-based modeling framework. ...
-
Automatic Recognition of Tractability in Inference Relations
(1990-02-01)A procedure is given for recognizing sets of inference rules that generate polynomial time decidable inference relations. The procedure can automatically recognize the tractability of the inference rules underlying ...
-
Automatic shaping and decomposition of reward functions
(2007-02-13)This paper investigates the problem of automatically learning how torestructure the reward function of a Markov decision process so as tospeed up reinforcement learning. We begin by describing a method thatlearns a shaped ...
-
Automatic Software Upgrades for Distributed Systems
(2005-10-06)Upgrading the software of long-lived, highly-available distributedsystems is difficult. It is not possible to upgrade all the nodes in asystem at once, since some nodes may be unavailable and halting thesystem for an ...
-
Automatic Software Upgrades for Distributed Systems
(2005-11-30)Upgrading the software of long-lived, highly-available distributed systems is difficult. It is not possible to upgrade all the nodes in a system at once, since some nodes may be unavailable and halting the system for an ...
-
Automatic Software Upgrades for Distributed Systems (PhD thesis)
(2005-10-06)Upgrading the software of long-lived, highly-available distributedsystems is difficult. It is not possible to upgrade all the nodes in asystem at once, since some nodes may be unavailable and halting thesystem for an ...
-
Automatic Synthesis of Fine-Motion Strategies for Robots
(1983-12-01)The use of active compliance enables robots to carry out tasks in the presence of significant sensing and control errors. Compliant motions are quite difficult for humans to specify, however. Furthermore, robot programs ...
-
Automatic Test Factoring for Java
(2005-06-08)Test factoring creates fast, focused unit tests from slow system-widetests; each new unit test exercises only a subset of the functionalityexercised by the system test. Augmenting a test suite with factoredunit tests ...
-
Automatically Recovering Geometry and Texture from Large Sets of Calibrated Images
(1999-10-22)Three-dimensional models which contain both geometry and texture have numerous applications such as urban planning, physical simulation, and virtual environments. A major focus of computer vision (and recently graphics) ...
-
Autonomous COLREGS Modes and Velocity Functions
(2017-05-16)This paper concerns an implementation of an autonomy system for unmanned surface vessels operating in accordance with the Coast Guard Collision Regulations (COLREGS). The autonomy system is implemented by associating a ...
-
Autonomous Virtual Mobile Nodes
(2005-06-15)This paper presents a new abstraction for virtual infrastructure in mobile ad hoc networks. An AutonomousVirtual Mobile Node (AVMN) is a robust and reliable entity that is designed to cope with theinherent difficulties ...
-
Autotuning Algorithmic Choice for Input Sensitivity
(2014-06-23)Empirical autotuning is increasingly being used in many domains to achieve optimized performance in a variety of different execution environments. A daunting challenge faced by such autotuners is input sensitivity, where ...
-
Availability-Consistency Trade-Offs in a Fault-Tolerant Stream Processing System
(2004-11-22)processing. In contrast to previous techniques that handlenode failures, our approach also tolerates network failuresand network partitions. The approach is based on a principledtrade-off between consistency and availability ...
-
AvatarSAT: An Auto-tuning Boolean SAT Solver
(2009-08-26)We present AvatarSAT, a SAT solver that uses machine-learning classifiers to automatically tune the heuristics of an off-the-shelf SAT solver on a per-instance basis. The classifiers use features of both the input and ...
-
Bagging Regularizes
(2002-03-01)Intuitively, we expect that averaging --- or bagging --- different regressors with low correlation should smooth their behavior and be somewhat similar to regularization. In this note we make this intuition precise. ...
-
Bandpass Channels, Zero-Crossings, and Early Visual Information Processing
(1978-09-01)A recent advance by B.F. Logan in the theory of one octave bandpass signals may throw new light on spatial-frequency-tuned channels in early visual information processing.
-
Bargaining Between Goals
(MIT Artificial Intelligence Laboratory, 1975-01)Bargaining is a process used to modify conflicting demands on an expendable resource so that a satisfactory allocation can be made. In this paper, I consider the design of a bargaining system to handle the problem of ...
-
Basic Solid Mechanics for Tactile Sensing
(1984-03-01)In order to stably grasp objects without using object models, tactile feedback from the fingers is sometimes necessary. This feedback can be used to adjust grasping forces to prevent a part form slipping from a hand. ...
-
A Basis for a Mathematical Theory of Computation
(1962-01-01)This paper is a corrected version of the paper of the same title given at the Western Joint Computer Conference, May 1961. A tenth section discussing the relations between mathematical logic and computation has been added. ...