Search Results for author:
Found 3 papers, 0 papers with code
DL-DRL: A double-level deep reinforcement learning approach for large-scale task scheduling of multi-UAV
Moreover, we also show via an ablation study that our ITS can help achieve a balance between the performance and training efficiency.
Shortest non-separating st-path on chordal graphs
Many NP-Hard problems on general graphs, such as maximum independence set, maximal cliques and graph coloring can be solved efficiently on chordal graphs.
Data Structures and Algorithms F.2.2
A natural extension to the convex hull problem and a novel solution
We study a natural extension to the well-known convex hull problem by introducing multiplicity: if we are given a set of convex polygons, and we are allowed to partition the set into multiple components and take the convex hull of each individual component, what is the minimum total sum of the perimeters of the convex hulls?
Computational Geometry F.2.2
