Results 31 to 40 of about 673,864 (284)
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
A bat optimization algorithm with moderate orientation and perturbation of trend
Journal of Algorithms & Computational Technology, 2021 In order to improve the convergence speed and optimization accuracy of the bat algorithm, a bat optimization algorithm with moderate optimal orientation and random perturbation of trend is proposed. The algorithm introduces the nonlinear variation factor
Jingsen Liu +3 more
doaj +1 more source
Local Optimization Method with Global Multidimensional Search
Journal of Global Optimization, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bagirov, Adil M. +2 more
openaire +2 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
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
Communication-Aware Local Search for Distributed Constraint Optimization
Journal of Artificial Intelligence Research, 2022 Most studies investigating models and algorithms for distributed constraint optimization problems (DCOPs) assume that messages arrive instantaneously and are never lost. Specifically, distributed local search DCOP algorithms, have been designed as synchronous algorithms (i.e., they perform in synchronous iterations in which each agent exchanges ...
Rachmut, Ben, Zivan, Roie, Yeoh, William
openaire +2 more sources
In situ molecular organization and heterogeneity of the Legionella Dot/Icm T4SS
FEBS Letters, EarlyView.We present a nearly complete in situ model of the Legionella Dot/Icm type IV secretion system, revealing its central secretion channel and identifying new components. Using cryo‐electron tomography with AI‐based modeling, our work highlights the structure, variability, and mechanism of this complex nanomachine, advancing understanding of bacterial ...
Przemysław Dutka +11 more
wiley +1 more source
Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization [PDF]
, 2016 Chicano, F., Whitley D., & Tinós R. (2016). Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization. 16th European Conference on Evolutionary Computation for Combinatorial Optimization (LNCS 9595), pp.
Chicano, Francisco +2 more
core
Molecular Oncology, EarlyView.This study integrates transcriptomic profiling of matched tumor and healthy tissues from 32 colorectal cancer patients with functional validation in patient‐derived organoids, revealing dysregulated metabolic programs driven by overexpressed xCT (SLC7A11) and SLC3A2, identifying an oncogenic cystine/glutamate transporter signature linked to ...
Marco Strecker +16 more
wiley +1 more source