Produktdetails
- ISBN-13: 9783540660613
- ISBN-10: 3540660615
- Artikelnr.: 24033060
- Herstellerkennzeichnung Die Herstellerinformationen sind derzeit nicht verfügbar.
The March 2002 issue of ACMs Computing Rezensions identifies a review of "How to Solve It" as the best review they published in 2001. The review is then reprinted in its entirety. Rezensioner: H. Van Dyke Parunak. Excerpt: Like its predecessor, the new How to Solve It, combines deep mathematical insight with skilled pedagogy. Puzzle lovers will seek out the book for its insightful discussion of many intriguing brain twisters. Students of computational methods will find it an accessible but rigorous introduction to evolutionary algorithms. Teachers will learn from its expositions how to make their own subject matter clearer to their students. Polya would be honored to know that his spirit lives on in the computer age.
The March 2002 issue of ACMs Computing Rezensions identifies a review of "How to Solve It" as the best review they published in 2001. The review is then reprinted in its entirety. Rezensioner: H. van Dyke Parunak. Excerpt: Like its predecessor, the new How to Solve It, combines deep mathematical insight with skilled pedagogy. Puzzle lovers will seek out the book for its insightful discussion of many intriguing brain twisters. Students of computational methods will find it an accessible but rigorous introduction to evolutionary algorithms. Teachers will learn from its expositions how to make their own subject matter clearer to their students. Polya would be honored to know that his spirit lives on in the computer age.
The March 2002 issue of ACMs Computing Rezensions identifies a review of "How to Solve It" as the best review they published in 2001. The review is then reprinted in its entirety. Rezensioner: H. van Dyke Parunak. Excerpt: Like its predecessor, the new How to Solve It, combines deep mathematical insight with skilled pedagogy. Puzzle lovers will seek out the book for its insightful discussion of many intriguing brain twisters. Students of computational methods will find it an accessible but rigorous introduction to evolutionary algorithms. Teachers will learn from its expositions how to make their own subject matter clearer to their students. Polya would be honored to know that his spirit lives on in the computer age.