Andere Kunden interessierten sich auch für
![Holistic Management]( "Holistic Management")
Holistic Management183,99 €![Engineering Principles of Combat Modeling and Distributed Simulation]( "Engineering Principles of Combat Modeling and Distributed Simulation")
Engineering Principles of Combat Modeling and Distributed Simulation176,99 €![Service Design for Six SIGMA]( "Service Design for Six SIGMA")
Service Design for Six SIGMA172,99 €![Enterprise Transformation]( "Enterprise Transformation")
Enterprise Transformation142,99 €![Multicriteria Decision Aid and Artificial Intelligence]( "Multicriteria Decision Aid and Artificial Intelligence")
Multicriteria Decision Aid and Artificial Intelligence114,99 €![The New Dynamic Project Management]( "The New Dynamic Project Management")
The New Dynamic Project Management206,99 €![Probablistic Risk Assessment and Management for Engineers and Scientists]( "Probablistic Risk Assessment and Management for Engineers and Scientists")
Probablistic Risk Assessment and Management for Engineers and Scientists194,99 €
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 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.
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.