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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.
Dr Socaciu and Dr Iancu are lecturers in computer science. Dr Pătruţ is associate professor in computer science. Their domains of research are procedural programming, data structures, and artificial intelligence. They published several papers and books on programming, algorithms, artificial intelligence, and interactive education.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: moluna, Greven, Deutschland
Kartoniert / Broschiert. Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Socaciu TiberiuDr Socaciu and Dr Iancu are lecturers in computer science. Dr Patrut is associate professor in computer science. Their domains of research are procedural programming, data structures, and artificial intelligence. They . Bestandsnummer des Verkäufers 5522411
Anzahl: Mehr als 20 verfügbar
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: Neu. The Backtracking Method | Examples in Pascal and C++ | Tiberiu Socaciu (u. a.) | Taschenbuch | Englisch | LAP Lambert Academic Publishing | EAN 9783848441136 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Bestandsnummer des Verkäufers 106525740
Anzahl: 5 verfügbar
Anbieter: Buchpark, Trebbin, Deutschland
Zustand: Hervorragend. Zustand: Hervorragend | Sprache: Englisch | Produktart: Bücher. Bestandsnummer des Verkäufers 12276650/1001
Anzahl: 1 verfügbar
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
Paperback. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Bestandsnummer des Verkäufers ERICA79638484411366
Anzahl: 1 verfügbar