• Aucun résultat trouvé

[PDF] Top 20 Lexicographic refinements in possibilistic decision trees and finite-horizon Markov decision processes

Has 10000 "Lexicographic refinements in possibilistic decision trees and finite-horizon Markov decision processes" found on our website. Below are the top 20 most common "Lexicographic refinements in possibilistic decision trees and finite-horizon Markov decision processes".

Lexicographic refinements in possibilistic decision trees and finite-horizon Markov decision processes

Lexicographic refinements in possibilistic decision trees and finite-horizon Markov decision processes

... Abstract Possibilistic decision theory has been proposed twenty years ago and has had several extensions since ...qualitative decision problems, possibilistic decision theory ... Voir le document complet

26

Lexicographic refinements in possibilistic decision trees and finite-horizon Markov decision processes

Lexicographic refinements in possibilistic decision trees and finite-horizon Markov decision processes

... Abstract Possibilistic decision theory has been proposed twenty years ago and has had several extensions since ...qualitative decision problems, possibilistic decision theory ... Voir le document complet

27

Lexicographic refinements in possibilistic decision trees

Lexicographic refinements in possibilistic decision trees

... solve possibilistic Markov Decision ...a finite-horizon MDP can be translated into a set of decision trees (one for each ...for finite-horizon MDPs as ...the ... Voir le document complet

8

Efficient Policies for Stationary Possibilistic Markov  Decision Processes

Efficient Policies for Stationary Possibilistic Markov Decision Processes

... infinite horizon case is concerned, other types of lexicographic refinements could be ...times in a single trajectory and consider only those which are ... Voir le document complet

12

Efficient Policies for Stationary Possibilistic Markov  Decision Processes

Efficient Policies for Stationary Possibilistic Markov Decision Processes

... infinite horizon case is concerned, other types of lexicographic refinements could be ...times in a single trajectory and consider only those which are ... Voir le document complet

11

Lexicographic refinements in possibilistic sequential decision-making models

Lexicographic refinements in possibilistic sequential decision-making models

... exposed in Chapter 3, is how to overcome the drowning effect of qualitative utilities when comparing ...two lexicographic criteria that compare policies based on their corresponding matrices of ... Voir le document complet

131

Lexicographic refinements in possibilistic decision trees

Lexicographic refinements in possibilistic decision trees

... solve possibilistic Markov Decision ...a finite-horizon MDP can be translated into a set of decision trees (one for each ...for finite-horizon MDPs as ...the ... Voir le document complet

9

Lexicographic refinements in stationary possibilistic Markov Decision Processes

Lexicographic refinements in stationary possibilistic Markov Decision Processes

... of lexicographic refinements to finite horizon possibilistic Markov decision processes and proposes a value iteration algorithm that looks for policies ... Voir le document complet

22

Strong Uniform Value in Gambling Houses and Partially Observable Markov Decision Processes

Strong Uniform Value in Gambling Houses and Partially Observable Markov Decision Processes

... any finite POMDP has a strong uniform value, and consequently has a uniform value in pure ...strategies. In fact, we prove this result in a much more general framework, as we shall see ... Voir le document complet

25

Near Optimal Exploration-Exploitation in Non-Communicating Markov Decision Processes

Near Optimal Exploration-Exploitation in Non-Communicating Markov Decision Processes

... term in the regret bound. All the efforts we put in this direction were ...[18] and Theocharous et al. [19] proposed posterior sampling algorithms and proved bounds on the expected Bayesian ... Voir le document complet

28

Planning in Markov Decision Processes with Gap-Dependent Sample Complexity

Planning in Markov Decision Processes with Gap-Dependent Sample Complexity

... hold in our experiments (despite the large state ...done in the bandit ...scaling in n t h (s, a), un-doing a few union bounds that were found to be conservative in ... Voir le document complet

25

Algorithmic aspects of mean–variance optimization in Markov decision processes

Algorithmic aspects of mean–variance optimization in Markov decision processes

... follows. In Section II, we describe the model and our ...policies and performance objectives of interest. In Section III, we compare different policy classes and show that performance ... Voir le document complet

26

Markov Decision Petri Net and Markov Decision Well-Formed Net Formalisms

Markov Decision Petri Net and Markov Decision Well-Formed Net Formalisms

... computed, in RG nd an arc is added from nd to pr labeled by σ nd,pr ...unchanged in RG nd ...Bellman and Ford (BF) algorithm for a single-source shortest paths in a weighted digraph where the ... Voir le document complet

20

Possibilistic sequential decision making

Possibilistic sequential decision making

... interest in Operation Research and more recently in Artificial Intelligence towards the foundations and computational methods of decision making under ...sequential decision ... Voir le document complet

34

Lightweight Verification of Markov Decision Processes with Rewards

Lightweight Verification of Markov Decision Processes with Rewards

... variables in the model [3]. Nu- merical algorithms to find extremal schedulers in MDPs incur the additional cost of (effectively) considering all the possible ways that the nondeterminism might be resolved ... Voir le document complet

16

Pathwise uniform value in gambling houses and Partially Observable Markov Decision Processes

Pathwise uniform value in gambling houses and Partially Observable Markov Decision Processes

... Solan and Vieille [18] (existence of the uniform value in behavior strategies in POMDPs) has been generalized in several dynamic programming models with infinite state space and action ... Voir le document complet

25

Applications of Markov Decision Processes in Communication Networks : a Survey

Applications of Markov Decision Processes in Communication Networks : a Survey

... 101 - 54602 Villers lès Nancy Cedex France Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu - 35042 Rennes Cedex France Unité de recherche INRIA Rhône-Alpes : 65[r] ... Voir le document complet

55

Smart Sampling for Lightweight Verification of Markov Decision Processes

Smart Sampling for Lightweight Verification of Markov Decision Processes

... iteration’ and ‘value iteration’ ...[2] and the ‘state explosion problem’ [7]. In essence, these two terms refer to the fact that the number of states of a system increases exponentially with respect ... Voir le document complet

14

Collision Avoidance for Unmanned Aircraft using Markov Decision Processes

Collision Avoidance for Unmanned Aircraft using Markov Decision Processes

... can in fact generate non-trivial (if not superior) collision avoidance strategies that can compete with hand-crafted ...field-of-view and lack of horizontal localization ability, provides us a good example ... Voir le document complet

23

Constrained Markov Decision Processes with Total Expected Cost Criteria

Constrained Markov Decision Processes with Total Expected Cost Criteria

... Theorem 2. Choose any initial distribution β and policy u. Then either C(β, u) = ∞ or there exists a stationary policy w such that C(β, w) ≤ C(β, u), Proof. This is an extension of thm 8.1 in p.100 of [1]. ... Voir le document complet

3

Show all 10000 documents...