Search results for "algorithm"
Items we need to order for you

Algorithms for Next-Generation Sequencing
Advances in sequencing technology have allowed scientists to study the human genome in greater depth and on a larger scale than ever before – as many as hundreds of millions of short reads in the course of a few days. But what are the best ways to deal with this flood of data?Algorithms for Next-Generation Sequencing is an invaluable tool for students and researchers in bioinformatics and computational biology, biologists seeking to process and manage the data generated by next-generation sequencing, and as a textbook or a self-study resource. In addition to offering an in-depth description of the algorithms for processing sequencing data, it also presents useful case studies describing the applications of this technology.
R 5,165.00

Stochastic Algorithms: Foundations and Applications
This book constitutes the refereed proceedings of the 5th International Symposium on Stochastic Algorithms, Foundations and Applications, SAGA 2009, held in Sapporo, Japan, in October 2009. The 15 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 22 submissions. The papers are organized in topical sections on learning, graphs, testing, optimization and caching, as well as stochastic algorithms in bioinformatics.
R 1,545.07

R 470.84

Approximation and Online Algorithms
This book constitutes the refereed proceedings of the 22nd International Workshop on Approximation and Online Algorithms, WAOA 2024, held in Egham, UK, during September 5–6, 2024. The 15 full papers included in this book were carefully reviewed and selected from 47 submissions. They were organized in topical sections as follows: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, FPT approximation algorithms, geometric problems, graph algorithms, inapproximability results, mechanism design, network design, packing and covering, paradigms for designing and analyzing approximation and online algorithms, resource augmentation, and scheduling problems.
R 2,546.28

Advances in Evolutionary Algorithms
Genetic and evolutionary algorithms (GEAs) have often achieved an enviable success in solving optimization problems in a wide range of disciplines. This book provides effective optimization algorithms for solving a broad class of problems quickly, accurately, and reliably by employing evolutionary mechanisms.
R 3,019.10
R 305.00

Genetic Algorithms and Genetic Programming
Genetic Algorithms and Genetic Programming: Modern Concepts and Practical Applications discusses algorithmic developments in the context of genetic algorithms (GAs) and genetic programming (GP). It applies the algorithms to significant combinatorial optimization problems and describes structure identification using HeuristicLab as a platform for algorithm development.The book focuses on both theoretical and empirical aspects. The theoretical sections explore the important and characteristic properties of the basic GA as well as main characteristics of the selected algorithmic extensions developed by the authors. In the empirical parts of the text, the authors apply GAs to two combinatorial optimization problems: the traveling salesman and capacitated vehicle routing problems. To highlight the properties of the algorithmic measures in the field of GP, they analyze GP-based nonlinear structure identification applied to time series and classification problems. Written by core members of the HeuristicLab team, this book provides a better understanding of the basic workflow of GAs and GP, encouraging readers to establish new bionic, problem-independent theoretical concepts. By comparing the results of standard GA and GP implementation with several algorithmic extensions, it also shows how to substantially increase achievable solution quality.
R 4,357.08

R 672.00

R 1,177.00

R 650.00

Handbook of Memetic Algorithms
Memetic Algorithms (MAs) are computational intelligence structures combining multiple and various operators in order to address optimization problems. The combination and interaction amongst operators evolves and promotes the diffusion of the most successful units and generates an algorithmic behavior which can handle complex objective functions and hard fitness landscapes. “Handbook of Memetic Algorithms” organizes, in a structured way, all the the most important results in the field of MAs since their earliest definition until now. A broad review including various algorithmic solutions as well as successful applications is included in this book. Each class of optimization problems, such as constrained optimization, multi-objective optimization, continuous vs combinatorial problems, uncertainties, are analysed separately and, for each problem, memetic recipes for tackling the difficulties are given with some successful examples. Although this book contains chapters written by multiple authors, a great attention has been given by the editors to make it a compact and smooth work which covers all the main areas of computational intelligence optimization. It is not only a necessary read for researchers working in the research area, but also a useful handbook for practitioners and engineers who need to address real-world optimization problems. In addition, the book structure makes it an interesting work also for graduate students and researchers is related fields of mathematics and computer science.
R 6,228.00

Mathematics for the Analysis of Algorithms
This monograph collects some fundamental mathematical techniques that are required for the analysis of algorithms. It builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is concise enough for easy reference yet detailed enough for those with little background with the material.
R 1,935.19

Rise of the Algorithms
The meteoric rise of online video is reshaping the competition for human attention. The Rise of the Algorithms argues that this new technology has changed the way we interact with others, our relationships with public institutions, and our very own behaviors and psyches. In tracing the origins and evolution of online video, John M. Jordan examines the mechanics—and the ethical stakes—of online video platforms, especially YouTube and TikTok, but also others such as Twitch. Tracing the use of algorithms pioneered by Facebook and Google and so successfully exploited by TikTok’s corporate parent, ByteDance, Jordan shows how these platforms now engineer human behavior—with consequences for culture, politics, and identity. Jordan argues that we are at an inflection point. Until now we have proved, as a society, ill-prepared or unwilling to address such problems as the power of digital platforms, the personal cost of viral celebrity, the invasion of privacy, and the proliferation of disinformation. The Rise of the Algorithms combines this urgent assessment with a clear-eyed discussion of present challenges and recommendations for reclaiming our online futures. A valuable resource for understanding the transformations that have been and will be brought by YouTube, TikTok, and similar platforms, Jordan’s timely book is a vital work for anyone who uses the internet, and especially for policy makers, technologists, communication and media specialists, and researchers who have a direct hand in determining the future of our online world.
R 914.00

Just Algorithms
Statistically-derived algorithms, adopted by many jurisdictions in an effort to identify the risk of reoffending posed by criminal defendants, have been lambasted as racist, de-humanizing, and antithetical to the foundational tenets of criminal justice. Just Algorithms argues that these attacks are misguided and that, properly regulated, risk assessment tools can be a crucial means of safely and humanely dismantling our massive jail and prison complex. The book explains how risk algorithms work, the types of legal questions they should answer, and the criteria for judging whether they do so in a way that minimizes bias and respects human dignity. It also shows how risk assessment instruments can provide leverage for curtailing draconian prison sentences and the plea-bargaining system that produces them. The ultimate goal of Christopher Slobogin's insightful analysis is to develop the principles that should govern, in both the pretrial and sentencing settings, the criminal justice system's consideration of risk.
R 1,743.97

Algorithmic Reason
This is an open access title available under the terms of a CC BY-NC-ND 4.0 International licence. It is free to read at Oxford Scholarship Online and offered as a free PDF download from OUP and selected open access locations.Are algorithms ruling the world today? Is artificial intelligence making life-and-death decisions? Are social media companies able to manipulate elections? As we are confronted with public and academic anxieties about unprecedented changes, this book offers a different analytical prism through which these transformations can be explored. Claudia Aradau and Tobias Blanke develop conceptual and methodological tools to understand how algorithmic operations shape the government of self and other.They explore the emergence of algorithmic reason through rationalities, materializations, and interventions, and trace how algorithmic rationalities of decomposition, recomposition, and partitioning are materialized in the construction of dangerous others, the power of platforms, and the production ofeconomic value. The book provides a global trandisciplinary perspective on algorithmic operations, drawing on qualitative and digital methods to investigate controversies ranging from mass surveillance and the Cambridge Analytica scandal in the UK to predictive policing in the US, and from the use of facial recognition in China and drone targeting in Pakistan to the regulation of hate speech in Germany.
R 5,027.00

Algorithms for Computer Algebra
Algorithms for Computer Algebra is the first comprehensive textbook to be published on the topic of computational symbolic mathematics. The book first develops the foundational material from modern algebra that is required for subsequent topics. It then presents a thorough development of modern computational algorithms for such problems as multivariate polynomial arithmetic and greatest common divisor calculations, factorization of multivariate polynomials, symbolic solution of linear and polynomial systems of equations, and analytic integration of elementary functions. Numerous examples are integrated into the text as an aid to understanding the mathematical development. The algorithms developed for each topic are presented in a Pascal-like computer language. An extensive set of exercises is presented at the end of each chapter. Algorithms for Computer Algebra is suitable for use as a textbook for a course on algebraic algorithms at the third-year, fourth-year, or graduate level. Although the mathematical development uses concepts from modern algebra, the book is self-contained in the sense that a one-term undergraduate course introducing students to rings and fields is the only prerequisite assumed. The book also serves well as a supplementary textbook for a traditional modern algebra course, by presenting concrete applications to motivate the understanding of the theory of rings and fields.
R 4,703.38

