SIAM Monographs on Discrete Mathematics and Applications – serie
Visar alla böcker i serien SIAM Monographs on Discrete Mathematics and Applications. Handla med fri frakt och snabb leverans.
10 produkter
Evaluation and Optimization of Electoral Systems
Av Pietro Grilli di Cortona, Cecilia Manzi m. fl.
Häftad, 1998
1219 kr
Lägg i varukorg
This monograph offers a systematic quantitative approach to the analysis, evaluation, and design of electoral systems. Today, electoral reform is of concern to newborn democracies as well as many old ones. The authors use mathematical models and automatic procedures, when possible, to solve some of …
Topics in Intersection Graph Theory
Av Terry A. McKee, F.R. McMorris
Häftad, 1999
1261 kr
Lägg i varukorg
Finally there is a book that presents real applications of graph theory in a unified format. This book is the only source for an extended, concentrated focus on the theory and techniques common to various types of intersection graphs. It is a concise treatment of the aspects of intersection graphs …
Graph Classes
A Survey
Av Andreas Brandstädt, Van Bang Le m. fl.
Häftad, 1999
1554 kr
Lägg i varukorg
This well-organized reference is a definitive encyclopedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each. The authors …
Branching Programs and Binary Decision Diagrams
Theory and Applications
Av Ingo Wegener
Inbunden, 2000
1777 kr
Lägg i varukorg
Finite functions (in particular, Boolean functions) play a fundamental role in computer science and discrete mathematics. This book describes representations of Boolean functions that have small size for many important functions and which allow efficient work with the represented functions. The …
Distributed Computing
A Locality-Sensitive Approach
Av David Peleg
Inbunden, 2000
1972 kr
Lägg i varukorg
This volume presents the locality-sensitive approach to distributed network algorithms - the utilization of locality to simplify control structures and algorithms and reduce their costs. The author begins with an introductory exposition of distributed network algorithms focusing on topics that …
Combinatorial Data Analysis
Optimization by Dynamic Programming
Av Lawrence Hubert, Phipps Arabie m. fl.
Inbunden, 2001
1164 kr
Lägg i varukorg
Combinatorial data analysis (CDA) refers to a wide class of methods for the study of relevant data sets in which the arrangement of a collection of objects is absolutely central. The focus of this monograph is on the identification of arrangements, which are then further restricted to where the …
Complexity Classifications of Boolean Constraint Satisfaction Problems
Av Nadia Creignou, Sanjeev Khanna m. fl.
Inbunden, 2001
1066 kr
Lägg i varukorg
Many fundamental combinatorial problems, arising in such diverse fields as artificial intelligence, logic, graph theory, and linear algebra, can be formulated as Boolean constraint satisfaction problems (CSP). This book is devoted to the study of the complexity of such problems. The authors' goal …
Discrete Mathematics of Neural Networks
Selected Topics
Inbunden, 2001
1108 kr
Lägg i varukorg
This concise, readable book provides a sampling of the very large, active, and expanding field of artificial neural network theory. It considers select areas of discrete mathematics linking combinatorics and the theory of the simplest types of artificial neural networks. Neural networks have …
Discrete Convex Analysis
Av Kazuo Murota
Häftad, 2013
1930 kr
Lägg i varukorg
Discrete Convex Analysis is a novel paradigm for discrete optimization that combines the ideas in continuous optimization (convex analysis) and combinatorial optimization (matroid/submodular function theory) to establish a unified theoretical framework for nonlinear discrete optimization. The study …
Algebraic Theory of Automata Networks
An Introduction
Av Pál Dömösi, Chrystopher L. Nehaniv
Inbunden, 2004
1735 kr
Tillfälligt slut
Algebraic Theory of Automata Networks investigates automata networks as algebraic structures and develops their theory in line with other algebraic theories, such as those of semigroups, groups, rings, and fields. The authors also investigate automata networks as products of automata, that is, as …
