Computing convex coverage sets for faster multi-objective coordination

Date: 2015

Categories:

Reference

Roijers, D.M., Whiteson, S. and Oliehoek, F.A. (2015) ‘Computing convex coverage sets for faster multi-objective coordination’,Journal of Artificial Intelligence Research, 52, pp. 399–443. doi: 10.1007/978-3-642-41575-3_24.

Full text available at www.jair.org

Author

Prof. Shimon Whiteson

« Posterior consistency for Bayesian inverse problems through stability and regression results

Exploiting Submodular value functions for faster dynamic sensor selection »

Computing convex coverage sets for faster multi-objective coordination

Reference

Author

More