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

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

Algorithm of Creation, The
The Algorithm of Creation is the last of Nicholas Hagger’s quartet on the unity of the universe and humankind, and follows The Universe and the Light (1993), The One and the Many (1999) and The New Philosophy of Universalism (2009). It offers an algebraic formula written out for him by Junzaburo Nishiwaki, Japan’s T.S. Eliot, in Tokyo in October 1965, that sums up the wisdom of the East: “+A + –A = 0.” Based on ancient Chinese thinking, yin (dark) + yang (light) = the Tao, it shows all opposites reconciled in the underlying unity of the One Void whose emptiness is also a fullness. During a dinner at a conference of leading scientists at Jesus College, Cambridge in September 1992, watched by Nobel physics prizewinner Roger Penrose, Hagger reversed the formula to 0 = +A + –A when he wrote down the maths for his view of the origin and creation of the universe and showed the first two particles emerging from the Void’s singularity, influenced by the 1992 discovery of ripples in the cosmic microwave background radiation and the Presocratic Anaximander of Miletus. In this work Hagger shows how this algebraic formula has worked as a universal algorithm, 0 = +A + –A = 0. Its many variations have acted as rules that have controlled the creation and development of the expanding universe, its evolution and the rise of human history, religion and science, and its ultimate fate. The formula is behind many of Hagger’s works, and his application of this algorithm to all human knowledge of the universe and all disciplines takes him to a first-ever Theory of Everything, which is set out at the end: the algorithm of Creation containing 100 mathematical symbols (reflecting all the variations) that can be summed up in the above algorithm. This startling achievement has been made possible by his Universalist cross-disciplinary approach which focuses on the fundamental oneness of the universe and humankind, and the unitive vision.
R 833.00

R 2,359.00

WALCOM: Algorithms and Computation
This book constitutes the proceedings of the 17th International Conference and Workshops on Algorithms and Computation, WALCOM 2023, which took place in Hsinchu, Taiwan, in March 2023.The 30 full papers presented together with 2 invited papers were carefully reviewed and selected from 75 submissions. They cover topics such as: computational geometry; string algorithm; optimization; graph algorithm; approximation algorithm; and parameterized complexity.
R 3,337.05

Hands-On Data Structures and Algorithms with Python
Understand how implementing different data structures and algorithms intelligently can make your Python code and applications more maintainable and efficientKey FeaturesExplore functional and reactive implementations of traditional and advanced data structuresApply a diverse range of algorithms in your Python codeImplement the skills you have learned to maximize the performance of your applicationsBook DescriptionChoosing the right data structure is pivotal to optimizing the performance and scalability of applications. This new edition of Hands-On Data Structures and Algorithms with Python will expand your understanding of key structures, including stacks, queues, and lists, and also show you how to apply priority queues and heaps in applications. You'll learn how to analyze and compare Python algorithms, and understand which algorithms should be used for a problem based on running time and computational complexity. You will also become confident organizing your code in a manageable, consistent, and scalable way, which will boost your productivity as a Python developer.By the end of this Python book, you'll be able to manipulate the most important data structures and algorithms to more efficiently store, organize, and access data in your applications.What you will learnUnderstand common data structures and algorithms using examples, diagrams, and exercisesExplore how more complex structures, such as priority queues and heaps, can benefit your codeImplement searching, sorting, and selection algorithms on number and string sequencesBecome confident with key string-matching algorithmsUnderstand algorithmic paradigms and apply dynamic programming techniquesUse asymptotic notation to analyze algorithm performance with regard to time and space complexitiesWrite powerful, robust code using the latest features of PythonWho this book is forThis book is for developers and programmers who are interested in learning about data structures and algorithms in Python to write complex, flexible programs. Basic Python programming knowledge is expected.
R 1,628.00

