Sequential Decision-Making Problems (Hardcover). Este artículo no está disponible.
Idioma: inglés
Editorial: ISTE Ltd and John Wiley & Sons Inc, London, 2009
- Primera edición
- Tapa dura
- Nuevo

Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de AmericaGrand Eagle Retail
Vendedor de AbeBooks desde 12 de octubre de 2005
Condición: Nuevo
EUR 191,22
Descripción del artículo del vendedor
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 multiple locations in the US or from the UK, depending on stock availability.…
N° de ref. del artículo 9781848211742
- Título
- Sequential Decision-Making Problems (Hardcover)
- Autor
- Thomas Schiex
- Editorial
- ISTE Ltd and John Wiley & Sons Inc, London
- Año de publicación
- 2009
- Estado
- new
- Encuadernación
- Hardcover
- Idioma
- inglés
- ISBN 10
- 1848211740
- ISBN 13
- 9781848211742
- Edición
- 1ª Edición
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.
“Sinopsis” puede pertenecer a otra edición de este título.
Acerca del autor
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.
“Acerca de” puede pertenecer a otra edición de este título.