Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7(495) 980-12-10
  пн-пт: 10-18 сб,вс: 11-18
  shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Хиты | |
 

Concise Guide to Numerical Algorithmics, Nazareth J.L.



Варианты приобретения
Цена: 7652р.
Кол-во:
Наличие: Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Америка: Есть  
При оформлении заказа до: 17 фев 2025
Ориентировочная дата поставки: Март
При условии наличия книги у поставщика.

Добавить в корзину
в Мои желания

Автор: Nazareth J.L.   (Назарет)
Название:  Concise Guide to Numerical Algorithmics
Перевод названия: Назарет: Краткое руководство по числовой алгоритмике
ISBN: 9783031217616
Издательство: Springer
Классификация:
ISBN-10: 3031217616
Обложка/Формат: Soft cover
Страницы: 69
Вес: 0.147 кг.
Дата издания: 03.01.2023
Серия: SpringerBriefs in Computer Science
Язык: English
Издание: 1st ed. 2023
Иллюстрации: 7 illustrations, color; 2 illustrations, black and white; xiv, 69 p. 9 illus., 7 illus. in color.
Размер: 235 x 155
Читательская аудитория: Professional & vocational
Основная тема: Computer Science
Подзаголовок: The foundations and spirit of scientific computing
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: Numerical Algorithmic Science and Engineering (NAS&E), or more compactly, Numerical Algorithmics, is the theoretical and empirical study and the practical implementation and application of algorithms for solving finite-dimensional problems of a numeric nature. The variables of such problems are either discrete-valued, or continuous over the reals, or, and as is often the case, a combination of the two, and they may or may not have an underlying network/graph structure. This re-emerging discipline of numerical algorithmics within computer science is the counterpart of the now well-established discipline of numerical analysis within mathematics, where the latter’s emphasis is on infinite-dimensional, continuous numerical problems and their finite-dimensional, continuous approximates. A discussion of the underlying rationale for numerical algorithmics, its foundational models of computation, its organizational details, and its role, in conjunction with numerical analysis, in support of the modern modus operandi of scientific computing, or computational science & engineering, is the primary focus of this short monograph. It comprises six chapters, each with its own bibliography. Chapters 2, 3 and 6 present the book’s primary content. Chapters 1, 4, and 5 are briefer, and they provide contextual material for the three primary chapters and smooth the transition between them. Mathematical formalism has been kept to a minimum, and, whenever possible, visual and verbal forms of presentation are employed and the discussion enlivened through the use of motivating quotations and illustrative examples. The reader is expected to have a working knowledge of the basics of computer science, an exposure to basic linear algebra and calculus (and perhaps some real analysis), and an understanding of elementary mathematical concepts such as convexity of sets and functions, networks and graphs, and so on. Although this book is not suitable for use as the principal textbook for a course on numerical algorithmics (NAS&E), it will be of value as a supplementary reference for a variety of courses. It can also serve as the primary text for a research seminar. And it can be recommended for self-study of the foundations and organization of NAS&E to graduate and advanced undergraduate students with sufficient mathematical maturity and a background in computing. When departments of computer science were first created within universities worldwide during the middle of the twentieth century, numerical analysis was an important part of the curriculum. Its role within the discipline of computer science has greatly diminished over time, if not vanished altogether, and specialists in that area are now to be found mainly within other fields, in particular, mathematics and the physical sciences. A central concern of this monograph is the regrettable, downward trajectory of numerical analysis within computer science and how it can be arrested and suitably reconstituted. Resorting to a biblical metaphor, numerical algorithmics (NAS&E) as envisioned herein is neither old wine in new bottles, nor new wine in old bottles, but rather this re-emerging discipline is a decantation of an age-old vintage that can hopefully find its proper place within the larger arena of computer science, and at what appears now to be an opportune time.
Дополнительное описание: PART I: RATIONALE AND FOUNDATIONS.- The discussion here is premised on the paper that accompanies this proposal..- Chapter 1: Algorithmics---The Spirit of Computing.- Chapter 2: Number ---The Language of Science.- Chapter 3: Bringing Number Under the Rubr



Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles

Автор: Karumanchi Narasimha
Название: Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles
ISBN: 819324527X ISBN-13(EAN): 9788193245279
Издательство: Неизвестно
Рейтинг:
Цена: 10970 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

Peeling Data Structures and Algorithms:

Table of Contents: goo.gl/JFMgiU
Sample Chapter: goo.gl/n2Hk4i
Found Issue? goo.gl/forms/4Gt72YO81I
Videos: goo.gl/BcHq74

"Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzles" is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer scientists.

A handy guide of sorts for any computer science professional, Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzles is a solution bank for various complex problems related to data structures and algorithms. It can be used as a reference manual by those readers in the computer science industry. This book serves as guide to prepare for interviews, exams, and campus work. In short, this book offers solutions to various complex data structures and algorithmic problems.

Topics Covered:

  1. Introduction
  2. Recursion and Backtracking
  3. Linked Lists
  4. Stacks
  5. Queues
  6. Trees
  7. Priority Queue and Heaps
  8. Disjoint Sets ADT
  9. Graph Algorithms
  10. Sorting
  11. Searching
  12. Selection Algorithms Medians]
  13. Symbol Tables
  14. Hashing
  15. String Algorithms
  16. Algorithms Design Techniques
  17. Greedy Algorithms
  18. Divide and Conquer Algorithms
  19. Dynamic Programming
  20. Complexity Classes
  21. Miscellaneous Concepts
