|
Dòng
|
Nội dung
|
|
1
|
Introduction to Algorithms / Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest; Clifford Stein The MIT Press, 20221312 tr. ; cm.Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor
Đầu mục:0
(Lượt lưu thông:0)
Tài liệu số:1
(Lượt truy cập:1)
|
|
2
|
Scheduling Algorithms / Peter Brucker Springer, 2007379 tr. ; cm.Besides scheduling problems for single and parallel machines and shop scheduling problems, this book covers advanced models involving due-dates, sequence dependent changeover times and batching. Discussion also extends to multiprocessor task scheduling and problems with multi-purpose machines. Among the methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. The text goes on to summarize complexity results for different classes of deterministic scheduling problems
Đầu mục:1
(Lượt lưu thông:0)
Tài liệu số:1
(Lượt truy cập:1)
|
|
|
|
|