Single-class closed queueing networks, consisting of infinite-server and single-server queues with exponential service times probabilistic routing, admit product-from solutions. Such solutions, although seemingly tractable, are difficult to characterize explicitly for practically relevant problems due the combinatorial complexity its normalization constant (partition function). In “A Probabilis...

One of the important challenges in Graphical models is the problem of dealing with the uncertainties in the problem. Among graphical networks, fuzzy cognitive map is only capable of modeling fuzzy uncertainty and the Bayesian network is only capable of modeling probabilistic uncertainty. In many real issues, we are faced with both fuzzy and probabilistic uncertainties. In these cases, the propo...

In this paper an epistemological model of learning fields of probabilistic events is formalized. It is used to explain resource allocation governed by pervasive complementarities as the sign of unity of knowledge. Such an episteme is induced epistemologically into interacting, integrating and evolutionary variables representing the problem at hand. The end result is the formalization of a p...

in this paper, a novel approach for multi response optimization is presented. in the proposed approach, response variables in treatments combination occur with a certain probability. moreover, we assume that each treatment has a network style. because of the probabilistic nature of treatment combination, the proposed approach can compute the efficiency of each treatment under the desirable reli...