نتایج جستجو برای: possibilistic programming
تعداد نتایج: 330913 فیلتر نتایج به سال:
Like Bayesian networks, possibilistic ones compactly encode joint uncertainty representations over a set of variables. Learning possibilistic networks from data in general and from imperfect or scarce data in particular, has not received enough attention. Indeed, only few works deal with learning the structure and the parameters of a possibilistic network from a dataset. This paper provides a p...
In this paper, we introduce a possibilistic argumentation-based decision making framework which is able to capture uncertain information and exceptions/defaults. In particular, we define the concept of a possibilistic decision making framework which is based on a possibilistic default theory, a set of decisions and a set of prioritized goals. This set of goals captures user preferences related ...
The paper deals with a possibilistic imprecise second-order probability model. It is argued that such models appear naturally in a number of situations. They lead to the introduction of a new type of previsions, called possibilistic previsions, which formally generalise coherent upper and lower previsions. The converse problem is also looked at: given a possibilistic prevision, under what condi...
This paper uses a constraint set approach to linear programming problems with equality constraints whose coefficients and/or right-hand side values could be uncertain. We consider three types of uncertainty: probabilistic, fuzzy/possibilistic, and interval. The constraint set generated by the linear constraints under uncertainty is illdefined and difficult to generate. Our approach computes an ...
This paper raises the question of solving multi-criteria sequential decision problems under uncertainty. It proposes to extend to possibilistic decision trees the decision rules presented in [1] for non sequential problems. It present a series of algorithms for this new framework: Dynamic Programming can be used and provide an optimal strategy for rules that satisfy the property of monotonicity...
In this paper we define a recursive semantics for warrant in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among arguments. This allows us to ensure direct and indirect consistency (in the sense of Caminada and Amgoud) without distinguishing between direct and indirect conflicts. Then, the general defeasible argumentation framework is e...
This study proposes a bi-objective mixed possibilistic, two-stage stochastic programming model to address supplier selection and order allocation problem to build the resilient supply base under operational and disruption risks. The model accounts for epistemic uncertainty of critical data and applies several proactive strategies such as suppliers’ business continuity plans, fortification of su...
The BDI model, as a practical reasoning architecture aims at making decisions about what to do based on cognitives notions as beliefs, desires and intentions. However, during the decision making process, BDI agents also have to make background decisions like choosing what intention to achieve next from a set of possibly conflicting desires; which plan to execute from among the plans that satisf...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید