We motivate and describe the problem of finding protocols for multiparty computations that only use a single broadcast round per computation (latency-free computations). We show t...
We use game theory to analyze meta-learning algorithms. The objective of meta-learning is to determine which algorithm to apply on a given task. This is an instance of a more gene...
: In this paper we consider several facility location problems with applications to cost and social welfare optimization, when the area map is encoded as a binary (0,1) mxn matrix....
Portfolio management in finance is more than a mathematical problem of optimizing performance under risk constraints. A critical factor in practical portfolio problems is severe u...
Daniel Berleant, L. Andrieu, Jean-Philippe Argaud,...
Abstract. Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues...