Abstract: The 0-1 Knapsack Problem (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in ...
Abstract: Sensor-related disturbances and measurement uncertainties often degrade the performance of dynamic neural network methods in solving time-varying problems, especially the time-varying ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback