Wang, Xi; Li, Zhiwu; Moor, Thomas SCT-based priority-free conditionally-preemptive scheduling of modular real-time systems with exact task execution time. (English) Zbl 1441.93183 Discrete Event Dyn. Syst. 29, No. 4, 501-520 (2019). MSC: 93C65 90B35 PDF BibTeX XML Cite \textit{X. Wang} et al., Discrete Event Dyn. Syst. 29, No. 4, 501--520 (2019; Zbl 1441.93183) Full Text: DOI
Nasri, Mitra; Nelissen, Geoffrey; Brandenburg, Björn B. A response-time analysis for non-preemptive job sets under global scheduling. (English) Zbl 07286766 Altmeyer, Sebastian (ed.), 30th Euromicro conference on real-time systems, ECRTS 2018, July 3rd–6th, 2018, Barcelona, Spain. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-075-0). LIPIcs – Leibniz International Proceedings in Informatics 106, Article 9, 23 p. (2018). MSC: 68M20 PDF BibTeX XML Cite \textit{M. Nasri} et al., LIPIcs -- Leibniz Int. Proc. Inform. 106, Article 9, 23 p. (2018; Zbl 07286766) Full Text: DOI
Gu, Yi; Liu, Yongping Optimal recovery of multivariate functions restricted by second-order differential operator. (English) Zbl 1393.41008 Anal. Appl., Singap. 16, No. 4, 585-599 (2018). MSC: 41A44 26D10 65D15 PDF BibTeX XML Cite \textit{Y. Gu} and \textit{Y. Liu}, Anal. Appl., Singap. 16, No. 4, 585--599 (2018; Zbl 1393.41008) Full Text: DOI
Borodachov, Sergiy Optimal recovery of three times differentiable functions on a convex polytope inscribed in a sphere. (English) Zbl 1400.41026 J. Approx. Theory 234, 51-63 (2018). Reviewer: Neha Malik (New Delhi) MSC: 41A50 41A63 PDF BibTeX XML Cite \textit{S. Borodachov}, J. Approx. Theory 234, 51--63 (2018; Zbl 1400.41026) Full Text: DOI
Chambers, Erin; Erickson, Alejandro; Fekete, Sándor P.; Lenchner, Jonathan; Sember, Jeff; Srinivasan, Venkatesh; Stege, Ulrike; Stolpner, Svetlana; Weibel, Christophe; Whitesides, Sue Connectivity graphs of uncertainty regions. (English) Zbl 1372.68205 Algorithmica 78, No. 3, 990-1019 (2017). MSC: 68R10 68Q17 68Q25 68U05 68W25 90C35 PDF BibTeX XML Cite \textit{E. Chambers} et al., Algorithmica 78, No. 3, 990--1019 (2017; Zbl 1372.68205) Full Text: DOI
Fürstberger, Axel; Maucher, Markus; Kestler, Hans A. Extended pairwise local alignment of wild card DNA/RNA sequences using dynamic programming. (English) Zbl 07183050 J. Stat. Comput. Simulation 85, No. 1, 3-13 (2015). MSC: 62 PDF BibTeX XML Cite \textit{A. Fürstberger} et al., J. Stat. Comput. Simulation 85, No. 1, 3--13 (2015; Zbl 07183050) Full Text: DOI
Kamburowski, Jerzy On the distribution-free newsboy problem with some non-skewed demands. (English) Zbl 1408.90013 Oper. Res. Lett. 43, No. 2, 165-171 (2015). MSC: 90B05 60E15 PDF BibTeX XML Cite \textit{J. Kamburowski}, Oper. Res. Lett. 43, No. 2, 165--171 (2015; Zbl 1408.90013) Full Text: DOI
Popovici, Elena; Winston, Ezra A framework for co-optimization algorithm performance and its application to worst-case optimization. (English) Zbl 1314.68295 Theor. Comput. Sci. 567, 46-73 (2015). MSC: 68T20 90C59 PDF BibTeX XML Cite \textit{E. Popovici} and \textit{E. Winston}, Theor. Comput. Sci. 567, 46--73 (2015; Zbl 1314.68295) Full Text: DOI
Zhang, Yanfang Numerical investigation of deterministic formulations for stochastic complementarity problems. (English) Zbl 1228.90133 Pac. J. Optim. 7, No. 2, 317-337 (2011). MSC: 90C33 90C15 65K05 PDF BibTeX XML Cite \textit{Y. Zhang}, Pac. J. Optim. 7, No. 2, 317--337 (2011; Zbl 1228.90133) Full Text: Link
Dahlke, Stephan; Novak, Erich; Sickel, Winfried Optimal approximation of elliptic problems by linear and nonlinear mappings. IV: Errors in \(L_{2}\) and other norms. (English) Zbl 1184.65056 J. Complexity 26, No. 1, 102-124 (2010). MSC: 65J10 65J15 47A50 47J25 41A50 41A46 PDF BibTeX XML Cite \textit{S. Dahlke} et al., J. Complexity 26, No. 1, 102--124 (2010; Zbl 1184.65056) Full Text: DOI
Dahlke, Stephan; Novak, Erich; Sickel, Winfried Optimal approximation of elliptic problems by linear and nonlinear mappings. III: Frames. (English) Zbl 1129.65038 J. Complexity 23, No. 4-6, 614-648 (2007). MSC: 65J10 47A50 41A65 42C40 PDF BibTeX XML Cite \textit{S. Dahlke} et al., J. Complexity 23, No. 4--6, 614--648 (2007; Zbl 1129.65038) Full Text: DOI arXiv
Dahlke, Stephan; Novak, Erich; Sickel, Winfried Optimal approximation of elliptic problems by linear and nonlinear mappings. I. (English) Zbl 1092.65044 J. Complexity 22, No. 1, 29-49 (2006). MSC: 65J10 47A50 42C40 35J05 65N30 65T60 65N15 PDF BibTeX XML Cite \textit{S. Dahlke} et al., J. Complexity 22, No. 1, 29--49 (2006; Zbl 1092.65044) Full Text: DOI arXiv
Heinrich, Stefan; Hickernell, Fred J.; Yue, Rong-Xian Optimal quadrature for Haar wavelet spaces. (English) Zbl 1035.65004 Math. Comput. 73, No. 245, 259-277 (2004). Reviewer: D. Acu (Sibiu) MSC: 65C05 65D32 65T60 PDF BibTeX XML Cite \textit{S. Heinrich} et al., Math. Comput. 73, No. 245, 259--277 (2004; Zbl 1035.65004) Full Text: DOI
Lermer, Karl; Fidge, Colin J.; Hayes, Ian J. Linear approximation of execution-time constraints. (English) Zbl 1093.68025 Formal Asp. Comput. 15, No. 4, 319-348 (2003). MSC: 68N30 68Q55 PDF BibTeX XML Cite \textit{K. Lermer} et al., Formal Asp. Comput. 15, No. 4, 319--348 (2003; Zbl 1093.68025) Full Text: DOI
Edelkamp, Stefan; Wegener, Ingo On the performance of WEAK-HEAPSORT. (English) Zbl 0971.68620 Reichel, Horst (ed.) et al., STACS 2000. 17th annual symposium on Theoretical aspects of computer science. Lille, France, February 17-19, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1770, 254-266 (2000). MSC: 68U99 68P10 68Q25 PDF BibTeX XML Cite \textit{S. Edelkamp} and \textit{I. Wegener}, Lect. Notes Comput. Sci. 1770, 254--266 (2000; Zbl 0971.68620)
Tautenhahn, U.; Gorenflo, R. On optimal regularization methods for fractional differentiation. (English) Zbl 0941.65140 Z. Anal. Anwend. 18, No. 2, 449-467 (1999). Reviewer: R.Plato (Berlin) MSC: 65R20 65R30 45E10 PDF BibTeX XML Cite \textit{U. Tautenhahn} and \textit{R. Gorenflo}, Z. Anal. Anwend. 18, No. 2, 449--467 (1999; Zbl 0941.65140) Full Text: DOI EuDML
Chan, Lap Mui Ann; Simchi-Levi, David; Bramel, Julien Worst-case analyses, linear programming and the bin-packing problem. (English) Zbl 0920.90121 Math. Program. 83, No. 2 (A), 213-227 (1998). MSC: 90C27 90C05 90C60 PDF BibTeX XML Cite \textit{L. M. A. Chan} et al., Math. Program. 83, No. 2 (A), 213--227 (1998; Zbl 0920.90121)
Goldberg, Robert R.; Shapiro, Jacob; Waxman, Jerry Optimal \(k\)-partitions. (English) Zbl 0905.90142 Congr. Numerantium 108, 17-32 (1995). MSC: 90C27 05A18 PDF BibTeX XML Cite \textit{R. R. Goldberg} et al., Congr. Numerantium 108, 17--32 (1995; Zbl 0905.90142)
Simchi-Levi, David New worst-case results for the bin-packing problem. (English) Zbl 0809.90111 Nav. Res. Logist. 41, No. 4, 579-585 (1994). Reviewer: T.M.Liebling (Lausanne) MSC: 90C27 PDF BibTeX XML Cite \textit{D. Simchi-Levi}, Nav. Res. Logist. 41, No. 4, 579--585 (1994; Zbl 0809.90111) Full Text: DOI
Perrizo, William Algorithm management systems: An design paradigm for database systems. (English) Zbl 0800.68386 Math. Model. Sci. Comput. 2(Sect.A), 275-280 (1993). MSC: 68P15 PDF BibTeX XML Cite \textit{W. Perrizo}, Math. Model. Sci. Comput. 2(Sect.A), 275--280 (1993; Zbl 0800.68386)
Mao, W. Best \(k\)-fit bin packing. (English) Zbl 0776.68059 Computing 50, No. 3, 265-270 (1993). MSC: 68Q25 68R05 PDF BibTeX XML Cite \textit{W. Mao}, Computing 50, No. 3, 265--270 (1993; Zbl 0776.68059) Full Text: DOI
Novak, Erich; Ritter, Klaus Some complexity results for zero finding for univariate functions. (English) Zbl 0771.65024 J. Complexity 9, No. 1, 15-40 (1993). Reviewer: W.C.Rheinboldt (Pittsburgh) MSC: 65H05 65Y20 30C15 12Y05 PDF BibTeX XML Cite \textit{E. Novak} and \textit{K. Ritter}, J. Complexity 9, No. 1, 15--40 (1993; Zbl 0771.65024) Full Text: DOI
Horowitz, Ellis; Papa, Marco Polygon clipping: Analysis and experiences. (English) Zbl 0766.68135 Theoretical studies in computer science, 315-339 (1992). MSC: 68U05 68Q25 PDF BibTeX XML Cite \textit{E. Horowitz} and \textit{M. Papa}, in: Theoretical studies in computer science. Boston etc.: Academic Press, Inc.. 315--339 (1992; Zbl 0766.68135)
Fishman, George S.; Granovsky, Boris L.; Rubin, David S. Evaluating best-case and worst-case variances when bounds are available. (English) Zbl 0763.65107 SIAM J. Sci. Stat. Comput. 13, No. 6, 1347-1360 (1992). Reviewer: I.Dimov (Sofia) MSC: 65C99 62J10 PDF BibTeX XML Cite \textit{G. S. Fishman} et al., SIAM J. Sci. Stat. Comput. 13, No. 6, 1347--1360 (1992; Zbl 0763.65107) Full Text: DOI
Hunter Mladineo, Regina Convergence rates of a global optimization algorithm. (English) Zbl 0756.90082 Math. Program., Ser. A 54, No. 2, 223-232 (1992). Reviewer: N.Djuranović-Miličić (Beograd) MSC: 90C30 90-08 90C25 PDF BibTeX XML Cite \textit{R. Hunter Mladineo}, Math. Program. 54, No. 2 (A), 223--232 (1992; Zbl 0756.90082) Full Text: DOI
Altinkemer, Kemal; Gavish, Bezalel Heuristics for delivery problems with constant error guarantees. (English) Zbl 0722.90079 Transp. Sci. 24, No. 4, 294-297 (1990). MSC: 90C35 90-08 05C70 PDF BibTeX XML Cite \textit{K. Altinkemer} and \textit{B. Gavish}, Transp. Sci. 24, No. 4, 294--297 (1990; Zbl 0722.90079) Full Text: DOI
Rolim, José D. P.; Greibach, Sheila A. A note on the best-case complexity. (English) Zbl 0672.68019 Inf. Process. Lett. 30, No. 3, 133-138 (1989). Reviewer: D.Lucanu MSC: 68Q25 03D15 PDF BibTeX XML Cite \textit{J. D. P. Rolim} and \textit{S. A. Greibach}, Inf. Process. Lett. 30, No. 3, 133--138 (1989; Zbl 0672.68019) Full Text: DOI
Ubhaya, V. A. An O(n) algorithm for least squares quasi-convex approximation. (English) Zbl 0635.65009 Comput. Math. Appl. 14, 583-590 (1987). Reviewer: H.P.Dikshit MSC: 65D10 65K05 62J02 PDF BibTeX XML Cite \textit{V. A. Ubhaya}, Comput. Math. Appl. 14, 583--590 (1987; Zbl 0635.65009) Full Text: DOI
Kacewicz, B.; Wasilkowski, G. W. How powerful is continuous nonlinear information for linear problems? (English) Zbl 0618.65043 J. Complexity 2, 306-316 (1986). Reviewer: A.Neumaier MSC: 65J05 41A46 PDF BibTeX XML Cite \textit{B. Kacewicz} and \textit{G. W. Wasilkowski}, J. Complexity 2, 306--316 (1986; Zbl 0618.65043) Full Text: DOI
Bard, Jonathan F.; Chatterjee, Sangit Objective function bounds for the inexact linear programming problem with generalized cost coefficients. (English) Zbl 0606.90085 Comput. Oper. Res. 12, 483-491 (1985). MSC: 90C05 65K05 PDF BibTeX XML Cite \textit{J. F. Bard} and \textit{S. Chatterjee}, Comput. Oper. Res. 12, 483--491 (1985; Zbl 0606.90085) Full Text: DOI
Dürre, K.; Heuft, J.; Müller, H. Worst and best case behaviour of an approximate graph coloring algorithm. (English) Zbl 0537.68066 Graphtheoretic concepts in computer science, Proc. 7th Conf., Linz/Austria 1981, 339-348 (1982). MSC: 68R10 68Q25 05C15 PDF BibTeX XML
Thompson, Gerald L. A recursive method for solving assignment problems. (English) Zbl 0469.90051 Ann. Discrete Math. 11, 319-343 (1981). MSC: 90C08 65K05 PDF BibTeX XML Full Text: DOI
D’Atri, Gianfranco Outline of a probabilistic framework for combinatorial optimization. (English) Zbl 0493.90064 Numerical techniques for stochastic systems, Conf. Gargnano/Italy 1979, 347-368 (1980). MSC: 90C10 65K05 68Q25 90B35 PDF BibTeX XML