Search alternatives:
coding optimization » codon optimization (Expand Search), routing optimization (Expand Search), joint optimization (Expand Search)
art optimization » swarm optimization (Expand Search), after optimization (Expand Search), path optimization (Expand Search)
binary based » library based (Expand Search), linac based (Expand Search), binary mask (Expand Search)
binary from » diary from (Expand Search), library from (Expand Search)
from coding » from decoding (Expand Search)
based art » based care (Expand Search)
coding optimization » codon optimization (Expand Search), routing optimization (Expand Search), joint optimization (Expand Search)
art optimization » swarm optimization (Expand Search), after optimization (Expand Search), path optimization (Expand Search)
binary based » library based (Expand Search), linac based (Expand Search), binary mask (Expand Search)
binary from » diary from (Expand Search), library from (Expand Search)
from coding » from decoding (Expand Search)
based art » based care (Expand Search)
-
1
-
2
-
3
Analysis and design of algorithms for the manufacturing process of integrated circuits
Published 2023“…The (approximate) solution proposals of state-of-the-art methods include rule-based approaches, genetic algorithms, and reinforcement learning. …”
-
4
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). …”
-
5
-
6
datasheet1_Graph Neural Networks for Maximum Constraint Satisfaction.pdf
Published 2021“…Despite being generic, we show that our approach matches or surpasses most greedy and semi-definite programming based algorithms and sometimes even outperforms state-of-the-art heuristics for the specific problems.…”
-
7