Search Results - (((((((ant OR cantee) OR find) OR wanting) OR cantor) OR anne) OR maarten) OR anti) algorithms.
Suggested Topics within your search.
Suggested Topics within your search.
- Data processing 49
- Machine learning 34
- Artificial intelligence 32
- Mathematical models 32
- Mathematics 28
- Data mining 27
- Mathematical optimization 22
- methods 22
- algorithms 21
- artificial intelligence 21
- Algorithms 19
- Computer networks 16
- Python (Computer program language) 16
- Diseases 15
- Research 15
- Computer algorithms 14
- Technological innovations 14
- Artificial Intelligence 13
- Data Mining 12
- Digital techniques 12
- Information technology 12
- Management 12
- Neural networks (Computer science) 12
- R (Computer program language) 12
- Signal processing 12
- Big data 11
- Bioinformatics 11
- Development 11
- Social aspects 11
- diagnosis 11
Search alternatives:
- ant »
- cantee »
- wanting »
- cantor »
- anti »
- find »
-
161
Ivor Horton's beginning Visual C++ 2012
Published 2012Table of Contents: “…Finding the Length of a Null-Terminated String --…”
Full text (MFA users only)
Electronic eBook -
162
Advances in nonlinear waves and symbolic computation
Published 2009Table of Contents: “…Senthilnathan [and others] -- Direct methods and symbolic software for conservation laws of nonlinear equations / Willy Hereman [and others] -- Nonclassical potential symmetries for a nonlinear thermal wave equation / M.L. Gandarias -- Anti-dark solitons of the resonant nonlinear Schrödinger equation / D.W.C. …”
Full text (MFA users only)
Electronic eBook -
163
Artificial Intelligence and Machine Learning Fundamentals : Develop Real-World Applications Powered by the Latest AI Advances.
Published 2018Table of Contents: “…Uninformed and Informed SearchCreating Heuristics; Admissible and Non-Admissible Heuristics; Heuristic Evaluation; Exercise 5: Tic-Tac-Toe Static Evaluation with a Heuristic Function; Using Heuristics for an Informed Search; Types of Heuristics; Pathfinding with the A* Algorithm; Exercise 6: Finding the Shortest Path to Reach a Goal; Exercise 7: Finding the Shortest Path Using BFS; Introducing the A* Algorithm; A* Search in Practice Using the simpleai Library; Game AI with the Minmax Algorithm and Alpha-Beta Pruning; Search Algorithms for Turn-Based Multiplayer Games; The Minmax Algorithm…”
Full text (MFA users only)
Electronic eBook -
164
Artificial intelligence with Python : build real-world artificial intelligence applications with Python to intelligently interact with the world around you
Published 2017Table of Contents: “…; Clustering data with K-Means algorithm; Estimating the number of clusters with Mean Shift algorithm; Estimating the quality of clustering with silhouette scores; What are Gaussian Mixture Models?…”
Full text (MFA users only)
Electronic eBook -
165
-
166
Twitter and tear gas : the power and fragility of networked protest
Published 2017Full text (MFA users only)
Electronic eBook -
167
Communication System Security.
Published 2012Table of Contents: “…Public-Key Cryptographic Algorithms; II. Security Mechanisms and Protocols; 6. …”
Full text (MFA users only)
Electronic eBook -
168
Analysis of biological data : a soft computing approach
Published 2007Table of Contents: “…Feature selection for cancer classification using ant colony optimization and support vector machines / A. …”
Full text (MFA users only)
Electronic eBook -
169
Structured Matrices in Mathematics, Computer Science, and Engineering.
Published 2001Table of Contents: “…Contents -- Foreword -- Part V. Fast Algorithms -- The Schur algorithm for matrices with Hessenberg displacement structure -- Fast inversion algorithms for a class of block structured matrices -- A fast and stable solver for recursively semi-separable systems of linear equations -- Part VI. …”
Full text (MFA users only)
Full text (MFA users only)
Electronic eBook -
170
-
171
Just Enough R! : an Interactive Approach to Machine Learning and Analytics.
Published 2020Full text (MFA users only)
Electronic eBook -
172
-
173
Quantum Bio-Informatics V : Proceedings of the Quantum Bio-Informatics 2011.
Published 2013Table of Contents: “…Introduction; 2. Simon's period-finding quantum algorithm; 2.1. Ingredients of Simon's quantum period finding algorithm (QPFA); 3. …”
Full text (MFA users only)
Electronic eBook -
174
The Complete Rust Programming Reference Guide : Design, Develop, and Deploy Effective Software Systems Using the Advanced Constructs of Rust.
Published 2019Table of Contents: “…Chapter 1: Getting Started with Rust -- Chapter 2: Managing Projects with Cargo -- Chapter 3: Tests, Documentation, and Benchmarks -- Chapter 4: Types, Generics, and Traits -- Chapter 5: Memory Management and Safety -- Chapter 6: Error Handling -- Chapter 7: Advanced Concepts -- Chapter 8: Concurrency -- Chapter 9: Metaprogramming with Macros -- Chapter 10: Unsafe Rust and Foreign Function Interfaces -- Chapter 11: Logging -- Chapter 12: Network Programming in Rust -- Chapter 13: Building Web Applications with Rust -- Chapter 14: Lists, Lists, and More Lists -- Chapter 15: Robust Trees -- Chapter 16: Exploring Maps and Sets -- Chapter 17: Collections in Rust -- Chapter 18: Algorithm Evaluation -- Chapter 19: Ordering Things -- Chapter 20: Finding Stuff -- Chapter 21: Random and Combinatorial -- Chapter 22: Algorithms of the Standard Library.…”
Full text (MFA users only)
Electronic eBook -
175
Python unlocked : become more fluent in Python--learn strategies and techniques for smart and high-performance Python programming
Published 2015Table of Contents: “…Method resolution orderSuper's superpowers; Using language protocols in classes; Iteration protocol; Context manager protocol; Using abstract classes; Summary; Chapter 3: Functions and Utilities; Defining functions; Decorating callables; Utilities; Summary; Chapter 4: Data Structures and Algorithms; Python built-in data structures; Python library data structures; Third party data structures; Arrays/List; Binary tree; Sorted containers; Trie; Algorithms on scale; Summary; Chapter 5: Elegance with Design Patterns; Observer pattern; Strategy pattern; Singleton pattern; Template pattern.…”
Full text (MFA users only)
Electronic eBook -
176
Geometric Function Theory In Several Complex Variables, Proceedings Of A Satellite Conference To The Int'l Congress Of Mathematicians In Beijing 2002.
Published 2004Table of Contents: “…Greiner and Jingzhi Tie); Defective values of double Meissel's formula and reduction of space-time requirement of Meissel-Lehmer-Lagarias-Odlyzko's algorithm an experimental program to find T(1021) (by Chen Guangxiao); Hardy space of holomorphic functions in infinite complex variables (by Zeqian Chen); The law of the iterated logarithm for pluriharmonic functions in the unit ball of Cn (by Zeqian Chen, Caiheng Ouyang).…”
Full text (MFA users only)
Electronic eBook -
177
Electronic design automation : synthesis, verification, and test
Published 2009Full text (MFA users only)
Electronic eBook -
178
Visual Data Mining : The VisMiner Approach.
Published 2012Table of Contents: “…Regression Analysis -- The Regression Model -- Correlation and Causation -- Algorithms for Regression Analysis -- Assessing Regression Model Performance -- Model Validity -- Looking Beyond R2 -- Polynomial Regression -- Artificial Neural Networks for Regression Analysis -- Dataset Preparation -- Tutorial -- A Regression Model for Home Appraisal -- Modeling with the Right Set of Observations -- Exercise 6.1 -- ANN Modeling -- The Advantage of ANN Regression -- Top-Down Attribute Selection -- Issues in Model Interpretation -- Model Validation -- Model Application -- Summary…”
Full text (MFA users only)
Electronic eBook -
179
Continuing Kepler's Quest : Assessing Air Force Space Command's Astrodynamics Standards
Published 2012Full text (MFA users only)
Electronic eBook -
180
Deterministic global optimization : an introduction to the diagonal approach
Published 2017Table of Contents: “…3.1 General Diagonal Scheme3.2 Analysis of Traditional Diagonal Partition Schemes; 3.3 Non-redundant Diagonal Partition Strategy; 4 Global Optimization Algorithms Based on the Non-redundant Partitions ; 4.1 Multiple Estimates of the Lipschitz Constant; 4.2 Derivative-Free Diagonal Method MultL; 4.2.1 Theoretical Background of MultL: Lower Bounds; 4.2.2 Theoretical Background of MultL: Finding Non-dominated Hyperintervals; 4.2.3 Description of the MultL Algorithm and its Convergence Analysis; 4.3 One-Point-Based Method MultK for Differentiable Problems.…”
Full text (MFA users only)
Electronic eBook