9781332869916 - balancing is not always good (classic reprint) di snir, marc (4 risultati)
- Brossura
Da: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 23,87
Spedizione gratuitaSpedito in U.S.A.Quantità: 15 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Brossura
Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 24,18
EUR 3,84 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 15 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
Altre immagini- Brossura
- Print on Demand
Da: Forgotten Books, London, Regno UnitoForgotten Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 15,07
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. Print on Demand. This book delves into the complexities of recurrence relations that arise within divide and conquer algorithms, challenging the commonly held notion known as the "Balancing Principle." The author meticulously examines scenarios where the principle stands valid, discerning that it hold…s true when the function representing the cost of combining solutions, denoted as f, exhibits convexity. However, when f demonstrates concavity, an optimal solution is achieved by deliberately introducing imbalance. The author meticulously formulates recurrence relations to express the time complexity of divide and conquer algorithms, establishing a functional equation framework for analysis. Through the study of convex and concave functions, the book illuminates the conditions under which the Balancing Principle remains valid. Expanding on this, the author presents a strategy for solving recurrence relations involving concave functions, thereby revealing that the optimal strategy in such cases involves unbalancing rather than maintaining equal-sized subproblems. This book significantly contributes to the theoretical understanding of algorithm analysis, particularly in the context of divide and conquer approaches. Its insights challenge conventional wisdom and provide valuable guidance for researchers and practitioners seeking to optimize the performance of algorithms. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.
- Brossura
- Print on Demand
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 33,41
EUR 11,68 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: Brand New. 30 pages. 9.21x5.98x0.10 inches. This item is printed on demand.
