Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries

In computing with explorable uncertainty, one considers problems where the values of some input elements are uncertain, typically represented as intervals, but can be obtained using queries. Previous work has considered query minimization in the settings where queries are asked sequentially (adaptiv...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 85; číslo 2; s. 406 - 443
Hlavní autoři:	Erlebach, Thomas, Hoffmann, Michael, de Lima, Murilo Santos
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.02.2023 Springer Nature B.V
Témata:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Lower bounds Mathematics of Computing Optimization Queries Sorting algorithms Theory of Computation Uncertainty Online algorithms Selection problem 68W40 Competitive analysis 68W10 Explorable uncertainty Minimum problem Parallel algorithms Sorting problem
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!