Motivated by the Markov chain Monte Carlo (MCMC) relaxation method of Jalali and Weissman, we propose a lossy compression algorithm for continuous amplitude sources that relies on...
—Particle Swarm Optimization (PSO) has shown its fast search speed in many complicated optimization and search problems. However, PSO could often easily fall into local optima. T...
— We develop decentralized controllers for a team of disk-shaped robots to converge to and circulate along the boundary of a desired two-dimensional geometric pattern specified ...
This work presents a comprehensive theoretical framework for window-based congestion control protocols that are designed to converge to fairness and efficiency. We first derive ...
We give the first rigorous upper bounds on the error of temporal difference (td) algorithms for policy evaluation as a function of the amount of experience. These upper bounds pr...