Search alternatives:
processes optimization » process optimization (Expand Search), process optimisation (Expand Search), property optimization (Expand Search)
model optimization » codon optimization (Expand Search), global optimization (Expand Search), based optimization (Expand Search)
key processes » key process (Expand Search), _ processes (Expand Search)
binary mask » binary image (Expand Search)
mask model » risk model (Expand Search), base model (Expand Search)
lines key » nine key (Expand Search), lines e (Expand Search)
processes optimization » process optimization (Expand Search), process optimisation (Expand Search), property optimization (Expand Search)
model optimization » codon optimization (Expand Search), global optimization (Expand Search), based optimization (Expand Search)
key processes » key process (Expand Search), _ processes (Expand Search)
binary mask » binary image (Expand Search)
mask model » risk model (Expand Search), base model (Expand Search)
lines key » nine key (Expand Search), lines e (Expand Search)
-
1
-
2
-
3
-
4
-
5
-
6
Algorithm parameter settings.
Published 2025“…Key algorithmic accelerators comprise a Heuristic Infeasibility Proof (HIP) for rapid solution screening and Enhanced Benders Cuts (EBC) derived from infeasibility analysis, both integrated with integrated with Local Branching. …”
-
7
Integrated algorithmic framework.
Published 2025“…Key algorithmic accelerators comprise a Heuristic Infeasibility Proof (HIP) for rapid solution screening and Enhanced Benders Cuts (EBC) derived from infeasibility analysis, both integrated with integrated with Local Branching. …”
-
8
-
9
The pseudo code of HIP algorithm.
Published 2025“…Key algorithmic accelerators comprise a Heuristic Infeasibility Proof (HIP) for rapid solution screening and Enhanced Benders Cuts (EBC) derived from infeasibility analysis, both integrated with integrated with Local Branching. …”
-
10
The pseudo code of local branching algorithm.
Published 2025“…Key algorithmic accelerators comprise a Heuristic Infeasibility Proof (HIP) for rapid solution screening and Enhanced Benders Cuts (EBC) derived from infeasibility analysis, both integrated with integrated with Local Branching. …”
-
11
A* Path-Finding Algorithm to Determine Cell Connections
Published 2025“…</p><p dir="ltr">Astrocytes were dissociated from E18 mouse cortical tissue, and image data were processed using a Cellpose 2.0 model to mask nuclei. Pixel paths were classified using a z-score brightness threshold of 1.21, optimized for noise reduction and accuracy. …”
-
12
-
13
-
14
Flowchart scheme of the ML-based model.
Published 2024“…<b>I)</b> Testing data consisting of 20% of the entire dataset. <b>J)</b> Optimization of hyperparameter tuning. <b>K)</b> Algorithm selection from all models. …”
-
15
-
16
Algoritmo de clasificación de expresiones de odio por tipos en español (Algorithm for classifying hate expressions by type in Spanish)
Published 2024“…</li></ul><p dir="ltr"><b>File Structure</b></p><p dir="ltr">The code generates and saves:</p><ul><li>Weights of the trained model (.h5)</li><li>Configured tokenizer</li><li>Training history in CSV</li><li>Requirements file</li></ul><p dir="ltr"><b>Important Notes</b></p><ul><li>The model excludes category 2 during training</li><li>Implements transfer learning from a pre-trained model for binary hate detection</li><li>Includes early stopping callbacks to prevent overfitting</li><li>Uses class weighting to handle category imbalances</li></ul><p dir="ltr">The process of creating this algorithm is explained in the technical report located at: Blanco-Valencia, X., De Gregorio-Vicente, O., Ruiz Iniesta, A., & Said-Hung, E. (2025). …”
-
17
Pareto boundary diagram.
Published 2024“…The results show that the model solution with the introduction of the key processes at work zones produces more time-efficient and less time-consuming route planning results, and that the results obtained using the <i>ε</i> − constraint method are more reliable than the traditional methods for solving multi-objective planning problems and are more in line with the decision maker’s needs.…”
-
18
<i>ε</i> − constraint method.
Published 2024“…The results show that the model solution with the introduction of the key processes at work zones produces more time-efficient and less time-consuming route planning results, and that the results obtained using the <i>ε</i> − constraint method are more reliable than the traditional methods for solving multi-objective planning problems and are more in line with the decision maker’s needs.…”
-
19
Supporting information-data.
Published 2024“…The results show that the model solution with the introduction of the key processes at work zones produces more time-efficient and less time-consuming route planning results, and that the results obtained using the <i>ε</i> − constraint method are more reliable than the traditional methods for solving multi-objective planning problems and are more in line with the decision maker’s needs.…”
-
20
The calculation result.
Published 2024“…The results show that the model solution with the introduction of the key processes at work zones produces more time-efficient and less time-consuming route planning results, and that the results obtained using the <i>ε</i> − constraint method are more reliable than the traditional methods for solving multi-objective planning problems and are more in line with the decision maker’s needs.…”