A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
COVAMOF is a variability management framework for product families that was developed to reduce the number of iterations required during product derivation and to reduce the depen...
Under mild conditions, it can be induced from the Karush-Kuhn-Tucker condition that the Pareto set, in the decision space, of a continuous multiobjective optimization problem is (m...
— A number of multi-objective genetic algorithms (MOGAs) have been developed to obtain Pareto optimal solutions for multi-objective optimization problems. However, as these metho...