Search alternatives:
simulation algorithm » segmentation algorithm (Expand Search), maximization algorithm (Expand Search), selection algorithm (Expand Search)
process simulation » process optimization (Expand Search)
art optimization » swarm optimization (Expand Search), after optimization (Expand Search), path optimization (Expand Search)
cycle process » whole process (Expand Search)
binary cycle » lunar cycle (Expand Search)
binary based » library based (Expand Search), linac based (Expand Search), binary mask (Expand Search)
based art » based care (Expand Search)
simulation algorithm » segmentation algorithm (Expand Search), maximization algorithm (Expand Search), selection algorithm (Expand Search)
process simulation » process optimization (Expand Search)
art optimization » swarm optimization (Expand Search), after optimization (Expand Search), path optimization (Expand Search)
cycle process » whole process (Expand Search)
binary cycle » lunar cycle (Expand Search)
binary based » library based (Expand Search), linac based (Expand Search), binary mask (Expand Search)
based art » based care (Expand Search)
-
1
Python-Based Algorithm for Estimating NRTL Model Parameters with UNIFAC Model Simulation Results
Published 2025“…The percentage mean absolute residuals of the activity coefficients obtained using DEA, NMM, and the parameter estimation tool in Aspen Plus were in the ranges of 0.05–16.69, 0.05–16.69, and 0.09–326.77%, respectively. This in-house algorithm will be helpful for obtaining more accurate NRTL parameters in a timely manner and will facilitate the simulation of biochemical processes for process optimization, energy consumption estimation, and life cycle assessment.…”
-
2
-
3
-
4
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. …”
-
5
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.…”
-
6