Results 251 to 260 of about 673,864 (284)
Some of the next articles are maybe not open access.

Global optimization based on local searches

4OR, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Locatelli, Marco, Schoen, Fabio
openaire   +4 more sources

Modularity optimization by Global-Local Search

2016 International Joint Conference on Neural Networks (IJCNN), 2016
Modularity is widely used in community detection in network. Despite its great success, one drawback is that its optimization is an NP-complete problem. To this end, this paper designs a new optimization method termed Global-Local-Search (Glo-Loc-Search for short).
null Xun Wang   +2 more
openaire   +1 more source

GLODS: Global and Local Optimization using Direct Search

Journal of Global Optimization, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Custódio, A. L., Madeira, JFA
openaire   +2 more sources

Spherical Local Search for Global Optimization

2018
This paper proposed spherical local search (SLS) for solving unconstrained optimization problems in three dimensions. The algorithm begins with a randomly chosen point in the search domain. Then, spherical trust region around this point is defined by the radius of SLS; where any point in this region is feasible.
M. A. El-Shorbagy, Aboul Ella Hassanien
openaire   +1 more source

Human Group Optimizer with Local Search

2011
Human Group Optimization (HGO) algorithm, derived from the previously proposed seeker optimization algorithm (SOA), is a novel swarm intelligence algorithm by simulating human behaviors, especially human searching/foraging behaviors. In this paper, a canonical HGO with local search (L-HGO) is proposed.
Chaohua Dai   +4 more
openaire   +1 more source

Particle swarm optimization using adaptive local search

2009 International Conference on Future BioMedical Information Engineering (FBIE), 2009
Particle swarm optimization (PSO) is a powerful stochastic evolutionary algorithm that is used to find the global optimum solution in search space. However, PSO often easily fall into local minima because the particles could quickly converge to a position by the attraction of the best particles.
null Jun Tang, null Xiaojuan Zhao
openaire   +1 more source

Global Search versus Local Search in Hyperparameter Optimization

2022 IEEE Congress on Evolutionary Computation (CEC), 2022
Yoshihiko Ozaki   +2 more
openaire   +1 more source

Optimization Problems and Local Search

2023
Leonardo Vanneschi, Sara Silva
openaire   +1 more source

Multiple Parallel Local Searches in Global Optimization

2000
The unconstrained global programming problem is addressed using an efficient multi-start algorithm, in which parallel local searches contribute towards a Bayesian global stopping criterion. The stopping criterion, denoted the unified Bayesian global stopping criterion, is based on the mild assumption that the probability of convergence to the global
Hermanus P. J. Bolton   +2 more
openaire   +1 more source

Local search in combinatorial optimization

1995
Y. Crama, A. W. J. Kolen, E. J. Pesch
openaire   +1 more source

Home - About - Disclaimer - Privacy