A hybrid multi-objective simulated annealing algorithm combined with K-nearest neighbors local search reduced average drone ...
Simulated annealing is a technique for finding an optimal or near-optimal solution for combinatorial optimization problems, or problems that have discrete variables. This technique was proposed by ...
If you want to simulate a tic-tac-toe game, that’s easy. You can evaluate every possible move in a reasonable amount of time. Simulating antennas, however, is much harder. [Rosrislav] has been ...
In computer science, normally we care about asymptotic speedup: We care about, “What is your running time as a function of the size of the problem? Does it grow linearly? Does it grow quadratically?” ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results