Advances in Computational Algorithms and Data Analysis
Advances in Computational Algorithms and Data Analysis offers state of the art tremendous advances in computational algorithms and data analysis. The selected articles are representative in these subjects sitting on the top-end-high technologies. The volume serves as an excellent reference work for researchers and graduate students working on computational algorithms and data analysis.
R 4,701.89

Frontiers of Algorithmics
This book LNCS15828 constitutes the refereed proceedings of the 19th International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom (IJTCS-FAW 2025), consisting of the 19th International Conference on Frontier of Algorithmic Wisdom (FAW) and the 6th International Joint Conference on Theoretical Computer Science (IJTCS), held in Paris, France, during June 30-July 2, 2025. The 28 full papers and 2 short papers were carefully reviewed and selected from 63 submissions. The proceedings focuses on Frontiers of Algorithmic Wisdom; Block-chain, Distributed Computing, Multi-Agents; Game Theory, Algorithmic Game Theory, Machine Learning, Electronic Commerce.
R 2,958.63


R 1,314.50

Algorithm Theory - SWAT '94
This volume constitutes the proceedings of SWAT '94, the 4th Scandinavian Workshop on Algorithm Theory, held in Aarhus, Denmark in July 1994. The SWAT events are organized each even year and alternate with the WADS meetings (Workshops on Algorithms and Data Structures) held each odd year in North America.The volume contains 31 papers selected from a total of 100 submissions and 3 invited presentations by Michael Fredman (Rutgers), Johan Hastad (Stockholm), and Ketan Mulmuley (Chicago). The contributions cover algorithms and data structures in all areas of computer science and in discrete mathematics, particularly including graph theory, computational geometry, and databases.
R 1,573.86

Genetische Algorithmen
Das Prinzip der Evolution wurde von Charles Darwin vor nur wenig mehr als hundert Jahren entdeckt. Die Lebewesen in der Natur unterliegen einer steten Veränderung, die durch Kooperation und Konkurrenz zwischen einzelnen Arten und deren Anpassungsfähigkeit an ihre Umwelt vorangetrieben wird. Inwieweit die heute existierenden Lebewesen ausschließlich durch den Evolutionsprozeß entstanden sind, ist eine philosophische und theologische Streitfrage, die in diesem Buch nicht weiter behandelt werden soll. Das grundlegende Prinzip besteht in der iterativen Abfolge von Rekom bination, Mutation und Selektion, wobei eine Tendenz zum Überleben der stärkeren und besseren Individuen besteht. Dieses Prinzip ist in der Natur sehr erfolgreich. Optimierung ist eine der wichtigsten Aufgaben in der modernen Industrie. Prozesse müssen schneller und sicherer ablaufen, Material wird gespart, die Produktivität soll ständig steigen. Diejenigen Firmen, denen das gelingt, haben im Wettbewerb um die Märkte die besten Überlebenschancen. Die freie Marktwirtschaft hat sich dieses Prinzip zu eigen gemacht und große Erfolge erzielt (allerdings oft zum Schaden der Umwelt, weil die dort entstandenen Schäden meistens keine finanziell meßbaren Kosten verursachen). Optimierung wird als Wissenschaft vor allem im Bereich des Operations Research untersucht. In der Mathematik sind ebenfalls viele Verfahren vorgeschlagen und entwickelt worden. Seit Mitte der 80er Jahre sind darüber hinaus Neuronale Netze zur Lösung von Optimierungspro blemen attraktiv geworden.
R 2,089.46

Algorithms for Continuous Optimization
The NATO Advanced Study Institute on "Algorithms for continuous optimiza tion: the state of the art" was held September 5-18, 1993, at II Ciocco, Barga, Italy. It was attended by 75 students (among them many well known specialists in optimiza tion) from the following countries: Belgium, Brasil, Canada, China, Czech Republic, France, Germany, Greece, Hungary, Italy, Poland, Portugal, Rumania, Spain, Turkey, UK, USA, Venezuela. The lectures were given by 17 well known specialists in the field, from Brasil, China, Germany, Italy, Portugal, Russia, Sweden, UK, USA. Solving continuous optimization problems is a fundamental task in computational mathematics for applications in areas of engineering, economics, chemistry, biology and so on. Most real problems are nonlinear and can be of quite large size. Devel oping efficient algorithms for continuous optimization has been an important field of research in the last 30 years, with much additional impetus provided in the last decade by the availability of very fast and parallel computers. Techniques, like the simplex method, that were already considered fully developed thirty years ago have been thoroughly revised and enormously improved. The aim of this ASI was to present the state of the art in this field. While not all important aspects could be covered in the fifty hours of lectures (for instance multiob jective optimization had to be skipped), we believe that most important topics were presented, many of them by scientists who greatly contributed to their development.
R 1,602.20

Randomized Algorithms in Automatic Control and Data Mining
In the fields of data mining and control, the huge amount of unstructured data and the presence of uncertainty in system descriptions have always been critical issues. The book Randomized Algorithms in Automatic Control and Data Mining introduces the readers to the fundamentals of randomized algorithm applications in data mining (especially clustering) and in automatic control synthesis. The methods proposed in this book guarantee that the computational complexity of classical algorithms and the conservativeness of standard robust control techniques will be reduced. It is shown that when a problem requires "brute force" in selecting among options, algorithms based on random selection of alternatives offer good results with certain probability for a restricted time and significantly reduce the volume of operations.
R 4,030.00

Algorithms and Architectures for Parallel Processing
This book constitutes the refereed workshop proceedings of the 16th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2016, held in Granada, Spain, in December 2016. The 30 full papers presented were carefully reviewed and selected from 58 submissions. They cover many dimensions of parallel algorithms and architectures, encompassing fundamental theoretical approaches, practical experimental projects, and commercial components and systems trying to push beyond the limits of existing technologies, including experimental efforts, innovative systems, and investigations that identify weaknesses in existing parallel processing technology.
R 2,191.51

R 306.00

Spaß mit Algorithmen
(2) Die NEGATION Die Negation ist die Verneinung einer Aussage. Ist A die Aussage, so bezeichnet man die Negation mit --, A, A' oder A. Ist die Aussage wahr, so ist ihre Negation falsch. Ist die Aussage falsch, so ist ihre Negation wahr. A' A W F F W (3) Die UND-Zusammensetzung A B C =AAB W W W W F F F F W F F F A A B ist nur dann wahr, wenn beide Teilaussagen wahr sind. Der Fachausdruck für die UND-Zusammensetzung ist KONJUNKTION. Die Konjunktion kann auch als "logisches Produkt" erklärt werden, weil nur 1 . 1 = 1 ist, wenn man W = 1 und F = 0 setzt. (4) Die ODER-Zusammensetzung A B C=A\lB W W W W F W F W W F F F A V B ist nur dann falsch, wenn beide Teilaussagen falsch sind. Der Fachausdruck für die ODER-Zusammensetzung ist DISJUNKTION. Die Disjunktion kann auch als "logische Summe" erklärt werden, weil nur 0 + 0 = 0 ist, wenn man W = 1 und F = 0 setzt. Wichtig: Dieses ODER ist nicht ausschließend.
R 1,678.14

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
This book constitutes the joint refereed proceedings of the 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2011, and the 15th International Workshop on Randomization and Computation, RANDOM 2011, held in Princeton, New Jersey, USA, in August 2011. The volume presents 29 revised full papers of the APPROX 2011 workshop, selected from 66 submissions, and 29 revised full papers of the RANDOM 2011 workshop, selected from 64 submissions. They were carefully reviewed and selected for inclusion in the book. In addition two abstracts of invited talks are included.APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.
R 1,624.10

R 305.00


Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.
R 2,015.00

Machine Learning Algorithms
An easy-to-follow, step-by-step guide for getting to grips with the real-world application of machine learning algorithmsKey FeaturesExplore statistics and complex mathematics for data-intensive applicationsDiscover new developments in EM algorithm, PCA, and bayesian regressionStudy patterns and make predictions across various datasetsBook DescriptionMachine learning has gained tremendous popularity for its powerful and fast predictions with large datasets. However, the true forces behind its powerful output are the complex algorithms involving substantial statistical analysis that churn large datasets and generate substantial insight.This second edition of Machine Learning Algorithms walks you through prominent development outcomes that have taken place relating to machine learning algorithms, which constitute major contributions to the machine learning process and help you to strengthen and master statistical interpretation across the areas of supervised, semi-supervised, and reinforcement learning. Once the core concepts of an algorithm have been covered, you’ll explore real-world examples based on the most diffused libraries, such as scikit-learn, NLTK, TensorFlow, and Keras. You will discover new topics such as principal component analysis (PCA), independent component analysis (ICA), Bayesian regression, discriminant analysis, advanced clustering, and gaussian mixture.By the end of this book, you will have studied machine learning algorithms and be able to put them into production to make your machine learning applications more innovative.What you will learnStudy feature selection and the feature engineering processAssess performance and error trade-offs for linear regressionBuild a data model and understand how it works by using different types of algorithmLearn to tune the parameters of Support Vector Machines (SVM)Explore the concept of natural language processing (NLP) and recommendation systemsCreate a machine learning architecture from scratchWho this book is forMachine Learning Algorithms is for you if you are a machine learning engineer, data engineer, or junior data scientist who wants to advance in the field of predictive analytics and machine learning. Familiarity with R and Python will be an added advantage for getting the best from this book.
R 1,889.00

