Results 11 to 20 of about 1,348,172 (305)
Parallel Direct Search Methods
AL-Rafidain Journal of Computer Sciences and Mathematics, 2010 Mostly minimization or maximization of a function is very expensive. Since function evaluation of the objective function requires a considerable time.
Bashir Khalaf, Mohammed Al-Neama
openaire +3 more sources
Genetic Algorithms as Computational Methods for Finite-Dimensional Optimization
Кібернетика та комп'ютерні технології, 2021 Introduction. As early as 1744, the great Leonhard Euler noted that nothing at all took place in the universe in which some rule of maximum or minimum did not appear [12].
Nataliya Gulayeva +2 more
doaj +1 more source
Applied Sciences, 2023 This work aims to offer an analysis of empirical research on the automatic learning methods used in detecting microRNA (miRNA) as potential markers of breast cancer.
Jorge Alberto Contreras-Rodríguez +3 more
doaj +1 more source
A Direct Search Algorithm for Global Optimization
Algorithms, 2016 A direct search algorithm is proposed for minimizing an arbitrary real valued function. The algorithm uses a new function transformation and three simplex-based operations.
Enrique Baeyens +2 more
doaj +1 more source
Comparing variable neighbourhood search algorithms for the direct aperture optimisation in radiotherapy [PDF]
PeerJ Computer ScienceIntensity modulated radiation therapy (IMRT) is a prevalent approach for administering radiation therapy in cancer treatment. The primary objective of IMRT is to devise a treatment strategy that eradicates cancer cells from the tumour while minimising ...
Mauricio Moyano +5 more
doaj +2 more sources
Retraction-Based Direct Search Methods for Derivative Free Riemannian Optimization [PDF]
, 2023 Direct search methods represent a robust and reliable class of algorithms for solving black-box optimization problems. In this paper, the application of those strategies is exported to Riemannian optimization, wherein minimization is to be performed with
Rinaldi F., Zeffiro D., Kungurtsev V.
core +1 more source
Acta Scientiarum: Biological Sciences, 2015 Quadrat sampling is a method used for a long time in plant ecology studies but only recently it has been used with focus on fauna. For the cave fauna samplings, there are rare works applying this methodology.
Maria Elina Bichuette +3 more
doaj +1 more source
Direct Search Methods on Reductive Homogeneous Spaces [PDF]
Journal of Optimization Theory and Applications, 2018 Direct search methods are mainly designed for use in problems with no equality constraints. However, there are many instances where the feasible set is of measure zero in the ambient space and no mesh point lies within it. There are methods for working with feasible sets that are (Riemannian) manifolds, but not all manifolds are created equal.
openaire +2 more sources
Tuning approximate dynamic programming policies for ambulance redeployment via direct search
Stochastic Systems, 2014 In this paper we consider approximate dynamic programming methods for ambulance redeployment. We first demonstrate through simple examples how typical value function fitting techniques, such as approximate policy iteration and linear programming, may not
Matthew S. Maxwell +2 more
doaj +1 more source
Indirect Searches for Dark Matter with IceCube [PDF]
EPJ Web of Conferences, 2019 The nature of dark matter remains one of the unsolved questions in modern cosmology and to understand its properties different experimental avenues are being explored.
Aguilar Sánchez Juan Antonio
doaj +1 more source