Sequential Decision-Making Problems (Hardcover). Cet article n’est pas disponible.
Langue : anglais
Edité par ISTE Ltd and John Wiley & Sons Inc, London, 2009
- Éd. originale
- Livre relié
- Neuf

Vendeur : AussieBookSeller, Truganina, VIC, AustralieAussieBookSeller
Vendeur AbeBooks depuis 22 juin 2007
Etat: Neuf
EUR 303,67
A propos de cet article
Hardcover. Numerous formalisms have been designed to model and solve decision-making problems. Some formalisms, such as constraint networks, can express "simple" decision problems, while others take into account uncertainties (probabilities, possibilities.), unfeasible decisions, and utilities (additive or not). In the first part of this book, we introduce a generic algebraic framework that encompasses and unifies a large number of such formalisms. This formalism, called the PlausibilityFeasibilityUtility (PFU) framework, is based on algebraic structures, graphical models, and sequences of quantifications. This work on knowledge representation is completed by a work on algorithms for answering queries formulated in the PFU framework. The algorithms defined are based on variable elimination or tree search, and work on a new generic architecture for local computations called multi-operator cluster DAGs. In the first part of this book, the authors introduce a generic algebraic framework that encompasses and unifies a large number of such formalisms. This formalism, called the Plausibility--Feasibility--Utility (PFU) framework, is based on algebraic structures, graphical models, and sequences of quantifications. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…
N° de réf. du vendeur 9781848211742
- Titre
- Sequential Decision-Making Problems (Hardcover)
- Auteur
- Thomas Schiex
- Éditeur
- ISTE Ltd and John Wiley & Sons Inc, London
- Année de publication
- 2009
- État de l'article
- new
- Reliure
- Hardcover
- Langue
- anglais
- ISBN à 10 chiffres
- 1848211740
- ISBN à 13 chiffres
- 9781848211742
- Édition
- Edition originale
In the first part of this book, we introduce a generic algebraic framework that encompasses and unifies a large number of such formalisms. This formalism, called the Plausibility-Feasibility-Utility (PFU) framework, is based on algebraic structures, graphical models, and sequences of quantifications. This work on knowledge representation is completed by a work on algorithms for answering queries formulated in the PFU framework. The algorithms defined are based on variable elimination or tree search, and work on a new generic architecture for local computations called multi-operator cluster DAGs.
« Synopsis » peut appartenir à une autre édition de cet ouvrage.
À propos de l’auteur
Cédric Pralet, a graduate from a French engineering school with a PhD in Computer Sciences, is now working as a research engineer at ONERA (French Aerospace Lab).
Thomas Schiex is working at INRA (French Institute for Agronomical Research) on algorithms for constraint networks and graphical models, and their applications in computational biology.
Gérard Verfaillie's research activity at ONERA is related to models, methods, and tools for combinatorial optimization and constrained optimization, especially for planning and decision-making.
« A propos de ce titre » peut appartenir à une autre édition de cet ouvrage.