Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Bellman R. — Algorithms, graphs, and computers, Volume 62 (Mathematics in Science and Engineering)
Bellman R. — Algorithms, graphs, and computers, Volume 62 (Mathematics in Science and Engineering)



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Algorithms, graphs, and computers, Volume 62 (Mathematics in Science and Engineering)

Автор: Bellman R.

Аннотация:

The book is thus addressed to readers seeking a first acquaintance with problems of this type, either for a general view of the methodologies of solution or for specific information concerning mathematical and computational solution methods. It is also addressed to readers seeking to obtain some ideas of the different uses of computers in problem solving. We expect that most readers will have a previous or concurrent course in the elements of computer programming. However, many such courses aim at developing facility with certain specific intricacies of computer programming, rather than an appreciation of the overall power of the computer to aid in the treatment of classes of major problems of science and society. What we hope to develop particularly is skill in problem analysis.


Язык: en

Рубрика: Computer science/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1970

Количество страниц: 246

Добавлена в каталог: 09.04.2010

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Steinhaus, method of      70
Stop rules      61
Storage      110 111
Storage disc      220
Storage of algorithms      112
Storage of sparse data      111
Storage rapid access      110
Stratification      114
Successive approximations method of, for algebraic equations      50—54 61
Successive approximations method of, for pouring puzzle      157
Successive approximations method of, number of iterations      135
Successive approximations, method of, for routing problem      71—94 126—137
systems      39—43
Systems, large      101—119
Systems, transformation of      112
Szwarc, W.      235
tapes      see "Magnetic tapes"
Theory of graphs      33—39
Topological problems      37 228
Torres, W.T.      121
Tourist problem      231
Trakhtenbrot, B.A.      100 171
Transportation problem      209
Travelling salesman problem      213—221
TREE      7 37
tree diagrams      6 145 174 197
Tree diagrams reduced trees      27
Trilinear coordinates      195
Tweedie, M.C.K.      195
Updating      see "Acceleration of convergence"
Upper solution      127—128 132 136
Vajda, S.      233
Veinott, A.F.      38
Venttsel, E.S.      19
Vertex      33
Vertex, adjacent vertices      38
Vollmann, T.E.      236
Wagner, H.M.      38
Wang, H.      234
White, D.J.      141
Wiebenson, W.      99
Wine-pouring puzzle      142—168 174—192
Wing, O.      96
Winograd, S.      234
Wollmer, R.D.      99
Wood, D.E.      236
Word equivalence problem      171
Wythoff's game      211
Yau, S.S.      140
Zero-th approximation      72
1 2
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте