Search
Now showing items 831-840 of 4210
Set Interfaces for Generalized Typestate and Data Structure Consistency Verification
(2007-10-31)
Typestate systems allow the type of an object to change during its lifetime in the computation. Unlike standard type systems, they can enforce safety properties that depend on changing object states. We present a new, ...
Collusion-Resilient Revenue In Combinatorial Auctions
(2007-11-02)
In auctions of a single good, the second-price mechanism achieves, in dominantstrategies, a revenue benchmark that is naturally high and resilient to anypossible collusion.We show how to achieve, to the maximum extent ...
Fast Self-Healing Gradients
(2008-03)
We present CRF-Gradient, a self-healing gradient algorithm that provably reconfigures in O(diameter) time. Self-healing gradients are a frequently used building block for distributed self-healing systems, but previous ...
ReCrash: Making Crashes Reproducible
(2007-11-20)
It is difficult to fix a problem without being able to reproduce it.However, reproducing a problem is often difficult and time-consuming.This paper proposes a novel algorithm, ReCrash, that generatesmultiple unit tests ...
MIXIT: The Network Meets the Wireless Channel
(2007-09-04)
The traditional contract between the network and the lower layers states that the network does routing and the lower layers deliver correct packets. In a wireless network, however, different nodes may hear most bits in a ...
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. ...
Relational Envelope-based Planning
(2007-12-31)
This thesis proposes a synthesis of logic and probability for solving stochastic sequential decision-making problems. We address two main questions: How can we take advantage of logical structure to speed up planning in a ...
An Application of Line-labeling and other Scene-analysis Techniques to the Problem of Hidden-line Removal
(MIT Artificial Intelligence Laboratory, 1974-03)
The problem of hidden-line drawings of scenes composed of opaque polyhedra is considered. The use of Huffnan labeling is suggested as a method if simplifying the task and increasing its intuitive appeal. The relation between ...
Advice on the Fast-paced World of Electronics
(MIT Artificial Intelligence Laboratory, 1974-05)
This paper is a reprint of a sketch of an electronic-circuit-designing program, submitted a a Ph.D. proposal. It describes the electronic design problem with respect to the classic trade-off between expertise and generality. ...
Kinematics of the MIT-AI-VICARM Manipulator
(MIT Artificial Intelligence Laboratory, 1974-05)
This paper describes the basic geometry of the electric manipulator designed for the Artificial Intelligence Laboratory by Victor Scheinman while on leave from Stanford University. The procedure for finding a set of joint ...