Abstract. The task addressed here is a dynamic search through a bounded region, while avoiding multiple large obstacles, such as buildings. In the case of limited sensors and commu...
Wesley Kerr, Diana F. Spears, William M. Spears, D...
The problem of searching for a walker that wants to be found, when the walker moves toward the helicopter when it can hear it, is an example of a two sided search problem which is ...
Applications ranging from location-based services to multi-player online gaming require continuous query support to monitor, track, and detect events of interest among sets of mov...
An ambient is a named cluster of processes and subambients, which moves as a group. We describe type systems able to guarantee that certain ambients will remain immobile, and that ...
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M...