Near-optimal probabilistic search via submodularity and sparse regression

You are here: Homepage > Search

Near-optimal probabilistic search via submodularity and sparse regression

Near-optimal probabilistic search via submodularity and sparse regression

Tseng, K. S.

Access

Check availability in my library

Order at Subito €

Export, share and cite

Document information

Title :

Near-optimal probabilistic search via submodularity and sparse regression

Contributors:

Tseng, K. S. (author)

Published in:

AUTONOMOUS ROBOTS ; 41 , 1 ; 205-229

Publication date :

2017-01-01

Size :

25 pages

ISSN :

Type of media :

Article (Journal)

Type of material :

Print

Language :

English

Classification :

DDC:

003 / 629.892

© Metadata Copyright the British Library Board and other contributors. All rights reserved.

Similar titles

Near-optimal probabilistic search using spatial Fourier sparse set

Tseng, K. S. | British Library Online Contents | 2018

Submodularity of optimal sensor placement for traffic networks

Li, Ruolin / Mehr, Negar / Horowitz, Roberto | Elsevier | 2023

Submodularity Property for Facility Locations of Dynamic Flow Networks

Suriya, Peerawit / Suppakitpaisarn, Vorapong / Chaidee, Supanut et al. | DataCite | 2023

Free access

Using submodularity within column generation to solve the flight-to-gate assignment problem

Li, Yijiang / Clarke, John-Paul / Dey, Santanu S. | Elsevier | 2021

Probabilistic Analysis with Sparse Data

McDonald, Mark / Zaman, Kais / Mahadevan, Sankaran | AIAA | 2013

Access

Check availability in my library

Order at Subito €

Page navigation

Document information

Export, share and cite