Generative models in the problem of evaluating the efficiency of computer algorithms

DOI10.1007/S10559-024-00672-9zbMATH Open1540.68355MaRDI QIDQ6547258FDOQ6547258

Authors: L. S. Fainzilberg 

Publication date: 30 May 2024

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4128371
• Feature Article—Toward an Experimental Method for Algorithm Simulation
• Some remarks on the efficient algorithms of numerical statistical simulation
• scientific article; zbMATH DE number 494377
• On the efficiency and capacity of computers

zbMATH Keywords

artificial datastatistical experimentcomputer algorithm efficiency

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Medical applications (general) (92C50) Theory of statistical experiments (62B15) Optimal stopping in statistics (62L15) Algorithms in computer science (68W99)

Cites Work

• Title not available (Why is that?)
• Who solved the secretary problem? With comments and a rejoinder by the author
• Title not available (Why is that?)
• Title not available (Why is that?)
• An interactive method for the optimal selection problem with two decision makers
• Dynamic programming and the secretary problem
• Ten lectures on statistical and structural pattern recognition.
• Simulation and the Monte Carlo method
• New approaches to the analysis and interpretation of the shape of cyclic signals

This page was built for publication: Generative models in the problem of evaluating the efficiency of computer algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547258)