Home | Amazing | Today | Tags | Publishers | Years | Account | Search 
Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications (Operations Research / Computer Science Interfaces Series)
Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications (Operations Research / Computer Science Interfaces Series)

Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering. The book contains eleven chapters written by...

Efficient Algorithms for Listing Combinatorial Structures (Distinguished Dissertations in Computer Science)
Efficient Algorithms for Listing Combinatorial Structures (Distinguished Dissertations in Computer Science)

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...

Geometric Algorithms and Combinatorial Optimization (Algorithms and Combinatorics 2)
Geometric Algorithms and Combinatorial Optimization (Algorithms and Combinatorics 2)

This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and - in particular - combinatorial optimization. It offers a unifying approach based on two fundamental geometric algorithms: - the ellipsoid method for finding a point in a convex set and - the basis reduction...

Algorithmic Probability and Combinatorics: Ams Special Sessions on Algorithmic Probability and Combinatorics, October 5-6, 2007, Depaul University, ... Bc, Canada (Contemporary Mathematics)
Algorithmic Probability and Combinatorics: Ams Special Sessions on Algorithmic Probability and Combinatorics, October 5-6, 2007, Depaul University, ... Bc, Canada (Contemporary Mathematics)

This volume contains the proceedings of the AMS Special Sessions on Algorithmic Probability and Combinatories held at DePaul University on October 5-6, 2007 and at the University of British Columbia on October 4-5, 2008.

This volume collects cutting-edge research and expository on algorithmic probability and combinatories. It
...

Efficient Algorithms for Listing Combinatorial Structures (Distinguished Dissertations in Computer Science)
Efficient Algorithms for Listing Combinatorial Structures (Distinguished Dissertations in Computer Science)

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...

Flexibility and Robustness in Scheduling
Flexibility and Robustness in Scheduling

Scheduling is a broad research area and scheduling problems arise from several application domains (production systems, logistic, computer science, etc.). Solving scheduling problems requires tools of combinatorial optimization, exact or approximated algorithms. Flexibility is at the frontier between predictive deterministic approaches and...

Developer Testing: Building Quality into Software (Addison-Wesley Signature Series (Cohn))
Developer Testing: Building Quality into Software (Addison-Wesley Signature Series (Cohn))

How do successful agile teams deliver bug-free, maintainable software—iteration after iteration? The answer is: By seamlessly combining development and testing. On such teams, the developers write testable code that enables them to verify it using various types of...

Scheduling Algorithms
Scheduling Algorithms
From the reviews of the fourth edition: 

"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...

Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems

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...

Classification Algorithms for Codes and Designs (Algorithms and Computation in Mathematics)
Classification Algorithms for Codes and Designs (Algorithms and Computation in Mathematics)
This book considers one of the basic problems in discrete mathematics: given a collection of constraints, describe up to isomorphism all the objects that meet them. Only a handful of classification results for combinatorial objects are dated before the mid-20th century; indeed, it is through modern computers and recent developments in algorithms...
Mathematics for Informatics and Computer Science (ISTE)
Mathematics for Informatics and Computer Science (ISTE)

How many ways do exist to mix different ingredients, how many chances to win a gambling game, how many possible paths going from one place to another in a network ? To this kind of questions Mathematics applied to computer gives a stimulating and exhaustive answer. This text, presented in three parts (Combinatorics, Probability, Graphs)...

Combinatorial Optimization: 3-Volume Set (ISTE)
Combinatorial Optimization: 3-Volume Set (ISTE)

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major domains: mathematics, theoretical computer science and management.

The three volumes of the Combinatorial Optimization set aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and...

Result Page: 11 10 9 8 7 6 5 4 3 2 
©2018 LearnIT (support@pdfchm.net) - Privacy Policy