• The smallest minimum color-spanning circle (S-MCSC) problem can be solved in O ( n k log ⁡ ) time. largest (L-MCSC) is NP-Hard. A 1 3 -factor 2 , if no two distinct color disks intersect) approximation to the L-MCSC computed Let R a set of colored imprecise points, where each point by one colors. Each specified unit disk which lies. We study computing and possible spanning circle, among all c...

Abstract The theory of imprecise probability is a generalization classical ‘precise’ that allows modeling imprecision and indecision. This practical advantage in situations where unique precise uncertainty model cannot be justified. arises, for example, when there relatively small amount data available to learn the or model’s structure defined uniquely. tools provides make it possible draw conc...

Subjective uncertainty is characterized by ambiguity if the decision maker has an imprecise knowledge of the probabilities of payo€ relevant events. In such an instance, the decision maker's beliefs are better represented by a set of probability functions than by a unique probability function. An ambiguity averse decision maker adjusts his choice on the side of caution in response to his imprec...