Parallel Algorithms for Irregularly Structured Problems, Alfonso Ferreira; Jose Rolim; Yousef Saad; Tao Yan
Автор: Afonso Ferreira; Jose Rolim Название: Parallel Algorithms for Irregularly Structured Problems ISBN: 3540603212 ISBN-13(EAN): 9783540603214 Издательство: Springer Рейтинг: Цена: 12157.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: These proceedings address issues related to deriving efficient parallel solutions to irregularly structured problems and they aim to foster co-operation between practitioners and theoreticians in the field. Topics covered include programming methods and compiling techniques.
Автор: Afonso Ferreira; Jose Rolim; Horst Simon; Shang-Hu Название: Solving Irregularly Structured Problems in Parallel ISBN: 3540648097 ISBN-13(EAN): 9783540648093 Издательство: Springer Рейтинг: Цена: 10480.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel, IRREGULAR`98, held in Berkeley, California, in August 1998.The 26 revised full papers presented were carefully reviewed and selected for inclusion from several dozen submissions.
Автор: Mari?n Vajtersic Название: Algorithms for Elliptic Problems ISBN: 9048141907 ISBN-13(EAN): 9789048141906 Издательство: Springer Рейтинг: Цена: 19564.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 'Et moi, ..., si j'avait su comment. One service mathematics has ren- en revenir, je n'y serais point alle'. dered the human race. It has put common sense back where it be- Jules Verne longs, on the topmost shelf next to the dusty canister labelIed 'discard- The series is divergent; therefore we ed nonsense'. may be able to do something with Eric T. Bell it. O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and nonlinearities abound. Similarly, all kinds of parts of mathematics serve as tools for other parts and for other sciences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One service topology has rendered mathema- tical physics ... '; 'One service logic has rendered computer science ... '; 'One service category theory has rendered mathematics ... '. All ar- guably true. Alld all statements obtainable this way form part of the raison d 'etre of this serics.
Описание: Presents a systematic collection of test problems for evaluating and testing constrained global optimization algorithms. This book also includes problems arising in a variety of engineering applications, as well as test problems from published computational reports.
Автор: Barthelemy, Jean-Pierre. Название: Algorithmic Complexity and Telecommunication Problems ISBN: 1857284518 ISBN-13(EAN): 9781857284515 Издательство: Taylor&Francis Рейтинг: Цена: 11942.00 р. Наличие на складе: Поставка под заказ.
Описание: In this treatment of algorithmic complexity the authors explore an area fundamental to the study of the foundations of computer science. It is a topic which is at the interface of information theory, applied mathematics and computer language theory and which is rooted strongly in this book in the problems of computer communication.; Complexity theory classifies problems according to the difficulty of resolving them, while algorithms provide the computational method for solving those problems. Therefore, algorithmic complexity is concerned with establishing the best algorithm given the constraints of the computational environment and the degree of complexity.; The first three chapters present the context for a later in-depth look at applied areas of the subject, with an outline of classical complexity theory. This is followed by three chapters which explore the key area of information communication. Within this field, the book is particularly concerned with two contiguous areas which make contrasting demands on the application of algorithmic complexity. Cryptography demands the creation of extremely complex problems in order to achieve its goal of security, whereas in coding for communication the emphasis is on maximizing the compact nature of the message and providing the error correction necessary for the message to achieve optimum speed. The two must co-exist and the methods outlined in Algorithmic Complexity suggest a number of approaches to such problems based on extensive examples of the authors' experience.; This senior undergraduate book should be an essential read for those studying advanced topics in theoretical computer science and should provide an introduction to applied complexity for researchers and professionals alike.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