Algorithms and Computation
This volume contains the proceedings of the 14th Annual International S- posium on Algorithms and Computation (ISAAC 2003), held in Kyoto, Japan, 15–17 December 2003. In the past, it was held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Taejon (1998), Chennai (1999), Taipei (2000), Christchurch (2001), and Vancouver (2002). ISAACisanannualinternationalsymposiumthatcoverstheverywiderange of topics in algorithms and computation. The main purpose of the symposium is to provide a forum for researchers working in algorithms and the theory of computation where they can exchange ideas in this active research community. In response to our call for papers, we received unexpectedly many subm- sions, 207 papers. The task of selecting the papers in this volume was done by our program committee and referees. After a thorough review process, the committee selected 73 papers. The selection was done on the basis of originality and relevance to the ?eld of algorithms and computation. We hope all accepted papers will eventally appear in scienti?c journals in more polished forms. The best paper award was given for “On the Geometric Dilation of Finite Point Sets” to Annette Ebbers-Baumann, Ansgar Grune ¨ and Rolf Klein. Two eminent invited speakers, Prof. Andrew Chi-Chih Yao of Princeton University and Prof. Takao Nishizeki of Tohoku University, contributed to this proceedings.
R 3,114.04

R 2,278.00

Algorithms for Worst-Case Design and Applications to Risk Management
Recognizing that robust decision making is vital in risk management, this book provides concepts and algorithms for computing the best decision in view of the worst-case scenario. The main tool used is minimax, which ensures robust policies with guaranteed optimal performace that will improve further if the worst case is not realized. The applications considered are drawn from finance, but the design and algorithms presented are equally applicable to problems of economic policy, engineering design, and other areas of decision making.;Critically, worst-case design addresses not only Armageddon-type uncertainty. Indeed, the determination of the worst case becomes nontrivial when faced with numerous - possibly infinite - and reasonably likely rival scenarios. Optimality does not depend on any single scenario but on all the scenarios under consideration. Worst-case optimal decisions provide guaranteed optimal performance for systems operating within the specified scenario range indicating uncertainty. The noninferiority of minimax solutions - which also offer the possibility of multiple maxima - ensures this optimality.;Worst-case design is not intended to necessarily replace expected
R 6,436.67

Experimental and Efficient Algorithms
The Third International Workshop on Experimental and E?cient Algorithms (WEA 2004) was held in Angra dos Reis (Brazil), May 25-28, 2004. TheWEAworkshopsaresponsoredbytheEuropeanAssociationforTheo- tical Computer Science (EATCS). They are intended to provide an international forum for researchers in the areas of design, analysis, and experimental eval- tion of algorithms. The two preceding workshops in this series were held in Riga (Latvia, 2001) and Ascona (Switzerland, 2003). This proceedings volume comprises 40 contributed papers selected by the Program Committee along with the extended abstracts of the invited lectures presentedbyRichardKarp(UniversityofCaliforniaatBerkeley,USA),Giuseppe Italiano (University of Rome "Tor Vergata", Italy), and Christos Kaklamanis (University of Patras, Greece). As the organizer and chair of this wokshop, I would like to thank all the authors who generously supported this project by submitting their papers for publication in thisvolume. Iamalso grateful to theinvited lecturers, who kindly accepted our invitation.For their dedication and collaboration in the refereeing procedure, I would like also to express my gratitude to the members of the Program Committee: E. Amaldi (Italy), J. Blazewicz (Poland), V.-D. Cung (France), U. Derigs (G- many), J. Diaz (Spain), M. Gendreau (Canada), A. Goldberg (USA), P. Hansen (Canada), T. Ibaraki (Japan), K. Jansen (Germany), S. Martello (Italy), C.C. McGeoch (USA), L.S. Ochi (Brazil), M.G.C. Resende (USA), J. Rolim (Sw- zerland), S. Skiena (USA), M. Sniedovich (Australia), C.C. Souza (Brazil), P.
R 1,604.71

Self-Learning and Adaptive Algorithms for Business Applications
In today’s data-driven world, more sophisticated algorithms for data processing are in high demand, mainly when the data cannot be handled with the help of traditional techniques. Self-learning and adaptive algorithms are now widely used by such leading giants that as Google, Tesla, Microsoft, and Facebook in their projects and applications. In this guide designed for researchers and students of computer science, readers will find a resource for how to apply methods that work on real-life problems to their challenging applications, and a go-to work that makes fuzzy clustering issues and aspects clear. Including research relevant to those studying cybernetics, applied mathematics, statistics, engineering, and bioinformatics who are working in the areas of machine learning, artificial intelligence, complex system modeling and analysis, neural networks, and optimization, this is an ideal read for anyone interested in learning more about the fascinating new developments in machine learning.
R 2,954.94

Algorithms and Architectures for Parallel Processing
This fourvolume set LNCS 9528, 9529, 9530 and 9531 constitutes the refereed proceedingsof the 15th International Conference on Algorithms and Architectures for ParallelProcessing, ICA3PP 2015, held in Zhangjiajie, China, in November 2015.The 219revised full papers presented together with 77 workshop papers in these fourvolumes were carefully reviewed and selected from 807 submissions (602 fullpapers and 205 workshop papers). The first volume comprises the followingtopics: parallel and distributed architectures; distributed and network-basedcomputing and internet of things and cyber-physical-social computing. Thesecond volume comprises topics such as big data and its applications andparallel and distributed algorithms. The topics of the third volume are:applications of parallel and distributed computing and service dependabilityand security in distributed and parallel systems. The covered topics of the fourthvolume are: software systems and programming models and performance modelingand evaluation.
R 2,264.11

Evolutionary Algorithms in Engineering and Computer Science
Evolutionary Algorithms in Engineering and Computer Science Edited by K. Miettinen, University of Jyväskylä, Finland M. M. Mäkelä, University of Jyväskylä, Finland P. Neittaanmäki, University of Jyväskylä, Finland J. Périaux, Dassault Aviation, France What is Evolutionary Computing? Based on the genetic message encoded in DNA, and digitalized algorithms inspired by the Darwinian framework of evolution by natural selection, Evolutionary Computing is one of the most important information technologies of our times. Evolutionary algorithms encompass all adaptive and computational models of natural evolutionary systems - genetic algorithms, evolution strategies, evolutionary programming and genetic programming. In addition, they work well in the search for global solutions to optimization problems, allowing the production of optimization software that is robust and easy to implement. Furthermore, these algorithms can easily be hybridized with traditional optimization techniques. This book presents state-of-the-art lectures delivered by international academic and industrial experts in the field of evolutionary computing. It bridges artificial intelligence and scientific computing with a particular emphasis on real-life problems encountered in application-oriented sectors, such as aerospace, electronics, telecommunications, energy and economics. This rapidly growing field, with its deep understanding and assesssment of complex problems in current practice, provides an effective, modern engineering tool. This book will therefore be of significant interest and value to all postgraduates, research scientists and practitioners facing complex optimization problems.
R 10,223.00

Algorithmic Learning in a Random World
This book is about conformal prediction, an approach to prediction that originated in machine learning in the late 1990s. The main feature of conformal prediction is the principled treatment of the reliability of predictions. The prediction algorithms described — conformal predictors — are provably valid in the sense that they evaluate the reliability of their own predictions in a way that is neither over-pessimistic nor over-optimistic (the latter being especially dangerous). The approach is still flexible enough to incorporate most of the existing powerful methods of machine learning. The book covers both key conformal predictors and the mathematical analysis of their properties.Algorithmic Learning in a Random World contains, in addition to proofs of validity, results about the efficiency of conformal predictors. The only assumption required for validity is that of "randomness" (the prediction algorithm is presented with independent and identically distributed examples); in later chapters, even the assumption of randomness is significantly relaxed. Interesting results about efficiency are established both under randomness and under stronger assumptions.Since publication of the First Edition in 2005 conformal prediction has found numerous applications in medicine and industry, and is becoming a popular machine-learning technique. This Second Edition contains three new chapters. One is about conformal predictive distributions, which are more informative than the set predictions produced by standard conformal predictors. Another is about the efficiency of ways of testing the assumption of randomness based on conformal prediction. The third new chapter harnesses conformal testing procedures for protecting machine-learning algorithms against changes in the distribution of the data. In addition, the existing chapters have been revised, updated, and expanded.
R 7,326.00

R 183.00

R 611.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,152.12

R 1,254.00

Data Structures and Algorithms with Scala
This practically-focused textbook presents a concise tutorial on data structures and algorithms using the object-functional language Scala. The material builds upon the foundation established in the title Programming with Scala: Language Exploration by the same author, which can be treated as a companion text for those less familiar with Scala.Topics and features: discusses data structures and algorithms in the form of design patterns; covers key topics on arrays, lists, stacks, queues, hash tables, binary trees, sorting, searching, and graphs; describes examples of complete and running applications for each topic; presents a functional approach to implementations for data structures and algorithms (excepting arrays); provides numerous challenge exercises (with solutions), encouraging the reader to take existing solutions and improve upon them; offers insights from the author’s extensive industrial experience; includes a glossary, and an appendix supplying an overview of discrete mathematics.Highlighting the techniques and skills necessary to quickly derive solutions to applied problems, this accessible text will prove invaluable to time-pressured students and professional software engineers.
R 1,832.87