Algorithmics

Автор: David Harel; Yishai Feldman
Название: Algorithmics
ISBN: 3642441351 ISBN-13(EAN): 9783642441356
Издательство: Springer
Рейтинг:
Цена: 9948 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Computer science is the science of the future, and already underlies every facet of business and technology, and much of our everyday lives.

Frontiers in Algorithmics

Автор: Chen
Название: Frontiers in Algorithmics
ISBN: 3319784544 ISBN-13(EAN): 9783319784540
Издательство: Springer
Рейтинг:
Цена: 7652 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 12th International Workshop on Frontiers in Algorithmics, FAW 2018, held in Guangzhou, China, in May 2018.The 23 full papers presented in this volume were carefully reviewed and selected from 38 submissions.

Frontiers in Algorithmics

Автор: Mingyu Xiao; Frances Rosamond
Название: Frontiers in Algorithmics
ISBN: 3319596047 ISBN-13(EAN): 9783319596044
Издательство: Springer
Рейтинг:
Цена: 8417 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the proceedings of the 11th International Workshop on Frontiers in Algorithmics, FAW 2017, held in Chengdu, China, in June 2017. The 24 papers presented in this volume were carefully reviewed and selected from 61 submissions. They deal with all aspects of theoretical computer science and algorithms.

Frontiers in Algorithmics

Автор: Yijia Chen; Xiaotie Deng; Mei Lu
Название: Frontiers in Algorithmics
ISBN: 3030181251 ISBN-13(EAN): 9783030181253
Издательство: Springer
Рейтинг:
Цена: 7652 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the proceedings of the 13th International Workshop on Frontiers in Algorithmics, FAW 2019, held in Sanya, China, in April/May 2019. The 15 full papers presented in this volume were carefully reviewed and selected from 21 submissions.

Algorithmics

Автор: Harel David
Название: Algorithmics
ISBN: 3642272657 ISBN-13(EAN): 9783642272653
Издательство: Springer
Рейтинг:
Цена: 9948 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This award-winning best-seller addresses the fundamentals of computer science. The authors discuss the design of algorithms, their efficiency and correctness, quantum algorithms, concurrency, large systems and artificial intelligence.

Algorithmics of Matching Under Preferences

Автор: Manlove David
Название: Algorithmics of Matching Under Preferences
ISBN: 9814425249 ISBN-13(EAN): 9789814425247
Издательство: World Scientific Publishing
Рейтинг:
Цена: 28314 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Matching problems with preferences are all around us - they arise when agents seek to be allocated to one another on the basis of ranked preferences over potential outcomes. Efficient algorithms are needed for producing matchings that optimise the satisfaction of the agents according to their preference lists. This book deals with this topic.

Frontiers in Algorithmics

Автор: Jianer Chen; John E. Hopcroft; Jianxin Wang
Название: Frontiers in Algorithmics
ISBN: 3319080156 ISBN-13(EAN): 9783319080154
Издательство: Springer
Рейтинг:
Цена: 8572 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 8th International Frontiers of Algorithmics Workshop, FAW 2014, held in Zhangjiajie, China, in June 2014. They provide a focused forum on current trends of research on algorithms, discrete structures, operations research, combinatorial optimization and their applications.

Frontiers in Algorithmics

Автор: Daming Zhu; Sergey Bereg
Название: Frontiers in Algorithmics
ISBN: 3319398164 ISBN-13(EAN): 9783319398167
Издательство: Springer
Рейтинг:
Цена: 8572 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: They deal with algorithm, complexity, problem, reduction, NP-complete, graph, approximation, linear programming, local search, integer programming, semidefinite programming, parameterized algorithm, fixed parameter, tractability, randomness, computational geometry.

Frontiers in Algorithmics

Автор: Jianxin Wang; Chee Yap
Название: Frontiers in Algorithmics
ISBN: 3319196464 ISBN-13(EAN): 9783319196466
Издательство: Springer
Рейтинг:
Цена: 8572 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the proceedings of the 9th International Workshop on Frontiers in Algorithmics, FAW 2015, held in Guilin, China, in July 2015. They deal with graph algorithms, approximation algorithms, combinatorial optimization, parameterized algorithms, and online algorithms.

Algorithmics for hard problems

Автор: Hromkovic, Juraj
Название: Algorithmics for hard problems
ISBN: 3642079091 ISBN-13(EAN): 9783642079092
Издательство: Springer
Рейтинг:
Цена: 13009 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech- nologies.

Foundations of Mathematics

Автор: C.B. Thomas; Erwin Engeler
Название: Foundations of Mathematics
ISBN: 3642780547 ISBN-13(EAN): 9783642780547
Издательство: Springer
Рейтинг:
Цена: 13009 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Our mathematics students, having been drilled for years in high-school and college, and having studied the immense edifice of analysis, regrettably come away convinced that they understand the concepts of real numbers, Euclidean space, and algorithm.


ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
   В Контакте     В Контакте Мед  Мобильная версия