An introduction to algorithms for readers with no background in advanced mathematics or computer science, emphasizing examples and real-world problems.
Algorithms are what we do in order not to have to do something. Algorithms consist of instructions to carry out tasks—usually dull, repetitive ones. Starting from simple building blocks, computer algorithms enable machines to recognize and produce speech, translate texts, categorize and summarize documents, describe images, and predict the weather. A task that would take hours can be completed in virtually no time by using a few lines of code in a modern scripting program. This book offers an introduction to algorithms through the real-world problems they solve. The algorithms are presented in pseudocode and can readily be implemented in a computer language.
The book presents algorithms simply and accessibly, without overwhelming readers or insulting their intelligence. Readers should be comfortable with mathematical fundamentals and have a basic understanding of how computers work; all other necessary concepts are explained in the text. After presenting background in pseudocode conventions, basic terminology, and data structures, chapters cover compression, cryptography, graphs, searching and sorting, hashing, classification, strings, and chance. Each chapter describes real problems and then presents algorithms to solve them. Examples illustrate the wide range of applications, including shortest paths as a solution to paragraph line breaks, strongest paths in elections systems, hashes for song recognition, voting power Monte Carlo methods, and entropy for machine learning. Real-World Algorithms can be used by students in disciplines from economics to applied sciences. Computer science majors can read it before using a more technical text.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Real World Algorithms : A Beginner's Guide by Panos Louridas, 9780262035705 , Mit Press
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 3,31 per la spedizione in U.S.A.
Destinazione, tempi e costiEUR 3,52 per la spedizione in U.S.A.
Destinazione, tempi e costiDa: HPB-Red, Dallas, TX, U.S.A.
Hardcover. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Codice articolo S_322230149
Quantità: 1 disponibili
Da: ebooks Keystone, Reading, PA, U.S.A.
Condizione: good. This book is in good condition, with minimal signs of wear and tear. Codice articolo GWKV.0262035707.G
Quantità: 1 disponibili
Da: SecondSale, Montgomery, IL, U.S.A.
Condizione: Very Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc. Codice articolo 00087392971
Quantità: 1 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. Codice articolo 26375064762
Quantità: 3 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 27876480
Quantità: 4 disponibili
Da: INDOO, Avenel, NJ, U.S.A.
Condizione: As New. Unread copy in mint condition. Codice articolo RH9780262035705
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 27876480-n
Quantità: 4 disponibili
Da: INDOO, Avenel, NJ, U.S.A.
Condizione: New. Brand New. Codice articolo 9780262035705
Quantità: Più di 20 disponibili
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Codice articolo ABNR-15247
Quantità: 2 disponibili
Da: Basi6 International, Irving, TX, U.S.A.
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Codice articolo ABEJUNE24-69503
Quantità: 8 disponibili