Innovations in Data Methodologies and Computational Algorithms for Medical Applications
Innovations in Data Methodologies and Computational Algorithms for Medical Applications offers the most cutting edge research in the field, offering insights into case studies and methodologies from around the world. The text details the latest developments and will serve as a vital resource to practitioners and academics alike in the burgeoning field of medical applications of technologies. As security and privacy improve, Electronic Health Records and informatics in the medical field are becoming ubiquitous, and staying abreast of the latest information can be difficult. This volume serves as a reference handbook and theoretical framework for the future of the field.
R 9,474.29

Algoritmi
Un'eccellente introduzione agli algoritmi, alla loro struttura, a come modificano i dati, alla computabilità e alla complessità, il libro è scritto in una forma allo stesso tempo elegante e schietto che fa sì che possa essere considerato sia un valido testo per un corso introduttivo di Informatica, sia un tesoro da custodire per i programmatori provetti e i progettisti di software.
R 1,745.88

Dynamics of Algorithms
The articles collected in this volume represent the contributions presented at the IMA workshop on "Dynamics of Algorithms" which took place in November 1997. The workshop was an integral part of the 1997 -98 IMA program on "Emerging Applications of Dynamical Systems." The interaction between algorithms and dynamical systems is mutually beneficial since dynamical methods can be used to study algorithms that are applied repeatedly. Convergence, asymptotic rates are indeed dynamical properties. On the other hand, the study of dynamical systems benefits enormously from having efficient algorithms to compute dynamical objects.
R 1,533.60
R 742.26


Algorithms in Bioinformatics
It gives us great pleasure to present the proceedings of the 4th Workshop on Algorithms in Bioinformatics (WABI 2004) which took place in Bergen, Norway, September 17-21, 2004. The WABI 2004 workshop was part of a ?- conference meeting, which in addition to WABI, included ESA, WAOA, IWPEC, and ATMOS, hosted by the University of Bergen, Norway. See http://www.ii.uib.no/algo2004/ for more details. TheWorkshoponAlgorithmsinBioinformaticscoversresearchonallaspects of algorithmic work in bioinformatics. The emphasis is on discrete algorithms that address important problems in molecular biology. These are founded on sound models, are computationally e?cient, and have been implemented and tested in simulations and on real datasets. The goal is to present recent research results, including sign?cant work in progress, and to identify and explore dir- tions of future research. Original research papers (including signi?cant work in progress) or sta- of-the-art surveys were solicited on all aspects of algorithms in bioinformatics, including, but not limited to: exact and approximate algorithms for genomics, genetics, sequence analysis, gene and signal recognition, alignment, molecular evolution, phylogenetics, structure determination or prediction, gene expression and gene networks, proteomics, functional genomics, and drug design.We received 117 submissions in response to our call for papers, and were able to accept 39 of these. In addition, WABI hosted one invited distinguished lecture, given to the entire ALGO 2004 conference, by Dr. Marie France Sagot of the INRIA Rhon e-Alpes laboratories in France.
R 3,068.49

R 502.00


Matrix Algorithms in MATLAB
Matrix Algorithms in MATLAB focuses on the MATLAB code implementations of matrix algorithms. The MATLAB codes presented in the book are tested with thousands of runs of MATLAB randomly generated matrices, and the notation in the book follows the MATLAB style to ensure a smooth transition from formulation to the code, with MATLAB codes discussed in this book kept to within 100 lines for the sake of clarity. The book provides an overview and classification of the interrelations of various algorithms, as well as numerous examples to demonstrate code usage and the properties of the presented algorithms. Despite the wide availability of computer programs for matrix computations, it continues to be an active area of research and development. New applications, new algorithms, and improvements to old algorithms are constantly emerging.
R 3,531.00

