Probabilistic Expert Systems emphasizes the basic computational principles that make probabilistic reasoning feasible in expert systems. The key to computation in these systems is the modularity of the probabilistic model. Shafer describes and compares the principal architectures for exploiting this modularity in the computation of prior and posterior probabilities. He also indicates how these similar yet different architectures apply to a wide variety of other problems of recursive computation in applied mathematics and operations research. This book describes probabilistic expert systems in...
Probabilistic Expert Systems emphasizes the basic computational principles that make probabilistic reasoning feasible in expert systems. The key to co...
A survey of some of the work that has been done since the appearance of the second edition of Combinatorial Algorithms. Topics include progress in: Gray Codes, listing of subsets of given size of a given universe, listing rooted and free trees, selecting free trees and unlabeled graphs uniformly at random, and ranking and unranking problems on unlabeled trees.
A survey of some of the work that has been done since the appearance of the second edition of Combinatorial Algorithms. Topics include progress in: Gr...
Interest in the temporal fluctuations of biological populations can be traced to the dawn of civilization. How can mathematics be used to gain an understanding of population dynamics? This monograph introduces the theory of structured population dynamics and its applications, focusing on the asymptotic dynamics of deterministic models. This theory bridges the gap between the characteristics of individual organisms in a population and the dynamics of the total population as a whole. In this monograph, many applications that illustrate both the theory and a wide variety of biological issues are...
Interest in the temporal fluctuations of biological populations can be traced to the dawn of civilization. How can mathematics be used to gain an unde...
An exploration of the interrelated fields of design of experiments and sequential analysis with emphasis on the nature of theoretical statistics and how this relates to the philosophy and practice of statistics.
An exploration of the interrelated fields of design of experiments and sequential analysis with emphasis on the nature of theoretical statistics and h...
This second edition provides much-needed updates to the original volume. Like the first edition, it emphasizes the ideas behind the algorithms as well as their theoretical foundations and properties, rather than focusing strictly on computational details; at the same time, this new version is now largely self-contained and includes essential proofs. Additions have been made to almost every chapter, including an introduction to the theory of inexact Newton methods, a basic theory of continuation methods in the setting of differentiable manifolds, and an expanded discussion of minimization...
This second edition provides much-needed updates to the original volume. Like the first edition, it emphasizes the ideas behind the algorithms as well...
This monograph presents new and elegant proofs of classical results and makes difficult results accessible. The integer programming models known as set packing and set covering have a wide range of applications. Sometimes, owing to the special structure of the constraint matrix, the natural linear programming relaxation yields an optimal solution that is integral, thus solving the problem. Sometimes, both the linear programming relaxation and its dual have integral optimal solutions. Under which conditions do such integrality conditions hold? This question is of both theoretical and practical...
This monograph presents new and elegant proofs of classical results and makes difficult results accessible. The integer programming models known as se...
