We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
Zohreh Jabbari, William S. Evans, David G. Kirkpat...
Abstract. Task-based planning problems for multi-agent systems require multiple agents to find a joint plan for a constrained set of tasks. Typically, each agent receives a subset...
J. Renze Steenhuisen, Cees Witteveen, Yingqian Zha...
Searching and comparing information from semi-structured repositories is an important, but cognitively complex activity for internet users. The typical web interface displays a li...
Maria-Elena Hernandez, Sean M. Falconer, Margaret-...
Networks are a shared resource connecting critical IT infrastructure, and the general practice is to always leave them on. Yet, meaningful energy savings can result from improving...
We address the problem of reconstructing the background of a scene from a set of photographs featuring several occluding objects. We assume that the photographs are obtained from ...
Miguel Granados, Hans-Peter Seidel, Hendrik P. A. ...