Evolutionary and Swarm Intelligence Algorithms
This book is a delight for academics, researchers and professionals working in evolutionary and swarm computing, computational intelligence, machine learning and engineering design, as well as search and optimization in general. It provides an introduction to the design and development of a number of popular and recent swarm and evolutionary algorithms with a focus on their applications in engineering problems in diverse domains. The topics discussed include particle swarm optimization, the artificial bee colony algorithm, Spider Monkey optimization algorithm, genetic algorithms, constrained multi-objective evolutionary algorithms, genetic programming, and evolutionary fuzzy systems. A friendly and informative treatment of the topics makes this book an ideal reference for beginners and those with experience alike.
R 6,592.24

Algorithms and Architectures for Parallel Processing
The eight volume set, LNCS 16381-16388 constitutes the refereed proceedings of the 25th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2025, held in Zhengzhou, China, during October 30 -November 2, 2025.The 158 full papers, 104 research papers and 48 session papers included in these proceedings were carefully reviewed and selected from 543 submissions. They focus on the following topical sections:Part I : Parallel and Distributed Architectures; Software Systems and Programming Models.Part II : Parallel and Distributed Algorithms and Applications.Part III : Parallel and Distributed Algorithms and Applications; Internet of Things and Cyber-Physical-Social Computing; Performance Modeling and Evaluation.Part IV : Service Dependability and Security in Distributed and Parallel Systems; Network Architectures and Algorithms.Part V: Network Architectures and Algorithms.Part VI: Parallel and Distributed Architectures; Software Systems and Programming Models; Parallel and Distributed Algorithms and Applications; Big Data Management and Analysis; Performance Modeling and Evaluation.Part VII: Service Dependability and Security in Distributed and Parallel Systems; Network Architectures and Algorithms; Internet of Things and Cyber-Physical-Social Computing.Part VIII: Intelligent Distributed Computing; Resource Coordination and Joint Optimization in Cloud-Edge-End Systems; Symbiotic AI and Data Ecosystems; Smart Education Powered by Parallel and Distributed Processing; AI for Networks and Networking for AI; Emerging Network Technologies in Computing and Networking Convergence.
R 5,474.17

Algorithms and Models for the Web-Graph
This volume contains the 14 contributed papers and the contribution of the distinguished invited speaker B´ ela Bollob´ as presented at the 3rd Workshop on Algorithms and Models for the Web-Graph (WAW 2004), held in Rome, Italy, October 16, 2004, in conjunction with the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2004). The World Wide Web has become part of our everyday life and information retrievalanddataminingontheWebisnowofenormouspracticalinterest.Some of the algorithms supporting these activities are based substantially on viewing the Web as a graph, induced in various ways by links among pages, links among hosts, or other similar networks. Theaimofthe2004WorkshoponAlgorithmsandModelsfortheWeb-Graph was to further the understanding of these Web-induced graphs, and stimulate the development of high-performance algorithms and applications that use the graphstructureoftheWeb.Theworkshopwasmeantbothtofosteranexchange of ideas among the diverse set of researchers already involved in this topic, and to act as an introduction for the larger community to the state of the art in this area. This was the third edition of a very successful workshop on this topic, WAW 2002 was held in Vancouver, Canada, in conjunction with the 43rd - nual IEEE Symposium on Foundations of Computer Science, FOCS 2002, and WAW 2003 was held in Budapest, Hungary, in conjunction with the 12th Int- national World Wide Web Conference, WWW 2003. This was the ?rst edition of the workshop with formal proceedings.
R 1,540.79

Numerical Algorithms with Fortran
This is a completely up-to-date compendium of Fortran algorithms for numerical mathematics, including many sophisticated algorithms which are not available elsewhere. All have been extensively field-tested and cover methods for solving nonlinear equations, the method of Laguerre for solving algebraic equations, conjugating gradients for solving linear systems of equations, and the McKee algorithm for solving special systems of symmetric equations. The real, practical algorithms provided make the book indispensable for applied scientists working in all areas of research. The CD contains Fortran programs for the algorithms given in the text.
R 2,552.31

Randomisierte Algorithmen
Zufall ist ein erfolgreiches Mittel für Entwurf und Entwicklung vieler Systeme in Informatik und Technik. Zufallsgesteuerte Algorithmen sind oft effizienter, einfacher, preiswerter und überraschenderweise auch zuverlässiger als die besten deterministischen Programme. Warum ist die Zufallssteuerung so erfolgreich und wie entwirft man randomisierte Systeme? Einfach, intuitiv und trotzdem formal präzise gibt dieses Buch dem Leser einen Einstieg in die wunderbare Welt zufallsgesteuerter Algorithmen.
R 1,536.10

