Search Results - (((((((ant OR cantee) OR wanting) OR wanted) OR cantor) OR anne) OR start) OR partes) algorithms.

  1. 221

    Metaheuristics for intelligent electrical networks by Héliodore, Frédéric, Nakib, Amir, Ismail, Boussaad, Ouchraa, Salma, Schmitt, Laurent

    Published 2017
    Table of Contents: “…2.2.1. Genetic algorithms2.2.2. Evolution strategies; 2.2.3. Coevolutionary algorithms; 2.2.4. …”
    Full text (MFA users only)
    Electronic eBook
  2. 222

    Media Backends : Digital Infrastructures and Sociotechnical Relations. by Parks, Lisa

    Published 2023
    Table of Contents: “…The Power of Cultural Infrastructures -- Conclusion -- Notes -- 5 Engaging Opacity: Spotify and the Poiesis of Algorithmic Backends -- Opacity and Accountability -- Data Profiling as Interpellation -- The Missing Half-Second -- Feeding Forward -- Ethics on the Fly through Inauthentic Worlds -- Notes -- Part II: Datafying, Serving, Distributing -- 6 The Social Mapping of Hyperscale Data Center Regions: Placemaking, Infrastructuring, Curating -- Placemaking and Economic Development -- Infrastructuring -- Curating…”
    Full text (MFA users only)
    Electronic eBook
  3. 223

    Java programming interviews exposed by Markham, Noel

    Published 2014
    Table of Contents: “…Acknowledgments; Contents; Introduction; Part I: Navigating the Interview Process; Chapter 1: Dissecting Interview Types; Looking at the Phone Screening Process; Reviewing Technical Tests; Handling Face-to-Face Interviews; Making the Decision; Summary; Chapter 2: Writing a Noticeable Resume; How to Write a Resume and Cover Letter; Writing a Cover Letter; Summary; Chapter 3: Technical Test and Interview Basics; Technical Written Tests; At-Computer Tests; Face-to-Face Technical Interviews; Summary; Chapter 4: Writing Core Algorithms; Looking at Big O Notation; Sorting Lists; Searching Lists.…”
    Full text (MFA users only)
    Electronic eBook
  4. 224

    The Method of Fundamental Solutions. by LI, Zi-Cai

    Published 2023
    Table of Contents: “…Intro -- The Method of Fundamental Solutions: Theory and Applications -- Contents -- Preface -- Acknowledgements -- Introduction -- Historic Review -- Basic Algorithms -- Numerical Experiments -- Characteristics of the MFS -- Part I -- Dirichlet Problems -- Basic Algorithms of MFS -- Preliminary Lemmas -- Main Theorems -- Stability Analysis for Disk Domains -- Proof Methodology -- Neumann Problems -- Introduction -- Method of Fundamental Solutions -- Description of Algorithms -- Main Results of Analysis and Their Applications -- Stability Analysis of Disk Domains -- Stability Analysis for Bounded Simply-Connected Domains -- Trefftz Methods -- Collocation Trefftz Methods -- Error Estimates -- Concluding Remarks -- Other Boundary Problems -- Mixed Boundary Condition Problems -- Interior Boundary Conditions -- Annular Domains -- Combined Methods -- Combined Methods -- Variant Combinations of FS and PS -- Simplified Hybrid Combination -- Hybrid Plus Penalty Combination -- Indirect Combination -- Combinations of MFS with Other Domain Methods -- Combined with FEM -- Combined with FDM -- Combined with Radial Basis Functions -- Singularity Problems by Combination of MFS and MPS -- Source Nodes on Elliptic Pseudo-Boundaries -- Introduction -- Algorithms of MFS -- Error Analysis -- Preliminary Lemmas -- Error Bounds -- Stability Analysis -- Selection of Pseudo-Boundaries -- Numerical Experiments -- Concluding Remarks -- PartII -- Helmholtz Equations in Simply-Connected Domains -- Introduction -- Algorithms -- Error Analysis for Bessel Functions -- Preliminary Lemmas -- Error Bounds with Small k -- Exploration of Bounded k -- Stability Analysis for Disk Domains -- Application to BKM -- Exterior Problems of Helmholtz Equation -- Introduction -- Standard MFS -- Basic Algorithms -- Brief Error Analysis.…”
    Full text (MFA users only)
    Electronic eBook
  5. 225

    Visible Business : Uncover the Blindspots and Engage the World's Female Economy. by Brideson, RJ

    Published 2017
    Table of Contents: “…Blind Spots; Contents; Foreword; About the Author; Acknowledgements; To my community; To my village; Preface; Introduction; Chapter 1 From history to herstory; The birth of business marketing; Things have changed -- or have they?; Women want more; The wo-man algorithm; Become conscious of the bias; From reject to results; Chapter 2 Are you blind?…”
    Full text (MFA users only)
    Electronic eBook
  6. 226

    Perspectives on adaptation in natural and artificial systems

    Published 2005
    Table of Contents: “…Introduction: Adaptation, Evolution, and Intelligence; PART 1: GENETIC ALGORITHMS AND BEYOND; Chapter 1: Genetic Algorithms: A 30-Year Perspective; Chapter 2: Human-Competitive Machine Intelligence by Means of Genetic Algorithms; Chapter 3: John H. …”
    Full text (MFA users only)
    Electronic eBook
  7. 227

    Learning Boost C++ libraries : solve practical programming problems using powerful, portable, and expressive libraries from Boost by Mukherjee, Arindam

    Published 2015
    Table of Contents: “…Shared ownership semanticsboost::shared_ptr and std::shared_ptr; Intrusive smart pointers -- boost::intrusive_ptr; shared_array; Managing non-memory resources using smart pointers; Self-test questions; Summary; References; Chapter 4: Working with Strings; Text processing with Boost String Algorithms library; Using Boost String Algorithms; Find algorithms; Case-conversion and trimming algorithms; The replace and erase algorithms; The split and join algorithms; Splitting text using the Boost Tokenizer library; Tokenizing based on separators…”
    Full text (MFA users only)
    Electronic eBook
  8. 228

    Mixed Models : Theory and Applications with R. by Demidenko, Eugene

    Published 2013
    Table of Contents: “…2.9 Derivatives of the log-likelihood function -- 2.10 Newton-Raphson algorithm -- 2.11 Fisher scoring algorithm -- 2.11.1 Simplified FS algorithm -- 2.11.2 Empirical FS algorithm -- 2.11.3 Variance-profile FS algorithm -- 2.12 EM algorithm -- 2.12.1 Fixed-point algorithm -- 2.13 Starting point -- 2.13.1 FS starting point -- 2.13.2 FP starting point -- 2.14 Algorithms for restricted MLE -- 2.14.1 Fisher scoring algorithm -- 2.14.2 EM algorithm -- 2.15 Optimization on nonnegative definite matrices -- 2.15.1 How often can one hit the boundary? …”
    Full text (MFA users only)
    Electronic eBook
  9. 229

    OIPE 2012

    Published 2014
    Table of Contents: “…N-level output space mapping for electromagnetic design optimizationHigh-speed functionality optimization of five-phase PM machine using third harmonic current; Topology optimization of magnetostatic shielding using multistep evolutionary algorithms with additional searches in a restricted design space ; Adaptive unscented transform for uncertainty quantification in EMC large-scale systems; Ant colony optimization for the topological design of interior permanent magnet (IPM)machines; Multiobjective approach developed for optimizing the dynamic behavior of incremental linear actuators.…”
    Full text (MFA users only)
    Electronic eBook
  10. 230
  11. 231

    Hands-On Reinforcement Learning with Python : Master Reinforcement and Deep Reinforcement Learning Using OpenAI Gym and TensorFlow. by Ravichandiran, Sudharsan

    Published 2018
    Table of Contents: “…Solving the taxi problem using Q learningSARSA; Solving the taxi problem using SARSA; The difference between Q learning and SARSA; Summary; Questions; Further reading; Chapter 6: Multi-Armed Bandit Problem; The MAB problem; The epsilon-greedy policy; The softmax exploration algorithm; The upper confidence bound algorithm; The Thompson sampling algorithm; Applications of MAB; Identifying the right advertisement banner using MAB; Contextual bandits; Summary; Questions; Further reading; Chapter 7: Deep Learning Fundamentals; Artificial neurons; ANNs; Input layer; Hidden layer; Output layer.…”
    Full text (MFA users only)
    Electronic eBook
  12. 232
  13. 233

    Comprehensive Ruby Programming. by Hudgens, Jordan

    Published 2017
    Table of Contents: “…Implementing a prime number counting algorithm -- How to code the power digit sum algorithm -- Implementing a humanize counting algorithm -- Implementing a date algorithm -- How to code a Fibonacci digit counter -- Implementing a permutation algorithm -- Implementing an amicable number algorithm -- Implementing a factorial algorithm -- Implementing an even Fibonacci number algorithm -- Implementing the least common multiple -- Summary -- Chapter 19: Machine Learning -- Big data analysis -- Basic decision tree implementation -- Addition of attributes -- Addition of training data and its values -- Calling the ID3 method -- Function of the train method -- Addition of the test method -- Setting up decision variables -- Print the results out -- Testing the program -- Advantage of decision trees over if ... else statements -- How to develop a big data analysis application in Ruby -- Summary -- Index.…”
    Full text (MFA users only)
    Electronic eBook
  14. 234

    Active networks and active network management : a proactive management framework by Bush, Stephen F., Kulkarni, Amit B.

    Published 2001
    Table of Contents: “…ALGORITHM ANALYSIS -- 8.1 PETRI-NET ANALYSIS FOR THE AVNMP ALGORITHM -- 8.2 EXPECTED SPEEDUP:? …”
    Full text (MFA users only)
    Electronic eBook
  15. 235

    Network Routing : Fundamentals, Applications, and Emerging Technologies. by Misra, Sudip

    Published 2017
    Table of Contents: “…s Algorithm -- 5.7 Random Races Algorithm -- References -- Abbreviations/Terminologies -- Questions -- Exercises -- Part III: Routing on the Internet -- 6 Interior Gateway Protocols -- 6.1 Introduction -- 6.2 Distance Vector Protocols -- 6.3 Link State Protocols -- References -- Abbreviations/Terminologies -- Questions -- Exercises -- 7 Exterior Gateway Protocol -- 7.1 Introduction -- 7.2 Exterior Gateway Protocol -- 7.3 Border Gateway Protocol -- References…”
    Full text (MFA users only)
    Electronic eBook
  16. 236

    Experiencing architecture in the nineteenth century : buildings and society in the modern age

    Published 2019
    Table of Contents: “…Commercial spaces: Bridging the divide between public and privateConclusion; Part 3: Designing experience; Chapter 6: New York's Harvard House and the origins of an alumni culture in America; Towards a clubhouse; Harvard House; Conclusion; Chapter 7: Architectural acoustics: Thomas Roger Smith and the science of hearing buildings in nineteenth-century Britain; The problem of acoustics in Victorian public buildings; Thomas Roger Smith and the emergence of architectural acoustics in Britain; Sabine versus Smith: Algorithmic and experiential sciences of architectural acoustics; Conclusion.…”
    Full text (MFA users only)
    Electronic eBook
  17. 237

    Java Deep Learning Projects : Implement 10 Real-World Deep Learning Applications Using Deeplearning4j and Open Source APIs. by Karim, Rezaul

    Published 2018
    Table of Contents: “…; Artificial Neural Networks; Biological neurons; A brief history of ANNs; How does an ANN learn?; ANNs and the backpropagation algorithm; Forward and backward passes; Weights and biases; Weight optimization; Activation functions.…”
    Full text (MFA users only)
    Electronic eBook
  18. 238

    Financial instrument pricing using C++ by Duffy, Daniel J.

    Published 2018
    Table of Contents: “…A tour of C++ and environs -- New and improved C++ fundamentals -- Modelling functions in C++ -- Advanced c++ template programming -- Tuples in c++ and their applications -- Type traits, advanced lambdas and multiparadigm design in C++ -- Multiparadigm design in C++ -- C++ numerics, IEEE754 and boost C++ multiprecision -- An introduction to unified software design (USD) -- New data types, containers and algorithms in C++ and boost C++ libraries -- Lattice models fundamental data structures and algorithms -- Lattice models applications to computational finance -- Numerical linear algebra : tridiagonal systems and applications -- Data visualisation in Excel -- Univariate statistical distributions -- Bivariate statistical distributions and two-asset option pricing -- STL algorithms in detail -- STL algorithms part II -- An introduction to optimisation and the solution of nonlinear equations -- The finite difference method for PDEs mathematical background -- Software framework for one-factor option models -- Extending the software framework -- A PDE software framework in C++11 for a class of path-dependent options -- Ordinary differential equations and their numerical approximation -- Advanced ordinary differential equations and method of lines (MOL) -- Random number generation and distributions -- Microsoft .net, C# and C++11 interoperability -- C++ concurrency, Part I Threads -- C++ concurrency, part II Tasks -- Parallel patterns language (PPL) -- Monte Carlo simulation, Part I -- Monte Carlo simulation, Part II -- Bibliography -- Appendix -- Index.…”
    Full text (MFA users only)
    Electronic eBook
  19. 239

    Agent-based computing

    Published 2010
    Table of Contents: “…Analysis of Algorithm -- 2.1.1. Chain-Like Agent Structure -- 2.1.2. …”
    Full text (MFA users only)
    Electronic eBook
  20. 240