Skip to main navigation
Skip to search
Skip to main content
National Central University Home
Help & FAQ
English
中文
Home
Scholar Profiles
Research units
Projects
Research output
Datasets
Prizes
Activities
Press/Media
Impacts
Search by expertise, name or affiliation
Near-optimal probabilistic search via submodularity and sparse regression
Kuo Shih Tseng
, Bérénice Mettler
Department of Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
17
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Near-optimal probabilistic search via submodularity and sparse regression'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Near-optimal
100%
Search Problems
100%
Submodularity
100%
Probabilistic Search
100%
Sparse Regression
100%
Detection Rate
66%
Detection Probability
66%
NP-hard
33%
High Probability
33%
Adaptive Optimization
33%
Target Detection
33%
Limited Sensors
33%
Minimum Time
33%
Optimal Search
33%
Minimum-time Trajectory Planning
33%
Adaptive Probability
33%
Computer Science
Detection Rate
100%
Objective Function
50%
Trajectory Planning
50%
Time Trajectory
50%
Engineering
Probability of Detection
100%
Path Planning
50%
Objective Function
50%
Target Tracking
50%