Randomized Greedy Methods for Weak Submodular Sensor Selection with Robustness Considerations
arXiv:2404.03740v2 Announce Type: replace-cross Abstract: We study a pair of budget- and performance-constrained weak-submodular maximization problems. For computational efficiency, we explore the use of stochastic greedy algorithms which limit the search space via random samp...
🔗 Read more: https://arxiv.org/abs/2404.03740
#News #Space #Climate #Software #Math #Politics #Academic
Edited
Comments
Log in to leave a comment.
No comments yet. Be the first to comment!