Algorithmic Combinatorics on Partial Words
The discrete mathematics and theoretical computer science communities have recently witnessed explosive growth in the area of algorithmic combinatorics on words. The next generation of research on combinatorics of partial words promises to have a substantial impact on molecular biology, nanotechnology, data communication, and DNA computing. Delving into this emerging research area, Algorithmic Combinatorics on Partial Words presents a mathematical treatment of combinatorics on partial words designed around algorithms and explores up-and-coming techniques for solving partial word problems as well as the future direction of research.This five-part book begins with a section on basics that covers terminology, the compatibility of partial words, and combinatorial properties of words. The book then focuses on three important concepts of periodicity on partial words: period, weak period, and local period. The next part describes a linear time algorithm to test primitivity on partial words and extends the results on unbordered words to unbordered partial words while the following section introduces some important properties of pcodes, details a variety of ways of defining and analyzing pcodes, and shows that the pcode property is decidable using two different techniques. In the final part, the author solves various equations on partial words, presents binary and ternary correlations, and covers unavoidable sets of partial words. Setting the tone for future research in this field, this book lucidly develops the central ideas and results of combinatorics on partial words.
R 3,842.84

Guide to Programming and Algorithms Using R
This easy-to-follow textbook provides a student-friendly introduction to programming and algorithms. Emphasis is placed on the threshold concepts that present barriers to learning, including the questions that students are often too embarrassed to ask. The book promotes an active learning style in which a deeper understanding is gained from evaluating, questioning, and discussing the material, and practised in hands-on exercises. Although R is used as the language of choice for all programs, strict assumptions are avoided in the explanations in order for these to remain applicable to other programming languages. Features: provides exercises at the end of each chapter; includes three mini projects in the final chapter; presents a list of titles for further reading at the end of the book; discusses the key aspects of loops, recursions, program and algorithm efficiency and accuracy, sorting, linear systems of equations, and file processing; requires no prior background knowledge in this area.
R 1,538.42

Theory of Semi-Feasible Algorithms
The primary goal of this book is unifying and making more widely accessible the vibrant stream of research - spanning more than two decades - on the theory of semi-feasible algorithms. In doing so it demonstrates the richness inherent in central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. The book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science. Another aim of this book is to lay out a path along which the reader can quickly reach the frontiers of current research, and meet and engage the many exciting open problems in this area.
R 4,030.00

R 915.00

Map Construction Algorithms
The book provides an overview of the state-of-the-art of map construction algorithms, which use tracking data in the form of trajectories to generate vector maps. The most common trajectory type is GPS-based trajectories. It introduces three emerging algorithmic categories, outlines their general algorithmic ideas, and discusses three representative algorithms in greater detail. To quantify map construction algorithms, the authors include specific datasets and evaluation measures. The datasets, source code of map construction algorithms and evaluation measures are publicly available on http://www.mapconstruction.org. The web site serves as a repository for map construction data and algorithms and researchers can contribute by uploading their own code and benchmark data.Map Construction Algorithms is an excellent resource for professionals working in computational geometry, spatial databases, and GIS. Advanced-level students studying computer science, geography and mathematics will also find this book a useful tool.
R 2,147.00

Algorithms and Architectures for Parallel Processing
This book constitutes the refereed proceedings of the 22nd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2022, which was held in October 2022. Due to COVID-19 pandemic the conference was held virtually. The 33 full papers and 10 short papers, presented were carefully reviewed and selected from 91 submissions. The papers cover many dimensions of parallel algorithms and architectures, encompassing fundamental theoretical approaches, practical experimental projects, and commercial components and systems
R 4,738.35

R 6,075.00

Algorithm-Architecture Matching for Signal and Image Processing
Advances in signal and image processing together with increasing computing power are bringing mobile technology closer to applications in a variety of domains like automotive, health, telecommunication, multimedia, entertainment and many others. The development of these leading applications, involving a large diversity of algorithms (e.g. signal, image, video, 3D, communication, cryptography) is classically divided into three consecutive steps: a theoretical study of the algorithms, a study of the target architecture, and finally the implementation. Such a linear design flow is reaching its limits due to intense pressure on design cycle and strict performance constraints. The approach, called Algorithm-Architecture Matching, aims to leverage design flows with a simultaneous study of both algorithmic and architectural issues, taking into account multiple design constraints, as well as algorithm and architecture optimizations, that couldn’t be achieved otherwise if considered separately. Introducing new design methodologies is mandatory when facing the new emerging applications as for example advanced mobile communication or graphics using sub-micron manufacturing technologies or 3D-Integrated Circuits. This diversity forms a driving force for the future evolutions of embedded system designs methodologies.The main expectations from system designers’ point of view are related to methods, tools and architectures supporting application complexity and design cycle reduction. Advanced optimizations are essential to meet design constraints and to enable a wide acceptance of these new technologies.Algorithm-Architecture Matching for Signal and Image Processing presents a collection of selected contributions from both industry and academia, addressing different aspects of Algorithm-Architecture Matching approach ranging from sensors to architectures design. The scope of this book reflects the diversity of potential algorithms, including signal, communication, image, video, 3D-Graphics implemented onto various architectures from FPGA to multiprocessor systems. Several synthesis and resource management techniques leveraging design optimizations are also described and applied to numerous algorithms.Algorithm-Architecture Matching for Signal and Image Processing should be on each designer’s and EDA tool developer’s shelf, as well as on those with an interest in digital system design optimizations dealing with advanced algorithms.
R 4,655.92

Wireless Algorithms, Systems, and Applications
This book constitutes the refereed proceedings of the Third Annual International Conference on Wireless Algorithms, Systems, and Applications, WASA 2008, held in Dallas, TX, USA, in October 2008. The 35 revised full papers presented together with 3 keynote talks and 15 invited lectures were carefully reviewed and selected from numerous submissions. Providing a forum for researchers and practitioners, from the academic, industrial and governmental sectors, the papers address current research and development efforts of various issues in the area of algorithms, systems and applications for current and next generation infrastructure and infrastructureless wireless networks.
R 1,604.71

Algorithms in Ambient Intelligence
The advent of the digital era, the Internet, and the development of fast com puting devices that can access mass storage servers at high communication bandwidths have brought within our reach the world of ambient intelligent systems. These systems provide users with information, communication, and entertainment at any desired place and time. Since its introduction in 1998, the vision of Ambient Intelligence has attracted much attention within the re search community. Especially, the need for intelligence generated by smart al gorithms, which run on digital platforms that are integrated into consumer elec tronics devices, has strengthened the interest in Computational Intelligence. This newly developing research field, which can be positioned at the inter section of computer science, discrete mathematics, and artificial intelligence, contains a large variety of interesting topics including machine learning, con tent management, vision, speech, data mining, content augmentation, profiling, contextual awareness, feature extraction, resource management, security, and privacy.
R 4,663.11

Algorithmic Ways for Mathematical Puzzles
Algorithmic Ways for Mathematical Puzzles introduces puzzles from all over the world, past and present, from the perspective of theoretical computer science. Certain types of puzzles have contributed greatly to the development of this field. In fact, the latest puzzles often provide new research themes for computer scientists, whether the puzzle designer intended this outcome or not.This book explores the current landscape, including such unsolved problems that are still extant. The contents of this book can be read by high school students with reasonable mathematical comprehension skills, but from an academic level it is mainly targeted at undergraduate and graduate students with an interest in algorithms and an appetite for puzzles.FeaturesPresents a wonderfully engaging teaching resource for a class on algorithmicsFull of interesting and previously unpublished puzzlesCopiously illustrated in full color.
R 6,118.00

Stochastic Simulation: Algorithms and Analysis
Sampling-based computational methods have become a fundamental part of the numerical toolset of practitioners and researchers across an enormous number of different applied domains and academic disciplines. This book provides a broad treatment of such sampling-based methods, as well as accompanying mathematical analysis of the convergence properties of the methods discussed. The reach of the ideas is illustrated by discussing a wide range of applications and the models that have found wide usage. The first half of the book focuses on general methods; the second half discusses model-specific algorithms. Exercises and illustrations are included.
R 1,855.57

R 1,173.14















































