Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Recent research into single–objective continuous Estimation– of–Distribution Algorithms (EDAs) has shown that when maximum–likelihood estimations are used for parametric d...
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...