|
|
 |
| Результат поиска |
Поиск книг, содержащих: Depth-first search
| Книга | Страницы для поиска | | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 446 | | Гудрич М.Т., Тамассия Р. — Структуры данных и алгоритмы в Java | 593 | | Сик Дж., Ли Л., Ламсдэйн Э. — C++ Boost Graph Library | 62 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 117 | | Grimaldi R.P. — Discrete and combinatorial mathematics. An introduction | 624, 625, 628, 651 | | Jurafsky D., Martin J.H. — Speech and Language Processing | 52 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 117 | | Aho A.V., Sethi R., Ullman J.D. — Compilers: principles, techniques and tools | 660—664 | | Leach A.R. — Molecular Modelling Principles and Applications | 462, 663 | | Forsyth R., Naylor Ch. — The Hitch-Hicker's Guide to Artificial Intelligence | 3, 57, 60, 100, 101, 102, 107, 116, 117 | | Kowalski R. — Logic for problem solving | 61, 84, 96, 177 | | Mumford D., Wright D., Series C. — Indra's Pearls: The Vision of Felix Klein | 113, 122, 141—150 | | Sedgewick R. — Algorithms | 371, 381—387, 391—395, 397—399, 422—423, 428—430, 454, 515 | | Pearl J. — Heuristics | 36—42, 65, 151, 160, 230, 260, 266 | | Tanimoto S.L. — The elements of artificial intelligence. An introduction using LISP | 151 | | Luger G.F., Stubblefield W.A. — Artificial Intelligence: Structures and Strategies for Complex Problem Solving | 99, 102—106, 159—163, 174, 367—369, 381—383, 449—455, 459—460, 560, 592 | | Brookshear J.G. — Computer Science: An Overview | 470 | | Ruskey F. — Combinatorial generation | 29, 209 | | Brualdi R.A., Ryser H.J. — Combinatorial Matrix Theory | 97 | | Tucker А. — Applied Combinatorics | 103, 426 | | Vanderbei R.J. — Linear Programming: Foundations and Extensions | 383 | | Attiya H., Welch J. — Distributed computing | 23 | | Bertsekas D.P. — Dynamic programming and optimal control (Vol. 1) | 69 | | Sebesta R.W. — Concepts of programming languages | 644 | | Bóna M. — Introduction to Enumerative Combinatorics | 289 | | Knuth D.E. — The art of computer programming (vol. 1 Fundаmental algorithms) | 578, 581 | | Nijenhuis A., Wilf H.S. — Combinatorial Algorithms: For Computers and Calculators | 160, 240—245 | | Tucker A. — Applied Combinatorics | 103, 426 | | van Lint J.H., Wilson R.M. — Course in Combinatorics | 17, 18 | | Brookshear J. — Computer Science | 470 | | Giarratano J.C., Riley G.D. — Expert Systems: Principles and Programming | 69 | | Patten T. — Systemic text generation as problem solving | 9 | | Allen J. — Natural language understanding | 56 | | Hartmann A.K., Rieger H. — Optimization Algorithms in Physics | 57—59 | | Grimaldi R.P., Rothman D.J. — Discrete and Combinatorial Mathematics: An Applied Introduction | 597, 598, 600, 617, 624 | | Covington M.A., Nute D., Vellino A. — Prolog programming in depth | 11 | | Peleg D. — Distributed Computing: A Locality-Sensitive Approach (Monographs on Discrete Mathematics and Applications) | 49, 54, 229 | | Шилдт Г. — Искусство программирования на С++ | 255 | | Yovits M. — Advances in Computers.Volume 26. | 112 | | Grimaldi R.P. — Student Solutions Manual for Discrete and Combinatorial Mathematics | 597, 598, 600, 617, 624 | | Nijenhuis A., Wilf H.S. — Combinatorial algorithms for computers and calculators | 160, 240—245 | | Chvatal V. — Linear programming | 314 |
|
|