| |
 |
|
|
Lambert, Joseph
Penn State University
University Park, Pennsylvania
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 27
reviews
|
|
|
|
|
|
|
|
Optimizing a library’s loan policy: an integer programming approach
Al-Fares H. Journal of the American Society for Information Science 49(13): 1169-1176, 1998. Type: Article
The author considers a problem that was detailed in publications inthe mid-1970s. He gives an explicit new integer programming formulationand solves the model with data from a library lending database....
|
May 1 1999 |
|
|
|
|
|
|
Monotone circuits for connectivity have depth 
Goldmann M., Håstad J. SIAM Journal on Computing 27(5): 1283-1294, 1998. Type: Article
The authors consider the complexity of computing connectivity with monotone circuits with AND-gates and OR-gates of fan-in two. They model their proof on Yao’s bottom-up approach [1]....
|
Jan 1 1999 |
|
|
|
|
|
|
Planning Models for Software Reliability and Cost
Helander M., Zhao M., Ohlsson N. IEEE Transactions on Software Engineering 24(6): 420-434, 1998. Type: Article
Modeling frameworks for cost and reliability planning in software system development are described. One model included is the reliability constrained cost minimization model, for minimizing cost subject to a system reliability goal. Th...
|
Dec 1 1998 |
|
|
|
|
|
|
On updating suffix tree labels
Ferragina P., Grossi R., Montangero M. Theoretical Computer Science 201(1-2): 249-262, 1998. Type: Article
The problem of maintaining arc labels in the suffix tree data structure when string insertions and deletions take place is investigated. The authors obtain a new simple real-time algorithm that achieves worst-case bounds and requires a...
|
Oct 1 1998 |
|
|
|
|
|
|
Parameterized on-line open-end bin packing
Zhang G. Computing 60(3): 267-273, 1998. Type: Article
Zhang investigates open-end bin packing, a recent variant on bin packing in which a bin can be filled to a level exceeding its capacity by its last item if the previous item does not completely fill the bin. He exhibits lower bounds fo...
|
Sep 1 1998 |
|
|
|
|
|
|
A method of trust region type for minimizing noisy functions
Elster C., Neumaier A. Computing 58(1): 31-46, 1997. Type: Article
An algorithm to optimize a noisy function in a few variables is given. A function is considered noisy if its evaluation is imprecise due to stochastic measurement errors. The authors were working in the domain of chemical experiments, ...
|
Jun 1 1998 |
|
|
|
|
|
|
Paradigms for fast parallel approximability
Díaz J. (ed), Serna M., Spirakis P., Torán J., Cambridge University Press, New York, NY, 1997. Type: Book (9780521431705)
Recent developments in the field of parallel approximability to combinatorial optimization problems are surveyed. This monograph stems from a series of lectures given by some of the authors in 1994 and 1995. The monograph is expository...
|
Mar 1 1998 |
|
|
|
|
|
|
Approximating the number of linear extensions
Ewacha K., Rival I., Zaguia N. (ed) Theoretical Computer Science 175(2): 271-282, 1997. Type: Article
To construct a linear extension of a finite order P, choose a noncomparable pair of elements and assign it to one of the two possible comparabilities. Take the transitive closure. Repeat until there are no more nonco...
|
Dec 1 1997 |
|
|
|
|
|
|
Approximating shortest superstrings
Teng S., Yao F. SIAM Journal on Computing 26(2): 410-417, 1997. Type: Article
The shortest-superstring problem is to find the shortest string that contains every string &sgr; in a given set S as a substring. Concatenating every string &sgr; in S certainly gives a superstring that would rare...
|
Oct 1 1997 |
|
|
|
|
|
|
Algorithm 762; LLDRLF, log-likelihood and some derivatives for log-F models
Brown B., Levy L., Lovato J., Russell K., Spears F. ACM Transactions on Mathematical Software 22(3): 372-382, 1996. Type: Article
The theoretical underpinnings of Algorithm 762 are presented. The Log-F distribution is a powerful analytic tool for statisticians but is little used numerically because of difficulties in calculating log likelihoods and their derivati...
|
Jan 1 1997 |
|
|
|
|
|
| |
|
|
| |
|
|
