Results 1 to 10 of about 10,333,076 (321)
Firefly Algorithms for Multimodal Optimization [PDF]
Symposium on Stochastic Algorithms: Foundations and Applications, 2009 Nature-inspired algorithms are among the most powerful algorithms for optimization. This paper intends to provide a detailed description of a new Firefly Algorithm (FA) for multimodal optimization applications.
Yang, Xin-She
core +3 more sources
On BMRN*-colouring of planar digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 In a recent work, Bensmail, Blanc, Cohen, Havet and Rocha, motivated by applications for TDMA scheduling problems, have introduced the notion of BMRN*-colouring of digraphs, which is a type of arc-colouring with particular colouring constraints.
Julien Bensmail, Foivos Fioravantes
doaj +1 more source
Symbolic Discovery of Optimization Algorithms [PDF]
Neural Information Processing Systems, 2023 We present a method to formulate algorithm discovery as program search, and apply it to discover optimization algorithms for deep neural network training. We leverage efficient search techniques to explore an infinite and sparse program space.
Xiangning Chen +11 more
semanticscholar +1 more source
Bayesian optimization algorithms for accelerator physics [PDF]
Physical Review Accelerators and Beams, 2023 Accelerator physics relies on numerical algorithms to solve optimization problems in online accelerator control and tasks such as experimental design and model calibration in simulations.
Ryan Roussel +25 more
semanticscholar +1 more source
Gossiping with interference in radio ring networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 In this paper, we study the problem of gossiping with interference constraint in radio ring networks. Gossiping (or total exchange information) is a protocol where each node in the network has a message and is expected to distribute its own message to ...
Jean-Claude Bermond +2 more
doaj +1 more source
From light edges to strong edge-colouring of 1-planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A strong edge-colouring of an undirected graph $G$ is an edge-colouring where every two edges at distance at most~$2$ receive distinct colours. The strong chromatic index of $G$ is the least number of colours in a strong edge-colouring of $G$.
Julien Bensmail +3 more
doaj +1 more source
List circular backbone colouring [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 A natural generalization of graph colouring involves taking colours from a metric space and insisting that the endpoints of an edge receive colours separated by a minimum distance dictated by properties of the edge.
Frederic Havet, Andrew D. King
doaj +3 more sources
On Hyperparameter Optimization of Machine Learning Algorithms: Theory and Practice [PDF]
Neurocomputing, 2020 Machine learning algorithms have been used widely in various applications and areas. To fit a machine learning model into different problems, its hyper-parameters must be tuned. Selecting the best hyper-parameter configuration for machine learning models
Li Yang, A. Shami
semanticscholar +1 more source
Algorithmic lifestyle optimization
Journal of the American Medical Informatics Association, 2022 Abstract Objective A hallmark of personalized medicine and nutrition is to identify effective treatment plans at the individual level. Lifestyle interventions (LIs), from diet to exercise, can have a significant effect over time, especially in the case of food intolerances and allergies. The large set
Ameen Eetemadi, Ilias Tagkopoulos
openaire +4 more sources
Hippopotamus Optimization Algorithm: A Novel Nature-Inspired Optimization Algorithm
Scientific Reports, 2023 Abstract The novelty of this article lies in introducing a novel nonparametric metaheuristic technique named the Hippopotamus Optimization (HO) algorithm. The HO is conceived by drawing inspiration from the inherent behaviors observed in hippopotamuses, showcasing an innovative approach in metaheuristic methodology.
Mohammad Hussein Amiri +4 more
openaire +3 more sources