Algorithmic Composition
Algorithmic composition – composing by means of formalizable methods – has a century old tradition not only in occidental music history. This is the first book to provide a detailed overview of prominent procedures of algorithmic composition in a pragmatic way rather than by treating formalizable aspects in single works. In addition to an historic overview, each chapter presents a specific class of algorithm in a compositional context by providing a general introduction to its development and theoretical basis and describes different musical applications. Each chapter outlines the strengths, weaknesses and possible aesthetical implications resulting from the application of the treated approaches. Topics covered are: markov models, generative grammars, transition networks, chaos and self-similarity, genetic algorithms, cellular automata, neural networks and artificial intelligence are covered. The comprehensive bibliography makes this work ideal for the musician and the researcher alike.
R 3,845.20

R 2,514.00

Distributed Algorithms
This volume contains the proceedings of the fifthInternational Workshop on Distributed Algorithms (WDAG '91)held in Delphi, Greece, in October 1991. The workshopprovided a forum for researchers and others interested indistributed algorithms, communication networks, anddecentralized systems. The aim was to present recentresearch results, explore directions for future research,and identify common fundamental techniques that serve asbuilding blocks in many distributed algorithms.The volume contains 23 papers selected by the ProgramCommittee from about fifty extended abstracts on the basisof perceived originality and quality and on thematicappropriateness and topical balance. The workshop wasorganizedby the Computer Technology Institute of PatrasUniversity, Greece.
R 1,561.94

Just Algorithms
Statistically-derived algorithms, adopted by many jurisdictions in an effort to identify the risk of reoffending posed by criminal defendants, have been lambasted as racist, de-humanizing, and antithetical to the foundational tenets of criminal justice. Just Algorithms argues that these attacks are misguided and that, properly regulated, risk assessment tools can be a crucial means of safely and humanely dismantling our massive jail and prison complex. The book explains how risk algorithms work, the types of legal questions they should answer, and the criteria for judging whether they do so in a way that minimizes bias and respects human dignity. It also shows how risk assessment instruments can provide leverage for curtailing draconian prison sentences and the plea-bargaining system that produces them. The ultimate goal of Christopher Slobogin's insightful analysis is to develop the principles that should govern, in both the pretrial and sentencing settings, the criminal justice system's consideration of risk.
R 5,083.61

Graphen—Algorithmen—Programme
Graphentheorie ist eine junge mathematische Disziplin, 1936 erschien das erste Lehrbuch yom ungarischen Mathematiker DENES KONIG. Mit der stiirmischen Ent- wicklung der Operationsforschung erlebte auch die Graphentheorie eine ungeahnte Bliite, so daB die Zahl der Biicher zur Graphentheorie heute schon Legion ist. Das Gros der Autoren setzt jedoch beim Leser einen relativ hohen mathematischen Aus- bildungsgrad sowie ein hohes Abstraktionsvermogen voraus. Wir verlangen yom Leser im allgemeinen nicht mehr mathematische Kenntnisse, als in den allgemein- bildenden Schulen vermittelt werden (sieht man einmal von den Begriffen Vektor und Matrix ab) und auch nicht mehr als element are Kenntnisse iiber Programmierung (Ergibtanweisung, Laufanweisung, bedingter Sprung u. a. ). Was wir jedoch yom Leser erwarten, ist die Bereitschaft, sich Zeile fUr Zeile durch einen Algorithmus hindurchzuarbeiten. Dabei kann der Leser stiindig testen, ob er den behandelten Algorithmus verstanden hat, wenn er niimlich das sich anschlieBende Beispiel selb- stiindig zu Ende fiihren kann. Kleine Aufgaben sind ebenfalls in die einzelnen Ab- schnitte eingestreut. Das vorliegende Lehrbuch wendet sich an Studierende von Fach- und Hochschulen technischer, naturwissenschaftlicher und okonomischer Fachrichtungen, ferner an in der Praxis Tiitige, die sich mit Modellierung, Strukturanalyse und Optimierung diskreter Systeme befassen. Aber auch der Leser, welcher bloB SpaB an der Losung kombinatorischer Probleme hat, wird nicht umsonst zu diesem Buch greifen.
R 1,743.62

Meta-Algorithmics
The confluence of cloud computing, parallelism and advanced machine intelligence approaches has created a world in which the optimum knowledge system will usually be architected from the combination of two or more knowledge-generating systems. There is a need, then, to provide a reusable, broadly-applicable set of design patterns to empower the intelligent system architect to take advantage of this opportunity. This book explains how to design and build intelligent systems that are optimized for changing system requirements (adaptability), optimized for changing system input (robustness), and optimized for one or more other important system parameters (e.g., accuracy, efficiency, cost). It provides an overview of traditional parallel processing which is shown to consist primarily of task and component parallelism; before introducing meta-algorithmic parallelism which is based on combining two or more algorithms, classification engines or other systems. Key features: Explains the entire roadmap for the design, testing, development, refinement, deployment and statistics-driven optimization of building systems for intelligenceOffers an accessible yet thorough overview of machine intelligence, in addition to having a strong image processing focusContains design patterns for parallelism, especially meta-algorithmic parallelism – simply conveyed, reusable and proven effective that can be readily included in the toolbox of experts in analytics, system architecture, big data, security and many other science and engineering disciplinesConnects algorithms and analytics to parallelism, thereby illustrating a new way of designing intelligent systems compatible with the tremendous changes in the computing world over the past decadeDiscusses application of the approaches to a wide number of fields; primarily, document understanding, image understanding, biometrics and security printingCompanion website contains sample code and data sets
R 3,743.00

Stable Mutations for Evolutionary Algorithms
This book presents a set of theoretical and experimental results that describe the features of the wide family of α-stable distributions (the normal distribution also belongs to this class) and their various applications in the mutation operator of evolutionary algorithms based on real-number representation of the individuals, and, above all, equip these algorithms with features that enrich their effectiveness in solving multi-modal, multi-dimensional global optimization problems. The overall conclusion of the research presented is that the appropriate choice of probabilistic model of the mutation operator for an optimization problem is crucial.Mutation is one of the most important operations in stochastic global optimization algorithms in the n-dimensional real space. It determines the method of search space exploration and exploitation. Most applications of these algorithms employ the normal mutation as a mutation operator. This choice is justified by the central limit theorem but is associated with a set of important limitations. Application of α-stable distributions allows more flexible evolutionary models to be obtained than those with the normal distribution. The book presents theoretical analysis and simulation experiments, which were selected and constructed to expose the most important features of the examined mutation techniques based on α-stable distributions. It allows readers to develop a deeper understanding of evolutionary processes with stable mutations and encourages them to apply these techniques to real-world engineering problems.
R 4,633.81

R 365.00

R 608.00

Algorithms and Data Structures
This book constitutes the refereed proceedings of the 10th International Workshop on Algorithms and Data Structures, WADS 2007, held in Halifax, Canada, in August 2007. The papers present original research on the theory and application of algorithms and data structures in all areas, including combinatorics, computational geometry, databases, graphics, parallel and distributed computing.
R 3,099.49

Cinematic Algorithms
This book explores the groundbreaking integration of generative artificial intelligence into filmmaking and visual storytelling. From democratizing video production to reshaping aesthetics, this book highlights the creative revolution AI offers. Through case studies, interviews with innovative artists, and historical perspectives, it examines how intelligent systems enhance creativity while challenging traditional notions of authorship and originality. With practical guides and forward-looking insights, this volume is essential for anyone curious about the intersection of technology and visual culture, offering a vivid portrait of the future of storytelling in an AI-driven world.
R 8,047.87

Mastering Machine Learning Algorithms
Updated and revised second edition of the bestselling guide to exploring and mastering the most important algorithms for solving complex machine learning problemsKey FeaturesUpdated to include new algorithms and techniquesCode updated to Python 3.8 & TensorFlow 2.x New coverage of regression analysis, time series analysis, deep learning models, and cutting-edge applicationsBook DescriptionMastering Machine Learning Algorithms, Second Edition helps you harness the real power of machine learning algorithms in order to implement smarter ways of meeting today's overwhelming data needs. This newly updated and revised guide will help you master algorithms used widely in semi-supervised learning, reinforcement learning, supervised learning, and unsupervised learning domains.You will use all the modern libraries from the Python ecosystem – including NumPy and Keras – to extract features from varied complexities of data. Ranging from Bayesian models to the Markov chain Monte Carlo algorithm to Hidden Markov models, this machine learning book teaches you how to extract features from your dataset, perform complex dimensionality reduction, and train supervised and semi-supervised models by making use of Python-based libraries such as scikit-learn. You will also discover practical applications for complex techniques such as maximum likelihood estimation, Hebbian learning, and ensemble learning, and how to use TensorFlow 2.x to train effective deep neural networks.By the end of this book, you will be ready to implement and solve end-to-end machine learning problems and use case scenarios.What you will learnUnderstand the characteristics of a machine learning algorithmImplement algorithms from supervised, semi-supervised, unsupervised, and RL domainsLearn how regression works in time-series analysis and risk predictionCreate, model, and train complex probabilistic models Cluster high-dimensional data and evaluate model accuracy Discover how artificial neural networks work – train, optimize, and validate them Work with autoencoders, Hebbian networks, and GANsWho this book is forThis book is for data science professionals who want to delve into complex ML algorithms to understand how various machine learning models can be built. Knowledge of Python programming is required.
R 1,661.00

Guide to Graph Algorithms
This book A Guide to Graph Algorithms offers high-quality content in the research area of graph algorithms and explores the latest developments in graph algorithmics. The reader will gain a comprehensive understanding of how to use algorithms to explore graphs. It is a collection of texts that have proved to be trend setters and good examples of that. The book aims at providing the reader with a deep understanding of the structural properties of graphs that are useful for the design of efficient algorithms. These algorithms have applications in finite state machine modelling, social network theory, biology, and mathematics. The book contains many exercises, some up at present-day research-level. The exercises encourage the reader to discover new techniques by putting things in a clear perspective. A study of this book will provide the reader with many powerful tools to model and tackle problems in real-world scenarios.
R 2,381.00

Algorithmic Institutionalism
Algorithmic Institutionalism is the first book to conceive algorithms as institutions in contemporary societies, focusing on different dimensions of how they structure decision-making and enact power relations. In many situations in contemporary societies, algorithms structure social interactions, resulting in patterns of action and human behavior in collective contexts. Almeida, Filgueiras, and Mendonca discuss how algorithms are gradually occupying an institutional space in societies, deciding on different aspects of social life and shaping collective and individual human behaviors. As institutions, algorithms work as decision systems that define what is allowed, hindered, facilitated, or made impossible as well as positions within society's organizational structures. Algorithmic institutionalism uses the perspective of institutional theories to explain the functioning of these decision systems and how they establish patterns and norms that affect human behavior and lead to deep changes in contemporary society. The book points to the challenges of political orders that are gradually institutionalized with algorithms, comprising new dynamics of interaction between humans and machines. These disruptive dynamics of interaction between humans and machines create new challenges related to the democratization of algorithms and the impasses that emerge with technological advancement through digital technologies. Providing an analytical framework for an adequate comprehension of the social and political implications of algorithmic systems, Algorithmic institutionalism applies this framework to make sense of recommendation systems, the platformization of governments, and the deployment of algorithms in security. It then addresses the challenge of developing approaches to democratize the new political order influenced by the global expansion of algorithmic decision-making, pointing to key democratic values that are relevant once we consider the construction of legitimate decisions in contemporary societies.
R 3,867.00

Algorithms and Complexity
This book constitutes the refereed conference proceedings of the 12th International Conference on Algorithms and Complexity, CIAC 2019, held as a virtual event, in May 2021.The 28 full papers presented together with one invited lecture and 2 two abstracts of invited lectures were carefully reviewed and selected from 78 submissions. The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures. The papers present original research in the theory and applications of algorithms and computational complexity.Due to the Corona pandemic the conference was held virtually.
R 3,338.67














































