Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title
Now showing items 1600-1619 of 3804
-
Importance Sampling for Reinforcement Learning with Multiple Objectives
(2001-08-01)This thesis considers three complications that arise from applying reinforcement learning to a real-world application. In the process of using reinforcement learning to build an adaptive electronic market-maker, we find ... -
Impossibility of boosting distributed service resilience
(2005-02-25)We prove two theorems saying that no distributed system in whichprocesses coordinate using reliable registers and f-resilient servicescan solve the consensus problem in the presence of f+1 undetectableprocess stopping ... -
Impossibility of Distributed Consensus with One Faulty Process*atio
(1982-09)The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. We show that every protocol for this problem has ... -
Improved Bounds on the Costs of Optimal and Balanced Binary Search Trees
(1975-11)A binary search tree can be used to store data in a computer system for retrieval by name. Different elements in the tree may be referenced with different probabilities. If we define the cost of the tree as the average ... -
Improved Caching Strategies for Publish/Subscribe Internet Networking
(2015-01-31)The systemic structure of TCP/IP is outdated; a new scheme for data transportation is needed in order to make the internet more adaptive to modern demands of mobility, information-driven demand, ever-increasing quantity ... -
An Improved Overlap Argument for On-line Multiplication
(1974-01)A lower bound of cN1ogN is proved for the mean time complexity of an on-line multitape Turing machine performing the multiplication of N-digit binary integers. For a more general class of machines the corresponding bound ... -
An Improved Proof of the Rabin-Harmanis-Stearns Conjecture
(1979-01)We offer an improved presentation of Aanderaa's constructive proof of the Rabin-Hartmanis-Stearns conjecture: For all k≥2, there exists a language Lk such that Lk can be recoginzed by a k-worktape real time Turing machine ... -
Improvements of Yao's Results on Parity Circuits
(1985-09) -
Improving 802.11 Range with Forward Error Correction
(2005-02-24)The ISO/IEC 8802-11:1999(E) specification uses a 32-bit CRC for error detection and whole-packet retransmissions for recovery. In long-distance orhigh-interference links where the probability of a bit error is high,this ... -
Improving Application-level Network Services with Regions
(2003-05)The underlying premise of the Region Project is that the concept of a region should be a new architecture capability in networking. A region is an entity that encapsulates and implements scoping, grouping, subdividing, and ... -
Improving Information Storage Reliability Using a Data Network
(1976-10)Backup and recovery methods using magnetic tapes are common in computer utilities, since information stored on-line is subject to damage. The serial access nature of the tape medium severely restricts the flexibility and ... -
Improving Multi-class Text Classification with Naive Bayes
(2001-09-01)There are numerous text documents available in electronic form. More and more are becoming available every day. Such documents represent a massive amount of information that is easily accessible. Seeking value in this huge ... -
Improving Multiclass Text Classification with the Support Vector Machine
(2001-10-16)We compare Naive Bayes and Support Vector Machines on the task of multiclass text classification. Using a variety of approaches to combine the underlying binary classifiers, we find that SVMs substantially outperform Naive ... -
Incomprehensible Computer Systems: Knowledge Without Wisdom
(1980-01)An analysis of the incomprehensibility of large, complex computer systems is made. The thesis is that there is a strong relationship between system incomprehensibility and the necessity to trust computer systems. A cogent ... -
Incorporating MIDAS Routines into PDP-6 LISP
(1967-03-01)Some PDP6 LISP users have felt a need for a way to incorporate MIDAS subroutines into LISP. LISP has been changed to let you do this, using files found on the LISP SYSTEM microtape. You write a routine for LISP in much the ... -
Increasing Cross-Domain Call Batching Using Promises and Batched Control Structures
(1995-06)In a client-server system, it may be possible for the client to corrupt server data through unsafe access methods or programming error. A common method for protecting the server data is to separate the client and server ... -
The Incremental Garbage Collection of Processes
(MIT Artificial Intelligence Laboratory, 1977-06)This paper investigates some problems associated with an argument evaluation order that we call "future" order, which is different from both call-by-name and call-by-value. In call-by-future, each formal parameter of a ... -
The Incremental Garbage Collection Processes
(1977-12-01)This paper investigates some problems associated with an expression evaluation order that we call "future" order, which is different from call-by-name, call-by-value, and call-by-need. In future order evaluation, an ... -
Incremental Multiset Hash Functions and their Application to Memory Integrity Checking
(2003-05)We introduce a new cryptographic tool: multiset hash functions. Unlike standard hash functions which take strings as input, multiset hash functions operate on multisets (or sets). They map multisets of arbitrary finite ...
