Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title
Now showing items 500-519 of 3804
-
Coherent Behavior from Incoherent Knowledge Sources in the Automatic Synthesis of Numerical Computer Programs
(1981-01-01)A fundamental problem in artificial intelligence is obtaining coherent behavior in rule-based problem solving systems. A good quantitative measure of coherence is time behavior; a system that never, in retrospect, ... -
Coherent Reaction
(2009-06-12)Side effects are both the essence and bane of imperative programming. The programmer must carefully coordinate actions to manage their side effects upon each other. Such coordination is complex, error-prone, and fragile. ... -
Cohesion in Computer Text Generation: Lexical Substitution
(1983-05)This report describes Paul, a computer text generation system designed to create cohesive text. The device used to a achieve this cohesion is lexical substitution. Through the use of syntactic and semantic information, ... -
Collaborative Diagnosis of Over-Subscribed Temporal Plans
(2016-10-14)Over-subscription, that is, being assigned too many tasks or requirements that are too demanding, is commonly encountered in temporal planning problems. As human beings, we often want to do more than we can, ask for things ... -
Collective Choice with Uncertain Domain Moldels
(2005-08-16)When groups of individuals make choices among several alternatives, the most compelling social outcome is the Condorcet winner, namely the alternative beating all others in a pair-wise contest. Obviously the Condorcet ... -
Collision Detection for Moving Polyhedra
(1984-10-01)We consider the problem of moving a three dimensional solid object among polyhedral obstacles. The traditional formulation of configuration space for this problem uses three translational parameters and three angles ... -
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 ... -
Collusive Dominant-Strategy Truthfulness
(2011-04-22)Fifty years ago, Vickrey published his famous mechanism for auctioning a single good in limited supply. The main property of Vickrey's mechanism is efficiency in dominant strategies. In absence of collusion, this is a ... -
A Colony Architecture for an Artificial Creature
(1989-09-01)This report describes a working autonomous mobile robot whose only goal is to collect and return empty soda cans. It operates in an unmodified office environment occupied by moving people. The robot is controlled by a ... -
Color Vision and Image Intensities: When Are Changes Material?
(1981-05-01)Marr has emphasized the difficulty in understanding a biological system or its components without some idea of its goals. In this paper, a preliminary goal for color vision is proposed and analyzed. That goal is to ... -
Color Vision: Representing Material Categories
(1984-05-01)We argue that one of the early goals of color vision is to distinguish one kind of material from another. Accordingly, we show that when a pair of image regions is such that one region has greater intensity at one wavelength ... -
The Colored Ticket Algorithm
(1983-08)Upper and lower bounds are proved for shared space requirements for solution of a problem involving resource allocation among asynchronous processes. The problem is to allocate some number, k≥1, of resources, in an environment ... -
Column-associative Caches: A Technique for Reducing the Miss Rate of Direct-mapped Caches
(1993-11)Direct-mapped caches are a popular design choice for high-performance processors; unfortunately, direct-mapped caches suffer systematic interference misses when more than one address map into the same cache set. This paper ... -
Combinatorial Algorithms for the Generalized Circulation Problem
(1988-05)We consider a generalization of the maximum flow problem in which the amounts of flow entering and leaving an arc are linearly related. More precisely, if x(e) units of flow enter an arc e, x(e) ?(e) units arrive at the ... -
The Combinatorics of Heuristic Search Termination for Object Recognition in Cluttered Environments
(1989-05-01)Many recognition systems use constrained search to locate objects in cluttered environments. Earlier analysis showed that the expected search is quadratic in the number of model and data features, if all the data comes ... -
The Combinatorics of Local Constraints in Model-Based Recognition and Localization from Sparse Data
(1986-03-01)The problem of recognizing what objects are where in the workspace of a robot can be cast as one of searching for a consistent matching between sensory data elements and equivalent model elements. In principle, this ... -
The Combinatorics of Object Recognition in Cluttered Environments Using Constrained Search
(1988-02-01)When clustering techniques such as the Hough transform are used to isolate likely subspaces of the search space, empirical performance in cluttered scenes improves considerably. In this paper we establish formal bounds ... -
Combined Static and Dynamic Mutability Analysis
(2007-03-23)Knowing which method parameters may be mutated during a method's execution is useful for many software engineering tasks. We present an approach to discovering parameter immutability, in which several lightweight, scalable ... -
Combined static and dynamic mutability analysis
(2006-09-17)Knowing which method parameters may be mutated during a method'sexecution is useful for many software engineering tasks. We presentan approach to discovering parameter immutability, in which severallightweight, scalable ...
