Online State Exploration: Competitive Worst Case and Learning-Augmented Algorithms.

Im, S; Moseley, B; Xu, C; Zhang, R

doi:10.1007/978-3-031-43421-1_20

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Friday, November 14 until 2:00 AM ET on Saturday, November 15 due to maintenance. We apologize for the inconvenience.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.

+ Advanced Search

Citation Details

Online State Exploration: Competitive Worst Case and Learning-Augmented Algorithms.

Award ID(s):: 1845146 2121744

PAR ID:: 10509584

Author(s) / Creator(s):: Im, S; Moseley, B; Xu, C; Zhang, R

Publisher / Repository:: Springer Link

Date Published:: 2023-10-18

Journal Name:: ECML/PKDD

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Conference Paper:
https://doi.org/10.1007/978-3-031-43421-1_20

Last Name:

First Name:

Search Results
Selected Authors

Type in a name, or the first few letters of a name, in one or both of appropriate search boxes above and select the search button. An attempt will be made to match authors that most closely relate to the text you typed.

No authors are currently selected. Choosing "Select These Authors" will enter a blank value for author search in the parent form.

Last Name:

First Name:

Search Results
Selected Editors

Type in a name, or the first few letters of a name, in one or both of appropriate search boxes above and select the search button. An attempt will be made to match editors that most closely relate to the text you typed.

No editors are currently selected. Choosing "Select These Editors" will enter a blank value for editor search in the parent form.

More Like this