Catalogue Search | MBRL
Search Results Heading
Explore the vast range of titles available.
MBRLSearchResults
-
DisciplineDiscipline
-
Is Peer ReviewedIs Peer Reviewed
-
Series TitleSeries Title
-
Reading LevelReading Level
-
YearFrom:-To:
-
More FiltersMore FiltersContent TypeItem TypeIs Full-Text AvailableSubjectCountry Of PublicationPublisherSourceDonorLanguagePlace of PublicationContributorsLocation
Done
Filters
Reset
2,610
result(s) for
"Algorithmes."
Sort by:
Evolutionary optimization algorithms
This comprehensive reference text discusses evolutionary optimization techniques, to find optimal solutions for single and multi-objective problems. The text presents each evolutionary optimization algorithm along with its history and other working equations. It also discusses variants and hybrids of optimization techniques. The text presents step-by-step solution to a problem and includes software's like MATLAB and Python for solving optimization problems. It covers important optimization algorithms including single objective optimization, multi objective optimization, Heuristic optimization techniques, shuffled frog leaping algorithm, bacteria foraging algorithm and firefly algorithm. Aimed at senior undergraduate and graduate students in the field of electrical engineering, electronics engineering, mechanical engineering, and computer science and engineering, this text: Provides step-by-step solution for each evolutionary optimization algorithm. Provides flowcharts and graphics for better understanding of optimization techniques. Discusses popular optimization techniques include particle swarm optimization and genetic algorithm. Presents every optimization technique along with the history and working equations. Includes latest software like Python and MATLAB.
Algorithms of Oppression
2018
A revealing look at how negative biases against women of color are embedded in search engine results and algorithms
Run a Google search for \"black girls\"—what will you find? \"Big Booty\" and other sexually explicit terms are likely to come up as top search terms. But, if you type in \"white girls,\" the results are radically different. The suggested porn sites and un-moderated discussions about \"why black women are so sassy\" or \"why black women are so angry\" presents a disturbing portrait of black womanhood in modern society.
In Algorithms of Oppression, Safiya Umoja Noble challenges the idea that search engines like Google offer an equal playing field for all forms of ideas, identities, and activities. Data discrimination is a real social problem; Noble argues that the combination of private interests in promoting certain sites, along with the monopoly status of a relatively small number of Internet search engines, leads to a biased set of search algorithms that privilege whiteness and discriminate against people of color, specifically women of color.
Through an analysis of textual and media searches as well as extensive research on paid online advertising, Noble exposes a culture of racism and sexism in the way discoverability is created online. As search engines and their related companies grow in importance—operating as a source for email, a major vehicle for primary and secondary school learning, and beyond—understanding and reversing these disquieting trends and discriminatory practices is of utmost importance.
An original, surprising and, at times, disturbing account of bias on the internet, Algorithms of Oppression contributes to our understanding of how racism is created, maintained, and disseminated in the 21st century.
Scalable and distributed machine learning and deep learning patterns
by
Thomas, J. Joshua, 1973- editor
,
Sriraman, Harini, 1982- editor
,
Venkatasubbu, Pattabiraman, 1976- editor
in
Machine learning.
,
Deep learning (Machine learning)
,
Algorithms.
2023
\"By the end of this book, you will have the knowledge and abilities necessary to construct and implement a distributed data processing pipeline for machine learning model inference and training. Reduced time costs in machine learning result in shorter model training and model updating cycle wait times. Distributed machine learning enables ML professionals to reduce model training and inference time drastically. With the aid of this helpful manual, you'll be able to use your Python development experience and quickly get started with the creation of distributed ML, including multi-node ML systems\"-- Provided by publisher.
Deep learning for the earth sciences : a comprehensive approach to remote sensing, climate science and geosciences
by
Tuia, Devis
,
Zhu, Xiao Xiang
,
Reichstein, Markus
in
Algorithms-Study and teaching
,
Earth sciences
,
Earth sciences -- Data processing
2021
DEEP LEARNING FOR THE EARTH SCIENCES Explore this insightful treatment of deep learning in the field of earth sciences, from four leading voices Deep learning is a fundamental technique in modern Artificial Intelligence and is being applied to disciplines across the scientific spectrum; earth science is no exception.
Absolute beginner's guide to algorithms : a practical introduction to data structures and algorithms in JavaScript
by
Chinnathambi, Kirupa, author
in
Computer algorithms.
,
JavaScript (Computer program language)
,
Computer programming.
2024
\"With the explosive growth in the amount of data and the diversity of computing applications, efficient algorithms are needed now more than ever. Programming languages come and go, but the core of programming--algorithms and data structures--remains the same. Absolute Beginner's Guide to Algorithms is the fastest way to learn algorithms and data structures. Using helpful diagrams and fully annotated code samples in Javascript, you will start with the basics and gradually go deeper and broader into all the techniques you need to organize your data. Start fast with data structures basics: arrays, stacks, queues, trees, heaps, and more. Walk through popular search, sort, and graph algorithms. Understand Big-O notation and why some algorithms are fast and why others are slow. Balance theory with practice by playing with the fully functional JavaScript implementations of all covered data structures and algorithms\"-- Provided by publisher.
Concentration of Measure for the Analysis of Randomized Algorithms
by
Dubhashi, Devdatt P.
,
Panconesi, Alessandro
in
Algorithms
,
Distribution (Probability theory)
,
Limit theorems (Probability theory)
2009
Randomized algorithms have become a central part of the algorithms curriculum, based on their increasingly widespread use in modern applications. This book presents a coherent and unified treatment of probabilistic techniques for obtaining high probability estimates on the performance of randomized algorithms. It covers the basic toolkit from the Chernoff–Hoeffding bounds to more sophisticated techniques like martingales and isoperimetric inequalities, as well as some recent developments like Talagrand's inequality, transportation cost inequalities and log-Sobolev inequalities. Along the way, variations on the basic theme are examined, such as Chernoff–Hoeffding bounds in dependent settings. The authors emphasise comparative study of the different methods, highlighting respective strengths and weaknesses in concrete example applications. The exposition is tailored to discrete settings sufficient for the analysis of algorithms, avoiding unnecessary measure-theoretic details, thus making the book accessible to computer scientists as well as probabilists and discrete mathematicians.
Stochastic local search : foundations and applications
by
Stützle, Thomas
,
Hoos, Holger H.
in
Algorithms
,
Combinatorial analysis
,
Stochastic programming
2005,2004
Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems in many areas of computer science and operations research, including propositional satisfiability, constraint satisfaction, routing, and scheduling. SLS algorithms have also become increasingly popular for solving challenging combinatorial problems in many application areas, such as e-commerce and bioinformatics.Hoos and Stützle offer the first systematic and unified treatment of SLS algorithms. In this groundbreaking new book, they examine the general concepts and specific instances of SLS algorithms and carefully consider their development, analysis and application. The discussion focuses on the most successful SLS methods and explores their underlying principles, properties, and features. This book gives hands-on experience with some of the most widely used search techniques, and provides readers with the necessary understanding and skills to use this powerful tool. *Provides the first unified view of the field.*Offers an extensive review of state-of-the-art stochastic local search algorithms and their applications.*Presents and applies an advanced empirical methodology for analyzing the behavior of SLS algorithms.*A companion website offers lecture slides as well as source code and Java applets for exploring and demonstrating SLS algorithms.
Optimization algorithms on matrix manifolds
2008
Many problems in the sciences and engineering can be rephrased as optimization problems on matrix search spaces endowed with a so-called manifold structure. This book shows how to exploit the special structure of such problems to develop efficient numerical algorithms. It places careful emphasis on both the numerical formulation of the algorithm and its differential geometric abstraction--illustrating how good algorithms draw equally from the insights of differential geometry, optimization, and numerical analysis. Two more theoretical chapters provide readers with the background in differential geometry necessary to algorithmic development. In the other chapters, several well-known optimization methods such as steepest descent and conjugate gradients are generalized to abstract manifolds. The book provides a generic development of each of these methods, building upon the material of the geometric chapters. It then guides readers through the calculations that turn these geometrically formulated methods into concrete numerical algorithms. The state-of-the-art algorithms given as examples are competitive with the best existing algorithms for a selection of eigenspace problems in numerical linear algebra.
Swarm intelligence and bio-inspired computation : theory and applications
by
Yang, Xin-She
,
Gandomi, Amir Hossein
,
Cui, Zhihua
in
Algorithms
,
Biologically-inspired computing
,
Computational intelligence
2013
Swarm Intelligence and bio-inspired computation have become increasing popular in the last two decades.Bio-inspired algorithms such as ant colony algorithms, bat algorithms, bee algorithms, firefly algorithms, cuckoo search and particle swarm optimization have been applied in almost every area of science and engineering with a dramatic increase.
The algorithmic beauty of plants
by
Lindenmayer, Aristid
,
Prusinkiewicz, Przemyslaw
in
Botany
,
Computer graphics
,
Computer Science
1996,1991,1990
The beauty of plants has attracted the attention of mathematicians for Mathematics centuries.Conspicuous geometric features such as the bilateral sym and beauty metry of leaves, the rotational symmetry of flowers, and the helical arrangements of scales in pine cones have been studied most exten sively.