Distance rationalizability is an intuitive paradigm for developing and studying voting rules: given a notion of consensus and a distance function on preference profiles, a ration...
Abstract-- Existing high-dimensional motion planning algorithms are simultaneously overpowered and underpowered. In domains sparsely populated by obstacles, the heuristics used by ...
Nathan D. Ratliff, Matt Zucker, J. Andrew Bagnell,...
We consider the problem of dynamic buying and selling of shares from a collection of N stocks with random price fluctuations. To limit investment risk, we place an upper bound on t...
Abstract. Various applications in uid dynamics and computational continuum mechanics motivate the development of reliable and ecient adaptive algorithms for mixed nite element m...
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...