11 citations · 26 across the 13 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.DS2020
Online Search with Maximum Clearance
Spyros Angelopoulos, Malachi Voss
We study the setting in which a mobile agent must locate a hidden target in a bounded or unbounded environment, with no information about the hider's position. In particular, we co…
cs.AI2020
Contract Scheduling With Predictions
Spyros Angelopoulos, Shahin Kamali
Contract scheduling is a general technique that allows to design a system with interruptible capabilities, given an algorithm that is not necessarily interruptible. Previous work o…
cs.DS2020
Online Search With a Hint
Spyros Angelopoulos
The linear search problem, informally known as the cow path problem, is one of the fundamental problems in search theory. In this problem, an immobile target is hidden at some unkn…