Refine Results
Sort By
From
To
Page 1
Page 1
Machine Learning Algorithms Using Python Programming
Presents the key concepts of Machine Learning which includes Python concepts and Interpreter, Foundation of Machine Learning, Data Pre-processing, Supervised Machine Learning, Unsupervised Machine Learning, Reinforcement Learning, Kernel Machine, Design and analysis of Machine Learning experiment and Data visualization. The theoretical concepts along with coding implementation are covered. This book aims to pursue a middle ground between a theoretical textbook and one that focuses on applications. The book concentrates on the important ideas in machine learning.
Competitive Programming in Python : 128 Algorithms to Develop your Coding Skills
Learn all the algorithmic techniques and programming skills you need from two experienced coaches, problem setters, and jurors for coding competitions. The authors highlight the versatility of each algorithm by considering a variety of problems and show how to implement algorithms in simple and efficient code. What to expect: * Master 128 algorithms in Python. * Discover the right way to tackle a problem and quickly implement a solution of low complexity.
Beyond the Worst-Case Analysis of Algorithms
There are no silver bullets in algorithm design, and no single algorithmic idea is powerful and flexible enough to solve every computational problem. Nor are there silver bullets in algorithm analysis, as the most enlightening method for analyzing an algorithm often depends on the problem and the application. However, typical algorithms courses rely almost entirely on a single analysis framework, that of worst-case analysis, wherein an algorithm is assessed by its worst performance on any input of a given size. The purpose of this book is to popularize several alternatives to worst-case analysis and their most notable algorithmic applications, from clustering to linear programming to neural network training. Forty leading researchers have contributed introductions to different facets of this field, emphasizing the most important models and results, many of which can be taught in lectures to beginning graduate students in theoretical computer science and machine learning.
Beginning Java Data Structures and Algorithms : Sharpen your problem solving skills by learning core computer science concepts in a pain-free manner
Teaches you tools that you can use to build efficient applications. It starts with an introduction to algorithms and big O notation, later explains bubble, merge, quicksort, and other popular programming patterns. You’ll also learn about data structures such as binary trees, hash tables, and graphs. The book progresses to advanced concepts, such as algorithm design paradigms and graph theory. By the end of the book, you will know how to correctly implement common algorithms and data structures within your applications.
Algorithms for Decision Making
A broad introduction to algorithms for decision making under uncertainty, introducing the underlying mathematical problem formulations and the algorithms for solving them. Automated decision-making systems or decision-support systems—used in applications that range from aircraft collision avoidance to breast cancer screening—must be designed to account for various sources of uncertainty while carefully balancing multiple objectives. This textbook provides a broad introduction to algorithms for decision making under uncertainty, covering the underlying mathematical problem formulations and the algorithms for solving them.
Algorithmes dapproximation
Le champ des algorithmes d'approximation est aujourd'hui l'un des domaines de recherche les plus actifs en informatique. Il allie la profondeur de la théorie mathématique aux promesses d'applications pratiques d'un intérêt considérable. La plupart des problèmes issus d'applications relevant de domaines aussi différents que la conception de circuits VLSI, la conception et la planification de réseaux, l'ordonnancement, la théorie des jeux, la biologie ou la théorie des nombres, sont des problèmes NP-difficiles. Leur résolution exacte demanderait des ressources informatiques inaccessibles et ne peut donc être envisagée. Pour faire face à cette situation, un grand nombre d'algorithmes proposant des solutions approchées à ces problèmes ont été développés.
Advanced Algorithms and Data Structures
introduces a collection of algorithms for complex programming challenges in data analysis, machine learning, and graph computing. You’ll discover cutting-edge approaches to a variety of tricky scenarios. You’ll even learn to design your own data structures for projects that require a custom solution. What's inside Build on basic data structures you already know Profile your algorithms to speed up application Store and query strings efficiently Distribute clustering algorithms with MapReduce Solve logistics problems using graphs and optimization algorithms
Matematica generale con il calcolatore
By introducing mathematical objects, it teaches students how to use a computer to perform numerical and symbolic calculations, define a function and calculate its values, plot and explore graphs, and execute simple algorithms. The course is rich in examples, applications, and models, drawn from economics, physics, biology, statistics, and mathematics itself. The analysis of these models constitutes, in a certain sense, the true purpose of the mathematical theory covered. Automatic calculation tools (mathematics software, spreadsheets) are used extensively to explore and illustrate concepts and properties. Mathcad® software, in particular, was used, both as a calculation tool and as a simple yet powerful programming language. Considerable space is devoted to approximation, emphasizing the distinction between numerical and symbolic calculation; to algorithms as a synthesis of the syntactic and semantic aspects of mathematical objects; and to computer simulation, interpreted as a "physical" experiment and a source of conjecture. The ability to use a calculator marks a sort of "democratization" of mathematics: even complex results, which have always required a broad background of knowledge and laborious calculations, are now quickly accessible to anyone who understands the meaning of mathematical objects and knows how to use the syntax.
