Программы для настройки и оптимизации ОС | 瓒崇悆瀹濊礉 | The Mindy Project
Home | Amazing | Today | Tags | Publishers | Years | Account | Search 
Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing
Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing

Wiley-Interscience Series in Discrete Mathematics and Optimization Advisory Editors Ronald L. Graham Jan Karel Lenstra Robert E. Tarjan Discrete Mathematics and Optimization involves the study of finite structures. It is one of the fastest growing areas in mathematics today. The level and depth of recent advances in the area and the wide...

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

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

Recent Advances in Algorithms and Combinatorics
Recent Advances in Algorithms and Combinatorics
From the reviews:

"Combinatorics is one of the fastest growing fields of mathematics. … From the table of contents one can see the wide range of topics covered. The authors are acknowledged researchers of the presented fields and guarantee the high quality of the volume. If you want to be up-to-date in combinatorics you should...

Handbook of Numerical Analysis : Special Volume: Foundations of Computational Mathematics
Handbook of Numerical Analysis : Special Volume: Foundations of Computational Mathematics
A long time ago, when younger and rasher mathematicians, we both momentarily harboured the ambition that one day, older and wiser, we might write a multivolume treatise titled “On the Mathematical Foundations of Numerical Analysis”. And then it dawned that such a creation already exists: it is called ‘a mathematics library’....
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...

Handbook of Approximation Algorithms and Metaheuristics
Handbook of Approximation Algorithms and Metaheuristics

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical applications. It is the first book to comprehensively study both approximation algorithms and metaheuristics.

Starting with basic approaches, the
...

Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
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
...
Advances in Bio-inspired Computing for Combinatorial Optimization Problems (Intelligent Systems Reference Library)
Advances in Bio-inspired Computing for Combinatorial Optimization Problems (Intelligent Systems Reference Library)

"Advances in Bio-inspired Combinatorial Optimization Problems" illustrates several recent bio-inspired efficient algorithms for solving NP-hard problems.

Theoretical bio-inspired concepts and models, in particular for agents, ants and virtual robots are described. Large-scale optimization problems, for example: the...

Exact Exponential Algorithms (Texts in Theoretical Computer Science. An EATCS Series)
Exact Exponential Algorithms (Texts in Theoretical Computer Science. An EATCS Series)

For a long time computer scientists have distinguished between fast and slow algorithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow...

Advanced Number Theory
Advanced Number Theory
Eminent mathematician/teacher approaches algebraic number theory from historical standpoint. Demonstrates how concepts, definitions, theories have evolved during last 2 centuries. Abounds with numerical examples, over 200 problems, many concrete, specific theorems. Includes numerous graphs and tables.

The prerequisites for this book
...
Adaptive and Multilevel Metaheuristics (Studies in Computational Intelligence)
Adaptive and Multilevel Metaheuristics (Studies in Computational Intelligence)
One of the keystones in practical metaheuristic problem-solving is the fact that tuning the optimization technique to the problem under consideration is crucial for achieving top performance. This tuning/customization is usually in the hands of the algorithm designer, and despite some methodological attempts, it largely remains a scientific art....
Result Page: 11 10 9 8 7 6 5 4 3 2 
©2018 LearnIT (support@pdfchm.net) - Privacy Policy