| |
1-10 of 65 reviews |
Date Reviewed | |
| |
Algorithms for minimum length partitions of polygons
Lingas A., Levcopoulos C., Sack J. BIT 27(4): 474-479, 1987. Type: Article
The authors present a compact description of an algorithm of time complexity O(n3m2) for finding a minimum length diagonal partition of a simple polygon into faces under two conditions: either...
|
Jun 1 1989 |
|
| |
On finding a worst-case optimal fourth normal form database decomposition
Loizou G., Thanisch P. BIT 27(2): 157-162, 1987. Type: Article
Let U = ⟨ A 1 ,..., A n ⟩ be a set of attributes and let d = ⟨ r 1 ,..., r k ⟩ be a set of relations over U<...
|
Jun 1 1989 |
|
| |
Left distance binary tree representations
Mäkinen E. BIT 27(2): 163-169, 1987. Type: Article
The paper describes a scheme for representing binary trees. Algorithms are given for enumerating the representation of a tree and for building a tree from a given representation. The author compares this scheme to one previously given ...
|
Mar 1 1989 |
|
| |
On quadratic spline interpolation
Usmani R. BIT 27(4): 615-622, 1987. Type: Article
This paper considers the classical problem of interpolating to data (xi,yi), i = 0(1)n, by means of a quadratic spline s(x) that satisfies the additional condition s
|
Nov 1 1988 |
|
| |
Efficient fourth order P-stable formulae
Thomas R. BIT 27(4): 599-614, 1987. Type: Article
A direct method for solving an initial value problem for the special differential equation y′′ = f(x,y) is P-stable if a certain norm of the approximate solution to the test problem y<...
|
Nov 1 1988 |
|
| |
The equivalence of algebraic stability and AN stability
Butcher J. BIT 27(4): 510-533, 1987. Type: Article
This paper is concerned with general linear methods and generalizes known results for Runge-Kutta and one-leg methods. The main result is that AN stability is equivalent to algebraic stability under certain restricti...
|
Oct 1 1988 |
|
| |
Sets of convergence and stability regions
Miekkala U., Nevanlinna O. BIT 27(4): 554-584, 1987. Type: Article
This is an interesting paper. The authors continue their study of the convergence of dynamic iteration methods for large systems of initial value problems. They consider the initial value problem &xdot; + A x = f , x ( 0 )...
|
Aug 1 1988 |
|
| |
Verification of a class of self-timed computational networks
Melhem R. BIT 27(4): 480-500, 1987. Type: Article
This paper stresses the importance of initial conditions for the correct operation of a network of processors. The author builds a general model of computation that has all reads of inputs followed by all computations followed by all o...
|
Aug 1 1988 |
|
| |
Parallel generation of permutations and combinations
Chen G., Chern M. BIT 26(3): 277-283, 1986. Type: Article
Given n objects, (1,2, . . . ,n), and m≤9Tn processors connected in a logical ring, an algorithm is given for generating permutations of length k ≤9Tm or less. It is shown that th...
|
Jul 1 1988 |
|
| |
Deadlock avoidance with a modified banker’s algorithm
Belik F. BIT 27(3): 290-305, 1987. Type: Article
The paper describes the Banker’s algorithm for deadlock avoidance in resource allocation systems together with a modification to the algorithm that seeks to reduce its execution time by identifying the conditions under which ...
|
May 1 1988 |
|
| |
|
|
| |
|
|
|
|
