Results 41 to 50 of about 681,060 (327)

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, Hongyuan Ji, Qingqing Liu, Yu Li   +3 more
doaj   +1 more source

Learning to Control Local Search for Combinatorial Optimization

, 2023
Accepted at ECML-PKDD ...
Jonas K. Falkner, Daniela Thyssens, Ahmad Bdeir, Lars Schmidt-Thieme   +3 more
openaire   +2 more sources

BeamECOC: A local search for the optimization of the ECOC matrix [PDF]

2016 23rd International Conference on Pattern Recognition (ICPR), 2016
Error Correcting Output Coding (ECOC) is a multi-class classification technique in which multiple binary classifiers are trained according to a preset code matrix such that each one learns a separate dichotomy of the classes. While ECOC is one of the best solutions for multi-class problems, one issue which makes it suboptimal is that the training of ...
Cemre Zor, Berrin A. Yanikoglu, Erinc Merdivan, Terry Windeatt, Josef Kittler, Ethem Alpaydin   +5 more
openaire   +2 more sources

Optimizing at the Ergodic Edge [PDF]

, 2005
Using a simple, annealed model, some of the key features of the recently introduced extremal optimization heuristic are demonstrated. In particular, it is shown that the dynamics of local search possesses a generic critical point under the variation of ...
Bantilan, Ben-Naim, Bhattacharya, Boettcher, Boettcher, Boettcher, Boettcher, Boettcher, Boettcher, Boettcher, Boettcher, Boettcher, Boettcher, Dall, de Sousa, Desimone, Duch, Frauenkron, Hartmann, Hartmann, Heilmann, Hoffmann, Holland, Houdayer, Iwamatsu, Jaeger, Kirkpatrick, Martin Frank, Meshoul, Metropolis, Middleton, Mézard, Onody, Pal, Pal, Palassini, Palmer, Palmer, Prellberg, Ritort, Sousa, Stefan Boettcher, Svenson, Tuzel, Wang, Yom-Tov, Zhou   +46 more
core   +1 more source

Orthogonal methods based ant colony search for solving continuous optimization problems [PDF]

, 2008
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation.
A C Zecchin, A S Hedayat, C R Rao, G Bilchev, J Dréo, J Dréo, J H Holland, J L Deneubourg, J Zhang, Jun Zhang, K M Sim, K Socha, K T Fang, L Chen, M B Nathanson, M Dorigo, M Mathur, M Wodrich, Math Stat Res Group, N Monmarché, Q Zhang, R S Parpinelli, R Salomon, S Goss, X B Liang, Xiao-Min Hu, Y W Leung, Yun Li   +27 more
core   +1 more source

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

Bayesian optimization for computationally extensive probability distributions [PDF]

, 2018
An efficient method for finding a better maximizer of computationally extensive probability distributions is proposed on the basis of a Bayesian optimization technique.
Hukushima, Koji, Tamura, Ryo
core   +1 more source

Optimal Network Topologies for Local Search with Congestion [PDF]

Physical Review Letters, 2002
The problem of searchability in decentralized complex networks is of great importance in computer science, economy and sociology. We present a formalism that is able to cope simultaneously with the problem of search and the congestion effects that arise when parallel searches are performed, and obtain expressions for the average search cost--written in
Guimerà, R, Díaz Guilera, A, VEGA-REDONDO, FERNANDO, Cabrales, A, Arenas, A.   +4 more
openaire   +6 more sources

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, Sun Zhi-Li, Wang Jian, Guo Yu   +3 more
doaj   +1 more source

Optimal noise in a stochastic model for local search

Physical Review E, 2018
We develop a prototypical stochastic model for local search around a given home. The stochastic dynamic model is motivated by experimental findings of the motion of a fruit fly around a given spot of food but shall generally describe local search behavior. The local search consists of a sequence of two epochs.
Noetel, J., Freitas, V. L. S., Macau, E. E. N., Schimansky-Geier, L.   +3 more
openaire   +4 more sources