• Aucun résultat trouvé

Lexicographic refinements in possibilistic decision trees

N/A
N/A
Protected

Academic year: 2021

Partager "Lexicographic refinements in possibilistic decision trees"

Copied!
9
0
0

Texte intégral

Loading

Figure

Figure 1. The possibilistic decision tree of Example 1
Figure 2. A counter example at the efficiency of D lmax(lmin)
Figure 3. Transformed probabilistic decision tree of possibilisic decision tree of (counter)-example 3
Figure 4. Average CPU time (in ms) for h=2 to 7

Références

Documents relatifs

The primary aim of chapter 5 is to show how to relate the theory of expected utility with that of possibilistic qualitative utilities by refinement relations in the case of

In order to overcome the drowning effect in possibilistic stationary sequential decision problems, we have proposed two lexicographic criteria, initially introduced by Fargier

A large number of extensions of the decision tree algorithm have been proposed for overfitting avoidance, handling missing attributes, handling numerical attributes, etc..

ةرح ا ةحابس ا يف ءدبل عفدل ةيقفأا ةحازإا و قاط اا ةيواز يريغتم نيب يو - ةحابس ا يف ءدبل صاصتما ةيقفأا ةحازإا و قاط اا ةيواز يريغتم نيب يو عم طابترا دوجو مدع .ةرح ا..

The outcome of these considerations (mission of the firm, definition of STUs, technology environmental scan, etc.) is to capture change, either change that

/ La version de cette publication peut être l’une des suivantes : la version prépublication de l’auteur, la version acceptée du manuscrit ou la version de l’éditeur. For

The pure Fe hydrogenase was recovered in a 0.1 M pH 8 Tris/HCl medium containing three other molecules at low concentration: DTT, dithionite and desthiobiotin, which are

The secondary objectives were to (i) describe the mother-infant interactions and any dis- orders at discharge and 6 months, (ii) explore the association between maternal