- OpenBU
- →
- College of Arts and Sciences
- →
- Computer Science
- →
- CAS: Computer Science: Technical Reports
- →
- Browsing CAS: Computer Science: Technical Reports by Issue Date
JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing CAS: Computer Science: Technical Reports by Issue Date
Now showing items 1-20 of 477
-
(Boston University Computer Science Department, 1993)We investigate the efficient learnability of unions of k rectangles in the discrete plane (1,...,n)[2] with equivalence and membership queries. We exhibit a learning algorithm that learns any union of k rectangles with ...
-
(Boston University Computer Science Department, 1993)
-
(Boston University Computer Science Department, 1993-01-27)In this paper, we propose a new class of Concurrency Control Algorithms that is especially suited for real-time database applications. Our approach relies on the use of (potentially) redundant computations to ensure that ...
-
(Boston University Computer Science Department, 1993-02-05)Speculative Concurrency Control (SCC) [Best92a] is a new concurrency control approach especially suited for real-time database applications. It relies on the use of redundancy to ensure that serializable schedules are ...
-
(Boston University Computer Science Department, 1993-02-21)Quadsim is an intermediate code simulator. It allows you to "run" programs that your compiler generates in intermediate code format. Its user interface is similar to most debuggers in that you can step through your program, ...
-
(Boston University Computer Science Department, 1993-04)The proliferation of inexpensive workstations and networks has prompted several researchers to use such distributed systems for parallel computing. Attempts have been made to offer a shared-memory programming model on such ...
-
(Boston University Computer Science Department, 1993-06-04)Coherent shared memory is a convenient, but inefficient, method of inter-process communication for parallel programs. By contrast, message passing can be less convenient, but more efficient. To get the benefits of both ...
-
(Boston University Computer Science Department, 1993-06-04)Parallel computing on a network of workstations can saturate the communication network, leading to excessive message delays and consequently poor application performance. We examine empirically the consequences of integrating ...
-
(Boston University Computer Science Department, 1993-07-31)This paper presents a lower-bound result on the computational power of a genetic algorithm in the context of combinatorial optimization. We describe a new genetic algorithm, the merged genetic algorithm, and prove that for ...
-
(Boston University Computer Science Department, 1993-08)We give an explicit and easy-to-verify characterization for subsets in finite total orders (infinitely many of them in general) to be uniformly definable by a first-order formula. From this characterization we derive ...
-
(Boston University Computer Science Department, 1993-08-01)We consider the problems of typability[1] and type checking[2] in the Girard/Reynolds second-order polymorphic typed λ-calculus, for which we use the short name "System F" and which we use in the "Curry style" where types ...
-
(Boston University Computer Science Department, 1993-08-11)We prove that first order logic is strictly weaker than fixed point logic over every infinite classes of finite ordered structures with unary relations: Over these classes there is always an inductive unary relation which ...
-
(Boston University Computer Science Department, 1993-10)Predictability - the ability to foretell that an implementation will not violate a set of specified reliability and timeliness requirements - is a crucial, highly desirable property of responsive embedded systems. This ...
-
(Boston University Computer Science Department, 1993-10-26)We describe a GB parser implemented along the lines of those written by Fong [4] and Dorr [2]. The phrase structure recovery component is an implementation of Tomita's generalized LR parsing algorithm (described in [10]), ...
-
(Boston University Computer Science Department, 1993-10-27)This paper presents an algorithm which extends the relatively new notion of speculative concurrency control by delaying the commitment of transactions, thus allowing other conflicting transactions to continue execution and ...
-
(Boston University Computer Science Department, 1993-11)This paper investigates the power of genetic algorithms at solving the MAX-CLIQUE problem. We measure the performance of a standard genetic algorithm on an elementary set of problem instances consisting of embedded cliques ...
-
(Boston University Computer Science Department, 1993-12)We investigate the problem of learning disjunctions of counting functions, which are general cases of parity and modulo functions, with equivalence and membership queries. We prove that, for any prime number p, the class ...
-
(Boston University Computer Science Department, 1993-12)This paper describes a prototype implementation of a Distributed File System (DFS) based on the Adaptive Information Dispersal Algorithm (AIDA). Using AIDA, a file block is encoded and dispersed into smaller blocks stored ...
-
(Boston University Department of Computer Science, 1993-12-01)We study the problem of type inference for a family of polymorphic type disciplines containing the power of Core-ML. This family comprises all levels of the stratification of the second-order lambda-calculus by "rank" of ...
-
(Boston University Computer Science Department, 1993-12-20)Various restrictions on the terms allowed for substitution give rise to different cases of semi-unification. Semi-unification on finite and regular terms has already been considered in the literature. We introduce a general ...
Now showing items 1-20 of 477
