— Approximating the sum of Log–Normal random variables (RVs) is a long–standing open issue, in the old and recent literature, and many approaches have been proposed to deal w...
Marco Di Renzo, Fabio Graziosi, Fortunato Santucci
The evolution strategy is one of the strongest evolutionary algorithms for optimizing real-value vectors. In this paper, we study how to use it for the evolution of prediction wei...
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Sha...