Search alternatives:
algorithm its » algorithm i (Expand Search), algorithm etc (Expand Search), algorithm iqa (Expand Search)
its function » i function (Expand Search), loss function (Expand Search), cost function (Expand Search)
algorithm ai » algorithm a (Expand Search), algorithm i (Expand Search), algorithm _ (Expand Search)
algorithm its » algorithm i (Expand Search), algorithm etc (Expand Search), algorithm iqa (Expand Search)
its function » i function (Expand Search), loss function (Expand Search), cost function (Expand Search)
algorithm ai » algorithm a (Expand Search), algorithm i (Expand Search), algorithm _ (Expand Search)
-
1
Function graph and algorithm iterative graph.
Published 2024“…This paper presents an effective technique to minimize the SLL and thus improve the radiation pattern of the linear antenna array (LAA) using the chaotic inertia-weighted Wild Horse optimization (IERWHO) algorithm. …”
-
2
-
3
datasheet1_Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces.pdf
Published 2021“…We investigate the shape of a discrete algorithmic space when performing regression or classification using a loss function parametrized by algorithmic complexity, demonstrating that the property of differentiation is not required to achieve results similar to those obtained using differentiable programming approaches such as deep learning. …”
-
4
datasheet2_Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces.zip
Published 2021“…We investigate the shape of a discrete algorithmic space when performing regression or classification using a loss function parametrized by algorithmic complexity, demonstrating that the property of differentiation is not required to achieve results similar to those obtained using differentiable programming approaches such as deep learning. …”
-
5
datasheet1_Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces.pdf
Published 2021“…We investigate the shape of a discrete algorithmic space when performing regression or classification using a loss function parametrized by algorithmic complexity, demonstrating that the property of differentiation is not required to achieve results similar to those obtained using differentiable programming approaches such as deep learning. …”
-
6
datasheet2_Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces.zip
Published 2021“…We investigate the shape of a discrete algorithmic space when performing regression or classification using a loss function parametrized by algorithmic complexity, demonstrating that the property of differentiation is not required to achieve results similar to those obtained using differentiable programming approaches such as deep learning. …”
-
7
Efficient algorithms to discover alterations with complementary functional association in cancer
Published 2019“…We provide analytic evidence of the effectiveness of UNCOVER in finding high-quality solutions and show experimentally that UNCOVER finds sets of alterations significantly associated with functional targets in a variety of scenarios. In particular, we show that our algorithms find sets which are better than the ones obtained by the state-of-the-art method, even when sets are evaluated using the statistical score employed by the latter. …”
-
8
Flowchart of the specific incarnation of the BO algorithm used in the experiments.
Published 2020“…To choose the next pipeline configuration to evaluate, the BO algorithm uses an Expected Improvement function to trade off maximisation of QS with the need to fully learn the GP. …”
-
9
-
10
-
11
-
12
-
13
The pseudocode for the NAFPSO algorithm.
Published 2025“…A scheduling optimization model based on the particle swarm optimization (PSO) algorithm is proposed. In view of the high-dimensional complexity and local optimal problems, the neighborhood adaptive constrained fractional particle swarm optimization (NACFPSO) algorithm is used to solve it. …”
-
14
PSO algorithm flowchart.
Published 2025“…A scheduling optimization model based on the particle swarm optimization (PSO) algorithm is proposed. In view of the high-dimensional complexity and local optimal problems, the neighborhood adaptive constrained fractional particle swarm optimization (NACFPSO) algorithm is used to solve it. …”
-
15
-
16
Parameters of the test function.
Published 2023“…The adaptive adjustment of the transition probability effectively balances the development and exploration abilities of the algorithm. The improved flower pollination algorithm (IFPA) outperformed six classical benchmark functions that were used to verify the superiority of the improved algorithm. …”
-
17
-
18
Completion times for different algorithms.
Published 2025“…This paper first analyzes the H-beam processing flow and appropriately simplifies it, develops a reinforcement learning environment for multi-agent scheduling, and applies the rMAPPO algorithm to make scheduling decisions. The effectiveness of the proposed method is then verified on both the physical work cell for riveting and welding and its digital twin platform, and it is compared with other baseline multi-agent reinforcement learning methods (MAPPO, MADDPG, and MASAC). …”
-
19
The average cumulative reward of algorithms.
Published 2025“…This paper first analyzes the H-beam processing flow and appropriately simplifies it, develops a reinforcement learning environment for multi-agent scheduling, and applies the rMAPPO algorithm to make scheduling decisions. The effectiveness of the proposed method is then verified on both the physical work cell for riveting and welding and its digital twin platform, and it is compared with other baseline multi-agent reinforcement learning methods (MAPPO, MADDPG, and MASAC). …”
-
20