Andere Kunden interessierten sich auch für
![Usability Assessment Method of the Open Source Applications]( "Usability Assessment Method of the Open Source Applications")
Usability Assessment Method of the Open Source Applications35,99 €![The ¿IQ Method]( "The ¿IQ Method")
The ¿IQ Method48,99 €![Modified Neldermead Simplex Method for Clustering Gene Expression Data]( "Modified Neldermead Simplex Method for Clustering Gene Expression Data")
Modified Neldermead Simplex Method for Clustering Gene Expression Data26,99 €![Data Construction Method for Small Sample Sets]( "Data Construction Method for Small Sample Sets")
Data Construction Method for Small Sample Sets48,99 €![The implications of RFID on society. An ethical case study using William May's seven-step method for an ethical analysis]( "The implications of RFID on society. An ethical case study using William May's seven-step method for an ethical analysis")
The implications of RFID on society. An ethical case study using William May's seven-step method for an ethical analysis17,95 €![Is the consumer willing to adopt the innovative cryptocurrency Bitcoin as a payment method?]( "Is the consumer willing to adopt the innovative cryptocurrency Bitcoin as a payment method?")
Is the consumer willing to adopt the innovative cryptocurrency Bitcoin as a payment method?47,95 €![Neural network methods for monitoring dynamic objects]( "Neural network methods for monitoring dynamic objects")
Neural network methods for monitoring dynamic objects60,99 €
One of the best known general techniques for developing of the algorithms is the Backtracking method. It seeks to eliminate the generation of all possibilities in order to get the result. The Backtracking method can be applied to those problems for which the solution can be represented as a vector whose elements take values in some finite sets and who meet certain internal conditions. In the Backtracking method, the vector elements are expressed one at a time, assigning a value to a component will be done only after values have been assigned to all its previous components, and no incompatibilities exist between these values. Classical problems solved by this method are: queens problem, Cartesian product generation, the generation of combinations, the 0-1 knapsack problem. The book is structured into 7 chapters and provides the solutions to a number of 19 classical problems by using versions of the backtracking algorithm. Most of the paragraphs are followed by a section with solved exercises and problems.