—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...
Abstract— We present an approach for the dynamic assignment and reassignment of a large team of homogeneous robotic agents to multiple locations with applications to search and r...
Consider the space of two dimensional vector functions whose components and curl are square integrable with respect to the degenerate weight given by the radial variable. This spac...
Dylan M. Copeland, Jayadeep Gopalakrishnan, Minah ...
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
We provide a new analysis of an efficient margin-based algorithm for selective sampling in classification problems. Using the so-called Tsybakov low noise condition to parametrize...