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

R 1,037.62

Algorithms for Convex Optimization
In the last few years, Algorithms for Convex Optimization have revolutionized algorithm design, both for discrete and continuous optimization problems. For problems like maximum flow, maximum matching, and submodular function minimization, the fastest algorithms involve essential methods such as gradient descent, mirror descent, interior point methods, and ellipsoid methods. The goal of this self-contained book is to enable researchers and professionals in computer science, data science, and machine learning to gain an in-depth understanding of these algorithms. The text emphasizes how to derive key algorithms for convex optimization from first principles and how to establish precise running time bounds. This modern text explains the success of these algorithms in problems of discrete optimization, as well as how these methods have significantly pushed the state of the art of convex optimization itself.
R 4,342.15

History of Algorithms
The development of computing has reawakened interest in algorithms. Often neglected by historians and modern scientists, algorithmic procedures have been instrumental in the development of fundamental ideas: practice led to theory just as much as the other way round. The purpose of this book is to offer a historical background to contemporary algorithmic practice.
R 3,076.56



GIS Algorithms
Geographic information systems (GIS) have become increasingly important in helping us understand complex social, economic, and natural dynamics where spatial components play a key role. The critical algorithms used in GIS, however, are notoriously difficult to both teach and understand, in part due to the lack of a coherent representation. GIS Algorithms attempts to address this problem by combining rigorous formal language with example case studies and student exercises.Using Python code throughout, Xiao breaks the subject down into three fundamental areas:Geometric AlgorithmsSpatial IndexingSpatial Analysis and ModellingWith its comprehensive coverage of the many algorithms involved, GIS Algorithms is a key new textbook in this complex and critical area of geography.
R 3,874.74

R 611.00

Algorithms, Artificial Intelligence and Beyond
This volume brings together eminent scholars from various parts of the world, representing different fields of knowledge in order to explore the social, cultural, political, and economic effects of the development of new technologies.On the one hand, the book contextualizes the discussion of algorithms and AI within the broader framework of the digital revolution, but it also examines individual experiences and practices. Moreover, in light of the speed at which algorithms and AI are being incorporated into various aspects of life, contributors also question the ethical implications of their development. The widespread development of artificial intelligence and algorithmic solutions is one of the most important contemporary phenomena. It has an overwhelming impact on the social and cultural life of the 21st century. In this context, one can point to both exciting examples of the application of algorithms and AI in business and popular culture, as well as the challenges of widening social inequality or the expanding scope of surveillance.The scope of the impact of algorithms and AI makes the formation of new theoretical frameworks vital. This is the aim of this book, which will be of interest to academics within the humanities and social sciences with an interest in technology and the impact of algorithms and AI on society and culture.
R 9,311.30

Algorithms for Sensor and Ad Hoc Networks
This monograph presents the outcome of a GI-Dagstuhl Seminar held in Dagstuhl Castle in November 2005. It gives a first overview of algorithmic results on wireless ad hoc and sensor networks. Many chapters deal with distributed algorithms. Importance is attached to topics that combine both interesting aspects of wireless networks and attractive algorithmic methods. Each chapter provides a survey of some part of the field, while selected results are described in more detail.
R 2,386.31

Algorithmic Aspects in Information and Management
This volume constitutes the proceedings of the 13th International Conference on Algorithmic Aspects in Information and Management, AAIM 2019, held in Bejing, China in August 2019.The 31 full papers presented were carefully reviewed and selected. The papers deal with most aspects of theoretical computer science and their applications. Special considerations are given to algorithmic research that is motivated by real-world applications.
R 2,184.18

Algorithmen und Datenstrukturen
Algorithmen bilden das Herzstück jeder nichttrivialen Anwendung von Computern, und die Algorithmik ist ein modernes und aktives Gebiet der Informatik. Daher sollte sich jede Informatikerin und jeder Informatiker mit den algorithmischen Grundwerkzeugen auskennen. Dies sind Strukturen zur effizienten Organisation von Daten, häufig benutzte Algorithmen und Standardtechniken für das Modellieren, Verstehen und Lösen algorithmischer Probleme. Dieses Buch ist eine straff gehaltene Einführung in die Welt dieser Grundwerkzeuge, gerichtet an Studierende und im Beruf stehende Experten, die mit dem Programmieren und mit den Grundelementen der Sprache der Mathematik vertraut sind. Die einzelnen Kapitel behandeln Arrays und verkettete Listen, Hashtabellen und assoziative Arrays, Sortieren und Auswählen, Prioritätswarteschlangen, sortierte Folgen, Darstellung von Graphen, Graphdurchläufe, kürzeste Wege, minimale Spannbäume und Optimierung. Die Algorithmen werden auf moderne Weise präsentiert, mit explizit angegebenen Invarianten, und mit Kommentaren zu neueren Entwicklungen wie Algorithm Engineering, Speicherhierarchien, Algorithmenbibliotheken und zertifizierenden Algorithmen. Die Algorithmen werden zunächst mit Hilfe von Bildern, Text und Pseudocode erläutert; dann werden Details zu effizienten Implementierungen gegeben, auch in Bezug auf konkrete Sprachen wie C++ und Java.
R 2,515.97

