Filteren
1
Sorteren
11 resultaten
Serie: Monographs on discre
PaperbackEngels9780898714302
1-1-1987
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. Meer
GebondenEngels9780898714586
1-1-1987
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. Meer
GebondenEngels9780898714784
1-1-1987
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. Meer
GebondenEngels9780898714791
1-1-1987
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). Meer
GebondenEngels9780898714807
1-1-1987
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. Meer
GebondenEngels9780898714647
1-1-1987
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. Meer
PaperbackEngels9780898715408
1-1-1987
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. Meer
GebondenEngels9780898715699
1-12-2004
Algebraic Theory of Automata Networks investigates automata networks as algebraic structures and develops their theory in line with other algebraic theories. Meer
PaperbackEngels9780898715798
1-1-1987
In the field of combinatorial optimization problems, the Vehicle Routing Problem (VRP) is one of the most challenging. Defined more than 40 years ago, the problem involves designing the optimal set of routes for fleets of vehicles for the purpose of serving a given set of customers. Meer
PaperbackEngels9780898714227
1-1-1987
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. Meer
PaperbackEngels9780898714326
1-1-1987
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. Meer