scientific article; zbMATH DE number 4027156

From MaRDI portal
Publication:3768665





[For the entire collection see Zbl 0627.00021.] In another paper [see the preceding review] we considered the basic methods of devising quasi-optimal schedules based on undirected random search. The main shortcoming of the method is its relatively slow convergence to the optimal schedule. The convergence can be accelerated by modifying the random search so that separate random tests are dependent. We can employ methods of local optimization that make it possible to apply various adaptation approaches in the process of realizing the random search.











This page was built for publication:

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