Articoli correlati a A Computer Experiment Oriented Approach to Algorithmic...
A Computer Experiment Oriented Approach to Algorithmic Complexity: Computer Applications of Statistics - Brossura
Sinossi
This book forms the much needed strong interface between algorithmic complexity and computer experiments using a careful blending of traditional ideas in algorithms with untraditional research in computer experiments (esp. fitting stochastic models to non-random data). While establishing the aforesaid interface, the important role of statistical bounds and their empirical estimates obtained over a finite range (called empirical O) is discovered as a bonus. While these bounds are very valuable for the average case, our research suggests in addition that there is no need to be over-conservative in the worst case just as the statistical bounds safeguard against making tall optimistic claims for the best cases. In short the statistical bounds have a sense of "calculated guarantee" that is neither too risky nor too conservative. In parallel computing, with every change of the processor, it can be argued that it is the weight of the operation that changes. Hence, if the bound is itself based on weights, it should be deemed as the ideal one.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
L'autore
Dr. Soubhik Chakraborty is a Reader, Deptt. of Applied Mathematics, BIT Mesra, Ranchi, India with 50 international papers, an ACM and IEEE Reviewer (Comp. Rev./Trans. Comp.). Dr. Suman Kumar Sourabh is a Sr. Faculty, Deptt. of Statistics and Computer Applications, T. M. Bhagalpur University, Bhagalpur, India with 10 international papers.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 55,21
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costiRisultati della ricerca per A Computer Experiment Oriented Approach to Algorithmic...
Immagini fornite dal venditore
A Computer Experiment Oriented Approach to Algorithmic Complexity
Editore:
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838377435
ISBN 13: 9783838377438
Nuovo
Brossura
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Chakraborty SoubhikDr. Soubhik Chakraborty is a Reader, Deptt. of Applied Mathematics, BIT Mesra, Ranchi, India with 50 international papers, an ACM and IEEE Reviewer (Comp. Rev./Trans. Comp.). Dr. Suman Kumar Sourabh is a Sr. Facu. Codice articolo 5418030
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
A Computer Experiment Oriented Approach to Algorithmic Complexity
Editore:
LAP LAMBERT Academic Publishing Jun 2010, 2010
ISBN 10: 3838377435
ISBN 13: 9783838377438
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book forms the much needed strong interface between algorithmic complexity and computer experiments using a careful blending of traditional ideas in algorithms with untraditional research in computer experiments (esp. fitting stochastic models to non-random data). While establishing the aforesaid interface, the important role of statistical bounds and their empirical estimates obtained over a finite range (called empirical O) is discovered as a bonus. While these bounds are very valuable for the average case, our research suggests in addition that there is no need to be over-conservative in the worst case just as the statistical bounds safeguard against making tall optimistic claims for the best cases. In short the statistical bounds have a sense of 'calculated guarantee' that is neither too risky nor too conservative. In parallel computing, with every change of the processor, it can be argued that it is the weight of the operation that changes. Hence, if the bound is itself based on weights, it should be deemed as the ideal one. 192 pp. Englisch. Codice articolo 9783838377438
Quantità: 2 disponibili
Immagini fornite dal venditore
A Computer Experiment Oriented Approach to Algorithmic Complexity : Computer Applications of Statistics
Editore:
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838377435
ISBN 13: 9783838377438
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book forms the much needed strong interface between algorithmic complexity and computer experiments using a careful blending of traditional ideas in algorithms with untraditional research in computer experiments (esp. fitting stochastic models to non-random data). While establishing the aforesaid interface, the important role of statistical bounds and their empirical estimates obtained over a finite range (called empirical O) is discovered as a bonus. While these bounds are very valuable for the average case, our research suggests in addition that there is no need to be over-conservative in the worst case just as the statistical bounds safeguard against making tall optimistic claims for the best cases. In short the statistical bounds have a sense of 'calculated guarantee' that is neither too risky nor too conservative. In parallel computing, with every change of the processor, it can be argued that it is the weight of the operation that changes. Hence, if the bound is itself based on weights, it should be deemed as the ideal one. Codice articolo 9783838377438
Quantità: 1 disponibili
Immagini fornite dal venditore
A Computer Experiment Oriented Approach to Algorithmic Complexity
Editore:
LAP LAMBERT Academic Publishing Jun 2010, 2010
ISBN 10: 3838377435
ISBN 13: 9783838377438
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Neuware -This book forms the much needed strong interface between algorithmic complexity and computer experiments using a careful blending of traditional ideas in algorithms with untraditional research in computer experiments (esp. fitting stochastic models to non-random data). While establishing the aforesaid interface, the important role of statistical bounds and their empirical estimates obtained over a finite range (called empirical O) is discovered as a bonus. While these bounds are very valuable for the average case, our research suggests in addition that there is no need to be over-conservative in the worst case just as the statistical bounds safeguard against making tall optimistic claims for the best cases. In short the statistical bounds have a sense of 'calculated guarantee' that is neither too risky nor too conservative. In parallel computing, with every change of the processor, it can be argued that it is the weight of the operation that changes. Hence, if the bound is itself based on weights, it should be deemed as the ideal one.Books on Demand GmbH, Überseering 33, 22297 Hamburg 192 pp. Englisch. Codice articolo 9783838377438
Quantità: 2 disponibili
Foto dell'editore
A Computer Experiment Oriented Approach to Algorithmic Complexity: Computer Applications of Statistics
Editore:
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838377435
ISBN 13: 9783838377438
Antico o usato
Paperback
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: Like New. Like New. book. Codice articolo ERICA79038383774356
Quantità: 1 disponibili