| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 17
reviews
|
|
|
 |
|
|
|
|
Robust variations of interpolation search
Louchard G. (ed) Computing 46(3): 193-222, 1991. Type: Article
The performance of algorithms to locate a record in a static, ordered file depends on the statistical distribution from which the keys are drawn. The classical interpolation search under uniform distribution has an O (
|
Sep 1 1993 |
|
|
|
|
|
|
Invariant-based verification of a distributed deadlock detection algorithm
Kshemkalyani A., Singhal M. (ed) IEEE Transactions on Software Engineering 17(9): 789-799, 1991. Type: Article
Proving the correctness of distributed deadlock detection algorithms (DDDAs) is difficult. Most previous works on DDDAs have either not provided a proof of correctness, provided only informal or intuitive arguments for correctness, or ...
|
May 1 1993 |
|
|
|
|
|
|
Simple local search problems that are hard to solve
Schäffer A., Yannakakis M. SIAM Journal on Computing 20(1): 56-87, 1991. Type: Article
The study of the complexity of finding locally optimal solutions to NP-hard search problems has led to the definition of a new class of problems by Johnson et al. [1]. This class, called polynomial local search (PLS), contains t...
|
Jan 1 1992 |
|
|
|
|
|
|
Expressions for Completely and Partly Unsuccessful Batched Search of Sequential and Tree-Structured Files
Manolopoulos Y., Kollias J. IEEE Transactions on Software Engineering 15(6): 794-799, 1989. Type: Article
The paper investigates the problem of estimating the number of block accesses from secondary storage needed to satisfy k queries as a batch, based on either primary or secondary key values. Previous investigations of this...
|
Aug 1 1990 |
|
|
|
|
|
|
On the path length of binary trees
Klein R., Wood D. Journal of the ACM 36(2): 280-289, 1989. Type: Article
The path length of a search tree is an important cost measure for the analysis of search operations performed on the tree. More specifically, given an extended binary tree T of weight N (the number of external nodes), the...
|
Jan 1 1990 |
|
|
|
|
|
|
Verifiable implementation of geometric algorithms using finite precision arithmetic
Milenkovic V. Artificial Intelligence 37(1-3): 377-401, 1988. Type: Article
Finite-precision implementation of a proven geometric algorithm may not have the capability to exactly match the behavior of an implementation based on infinite-precision arithmetic because of the round-off error. To handle this proble...
|
Dec 1 1989 |
|
|
|
|
|
|
A unifying approach to evaluating block accesses in database organizations
Ciaccia P., Maio D., Tiberio P. Information Processing Letters 28(5): 253-257, 1988. Type: Article
Let n records of a file be randomly distributed among m blocks of equal size (1 ≤9Tm ≤9Tn). The authors show that if k of these n records are selected randomly, then the discrete ...
|
Jun 1 1989 |
|
|
|
|
|
|
Transitive closures of fuzzy thesauri for information-retrieval systems
Bezdek J. (ed), Biswas G., Huang L. International Journal of Man-Machine Studies 25(3): 343-356, 1986. Type: Article
The mathematical notion of a fuzzy relation is adopted as a basis for developing a thesaurus to be used in the context of document retrieval systems. Specifically, given a set, T, of document descriptors, two fuzzy relati...
|
Jun 1 1988 |
|
|
|
|
|
|
Introduction to data management & file design
Walter R., Reston Publishing Co., Reston, VA, 1986. Type: Book (9789780835932455)
The book provides an elementary, but comprehensive, treatment of concepts and techniques pertaining to data organization and file processing. Specifically topics such as data storage systems, data representations, file structures, acce...
|
Sep 1 1987 |
|
|
|
|
|
|
An adaptation of a root finding method to searching ordered disk files
Armenakis A., Garey L., Gupta R. BIT 25(4): 562-568, 1985. Type: Article
Three methods of locating a record in a static, ordered file are compared under different assumptions about the statistical distribution from which the keys are drawn. The methods, specifically, are the interpolation search by Perl et ...
|
Mar 1 1987 |
|
|
|
|
|
| |
|
|
| |
|
|
