Cluster-based Kriging approximation algorithms for complexity reduction
نویسندگان
چکیده
منابع مشابه
Cluster-based Kriging Approximation Algorithms for Complexity Reduction
Kriging or Gaussian Process Regression is applied in many fields as a non-linear regression model as well as a surrogate model in the field of evolutionary computation. However, the computational and space complexity of Kriging, that is cubic and quadratic in the number of data points respectively, becomes a major bottleneck with more and more data available nowadays. In this paper, we propose ...
متن کاملComplexity Classes , and Approximation Algorithms
We survey recent results about game-theoretic characterizations of computational complexity classes. We also show how these results are used to prove that certain natural optimization functions are as hard to approximate closely as they are to compute exactly. 1991 Mathematics Subject Classi cation: 68Q15
متن کاملParameterized Complexity and Approximation Algorithms
. Proc. Ninth Annual ACM-SIAM Symp. Discrete Algorithms, San Francisco, CA, pp. 394–399. ACM, New York.Page 18 of 19D. MARX THE COMPUTER JOURNAL, 2007 [113] Erlebach, T., Jansen, K. and Seidel, E. (2005) Polynomial-timeapproximation schemes for geometric intersection graphs.SIAM J. Comput., 34, 1302–1323. [114] Hochbaum, D.S. and Maass, W. (1985) Approximationschemes for cov...
متن کاملParameterized complexity and approximation algorithms Dagstuhl Seminar
From 14. 12. 2009 to 17. 12. 2009., the Dagstuhl Seminar 09511 Parameterized complexity and approximation algorithms was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar resul...
متن کاملGames, Complexity Classes, and Approximation Algorithms
We survey recent results about game-theoretic characterizations of computational complexity classes. We also show how these results are used to prove that certain natural optimization functions are as hard to approximate closely as they are to compute exactly.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Intelligence
سال: 2019
ISSN: 0924-669X,1573-7497
DOI: 10.1007/s10489-019-01549-7