We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
Nominal techniques were introduced to represent in a simple and natural way that involve binders. The syntax includes an abstraction operator and a primitive notion of name swappin...
Capability planning problems are pervasive throughout many areas of human interest with prominent examples found in defense and security. Planning provides a unique context for op...
James M. Whitacre, Hussein A. Abbass, Ruhul A. Sar...
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...