Learning spaces offer a rigorous mathematical foundation for practical systems of educational technology. Learning spaces generalize partially ordered sets and are special cases of knowledge spaces. The various structures are investigated from the standpoints of combinatorial properties and stochastic processes.
This book offers concise and unbiased presentations by synthetic and analytical chemists who have been involved in creating and moving the field of combinatorial chemistry into the academic and industrial mainstream. Since the synthetic method often dictates the appropriate types of analysis, each chapter or section begins with a description...
Recent years have seen an explosive growth in research in combinatorics and graph theory.
One primary factor in this rapid development has been the advent of computers, and the
parallel study of practical and efficient algorithms. This volume represents an attempt to...
This edited volume features a curated selection of research in algebraic combinatorics that explores the boundaries of current knowledge in the field. Focusing on topics experiencing broad interest and rapid growth, invited contributors offer survey articles on representation theory, symmetric functions, invariant theory, and...
This encyclopedic work covers twenty-plus years of research in constraint programming in a readable, accessible and appealing way. For someone outside the field wondering what Constraint Programming is all about, this is the perfect introduction, and the book will remain useful as a reference for years. Michael Trick, Professor of Operations...
A matroid is an abstract mathematical structure that captures combinatorial properties of matrices. This book offers a unique introduction to matroid theory, emphasizing motivations from matrix theory and applications to systems analysis.
This book serves also as a comprehensive presentation of the theory and application of mixed...
This thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their members, What general methods are useful for listing combinatorial...
This new edition provides an up-to-date coverage of important theoretical models in the scheduling literature as well as significant scheduling problems that occur in the real world. It again includes supplementary material in the form of slide-shows from industry and movies that...
The First Summer School on Theoretical Aspects on Computer Science was held
at the Institute for Studies in Theoretical Physics and Mathematics (IPM) from
July 3-10, 2000.
The idea of organizing a summer school was originated during a conversation
between the first and the second editor of this volume in the winter...
This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the...
Although vast activity exists, especially recent, the editors did not find any book that treats applied algorithms in a comprehensive manner. The editors discovered a number of graduate courses in computer science programs with titles such as “Design and Analysis of Algorithms, “Combinatorial Algorithms” “Evolutionary...
"This is a book about scheduling algorithms. … The book contains eleven chapters. … Most of the chapters contain the summarized complexity results. In this edition the complexity columns have been updated. The book is completed by the bibliography which also has been updated and...