R 977.00

R 1,303.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 5,083.61

R 2,796.00


R 630.85

Data Structures And Algorithms In Javascript
For Javascript developers, this book is a one-stop-shop for learning the algorithms and data structures that solve and optimize complex problems. Covering everything from functional programming and abstract data types, to sorting and searching, lists, bags, binary trees, forests, heaps, and graphs - the author uses examples taken from coding challenges and interview questions, enabling readers to explore the real-world advantages of specific algorithms and data structures. Written and illustrated to be a developer's go-to reference manual as well as for immediate on-the-job applications, performance - both from a theoretical point of view and a practical standpoint - is considered alongside every algorithm or data structure introduced. In addition to demonstrating best practices throughout the text, each chapter ends with a series of questions that amplify the preceding concepts and provide further examples for the reader to apply. Also of note, the book utilizes the latest version of
R 1,368.00

R 1,601.36

Hands-On Data Structures and Algorithms with Kotlin
Understand and solve complex computational problems and write efficient code with KotlinKey FeaturesLearn about important data structures such as lists, arrays, queues, and stacksDesign custom algorithms for real-life implementationsIdentify suitable tools for different scenarios and deliver immediate resultsBook DescriptionData structures and algorithms are more than just theoretical concepts. They help you become familiar with computational methods for solving problems and writing logical code. Equipped with this knowledge, you can write efficient programs that run faster and use less memory.Hands-On Data Structures and Algorithms with Kotlin book starts with the basics of algorithms and data structures, helping you get to grips with the fundamentals and measure complexity. You'll then move on to exploring the basics of functional programming while getting used to thinking recursively. Packed with plenty of examples along the way, this book will help you grasp each concept easily. In addition to this, you'll get a clear understanding of how the data structures in Kotlin's collection framework work internally.By the end of this book, you will be able to apply the theory of data structures and algorithms to work out real-world problems.What you will learnUnderstand the basic principles of algorithms and data structuresExplore general-purpose data structures with arrays and linked listsGet to grips with the basics of stacks, queues, and double-ended queuesUnderstand functional programming and related data structuresUse performant searching and efficient sortingUncover how Kotlin's collection framework functionsBecome adept at implementing different types of mapsWho this book is forIf you're a Kotlin developer who wants to learn the intricacies of implementing data structures and algorithms for scalable application development, this book is for you.
R 1,335.00

Algorithmic Algebra
Algorithmic Algebra studies some of the main algorithmic tools of computer algebra, covering such topics as Gröbner bases, characteristic sets, resultants and semialgebraic sets. The main purpose of the book is to acquaint advanced undergraduate and graduate students in computer science, engineering and mathematics with the algorithmic ideas in computer algebra so that they could do research in computational algebra or understand the algorithms underlying many popular symbolic computational systems: Mathematica, Maple or Axiom, for instance. Also, researchers in robotics, solid modeling, computational geometry and automated theorem proving community may find it useful as symbolic algebraic techniques have begun to play an important role in these areas. The book, while being self-contained, is written at an advanced level and deals with the subject at an appropriate depth. The book is accessible to computer science students with no previous algebraic training. Some mathematical readers, on the other hand, may find it interesting to see how algorithmic constructions have been used to provide fresh proofs for some classical theorems. The book also contains a large number of exercises with solutions to selected exercises, thus making it ideal as a textbook or for self-study.
R 1,578.11

R 502.00

