UC Santa Barbara computer scientist Daniel Lokshtanov is advancing fundamental understanding of computational efficiency through groundbreaking research on quasi-polynomial time algorithms, supported ...
Abstract: Many online resource allocation algorithms have been recently proposed to handle optimization problems in dynamic scenarios. However, none of these algorithms have been designed to take into ...
Abstract: In multimodal multi-objective optimization problems (MMOPs), multiple solutions on different Pareto optimal solution sets (PSs) are mapped to the same point on the Pareto front. Considering ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback