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

Computational Complexity and Local Algorithms
This volume contains a collection of studies in the areas of complexity theory and local algorithms. A common theme in most of the papers is the interplay between randomness and computation. This interplay is pivotal to some parts of complexity theory and is essential for local algorithms.The works included address a variety of topics in the areas of complexity theory and local algorithms. Within complexity theory the topics include approximation algorithms, counting problems, enumeration problems, explicit construction of expander graphs, fine grained complexity, interactive proof systems, PPT-search and pseudodeterminism, space complexity, and worst-case to average-case reductions. Within local algorithms the focus is mostly on property testing and on locally testable and decodable codes. In particular, many of the works seek to advance the study of testing graph properties in the bounded-degree graph model. Other topics in property testing include testing group properties and testing properties of affine subspaces.
R 3,154.45

Sequential and Parallel Algorithms and Data Structures
This textbook is a concise introduction to the basic toolbox of structures that allow efficient organization and retrieval of data, key algorithms for problems on graphs, and generic techniques for modeling, understanding, and solving algorithmic problems. The authors aim for a balance between simplicity and efficiency, between theory and practice, and between classical results and the forefront of research. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, optimization, collective communication and computation, and load balancing. The authors also discuss important issues such as algorithm engineering, memory hierarchies, algorithm libraries, and certifying algorithms. Moving beyond the sequential algorithms and data structures of the earlier related title, this book takes into account the paradigm shift towards the parallel processing required to solve modern performance-critical applications and how this impacts on the teaching of algorithms. The book is suitable for undergraduate and graduate students and professionals familiar with programming and basic mathematical language. Most chapters have the same basic structure: the authors discuss a problem as it occurs in a real-life situation, they illustrate the most important applications, and then they introduce simple solutions as informally as possible and as formally as necessary so the reader really understands the issues at hand. As they move to more advanced and optional issues, their approach gradually leads to a more mathematical treatment, including theorems and proofs. The book includes many examples, pictures, informal explanations, and exercises, and the implementation notes introduce clean, efficient implementations in languages such as C++ and Java.
R 2,015.00

R 305.00

Algorithms and Programming
This text is structured in a problem-solution format that requires the student to think through the programming process. New to the second edition are additional chapters on suffix trees, games and strategies, and Huffman coding as well as an Appendix illustrating the ease of conversion from Pascal to C.
R 2,261.86

Algorithms in Real Algebraic Geometry
This is the first graduate textbook on the algorithmic aspects of real algebraic geometry. The main ideas and techniques presented form a coherent and rich body of knowledge. Mathematicians will find relevant information about the algorithmic aspects. Researchers in computer science and engineering will find the required mathematical background. Being self-contained the book is accessible to graduate students and even, for invaluable parts of it, to undergraduate students. This second edition contains several recent results on discriminants of symmetric matrices and other relevant topics.
R 3,098.46

R 585.05

Optimal Algorithms
This volume brings together papers from various fields of theoretical computer science, including computational geometry, parallel algorithms, algorithms on graphs, data structures and complexity of algorithms. Some of the invited papers include surveys of results in particular fields and some report original research, while all the contributed papers report original research. Most of the algorithms given are for parallel models of computation. The papers were presented at the Second International Symposium on Optimal Algorithms held in Varna, Bulgaria, in May/June 1989. The volume will be useful to researchers and students in theoretical computer science, especially in parallel computing.
R 1,559.44


R 603.89

R 1,221.00

Algorithmic Society
We live in an algorithmic society. Artificial Intelligence and algorithms have become the main mediators through which power and knowledge are enacted in our society. This book brings together three academic fields – Public Administration, Criminal Justice and Urban Governance – into a single conceptual framework, and offers a broad cultural-political analysis, addressing critical and ethical issues of AI and algorithms.Governments are increasingly turning towards AI tools to predict criminality, deliver public services, allocate resources, and calculate recidivism rates. Mind-boggling amounts of data regarding our daily actions are analysed to make decisions that manage, control, and nudge our behaviour in everyday life. The contributions in this book offer a broad analysis of the mechanisms and social implications of algorithmic governance. Reporting from the cutting edge of scientific research, the result is illuminating and useful for understanding the relations between AI, power and knowledge.This new revised and updated edition includes topics such as:Algorithmic governmentalityTransparency and accountabilityFairness in criminal justice and predictive policingPrinciples of good digital administrationDigital sovereignty and responsible AIAI and the smart city This book is essential reading for students and scholars of Sociology, Criminology, Public Administration, Political Sciences, and Cultural Theory interested in the integration of AI and algorithms into the governance of society.
R 2,235.00

Cuckoo Search and Firefly Algorithm
Nature-inspired algorithms such as cuckoo search and firefly algorithm have become popular and widely used in recent years in many applications. These algorithms are flexible, efficient and easy to implement. New progress has been made in the last few years, and it is timely to summarize the latest developments of cuckoo search and firefly algorithm and their diverse applications. This book will review both theoretical studies and applications with detailed algorithm analysis, implementation and case studies so that readers can benefit most from this book. Application topics are contributed by many leading experts in the field. Topics include cuckoo search, firefly algorithm, algorithm analysis, feature selection, image processing, travelling salesman problem, neural network, GPU optimization, scheduling, queuing, multi-objective manufacturing optimization, semantic web service, shape optimization, and others.This book can serve as an ideal reference for both graduates and researchers in computer science, evolutionary computing, machine learning, computational intelligence, and optimization, as well as engineers in business intelligence, knowledge management and information technology.
R 4,267.32

Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques
This volume contains the papers presented at the3rd International Wo- shoponRandomizationandApproximationTechniquesinComputer Science (RANDOM'99) and the 2nd International Workshop on - proximation Algorithms for Combinatorial Optimization Problems (APPROX'99), which took place concurrently at the University of California, Berkeley, from August 8-11, 1999. RANDOM'99 is concerned with appli- tions of randomness to computational and combinatorial problems, and is the third workshop in the series following Bologna (1997) and Barcelona (1998). APPROX'99 focuses on algorithmic and complexity issues surrounding the - velopment of e?cient approximate solutions to computationally hard problems, and is the second in the series after Aalborg (1998). The volume contains 24 contributed papers, selected by the two program committees from 44 submissions received in response to the call for papers, together with abstracts of invited lectures by Uri Feige (Weizmann Institute), Christos Papadimitriou (UC Berkeley), Madhu Sudan (MIT), and Avi Wigd- son (Hebrew University and IAS Princeton).We would like to thank all of the authors who submitted papers, our invited speakers, the external referees we consulted and the members of the program committees, who were: RANDOM'99 APPROX'99 Alistair Sinclair, UC Berkeley Dorit Hochbaum, UC Berkeley Noga Alon, Tel Aviv U. Sanjeev Arora, Princeton U. Jennifer Chayes, Microsoft Leslie Hall, Johns Hopkins U. Monika Henzinger, Compaq-SRC Samir Khuller, U. of Maryland Mark Jerrum, U. of Edinburgh Phil Klein, Brown U.
R 1,557.71

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

Counting, Sampling and Integrating: Algorithms and Complexity
The subject of these notes is counting and related topics, viewed from a computational perspective. A major theme of the book is the idea of accumulating information about a set of combinatorial structures by performing a random walk on those structures. These notes will be of value not only to teachers of postgraduate courses on these topics, but also to established researchers. For the first time this body of knowledge has been brought together in a single volume.
R 2,202.09

Algorithms - ESA 2002
This volume contains the 74 contributed papers and abstracts of 4 of the 5 invited talks presented at the 10th Annual European Symposium on Algorithms (ESA 2002), held at the University of Rome “La Sapienza”, Rome, Italy, 17-21 September, 2002. For the ?rst time, ESA had two tracks, with separate program committees, which dealt respectively with: – the design and mathematical analysis of algorithms (the “Design and An- ysis” track); – real-world applications, engineering and experimental analysis of algorithms (the “Engineering and Applications” track). Previous ESAs were held in Bad Honnef, Germany (1993); Utrecht, The Neth- lands (1994); Corfu, Greece (1995); Barcelona, Spain (1996); Graz, Austria (1997); Venice, Italy (1998); Prague, Czech Republic (1999); Saarbruc ¨ ken, Ger- ? many (2000), and Arhus, Denmark (2001). The predecessor to the Engineering and Applications track of ESA was the Annual Workshop on Algorithm En- neering (WAE). Previous WAEs were held in Venice, Italy (1997), Saarbruc ¨ ken, ? Germany (1998), London, UK (1999), Saarbru ¨cken, Germany (2000), and Arhus, Denmark (2001). The proceedings of the previous ESAs were published as Springer LNCS volumes 726, 855, 979, 1284, 1461, 1643, 1879, and 2161. The proceedings of WAEs from 1999 onwards were published as Springer LNCS volumes 1668, 1982, and 2161.
R 4,218.22

Algorithmen und rekursive Funktionen
Noch in den 30er Jahren unseres Jahrhunderts erweckten die mathematische Logik und die damals entstehende Algorithmentheorie den Anschein besonders abstrakter und von praktischen Anwendungen besonders weit entfernter mathe matischer Disziplinen. Heute hat sich die Situation radikal verändert. Es ist jetzt allgemein anerkannt, daß die beiden genannten Disziplinen eine theoretische Grundlage für Aufbau und Anwendungen schnell arbeitender Rechen-und Steu erungssysteme schaffen. Das relative Gewicht der mathematischen Logik und der Algorithmentheorie wuchs auch in der Mathematik selbst stark an. Darüber hinaus dringen gegenwärtig in beträchtlichem Maße durch die Algorithmentheorie und die mathematische Logik mathematische Methoden in die Biologie, die Lin guistik, die Wirtschaftswissenschaften und sogar Philosophie der Naturwissen schaften ein. All dies hat dazu geführt, daß die mathematische Logik und die Algorithmentheorie angefangen haben, in die Lehrpläne unserer Universitäten und pädagogischen Hochschulen als für das Studium der Mathematikstudenten aller Fachrichtungen obligatorische Disziplin einzudringen. Das vorliegende Buch ist aus der Bearbeitung von Nachschriften von Vorlesun gen über mathematische Logik, Algorithmentheorie und deren Anwendungen ent standen, die der Verfasser in den Jahren 1956-1959 an der pädagogischen Hoch schule von lvanovsk und seit dem Jahr 1960 an der Universität Novosibirsk gehalten hat. In ihm wird nur die allgemeine Theorie der Algorithmen und der rekursiven Funktionen entwickelt. Ganz außerhalb des Rahmens des Buches blieben die Komplexe Auto· matentheorie, Anwendungen der Algorithmentheorie auf formale Theorien und Theorie der Unlösbarkeitsgrade. Eine irgendwie ausführliche Darstellung dieser Disziplinen zum gegenwärtigen Zeitpunkt bedarf besonderer Einzeldar stellungen.
R 1,926.47

Algorithms and Discrete Applied Mathematics
This book collects the refereed proceedingsof the Second International Conference on Algorithms and Discrete AppliedMathematics, CALDAM 2016, held in Thiruvananthapuram, India, in February 2016.The volume contains 30 full revised papers from 90 submissions along with 1invited talk presented at the conference. The conference focuses on topicsrelated to efficient algorithms and data structures, their analysis (boththeoretical and experimental) and the mathematical problems arising thereof,and new applications of discrete mathematics, advances in existing applicationsand development of new tools for discrete mathematics.
R 2,187.26

Codeless Data Structures and Algorithms
In the era of self-taught developers and programmers, essential topics in the industry are frequently learned without a formal academic foundation. A solid grasp of data structures and algorithms (DSA) is imperative for anyone looking to do professional software development and engineering, but classes in the subject can be dry or spend too much time on theory and unnecessary readings. Regardless of your programming language background, Codeless Data Structures and Algorithms has you covered.In this book, author Armstrong Subero will help you learn DSAs without writing a single line of code. Straightforward explanations and diagrams give you a confident handle on the topic while ensuring you never have to open your code editor, use a compiler, or look at an integrated development environment. Subero introduces you to linear, tree, and hash data structures and gives you important insights behind the most common algorithms that you can directly apply to your own programs. Codeless Data Structures and Algorithms provides you with the knowledge about DSAs that you will need in the professional programming world, without using any complex mathematics or irrelevant information. Whether you are a new developer seeking a basic understanding of the subject or a decision-maker wanting a grasp of algorithms to apply to your projects, this book belongs on your shelf. Quite often, a new, refreshing, and unpretentious approach to a topic is all you need to get inspired. What You'll LearnUnderstand tree data structures without delving into unnecessary details or going into too much theoryGet started learning linear data structures with a basic discussion on computer memory Study an overview of arrays, linked lists, stacks and queuesWho This Book Is ForThis book is for beginners, self-taught developers and programmers, and anyone who wants to understand data structures and algorithms but don’t want to wade through unnecessary details about quirks of a programming language or don’t have time to sit and read a massive book on the subject. This book is also useful for non-technical decision-makers who are curious about how algorithms work.
R 1,026.00

Algorithmic Aspects in Information and Management
This volume constitutes the proceedings of the 12th International Conference on Algorithmic Aspects in Information and Management, AAIM 2018, held in Dallas, Texas, USA, in December 2018.The 25 full papers presented were carefully reviewed and selected. The papers deal with current trends of research on algorithms, data structures, operation research, combinatorial optimization and their applications.
R 2,178.46

Music-Inspired Harmony Search Algorithm
Calculus has been used in solving many scientific and engineering problems. For optimization problems, however, the differential calculus technique sometimes has a drawback when the objective function is step-wise, discontinuous, or multi-modal, or when decision variables are discrete rather than continuous. Thus, researchers have recently turned their interests into metaheuristic algorithms that have been inspired by natural phenomena such as evolution, animal behavior, or metallic annealing.This book especially focuses on a music-inspired metaheuristic algorithm, harmony search. Interestingly, there exists an analogy between music and optimization: each musical instrument corresponds to each decision variable; musical note corresponds to variable value; and harmony corresponds to solution vector. Just like musicians in Jazz improvisation play notes randomly or based on experiences in order to find fantastic harmony, variables in the harmony search algorithm have random values or previously-memorized good values in order to find optimal solution.
R 4,371.25

R 1,103.82

R 455.00

Algorithmic Number Theory
This book constitutes the refereed proceedings of the Third International Symposium on Algorithmic Number Theory, ANTS-III, held in Portland, Oregon, USA, in June 1998.The volume presents 46 revised full papers together with two invited surveys. The papers are organized in chapters on gcd algorithms, primality, factoring, sieving, analytic number theory, cryptography, linear algebra and lattices, series and sums, algebraic number fields, class groups and fields, curves, and function fields.
R 3,095.37

Programming Algorithms in Lisp
Master algorithms programming using Lisp, including the most important data structures and algorithms. This book also covers the essential tools that help in the development of algorithmic code to give you all you need to enhance your code.Programming Algorithms in Lisp shows real-world engineering considerations and constraints that influence the programs that use these algorithms. It includes practical use cases of the applications of the algorithms to a variety of real-world problems. What You Will LearnProgram algorithms using the Lisp programming languageWork with data structures, arrays, key-values, hash-tables, trees, graphs, and moreUse dynamic programming Program using stringsWork with approximations and compression Who This Book Is For Intermediate Lisp programmers wanting to do algorithms programming. A very experienced non-Lisp programmer may be able to benefit from this book as well.
R 866.00

Learning Decision Sequences For Repetitive Processes—Selected Algorithms
This book provides tools and algorithms for solving a wide class of optimization tasks by learning from their repetitions. A unified framework is provided for learning algorithms that are based on the stochastic gradient (a golden standard in learning), including random simultaneous perturbations and the response surface the methodology. Original algorithms include model-free learning of short decision sequences as well as long sequences—relying on model-supported gradient estimation. Learning is based on whole sequences of a process observation that are either vectors or images. This methodology is applicable to repetitive processes, covering a wide range from (additive) manufacturing to decision making for COVID-19 waves mitigation. A distinctive feature of the algorithms is learning between repetitions—this idea extends the paradigms of iterative learning and run-to-run control. The main ideas can be extended to other decision learning tasks, not included in this book. The text is written in a comprehensible way with the emphasis on a user-friendly presentation of the algorithms, their explanations, and recommendations on how to select them. The book is expected to be of interest to researchers, Ph.D., and graduate students in computer science and engineering, operations research, decision making, and those working on the iterative learning control.
R 4,654.83

Elements of Distributed Algorithms
Distributed Computing is rapidly becoming the principal computing paradigm in diverse areas of computing, communication, and control. Processor clusters, local and wide area networks, and the information highway evolved a new kind of problems which can be solved with distributed algorithms.In this textbook a variety of distributed algorithms are presented independently of particular programming languages or hardware, using the graphically suggestive technique of Petri nets which is both easy to comprehend intuitively and formally rigorous. By means of temporal logic the author provides surprisingly simple yet powerful correctness proofs for the algorithms.The scope of the book ranges from distributed control and synchronization of two sites up to algorithms on any kind of networks. Numerous examples show that description and analysis of distributed algorithms in this framework are intuitive and technically transparent.
R 1,649.00

Geometric Algorithms and Combinatorial Optimization
Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated. Rather, it seems that many of the new results build on the models, algorithms, and theorems presented here. For instance, the celebrated Dyer-Frieze-Kannan algorithm for approximating the volume of a convex body is based on the oracle model of convex bodies and uses the ellipsoid method as a preprocessing technique. The polynomial time equivalence of optimization, separation, and membership has become a commonly employed tool in the study of the complexity of combinatorial optimization problems and in the newly developing field of computational convexity. Implementations of the basis reduction algorithm can be found in various computer algebra software systems. On the other hand, several of the open problems discussed in the first edition are still unsolved. For example, there are still no combinatorial polynomial time algorithms known for minimizing a submodular function or finding a maximum clique in a perfect graph. Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient. In particular, it is not known how to adapt interior point methods to such linear programs.
R 3,990.59

Algorithmic Aspects in Information and Management
This two-volume set LNCS 15179-15180 constitutes the refereed proceedings of the 18th International Conference on Algorithmic Aspects in Information and Management, AAIM 2024, which took place virtually during September 21-23, 2024.The 45 full papers presented in these two volumes were carefully reviewed and selected from 76 submissions. The papers are organized in the following topical sections:Part I: Optimization and applications; submodularity, management and others,Part II: Graphs and networks; quantum and others.
R 2,552.89

Algorithms - ESA 2006
This book constitutes the refereed proceedings of the 14th Annual European Symposium on Algorithms, ESA 2006, held in Zurich, Switzerland, in the context of the combined conference ALGO 2006. The book presents 70 revised full papers together with abstracts of 3 invited lectures. The papers address all current subjects in algorithmics, reaching from design and analysis issues of algorithms over to real-world applications and engineering of algorithms in various fields.
R 3,129.31

Planning Algorithms
Planning algorithms are impacting technical disciplines and industries around the world, including robotics, computer-aided design, manufacturing, computer graphics, aerospace applications, drug design, and protein folding. This coherent and comprehensive book unifies material from several sources, including robotics, control theory, artificial intelligence, and algorithms. The treatment is centered on robot motion planning, but integrates material on planning in discrete spaces. A major part of the book is devoted to planning under uncertainty, including decision theory, Markov decision processes, and information spaces, which are the 'configuration spaces' of all sensor-based planning problems. The last part of the book delves into planning under differential constraints that arise when automating the motions of virtually any mechanical system. This text and reference is intended for students, engineers, and researchers in robotics, artificial intelligence, and control theory as well as computer graphics, algorithms, and computational biology.
R 5,206.24

Mastering Algorithms with Perl
There have been dozens of books on programming algorithms, but never before has there been one that uses Perl. Whether you are an amateur programmer or know a wide range of algorithms in other languages, this book will teach you how to carry out traditional programming tasks in a high-powered, efficient, easy-to-maintain manner with Perl. Topics range in complexity from sorting and searching to statistical algorithms, numerical analysis, and encryption.
R 912.00

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
This volume contains the papers presented at the 11th International Wo- shop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2008) and the 12th International Workshop on Randomization and Computation (RANDOM 2008), which took place concurrently at the MIT (M- sachusetts Institute of Technology) in Boston, USA, during August 25–27, 2008. APPROX focuses on algorithmic and complexity issues surrounding the development of e?cient approximate solutions to computationally di?cult problems, and was the 11th in the series after Aalborg (1998), Berkeley (1999), Saarbru ¨cken (2000), Berkeley (2001), Rome (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), and Princeton (2007). RANDOM is concerned with applications of randomness to computational and combinatorial problems, and was the 12th workshop in the series following Bologna (1997), Barcelona (1998), Berkeley (1999), Geneva (2000), Berkeley (2001), Harvard (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), and Princeton (2007). Topics of interest for APPROX and RANDOM are: design and analysis of - proximation algorithms, hardness of approximation, small space, sub-linear time, streaming, algorithms, embeddings and metric space methods, mathematical programming methods, combinatorial problems in graphs and networks, game t- ory, markets, economic applications, geometric problems, packing, covering, scheduling, approximate learning, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness and derandomization, random combinatorial structures, random walks/Markov chains, expander graphs and randomness extractors, probabilistic proof systems, random projections and - beddings, error-correcting codes, average-case analysis, property testing, com- tational learning theory, and other applications of approximation and randomness.
R 4,140.89

Algorithms for Sensor Systems
This book constitutes revised selected papers from the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2016, held in Aarhus, Denmark, in August 2016. The 9 full papers presented in this volume were carefully reviewed and selected from 19 submissions. This year papers were solicited into three tracks: Distributed and Mobile, Experiments and Applications, and Wireless and Geometry.
R 2,150.22

Proofs and Algorithms
Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation.Proofs and Algorithms: Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, Gödel’s incompleteness theorem, the theorem asserting the semi-decidability of provability - that have profoundly changed our vision of reasoning, computation, and finally truth itself.Designed for undergraduate students, this book presents all that philosophers, mathematicians and computer scientists should know about logic.
R 1,130.05

Flowchart and Algorithm Basics
This book is designed to equip the reader with all of the best followed, efficient, well-structured program logics in the form of flowcharts and algorithms. The basic purpose of flow charting is to create the sequence of steps for showing the solution to problems through arithmetic and/or logical manipulations used to instruct computers. The applied and illustrative examples from different subject areas will definitely encourage readers to learn the logic leading to solid programming basics.Features:Uses flowcharts and algorithms to solve problems from everyday applications, teaching the logic needed for the creation of computer instructionsCovers arrays, looping, file processing, etc.
R 1,139.00

Combinatorial Heuristic Algorithms with FORTRAN
In recent years researchers have spent much effort in developing efficient heuristic algorithms for solving the class of NP-complete problems which are widely believed to be inherently intractable from the computational point of view. Although algorithms have been designed and are notorious among researchers, computer programs are either not implemented on computers or very difficult to obtain. The purpose of this book is to provide a source of FORTRAN coded algorithms for a selected number of well-known combinatorial optimization problems. The book is intended to be used as a supplementary text in combinatorial algorithms, network optimization, operations research and management science. In addition, a short description on each algorithm will allow the book to be used as a convenient reference. This work would not have been possible without the excellent facilities of Bell-Northern Research, Canada. H. T. Lau lIe des Soeurs Quebec, Canada August 1986 CONTENTS Page Introduction Part I. INTEGER PROGRAMMING Chapter 1. Integer Linear Programming Chapter 2. Zero-one Linear Programming 30 Chapter 3. Zero-one Knapsack Problem 38 Part II. NETWORK DESIGN Chapter 4. Traveling Salesman Problem 52 Chapter 5. Steiner Tree Problem 81 Chapter 6. Graph Partitioning 98 Chapter 7. K-Median Location 106 Chapter 8. K-Center Location 114 List of Subroutines 123 Bibliographic Notes 124 INTRODUCTION Following the elegant theory of NP-comp1eteness, the idea of developing efficient heuristic algorithms has been gaining its popularity and significance.
R 2,015.00

Algorithms and Complexity
This book constitutes the refereed conference proceedings of the 9th International Conference on Algorithms and Complexity, CIAC 2015, held in Paris, France, in May 2015.The 30 revised full papers presented were carefully reviewed and selected from 93 submissions and are presented together with 2 invited papers. The papers present original research in the theory and applications of algorithms and computational complexity.
R 2,197.70

Introducing Algorithms in C
Study elementary and complex algorithms with clear examples and implementations in C. This book introduces data types (simple and structured) and algorithms with graphical and textual explanations. In the next sections, you’ll cover simple and complex standard algorithms with their flowcharts: everything is integrated with explanations and tables to give a step-by-step evolution of the algorithms. The main algorithms are: the sum of three or n numbers in a loop, decimal-to-binary conversion, maximum and minimum search, linear/sequential search, binary search, bubble sort, selection sort, merging of two sorted arrays, reading characters from a file, stack management, and factorial and Fibonacci sequences. The last section of Introducing Algorithms in C is devoted to the introduction of the C language and the implementation of the code, which is connected to the studied algorithms. The book is full of screenshots and illustrations showing the meaning of the code. What You Will LearnImplement algorithms in C Work with variables, constants, and primitive and structured typesUse arrays, stacks, queues, graphs, trees, hash tables, records, and filesExplore the design of algorithms Solve searching problems, including binary search, sorting, and bubble/selection sortProgram recursive algorithms with factorial functions and Fibonacci sequences Who This Book Is ForPrimarily beginners: it can serve as a starting point for anyone who is beginning the study of computer science and information systems for the first time.
R 1,075.76

