Search alternatives:
based optimization » whale optimization (Expand Search)
primary made » primary care (Expand Search), primary case (Expand Search), primary mdm (Expand Search)
binary case » binary mask (Expand Search), binary image (Expand Search), primary case (Expand Search)
made based » image based (Expand Search)
case based » game based (Expand Search), rate based (Expand Search)
based optimization » whale optimization (Expand Search)
primary made » primary care (Expand Search), primary case (Expand Search), primary mdm (Expand Search)
binary case » binary mask (Expand Search), binary image (Expand Search), primary case (Expand Search)
made based » image based (Expand Search)
case based » game based (Expand Search), rate based (Expand Search)
-
21
-
22
Routing policy based on path satisfaction.
Published 2025“…These enhancements aim to achieve optimal routing scheduling based on risk information. …”
-
23
-
24
Flowchart of simple ant colony algorithm.
Published 2025“…These enhancements aim to achieve optimal routing scheduling based on risk information. …”
-
25
-
26
-
27
-
28
-
29
Business priorities.
Published 2025“…These enhancements aim to achieve optimal routing scheduling based on risk information. …”
-
30
Topology of 14-node communication network.
Published 2025“…These enhancements aim to achieve optimal routing scheduling based on risk information. …”
-
31
Changes of risk value under different parameters.
Published 2025“…These enhancements aim to achieve optimal routing scheduling based on risk information. …”
-
32
Performance of active and standby paths.
Published 2025“…These enhancements aim to achieve optimal routing scheduling based on risk information. …”
-
33
DATA.
Published 2025“…These enhancements aim to achieve optimal routing scheduling based on risk information. …”
-
34
-
35
-
36
-
37
-
38
Analysis and design of algorithms for the manufacturing process of integrated circuits
Published 2023“…From this, we propose: (i) a new ILP model, and (ii) a new solution representation, which, unlike the reference work, guarantees that feasible solutions are obtained throughout the generation of new individuals. Based on this new representation, we proposed and evaluated other approximate methods, including a greedy algorithm and a genetic algorithm that improve the state-of-the-art results for test cases usually used in the literature. …”
-
39
-
40