The Cross-Entropy (CE) method is a modern and effective optimization method well suited to parallel implementations. There is a vast array of problems today, some of which are hig...
Gareth E. Evans, Jonathan M. Keith, Dirk P. Kroese
The problem of finding the binomial population with the highest success probability is considered when the number of binomial populations is large. A new rigorous indifference zo...
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
Conservative adaptation consists in a minimal change on a source case to be consistent with the target case, given the domain knowledge. It has been formalised in a previous work t...