Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title
Now showing items 1058-1077 of 3804
-
Efficient Modeling for Short Channel MOS Circuit Cimulation
(1982-08)Existing circuit models for short-channel MOS transistors represent a compromise between speed and ease of use. Empirical models are very fast to evaluate, but their parameters must be fitted from experimental measurements. ... -
Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
(2008-03-06)When controlling dynamic systems such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster by taking a more challenging path. This paper ... -
Efficient Object Recognition and Image Retrieval for Large-Scale Applications
(2008-05-06)Algorithms for recognition and retrieval tasks generally call for both speed and accuracy. When scaling up to very large applications, however, we encounter additional significant requirements: adaptability and scalability. ... -
Efficient Parallel Algorithms for (_+1)-coloring and Maximal Indepdendent Set Problems
(1987-01)We describe an efficient technique for breaking symmetry in paralle. The technique works especially well on rooted trees and on graphs with a small maximum degree. In particular, we can find a maximal independent set on a ... -
Efficient POMDP Forward Search by Predicting the Posterior Belief Distribution
(2009-09-23)Online, forward-search techniques have demonstrated promising results for solving problems in partially observable environments. These techniques depend on the ability to efficiently search and evaluate the set of beliefs ... -
Efficient Scheduling of Tasks Without Full Use of Processor Resources
(1979-01)The nonpreemptive scheduling of a partially ordered set of tasks on a machine with m processors of different speeds is studied. Heuristics are presented which benefit from selective non-use of slow processors. The performance ... -
Efficient Specification-Assisted Error Localization and Correction
(2003-11-13)We present a new error localization tool, Archie, that accepts aspecification of key data structure consistency constraints, then generatesan algorithm that checks if the data structures satisfy theconstraints. We also ... -
Efficient View-Dependent Sampling of Visual Hulls
(2002-02)In this paper we present an efficient algorithm for sampling visual hulls. Our algorithm computers exact points and normals on the surface of visual hull instead of a more traditional volumetric representation. The main ... -
An Efficient Virtual Network Interface in the Fugu Scalable Workstation
(1998-01)A scalable workstation is one vision of a mainstream parallel computer: a machine that combines scalable, fine-grain communication facilities for parallel applications with virtual memory and pre-emptive multiprogramming ... -
An Efficient Visual Hull Computation Algorithm
(2002-02)In this paper we describe an efficient algorithm for computing the visual hull of an object. This problem is equivalent to computing the intersection of generalized cones. The naïve visual hull computation algorithm requires ... -
Efficient Web Browsing for Mobile Clients using HTTP Compression
(2003-01)Efficient web browsing on mobile computers presents a unique challenge. These machines are different from other classes of client computers since they have relatively low-bandwidth connections and they are battery-powered ... -
Efficient, Verifiable Binary Sandboxing for a CISC Architecture
(2005-05-02)Executing untrusted code while preserving security requiresenforcement of memory and control-flow safety policies:untrusted code must be prevented from modifying memory orexecuting code except as explicitly allowed. ... -
Efficiently Solving Repeated Integer Linear Programming Problems by Learning Solutions of Similar Linear Programming Problems using Boosting Trees
(2015-01-21)It is challenging to obtain online solutions of large-scale integer linear programming (ILP) problems that occur frequently in slightly different forms during planning for autonomous systems. We refer to such ILP problems ... -
The EIGHT Manual: A System for Geometric Modelling and Three-Dimensional Graphics on the Lisp Machine
(MIT Artificial Intelligence Laboratory, 1984-08)We describe a simple geometric modelling system called Eight which supports interactive creation, editing, and display of three-dimensional polyhedral solids. Perspective views of a polyhedral environment may be generated, ... -
Elastic-Net Regularization in Learning Theory
(2008-07-24)Within the framework of statistical learning theory we analyze in detail the so-called elastic-net regularization scheme proposed by Zou and Hastie ["Regularization and variable selection via the elastic net" J. R. Stat. ... -
Electing a Leader in a Synchronous Ring
(1985-07)We consider the problem of electing a leader in a synchronous ring of n processors. We obtain both positive and negative results. One the one hand, we show that if processor ID's are chosen from some countable set, then ... -
Electrical Design: A Problem for Artificial Intelligence Research
(1977-06-01)This report outlines the problem of intelligent failure recovery in a problem-solver for electrical design. We want our problem solver to learn as much as it can from its mistakes. Thus we cast the engineering design ... -
Electronic Cash with Blind Deposits: How to Have No Spare Change
(2003-10-14)Electronic cash schemes in which the bank authenticates many coins at once suffer from the problem that coins that are authenticated together can be linked to one another. Unfortunately, unless a user spends coins in a ... -
An Electronic Market-Maker
(2001-04-17)This paper presents an adaptive learning model for market-making under the reinforcement learning framework. Reinforcement learning is a learning technique in which agents aim to maximize the long-term accumulated rewards. ...