|
|
 |
| Результат поиска |
Поиск книг, содержащих: Greedy algorithm
| Книга | Страницы для поиска | | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 442 | | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 313 | | Engel A. — Problem-Solving Strategies | 46, 167 | | Стивенc Р. — Delphi. Готовые алгоритмы | 312 | | Dietterich T.G., Becker S., Ghahramani Z. — Advances in neural information processing systems 14 (Vol. 1 and vol. 2) | 1065, 1499 | | Khosrowpour M. — Encyclopedia Of Information Science And Technology | 2041 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 139, 373, 638, 1545—1547, 2187 | | Ito K. — Encyclopedic Dictionary of Mathematics. Vol. 2 | 66.G | | Grimaldi R.P. — Discrete and combinatorial mathematics. An introduction | 658, 665, 667, 669, 694 | | Diestel R. — Graph Theory | 98, 108, 117 | | Graham R.L., Knuth D.E., Patashnik O. — Concrete mathematics | 101, 281 | | Cameron P.J. — Combinatorics : Topics, Techniques, Algorithms | 165—166, 184, 204, 208 | | Matousek J. — Lectures on Discrete Geometry (some chapters) | 225, 225 (Ex.4) | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 139, 373, 638, 1545—1547, 2187 | | Fette B.A. (Ed) — Cognitive Radio Technology | 178 | | Diestel R. — Graph theory | 114, 124, 133 | | Grotschel M., Lovasz L., Schrijver A. — Geometric Algorithms and Combinatorial Optimization | 212, 212—213, 246, 306—308 | | Fogiel M. — The Operations Research Problem Solver | 8—15, 8—16, 8—35 | | Carmona R. — Practical Time-Frequency Analysis | 181 | | Lawler E.L. — Combinatorial Optimization: Networks and Matroids | 267, 275—277 | | Niedermeier R. — Invitation to Fixed Parameter Algorithms | 194 | | Allouche J.-P., Shallit J. — Automatic Sequences: Theory, Applications, Generalizations | 71 | | Bollobas B. — Modern Graph Theory | 147 | | Rachev S.T. — Probability Metrics and the Stability of Stochastic Models | 425 | | Williamson S. — Combinatorics for computer science | 272, 441, 448 | | Knuth D.E. — The art of computer programming (vol. 2 Seminumerical Algorithms) | 293 | | Ross Sh.M. — Topics in Finite and Discrete Mathematics | 131—134 | | Marchette D.J. — Random Graphs for Statistical Pattern Recognition | 51, 152, 207, 209 | | Ito K. — Encyclopedic Dictionary of Mathematics | 66.G | | Meester R., Roy R. — Continuum percolation | 227 | | Du D. (ed.), Pardalos P. (ed.) — Handbook of combinatorial optimization: supplement volume A | 225—226, 313 | | Schroeder M.R. — Schroeder, Self Similarity: Chaos, Fractals, Power Laws | 210 | | Kolman B., Busby R.C., Cutler S.C. — Discrete Mathematical Structures | 273 | | Guy R.K. — Unsolved Problems in Number theory | E10, E28, E32 | | Sack J.R., Urrutia J. (Ed) — Handbook of Computational Geometry | 454, 455, 926 | | Crochemore M., Rytter W. — Jewels of stringology | 239 | | Strang G. — Linear Algebra and Its Applications | 430 | | Papadimitriou C.H., Steiglitz K. — Combinatorial Optimization: Algorithms and Complexity | 278—80, 282, 285 | | Allaire G. — Numerical Analysis and Optimization: An Introduction to Mathematical Modelling and Numerical Simulation | 380 | | Murota K. — Discrete convex analysis | 3, 108 | | Pal S.K., Pal A. (eds.) — Pattern Recognition: From Classical to Modern Approaches | 170 | | Kozen D.C. — The Design And Analysis Of Algorithms | 11, 17, 25, 274 | | Bóna M. — A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory | 214 | | Cook W.J., Cunningham W.H., Pulleyblank W.R. — Combinatorial optimization | 273, 274, 277, 284, 290, 293 | | Kreyszig E. — Advanced engineering mathematics | 967 | | Bóna M. — Introduction to Enumerative Combinatorics | 392 | | Ore O., Wilson R.J. — Graphs and Their Uses | 42 | | Bonar D.D., Khoury M.J. — Real Infinite Series | 80 | | Nijenhuis A., Wilf H.S. — Combinatorial Algorithms: For Computers and Calculators | 283 | | Martello S., Toth P. — Knapsack problems: algorithms and computer implementations | 28—29 | | van Lint J.H., Wilson R.M. — Course in Combinatorics | 16—17 | | Thompson S. — Haskell: the craft of functional programming | 448 | | Diestel R. — Graph Theory | 98, 108, 117 | | Roberts F. S. — Graph theory and its applications to problems of society | 35 | | Charniak E. — Statistical Language Learning | 138 | | Aldous J.M., Wilson R. — Graphs and Applications: An Introductory Approach | 184 | | Mott J.L., Kandel A., Baker T.P. — Discrete Mathematics For Computer Scientists And Mathematicians | 486—487, 567 | | Mott J., Kandel A., Baker T. — Discrete mathematics for computer scientists and mathematicians | 486—487, 567 | | Strang G. — Introduction to Applied Mathematics | 611 | | Hazewinkel M. — Handbook of Algebra (часть 1) | 160 | | Grimaldi R.P., Rothman D.J. — Discrete and Combinatorial Mathematics: An Applied Introduction | 632, 638—641, 667 | | Gossett E. — Discrete Math with Proof | 458, 711 | | Klee V., Wagon S. — Old and New Unsolved Problems in Plane Geometry and Number Theory (Dolciani Mathematical Expositions Series #11) | 175—177 | | Akenine-Möller T. — Real-Time Rendering | 460 | | Clarke E.M., Grumberg O., Peled D.A. — Model checking | 83, 84 | | Kolman B., Busby R.C., Ross S. — Discrete Mathematical Structures | 323 | | Grimaldi R.P. — Student Solutions Manual for Discrete and Combinatorial Mathematics | 632, 638—641, 667 | | Nijenhuis A., Wilf H.S. — Combinatorial algorithms for computers and calculators | 283 | | V. Bryant — Independence theory in combinatorics: An introductory account with applications to graphs and transversals (Chapman and Hall mathematics series) | 24 |
|
|
|
|
О проекте