Analysis of an approximation algorithm for scheduling indepentent parallel tasks.
Li, Keqin (1999)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Erratum to the paper 'On the Kaczmarz algorithm of approximation in infinite-dimensional spaces' (Studia Math. 148 (2001), 75-86)”
Analysis of an approximation algorithm for scheduling indepentent parallel tasks.
Algorithm 10. Determination of the best polynomial in the sense of uniform approximation by the second algorithm of Remez
S. Paszkowski (1971)
Applicationes Mathematicae
Similarity:
An Algorithm for Segment Approximation.
H. Strauß, G. Nürnberger, M. Sommer (1986)
Numerische Mathematik
Similarity:
DCR2: An Improved Algorithm for l¶ Rational Approximation on Intervals.
D. Belogus, N. Liron (1978/79)
Numerische Mathematik
Similarity:
Approximation Results Toward Nearest Neighbor Heuristic
Jérôme Monnot (2002)
The Yugoslav Journal of Operations Research
Similarity:
Implementation of the gmr algorithm for large symmetric eigenproblems
J. Kuczyński (1988)
Applicationes Mathematicae
Similarity:
A discrete approximation of the Weber problem with Euclidean distance
J. Kacprzyk, W. Stańczak (1984)
Applicationes Mathematicae
Similarity:
Algorithms. 47. ALPHA CHISQ. An algorithm for the chi-square test without application of critial values
Zdeněk Režný, Josef Jirkovský (1983)
Aplikace matematiky
Similarity:
Remarks on algorithm 3
Z. Cylkowski, J. Kucharczyk (1970)
Applicationes Mathematicae
Similarity:
Remarks on algorithm 32
Anna Bartkowiak (1975)
Applicationes Mathematicae
Similarity:
Algorithm 61. The solution of a certain linear equation system
Z. Kasperski (1978)
Applicationes Mathematicae
Similarity:
Algorithm 24. One-dimensional knapsack function
J. Kucharczyk (1973)
Applicationes Mathematicae
Similarity: