| |
 |
|
|
Mirsepassi, Taghi
Ass. Gen. Tech. CO., IN.
Claremont, California
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 30
reviews
|
|
|
|
|
|
|
|
A software engineering perspective on algorithmics
Weihe K. ACM Computing Surveys 33(1): 89-134, 2001. Type: Article
The author first discusses the inadequacies of present-day methods of specifying the performance requirements of an algorithm component, specifically, the vagueness of the criteria established by “maintainability” a...
|
Nov 1 2001 |
|
|
|
|
|
|
A simple method for generating gamma variables
Marsaglia G., Tsang W. ACM Transactions on Mathematical Software 26(3): 363-372, 2000. Type: Article
An algorithm is presented for generating samples of a gamma distribution with a predefined parameter. Two samples, one from a normal distribution and one from a uniform distribution, are required to generate each sample. The algorithm ...
|
Apr 1 2001 |
|
|
|
|
|
|
Modelling and computation for applications in mathematics, science, and engineering
Jerome J. Oxford University Press, Oxford, UK, 1998. Type: Divisible Book
The nine chapters that make up this book are independent of each other. The authors of each chapter, after providing a comprehensive introduction to its subject, discuss the model, algorithms, and computation results presented, then pr...
|
Aug 1 2000 |
|
|
|
|
|
|
Recent advances on determining the number of real roots of parametric polynomials
Yang L. Journal of Symbolic Computation 28(1-2): 225-242, 1999. Type: Article
Yang presents an algorithm for the complete root classification of a polynomial in terms of its symbolic coefficients. In certain aspects, the method employed here is similar to that of Arnon [1]. However, while Arnon’s work ...
|
Feb 1 2000 |
|
|
|
|
|
|
Solving difference equations in finite terms
Hendricks P., Singer M. Journal of Symbolic Computation 27(3): 239-259, 1999. Type: Article
A continuation of existing work onhypergeometric solutions of difference equationswith rational function coefficients is presented. Thealgorithm developed here generalizes the algorithms presented by variousauthors in conjunction with ...
|
Oct 1 1999 |
|
|
|
|
|
|
Towards a polynomial-time randomized algorithm for closed product-form networks
Chen W., O’Cinneide C. ACM Transactions on Modeling and Computer Simulation 8(3): 227-253, 1998. Type: Article
A computational approach to evaluating the performance of a queueing network is presented. The particular queueing configuration considered in this paper is one in which the queueing network can be expressed by a product of the states ...
|
Jun 1 1999 |
|
|
|
|
|
|
A rational approach to the Prelle-Singer algorithm
Man Y., Maccallum M. Journal of Symbolic Computation 24(1): 31-43, 1997. Type: Article
A new approach is presented to the problem of finding elementary first integrals of two-dimensional polynomial vector fields. The conventional method used at present for solving this problem is based on the Prelle-Singer procedure [1],...
|
Apr 1 1999 |
|
|
|
|
|
|
Computing Sylow subgroups in permutation groups
Cannon J. (ed), Cox B., Holt D. Journal of Symbolic Computation 24(3-4): 303-316, 1997. Type: Article
The authors have used a wide variety of examples to demonstrate the effectiveness of new algorithms for the computation of Sylow subgroups. The effectiveness of these algorithms makes it possible to compute Sylow functions for consider...
|
Nov 1 1998 |
|
|
|
|
|
|
A posteriori error control in radiative transfer
Führer C., Kanschat G. Computing 58(4): 317-334, 1997. Type: Article
An improved finite element technique for modeling and related computations of radiative transfer phenomena is presented. The improvement is accomplished by modifying the finite element grid size and evaluating a concurrent, a posterior...
|
May 1 1998 |
|
|
|
|
|
|
Efficient enumeration of all minimal separators in a graph
Shen H., Liang W. Theoretical Computer Science 180(1-2): 169-180, 1997. Type: Article
Graph theory has numerous practical applications in network analysis, reliability models, and operations research. This paper deals with the decomposition of connected graphs. Using several lemmas and two essential theorems, the author...
|
Dec 1 1997 |
|
|
|
|
|
| |
|
|
| |
|
|
