Results 31 to 40 of about 10,111,586 (292)
Improved quantum-behaved particle swarm optimization with local search strategy
Journal of Algorithms & Computational Technology, 2017 Quantum-behaved particle swarm optimization, which was motivated by analysis of particle swarm optimization and quantum system, has shown compared performance in finding the optimal solutions for many optimization problems to other evolutionary ...
Maolong Xi +4 more
doaj +1 more source
Learning to Control Local Search for Combinatorial Optimization
, 2023 Accepted at ECML-PKDD ...
Jonas K. Falkner +3 more
openaire +4 more sources
Double Cuckoo Search Algorithm with Dynamically Adjusted Probability
Jisuanji kexue yu tansuo, 2021 Cuckoo search algorithm is an emerging bionic intelligent algorithm, which has the shortages of low search precision, easy to fall into local optimum and slow convergence speed. Double cuckoo search algorithm with dynamically adjusted probability (DECS)
CHEN Cheng, HE Xingshi, YANG Xinshe
doaj +1 more source
Local search for parallel optimization algorithms for high diminsional optimization problems
MATEC Web of Conferences, 2018 Local search algorithms perform an important role when being employed with optimization algorithms tackling numerous optimization problems since they lead to getting better solutions.
Abd-Alsabour Nadia
doaj +1 more source
Efficient Local Search for Pseudo Boolean Optimization
, 2021 Pseudo-Boolean Optimization (PBO) can be used to model many combinatorial optimization problems. PBO instances encoded from real-world applications are often large and difficult to solve; in many cases, close-to-optimal solutions are useful and can be found reasonably efficiently, using incomplete algorithms.
Lei, Z., Cai, S., Luo, C., Hoos, H.H.
openaire +3 more sources
Achieving optimal illumination conditions using local search [PDF]
, 2015 In this research we attempt to achieve optimal illumination conditions in enclosed spaces that contain multiple illumination devices using local search algorithms.
Sioutis, Marios +5 more
core +1 more source
Local Search Optimization for a Multi-state Series-parallel System
MATEC Web of Conferences, 2016 Generally, the redundancy allocation problem is characterized as a kind of NP-hard combinatorial optimization problem, which is difficult to solve with the classical method because it has exponentially increasing complexity with the augmented size.
Yin Ming-Ang +3 more
doaj +1 more source
Exploiting Local Optimality in Metaheuristic Search
CoRR, 2020 A variety of strategies have been proposed for overcoming local optimality in metaheuristic search. This paper examines characteristics of moves that can be exploited to make good decisions about steps that lead away from a local optimum and then lead toward a new local optimum.
openaire +3 more sources
Local Optimization Method with Global Multidimensional Search
Journal of Global Optimization, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adil M. Bagirov +2 more
openaire +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Embryonal tumors comprise the majority of malignant central nervous system (CNS) neoplasms diagnosed in children under 3 years of age. Compared with their counterparts in older children, these tumors exhibit distinct molecular biology and a more aggressive clinical phenotype, while their management is complicated by the heightened ...
Sudarshawn Damodharan +3 more
wiley +1 more source