Mastering Algorithms with Python
Gain a solid understanding of algorithms and improve your problem-solving abilities using Python code. With practical examples and clear explanations, this book bridges the gap between dense academic texts and overly simple industry guides. Focusing on the logic behind essential algorithms such as Breadth First Search (BFS), Depth First Search (DFS), Divide-and-Conquer, Greedy Methods, and Dynamic Programming, the book provides ample examples, from easy to more advanced. By connecting these concepts to real-world examples, such as chess strategies and the Seam Carving, the book helps readers better grasp and apply algorithms. Each chapter also includes fully implemented Python code, making it a practical reference. Mastering Algorithms with Python is ideal for IT professionals looking to enhance their skills and approach algorithms with clarity and confidence. What You Will Learn - - - - Who This Book Is For Software developers, data scientists, machine learning professionals and any curious learners about computer algorithms.
R 912.00

R 4,367.45

ISA '91 Algorithms
This volume presents the proceedings of the Second AnnualInternational Symposium on Algorithms held at AcademiaSinica, Taipei, Republic of China, December 16-18, 1991. Thesymposium was organized by the Institute of InformationScience, Academia Sinica, and the National Tsing HuaUniversity.In response to the program committee's call for papers, 90papers were submitted, from which the committee selected 36for presentation at the symposium. In addition to thesecontributed papers, the symposium included 5 invited talks.The subjects of the papers range widely in the area ofdiscrete algorithms, over such topics as computationalgeometry, graph algorithms, complexity theory, parallelalgorithms, distributed computing and computational algebra.
R 1,574.89

Algorithms and Complexity
The two-volume set LNCS 15679 and 15680 constitutes the refereed proceedings of the 14th International Conference on Algorithms and Complexity, CIAC 2025, held in Rome, Italy, during June 10–12, 2025.The 44 full papers included in these proceedings were carefully reviewed and selected from 110 submissions. They focus on all aspects of important venue for researchers working on computational complexity and the design, analysis, experimentation, and application of efficient algorithms and data structures.
R 2,949.67

Konstruktion Guter Algorithmen
Dieses Buch ist ein Lehrbuch für schnelle, effiziente und korrekte Pro- p;rammierung. Es werden Verfahren vorgestellt, die es ermöglichen, sprach- und maschinenunabhängig zu programmieren, und eine Me- thode, mit der zweifelsfrei bewiesen werden kann, daß die so entwickel- ten Algorithmen korrekt sind, d.h., genau das leisten, was sie leisten sollen. Dazu wird die Top-Down-Konstruktion und die Bottom-Up- Verifikation dargestellt. Es wird auf die Übertragung in gängige und in moderne funktionale und objekt-orientierte Programmiersprachen eingegangen. Systemati- sche Testmethoden werden ebenfalls kurz beschrieben. Einen großen Raum nimmt die Besprechung prinzipieller Programmiermethoden ein wie Rekursion, Divide and Conquer, Greedy, Dynamisches Program- mieren usw. Eine Vielzahl von Beispielalgorithmen werden vorgestellt. Großer Wert wird darauf gelegt, daß das Buch gut lesbar und verständ- lich ist und alle Verfahren und Algorithmen ausführlich erläutert wer- den. Es ist entstanden aus Vorlesungen, die der Autor seit 1988 an der Fachhochschule Osnabrück hält. Es ist aber nicht nur für Studenten geeignet, sondern auch für den Prak- tiker. In den Abschnitten über Motivation und Sensibilisierung wird nachvollziehbar begründet, warum nicht nur Profis die beschriebene Me- thodik verwenden sollten, sondern sogar Hobby-Programmierer. Pro- grammieren basiert auf logischen Strukturen, die bei einem kleinsten Fehler die Ergebnisse unvorhersehbar machen.
R 2,852.75












