Quantum Walks and Search Algorithms
The revised edition of this book offers an extended overview of quantum walks and explains their role in building quantum algorithms, in particular search algorithms.Updated throughout, the book focuses on core topics including Grover's algorithm and the most important quantum walk models, such as the coined, continuous-time, and Szedgedy's quantum walk models. There is a new chapter describing the staggered quantum walk model. The chapter on spatial search algorithms has been rewritten to offer a more comprehensive approach and a new chapter describing the element distinctness algorithm has been added. There is a new appendix on graph theory highlighting the importance of graph theory to quantum walks.As before, the reader will benefit from the pedagogical elements of the book, which include exercises and references to deepen the reader's understanding, and guidelines for the use of computer programs to simulate the evolution of quantum walks.Review of the first edition:“The book is nicely written, the concepts are introduced naturally, and many meaningful connections between them are highlighted. The author proposes a series of exercises that help the reader get some working experience with the presented concepts, facilitating a better understanding. Each chapter ends with a discussion of further references, pointing the reader to major results on the topics presented in the respective chapter.” - Florin Manea, zbMATH.
R 6,521.07

R 748.71

How Algorithms Create and Prevent Fake News
"It's a joy to read a book by a mathematician who knows how to write. [...] There is no better guide to the strategies and stakes of this battle for the future."---Paul Romer, Nobel Laureate, University Professor in Economics at NYU, and former Chief Economist at the World Bank. “By explaining the flaws and foibles of everything from Google search to QAnon—and by providing level-headed evaluations of efforts to fix them—Noah Giansiracusa offers the perfect starting point for anyone entering the maze of modern digital media.”—Jonathan Rauch, senior fellow at the Brookings Institute and contributing editor of The AtlanticFrom deepfakes to GPT-3, deep learning is now powering a new assault on our ability to tell what’s real and what’s not, bringing a whole new algorithmic side to fake news. On the other hand, remarkable methods are being developed to help automate fact-checking and the detection of fake news and doctored media. Success in the modern business world requires you to understand these algorithmic currents, and to recognize the strengths, limits, and impacts of deep learning---especially when it comes to discerning the truth and differentiating fact from fiction. This book tells the stories of this algorithmic battle for the truth and how it impacts individuals and society at large. In doing so, it weaves together the human stories and what’s at stake here, a simplified technical background on how these algorithms work, and an accessible survey of the research literature exploring these various topics. How Algorithms Create and Prevent Fake News is an accessible, broad account of the various ways that data-driven algorithms have been distorting reality and rendering the truth harder to grasp. From news aggregators to Google searches to YouTube recommendations to Facebook news feeds, the way we obtain information today is filtered through the lens of tech giant algorithms. The way data is collected, labelled, and stored has a big impact on the machine learning algorithms that are trained on it, and this is a main source of algorithmic bias – which gets amplified in harmful data feedback loops. Don’t be afraid: with this book you’ll see the remedies and technical solutions that are being applied to oppose these harmful trends. There is hope.What You Will LearnThe ways that data labeling and storage impact machine learning and how feedback loops can occurThe history and inner-workings of YouTube’s recommendation algorithmThe state-of-the-art capabilities of AI-powered text generation (GPT-3) and video synthesis/doctoring (deepfakes) and how these technologies have been used so farThe algorithmic tools available to help with automated fact-checking and truth-detectionWho This Book is ForPeople who don’t have a technical background (in data, computers, etc.) but who would like to learn how algorithms impact society; business leaders who want to know the powers and perils of relying on artificial intelligence. A secondary audience is people w
R 1,026.00

Data Structures and Algorithm Analysis in Java
Data Structures and Algorithm Analysis in Java is an advanced algorithms book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. It is also suitable for a first-year graduate course in algorithm analysis As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java. Weiss clearly explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss' careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code complement the text's coverage.
R 2,188.00

Frontiers of Algorithmics
This book constitutes the refereed proceedings of the 17th International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom (IJTCS-FAW 2023), consisting of the 17th International Conference on Frontier of Algorithmic Wisdom (FAW) and the 4th International Joint Conference on Theoretical Computer Science (IJTCS), held in Macau, China, during August 14–18, 2023.FAW started as the Frontiers of Algorithmic Workshop in 2007 at Lanzhou, China, and was held annually from 2007 to 2021 and published archival proceedings. IJTCS, the International joint theoretical Computer Science Conference, started in 2020, aimed to bring in presentations covering active topics in selected tracks in theoretical computer science. To accommodate the diversified new research directions in theoretical computer science, FAW and IJTCS joined their forces together to organize an event for information exchange of new findings and work of enduring value in the field. The 21 full papers included in this book were carefully reviewed and selected from 34 submissions. They were organized in topical sections as follows: algorithmic game theory; algorithms and data structures; combinatorial optimization; and computational economics.
R 3,321.62

Permutation Group Algorithms
Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, including developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear time algorithms. The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses.
R 5,840.20

Algorithmic Information Theory
Algorithmic Information Theory treats the mathematics of many important areas in digital information processing. It has been written as a read-and-learn book on concrete mathematics, for teachers, students and practitioners in electronic engineering, computer science and mathematics. The presentation is dense, and the examples and exercises are numerous. It is based on lectures on information technology (Data Compaction, Cryptography, Polynomial Coding) for engineers.
R 5,485.99

R 1,805.13

Algorithms for Communications Systems and their Applications
The definitive guide to problem-solving in the design of communications systems In Algorithms for Communications Systems and their Applications, 2nd Edition, authors Benvenuto, Cherubini, and Tomasin have delivered the ultimate and practical guide to applying algorithms in communications systems. Written for researchers and professionals in the areas of digital communications, signal processing, and computer engineering, Algorithms for Communications Systems presents algorithmic and computational procedures within communications systems that overcome a wide range of problems facing system designers. New material in this fully updated edition includes: MIMO systems (Space-time block coding/Spatial multiplexing /Beamforming and interference management/Channel Estimation)OFDM and SC-FDMA (Synchronization/Resource allocation (bit and power loading)/Filtered OFDM)Improved radio channel model (Doppler and shadowing/mmWave)Polar codes (including practical decoding methods)5G systems (New Radio architecture/initial access for mmWave/physical channels) The book retains the essential coding and signal processing theoretical and operative elements expected from a classic text, further adopting the new radio of 5G systems as a case study to create the definitive guide to modern communications systems.
R 5,372.00

R 358.00

Algorithms and Classification in Combinatorial Group Theory
In January 1989 a Workshop on Algorithms, Word Problems and Classi- fication in Combinatorial Group Theory was held at MSRl. This was part of a year-long program on Geometry and Combinatorial Group Theory or- ganised by Adyan, Brown, Gersten and Stallings. The organisers of the workshop were G. Baumslag, F.B. Cannonito and C.F. Miller III. The pa- pers in this volume are an outgrowth of lectures at this conference. The first three papers are concerned with decision problems and the next two with finitely presented simple groups. These are followed by two papers dealing with combinatorial geometry and homology. The remaining papers are about automatic groups and related topics. Some of these papers are, in essence, announcements of new results. The complexity of some of them are such that neither the Editors nor the Reviewers feel that they can take responsibility for vouching for the completeness of the proofs involved. We wish to thank the staff at MSRl for their help in organising the workshop and this volume.
R 1,547.26

Functional Data Structures and Algorithms
This book is an introduction to data structures and algorithms for functional programming languages, with a focus on proofs. Starting with sorting and searching, it moves on to priority queues and advanced design and analysis techniques: dynamic programming, amortized analysis, splay trees, skew heaps and pairing heaps. The final part of the book covers a number of selected fun topics: graph algorithms, string search, Huffman's algorithm for generating optimal codes and alpha-beta pruning of game trees. The book covers both correctness (does the algorithm do what it is supposed to do?) and running time analysis (does the algorithm terminate within a specified number of steps?). It does so in a unified manner with inductive proofs about functional programs and their running time functions. What sets this book apart from existing books on algorithms is that all proofs have been machine-checked, by the proof assistant Isabelle. That is, in addition to the text in the book, which requires no knowledge of proof assistants!, the Isabelle definitions and proofs are available online. The structured nature of Isabelle proofs permits even novices to follow the high-level arguments. This book is aimed at teachers and students (it has been classroom-tested for a number of years) but is also a reference work for programmers and researchers who are interested in the (verified!) details of some algorithm or proof.
R 1,790.00

Algorithms and Data Structures
This book constitutes the refereed proceedings of the 18th International Symposium on Algorithms and Data Structures, WADS 2023, held during July 31-August 2, 2023. The 47 regular papers, presented in this book, were carefully reviewed and selected from a total of 92 submissions. They present original research on the theory, design and application of algorithms and data structures.
R 5,106.33

R 5,266.47

Controversial Encounters in the Age of Algorithms
How can we have meaningful public conversations in the algorithmic age? This book explores how digital technologies shape our opinions and interactions, often in ways that limit our exposure to diverse perspectives and fuel polarization. Drawing on the ancient art of arguing all sides of a case, the book offers a way to revive public debate as a source of trust and legitimacy in democratic societies. This is a timely and urgent book for anyone who cares about the future of democracy in the digital era.
R 1,623.00

Algorithms, Software and Hardware of Parallel Computers
Both algorithms and the software . and hardware of automatic computers have gone through a rapid development in the past 35 years. The dominant factor in this development was the advance in computer technology. Computer parameters were systematically improved through electron tubes, transistors and integrated circuits of ever-increasing integration density, which also influenced the development of new algorithms and programming methods. Some years ago the situation in computers development was that no additional enhancement of their performance could be achieved by increasing the speed of their logical elements, due to the physical barrier of the maximum transfer speed of electric signals. Another enhancement of computer performance has been achieved by parallelism, which makes it possible by a suitable organization of n processors to obtain a perform ance increase of up to n times. Research into parallel computations has been carried out for several years in many countries and many results of fundamental importance have been obtained. Many parallel computers have been designed and their algorithmic and program ming systems built. Such computers include ILLIAC IV, DAP, STARAN, OMEN, STAR-100, TEXAS INSTRUMENTS ASC, CRAY-1, C mmp, CM*, CLIP-3, PEPE. This trend is supported by the fact that: a) many algorithms and programs are highly parallel in their structure, b) the new LSI and VLSI technologies have allowed processors to be combined into large parallel structures, c) greater and greater demands for speed and reliability of computers are made.
R 2,015.00

Genome-Scale Algorithm Design
Presenting the fundamental algorithms and data structures that power bioinformatics workflows, this book covers a range of topics from the foundations of sequence analysis (alignments and hidden Markov models) to classical index structures (k-mer indexes, suffix arrays, and suffix trees), Burrows–Wheeler indexes, graph algorithms, network flows, and a number of advanced omics applications. The chapters feature numerous examples, algorithm visualizations, and exercises, providing graduate students, researchers, and practitioners with a powerful algorithmic toolkit for the applications of high-throughput sequencing. An accompanying website (www.genome-scale.info) offers supporting teaching material. The second edition strengthens the toolkit by covering minimizers and other advanced data structures and their use in emerging pangenomics approaches.
R 2,526.00

Combinatorial Algorithms
This book constitutes the proceedings of 37th International Workshop on Combinatorial Algorithms, IWOCA 2026, held in Clermont-Ferrand, France, during June 8–11, 2026.The 37 full papers presented in this book were carefully reviewed and selected from 110 submissions. They deal with design algorithms for the myriad combinatorial problems that underlie computer applications in science, engineering and business.
R 3,553.74

Induction, Algorithmic Learning Theory, and Philosophy
This is the first book to collect essays from philosophers, mathematicians and computer scientists working at the exciting interface of algorithmic learning theory and the epistemology of science and inductive inference. Readable, introductory essays provide engaging surveys of different, complementary, and mutually inspiring approaches to the topic, both from a philosophical and a mathematical viewpoint.
R 6,002.01

R 775.00

R 397.00

R 275.00

Algorithms in Bioinformatics
The refereed proceedings from the 7th International Workshop on Algorithms in Bioinformatics are provided in this volume. Papers address current issues in algorithms in bioinformatics, ranging from mathematical tools to experimental studies of approximation algorithms to significant computational analyses. Biological problems examined include genetic mapping, sequence alignment and analysis, phylogeny, comparative genomics, and protein structure.
R 1,580.46

Algorithmisches Lernen
Das Buch gibt eine Einführung in das Gebiet des Algorithmischen Lernens, d. h. in den Bereich des Maschinellen Lernens, der methodische und komplexitätstheoretische Aspekte betont. Zunächst wird die Frage geklärt, was überhaupt Lernen bedeutet und wann man davon reden kann, eine Maschine habe gelernt. Anschließend wird einerseits untersucht, welche Objekte in diesem Sinne lernbar sind, andererseits werden auch die Grenzen aufgezeigt. Es werden strukturelle Resultate und algorithmische Entwurfsprinzipien für diese Verfahren dargestellt. Dabei geht es darum, zu bestimmen, wieviel Information zum Lernen notwendig bzw. ausreichend ist. Darüber hinaus werden auch Verfahren für konkrete Aufgaben vorgestellt. Außerdem werden Methoden präsentiert, um unzureichende Lernverfahren zu verbessern und Störungen in der zum Lernen benutzten Information herauszufiltern. Übungen ermöglichen die Überprüfung des richtigen Verständnisses beim Lesen des Buches.
R 1,157.20

R 570.00
















































