Results 21 to 30 of about 2,844,778 (299)
Discover Internet of Things, 2023 The multi-objective grasshopper optimization algorithm (MOGOA) is a relatively new algorithm inspired by the collective behavior of grasshoppers, which aims to solve multi-objective optimization problems in IoT applications.
Faria Sajjad +8 more
doaj +1 more source
Quantum Algorithms for Simulated Annealing [PDF]
, 2015 This paper summarizes a quantum algorithm of [R.D. Somma, et.al., Phys. Rev. Lett. 101, 130504 (2008)] that simulates a classical annealing process for solving discrete optimization problems. The complexity of the quantum algorithm scales with the inverse square root of the spectral gap of an associated stochastic matrix.
Boixo, Sergio, Somma, Rolando D.
openaire +2 more sources
A search algorithm for global optimisation [PDF]
, 2005 This paper investigates a global search optimisation technique, referred to as the repeated weighted boosting search. The proposed optimisation algorithm is extremely simple and easy to implement.
Wang, X.X. +5 more
core +2 more sources
Journal of Mathematics, 2022 In the classical simulated annealing algorithm (SAA), the iteration feasible solution is mainly based on a certain random probability. In the process of iteration, there is a lack of comparison between individuals and the whole population of feasible ...
Fangwei Zhang +3 more
doaj +1 more source
A multipopulation parallel genetic simulated annealing based QoS routing and wavelength assignment integration algorithm for multicast in optical networks [PDF]
, 2009 Copyright @ 2008 Elsevier B.V. All rights reserved.In this paper, we propose an integrated Quality of Service (QoS) routing algorithm for optical networks.
Wang, X +11 more
core +1 more source
Simulated annealing based multiuser detection for synchronous SDMA system [PDF]
, 2008 In this treatise, a novel Simulated Annealing (SA) based Multi-User Detection (MUD) is proposed in synchronous Space Division Multiple Access (SDMA) system.
Lv, Tiejun +9 more
core +1 more source
An adaptive simulated annealing algorithm
Stochastic Processes and their Applications, 2001 Inspired by the idea of the Metropolis algorithm, the authors propose a new sample adaptive simulated annealing algorithm on finite state space. The algorithm can be considered as a substitute of the annealing of iterative stochastic schemes in case of finite state space and can be hopefully extended to the denumerable state case with some ...
Gong, Guanglu, Liu, Yong, Qian, Minping
openaire +2 more sources
A Simulated Annealing Method to Cover Dynamic Load Balancing in Grid Environment [PDF]
, 2009 High-performance scheduling is critical to the achievement of application performance on the computational grid. New scheduling algorithms are in demand for addressing new concerns arising in the grid environment.
Herrero Martín, María del Pilar +1 more
core +1 more source
Optimization of Neural Network Training for Wine Quality Classification Using Simulated Annealing [PDF]
SHS Web of Conferences, 2022 The backpropagation algorithm is the most used algorithm to train a neural network. However, a simulated annealing algorithm can do that work too.
Duan Mingfei
doaj +1 more source
A non-revisiting simulated annealing algorithm [PDF]
2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence), 2008 In this article, a non-revisiting simulated annealing algorithm (NrSA) is proposed. NrSA is an integration of the non-revisiting scheme and standard simulated annealing (SA). It guarantees that every generated neighbor must not be visited before.
Shiu Yin Yuen, Chi Kin Chow 0001
openaire +3 more sources