Abstract-- In this paper we present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the en...
Stephen L. Smith, Jana Tumova, Calin Belta, Daniel...
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
In our previous work (`An Algebraic Watchdog for Wireless Network Coding'), we proposed a new scheme in which nodes can detect malicious behaviors probabilistically, police th...
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
Michael R. Fellows, Serge Gaspers, Frances A. Rosa...
We show that there is a straightforward algorithm to determine if the polyhedron guaranteed to exist by Alexandrov's gluing theorem is a degenerate flat polyhedron, and to re...
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
In 1992, Bartholdi, Tovey, and Trick [1992] opened the study of control attacks on elections--attempts to improve the election outcome by such actions as adding/deleting candidate...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...
We consider discrete denoising of two-dimensional data with characteristics that may be varying abruptly between regions. Using a quadtree decomposition technique and space-fillin...
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...