Tài liệu Thuật toán Algorithms (Phần 54) doc

... Nondeterministic Polynomial- Time Algorithms The great disparity in performance between “efficient” algorithms of the type we’ve been studying and brute-force “exponential” algorithms that check each possibility ... The practical utility of most of the algorithms is obvious: for many problems we have the luxury of several efficient algorithms to choose from. Many of the algorithms...

Ngày tải lên: 15/12/2013, 02:16

... useful algorithms. The book consists of forty chapters which are grouped into seven major parts: mathematical algorithms, sorting, searching, string processing, geomet- ric algorithms, graph algorithms ... structures and algorithms, ” on math- ematical analysis for “design and analysis of algorithms, ” and on software engineering techniques for “software tools”); in this book, the emp...

Ngày tải lên: 15/12/2013, 02:16

... need to be studied in order to understand the algorithms. Simple algorithms can give rise to complicated data structures and, conversely, complicated algorithms can use simple data structures. When ... 9 INTRODUCTION 7 The study of algorithms is interesting because it is a new field (almost all of the algorithms we will study are less than twenty-five years old) with a rich traditi...

Ngày tải lên: 15/12/2013, 02:16

... software capabilities certainly can have a significant impact on specific algorithms, but good algorithms on old machines are, for the most part, good algorithms on new machines. One reason for this is that the ... start with the algorithms that are best on conventional machines and adapt them to the particular features of the new machine. This approach encourages the persistence of ol...

Ngày tải lên: 15/12/2013, 02:16

... performance of various algorithms, we can look forward to the development of general-purpose parallel computers that will provide improved performance for a wide variety of algorithms. 466 CHAPTER ... to learn the characteristics of a fundamental algorithm within the context of some of the other algorithms that we’ve been studying. In par- ticular, we’ll examine how to use the algorithm...

Ngày tải lên: 15/12/2013, 02:16

Ngày tải lên: 15/12/2013, 02:16

... programming/simplex; for other problems (including various extensions of network flow), no better algorithms are known. Even if there is a better algorithm, it may be complicated or difficult to ... inefficient solutions for some simple problems (for example, many of those for which we have studied algorithms in this book). Geometric Interpretation Linear programs can be cast in a geometr...

Ngày tải lên: 15/12/2013, 02:16

... operation of moving from point to point on the simplex, in search of the solution. The several algorithms which are commonly used differ in essential details having to do with the order in which

Ngày tải lên: 15/12/2013, 02:16

... something like or to be considered efficient. We’ve generally considered quadratic algorithms to be bad and cubic algorithms to be awful. But for the problems that we’ll consider in this and the ... graph. For all of the algorithms in those chapters, it was possible to arrange the computation so that each node is visited just once, and this leads to very efficient algorithms. For the H...

Ngày tải lên: 15/12/2013, 02:16

... discussion is to gain some intuitive feeling for how divide-and-conquer algorithms achieve efficiency, not to do detailed analysis of the algorithms. Indeed, the particular recurrences that we’ve just ... applications (though the effect, is not always so dramatic): simple algorithms work best for small problems, but sophisticated algorithms can reap tremendous savings for large problem...

Ngày tải lên: 24/12/2013, 11:15