In this paper the authors point out that the Pareto Optimality is unfair, unreasonable and imperfect for Many-objective Optimization Problems (MOPs) underlying the hypothesis that ...
We present an algorithm to solve the sensor planning problem for a trinocular, active vision system. This algorithm uses an iterative optimization method to rst solve for the tran...
We discuss the problem of optimally "finishing" a partially sequenced, reconstructed DNA segment. At first sight, this appears to be computationally hard. We construct a...
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
Many-objective problems are difficult to solve using conventional multi-objective evolutionary algorithms (MOEAs) as these algorithms rely primarily on Pareto ranking to guide the ...