Abstract. For uncertain optimization problems, three measures of robustness (absolute robustness, deviation robustness and relative robustness) are proposed depending on the goal and specifics of the decision maker. Absolute robustness is well discussed on
ISSN 1342-2804
Research Reports on Mathematical and Computing Sciences
A Relaxation Algorithm with Probabilistic Guarantee for Robust Deviation Optimization Problems Akiko Takeda, Shunsuke Taguchi and Tsutomu Tanaka March 2006, B–427
Department of Mathematical and Computing Sciences Tokyo Institute of Technology SERIES
B: Operations Research

A NOVEL INFORMATION-THEORETIC CLUSTERING ALGORITHM FOR ROBUST, UNSUPERVISED CLASSIFICATION...probabilistic likelihood optimization techniques with mixture-models [1-3...
COPYRIGHT ALGORITHM SELECTION FOR SORTING AND PROBABILISTIC INFERENCE A MACHINE LEARNING-BA The algorithm selection problem aims at selecting the best algorithm ...
COPYRIGHT ALGORITHM SELECTION FOR SORTING AND PROBABILISTIC INFERENCE A MACHINE LEARNING-BA The algorithm selection problem aims at selecting the best algorithm ...
热门文档