Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title
Now showing items 828-847 of 3804
-
Dealers, Insiders and Bandits: Learning and its Effects on Market Outcomes
(2006-07-12)This thesis seeks to contribute to the understanding of markets populated by boundedly rational agents who learn from experience. Bounded rationality and learning have both been the focus of much research in computer ... -
Debugging Distributed Computations in a Nest Atomic Action System
(1984-12)Concurrent and distributed programs are hard to debug. In this thesis, we argue that structuring activities as nested atomic actions can make debugging such programs much like debugging traditional sequential programs. ... -
Debugging Multithreaded Programs that Incorporate User-Level Locking
(1998-05)A multithreaded program with a bug may behave nondeterministically, and this nondeterminism typically makes the bug hard to localize. This thesis presents a debugging tool, the Nondeterminator-2, which automatically finds ... -
Debunking the 'Expensive Procedure Call' Myth, or, Procedure Call Implementations Considered Harmful, or, Lambda: The Ultimate GOTO
(1977-10-01)Folklore states that GOTO statements are 'cheap', while procedure calls are 'expensive'. This myth is largely a result of poorly designed language implementations. The historical growth of this myth is considered. Both ... -
Decentralized Channel Management in Scalable Multihop Spread-Spectrum Packet Radio Networks
(1995-07)This thesis addresses the problems of managing the transmissions of stations in a spread-spectrum packet ratio network so that the system can remain effective when scaled to millions of nodes concentrated in a metropolitan ... -
Decidability of Equivalence for a Class of Data Flow Schemas
(1975-03)In this paper we examine a class of computation schemas and consider the problem of deciding when pairs of elements in this class represent equivalent programs. We are able to show that equivalence is decidable for a ... -
Decidability Questions for Petri Nets
(1976-06)An understanding of the mathematical properties of Petri Nets is essential when one wishes to use Petri Nets as an abstract model for concurrent systems. The decidability of various problems which arise in this context ... -
A Decidability Result for a Second Order Process Logic
(1978-09)We prove the decidability of the validity problem for a rather general language for talking about computations. As corollaries of our result, we obtain some decidability results of Pratt, Constable, Fischer-Ladner, and ... -
Decision Problems for Petri Nets and Vector Addition Systems
(1975-03)Petri Nets, Generalized Petri Nets, and Vector Addition Systems can represent each other and thus have common decideability problems. The graphical appeal of Petri Nets is used in a new presentation of the classical problems ... -
A Decision Procedure for the First Order Theory of Real Addition with Order
(1973-05)Consider the first order theory of the real numbers with the predicates + (plus) and < (less than). Let S be the set of true sentences. We first present an elimination of quantifiers decision procedure for S, and then ... -
Decision Representation Language (DRL) and Its Support Environment
(MIT Artificial Intelligence Laboratory, 1989-08)In this report, I describe a language, called Decision Representation Language (DRL), for representing the qualitative aspects of decision making processes such as the alternatives being evaluated, goals to satisfy, and ... -
Decision Uncertainty Minimization and Autonomous Information Gathering
(2013-08-22)Over the past several decades, technologies for remote sensing and exploration have be- come increasingly powerful but continue to face limitations in the areas of information gathering and analysis. These limitations ... -
Decomposing Broadcast Algorithms Using Abstract MAC Layers
(2011-02-23)In much of the theoretical literature on global broadcast algorithms for wireless networks, issues of message dissemination are considered together with issues of contention management. This combination leads to complicated ... -
Decomposition of a Visual Scene into Bodies
(1967-09-01)This memorandum describes a program which finds bodies in a scene, presumably formed by 3-dimensional objects, with some of them perhaps not completely visible. -
Decomposition of a Visual Scene into Three-Dimensional Bodies
(1969-01-01)The program described here takes as its input a collection of lines, vertices and surfaces describing a scene, and analyzes the scene into a composition of three-dimensional objects. The program does not need to know the ... -
Decoupled Sampling for Real-Time Graphics Pipelines
(2010-03-29)We propose decoupled sampling, an approach that decouples shading from visibility sampling in order to enable motion blur and depth-of-field at reduced cost. More generally, it enables extensions of modern real-time graphics ... -
The Deducibility Problem in Propositional Dynamic Logic
(1981-02)The problem of whether an arbitrary formula of Propositional Dynamic Logic (PDL) is deducible from a fixed axiom scheme of PDL is _ ]1-complete. Ths contrasts with the decidability of the problem when the axiom scheme is ... -
Deep Learning without Poor Local Minima
(2016-05-23)In this paper, we prove a conjecture published in 1989 and also partially address an open problem announced at the Conference on Learning Theory (COLT) 2015. For an expected loss function of a deep nonlinear neural network, ... -
Definability in Dynamic Logic
(1980-02)We study the expressive power of various versions of Dynamic Logic and compare them with each other as well as with standard languages in the logical literature. One version of Dynamic Logic is equivalent to the infinitary ...
