Search results for "Frequently Asked Coding Interview - Algorithms"
Items we need to order for you

R 548.00

Introduction to Quantum Computing Algorithms
In 1994 Peter Shor [65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com puter. Since the difficulty of the factoring problem is crucial for the se curity of a public key encryption system, interest (and funding) in quan tum computing and quantum computation suddenly blossomed. Quan tum computing had arrived. The study of the role of quantum mechanics in the theory of computa tion seems to have begun in the early 1980s with the publications of Paul Benioff [6]' [7] who considered a quantum mechanical model of computers and the computation process. A related question was discussed shortly thereafter by Richard Feynman [35] who began from a different perspec tive by asking what kind of computer should be used to simulate physics. His analysis led him to the belief that with a suitable class of "quantum machines" one could imitate any quantum system.
R 2,206.35

Applied Nature-Inspired Computing: Algorithms and Case Studies
This book presents a cutting-edge research procedure in the Nature-Inspired Computing (NIC) domain and its connections with computational intelligence areas in real-world engineering applications. It introduces readers to a broad range of algorithms, such as genetic algorithms, particle swarm optimization, the firefly algorithm, flower pollination algorithm, collision-based optimization algorithm, bat algorithm, ant colony optimization, and multi-agent systems. In turn, it provides an overview of meta-heuristic algorithms, comparing the advantages and disadvantages of each. Moreover, the book provides a brief outline of the integration of nature-inspired computing techniques and various computational intelligence paradigms, and highlights nature-inspired computing techniques in a range of applications, including: evolutionary robotics, sports training planning, assessment of water distribution systems, flood simulation and forecasting, traffic control, gene expression analysis, antenna array design, and scheduling/dynamic resource management.
R 4,030.00


Fast Algorithms for 3D-Graphics
In this book, a variety of algoritbms are described that may be of interest to everyone who writes software for 3D-graphics. It is a book that haB been written for programmers at an intermediate level as well aB for experienced software engineers who simply want to have some particular functions at their disposal, without having to think too much about details like special cases or optimization for speed. The programming language we use is C, and that has many advantages, because it makes the code both portable and efficient. Nevertheless, it should be possible to adapt the ideas to other high-level programming languages. The reader should have a reasonable knowledge of C, because sophisticated pro grams with economical storage household and fast sections cannot be written without the use of pointers. You will find that in the long run it is just aB easy to work with pointer variables as with multiple arrays . .Aß the title of the book implies, we will not deal with algorithms that are very computation-intensive such as ray tracing or the radiosity method. Furthermore, objects will always be (closed or not closed) polyhedra, which consist of a certain number of polygons.
R 1,559.44

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 2,718.51


Algorithms and Architectures for Parallel Processing
This book constitutes the refereed proceedings of the 7th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2007, held in Hangzhou, China in June 2007. Focusing on two broad areas of parallel and distributed computing, the papers are organized in topical sections on parallel algorithms, parallel architecture, grid computing, peer-to-peer technologies, and advanced network technologies.
R 1,592.66
R 1,183.00

R 702.00

R 413.20


Combinatorial Search: From Algorithms to Systems
Although they are believed to be unsolvable in general, tractability results suggest that some practical NP-hard problems can be efficiently solved. Combinatorial search algorithms are designed to efficiently explore the usually large solution space of these instances by reducing the search space to feasible regions and using heuristics to efficiently explore these regions. Various mathematical formalisms may be used to express and tackle combinatorial problems, among them the constraint satisfaction problem (CSP) and the propositional satisfiability problem (SAT). These algorithms, or constraint solvers, apply search space reduction through inference techniques, use activity-based heuristics to guide exploration, diversify the searches through frequent restarts, and often learn from their mistakes.In this book the author focuses on knowledge sharing in combinatorial search, the capacity to generate and exploit meaningful information, such as redundant constraints, heuristic hints, and performance measures, during search, which can dramatically improve the performance of a constraint solver. Information can be shared between multiple constraint solvers simultaneously working on the same instance, or information can help achieve good performance while solving a large set of related instances. In the first case, information sharing has to be performed at the expense of the underlying search effort, since a solver has to stop its main effort to prepare and communicate the information to other solvers; on the other hand, not sharing information can incur a cost for the whole system, with solvers potentially exploring unfeasible spaces discovered by other solvers. In the second case, sharing performance measures can be done with little overhead, and the goal is to be able to tune a constraint solver in relation to the characteristics of a new instance – this corresponds to the selection of the most suitable algorithm for solving a given instance. The book is suitable for researchers, practitioners, and graduate students working in the areas of optimization, search, constraints, and computational complexity.
R 1,862.65

Distributed Algorithms
This book includes the papers presented at the Third International Workshop on Distributed Algorithms organized at La Colle-sur-Loup, near Nice, France, September 26-28, 1989 which followed the first two successful international workshops in Ottawa (1985) and Amsterdam (1987). This workshop provided a forum for researchers and others interested in distributed algorithms on communication networks, graphs, and decentralized systems. The aim was to present recent research results, explore directions for future research, and identify common fundamental techniques that serve as building blocks in many distributed algorithms. Papers describe original results in all areas of distributed algorithms and their applications, including: distributed combinatorial algorithms, distributed graph algorithms, distributed algorithms for control and communication, distributed database techniques, distributed algorithms for decentralized systems, fail-safe and fault-tolerant distributed algorithms, distributed optimization algorithms, routing algorithms, design of network protocols, algorithms for transaction management, composition of distributed algorithms, and analysis of distributed algorithms.
R 1,561.22

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

R 1,407.10


R 519.00

Introduction to String Algorithms
An essential introduction to the building blocks of modern text processingString algorithms make it possible to process, store, and manipulate text with computational efficiency, with applications ranging from search engines and social networks that regularly process terabytes of information to areas like genomics, where the genome of an organism can be encoded as a long string of letters. This book provides an incisive introduction to the concepts and applications that every practitioner in the field needs to know. Ideal for the classroom and self-study, it guides readers from the fundamentals of string processing to advanced computational methods, presenting useful data structures and proof techniques for strings and other data and serving as an on-ramp to doing cutting-edge research in string algorithms.Discusses topics ranging from exact string matching and efficient edit distance computation to modern string data structures, sketching methods, and generative models of stringsCovers data structures such as suffix trees, suffix arrays, wavelet trees, the Burrows-Wheeler transform, the FM index, and compressed bit vectorsPresents an array of algorithms along with their proofs of correctness and running timeDevelops the skills needed to design and implement new string algorithms as well as various algorithmic techniques that are applicable beyond string algorithmsInvaluable for anyone interested in processing large collections of string data, including genomic sequences and text for training large language modelsIncludes hundreds of exercises and explanatory figuresAn indispensable resource for graduate students, advanced undergraduates, researchers, and practitioners
R 2,643.76

Combinatorial Algorithms
This book constitutes the refereed proceedings of the 33rd International Workshop on Combinatorial Algorithms, IWOCA 2022, which took place as a hybrid event in Trier, Germany, during June 7-9, 2022.The 35 papers presented in these proceedings were carefully reviewed and selected from 86 submissions. They deal with diverse topics related to combinatorial algorithms, such as algorithms and data structures; algorithmic and combinatorical aspects of cryptography and information security; algorithmic game theory and complexity of games; approximation algorithms; complexity theory; combinatorics and graph theory; combinatorial generation, enumeration and counting; combinatorial optimization; combinatorics of words; computational biology; computational geometry; decompositions and combinatorial designs; distributed and network algorithms; experimental combinatorics; fine-grained complexity; graph algorithms and modelling with graphs; graph drawing and graph labelling; network theory and temporal graphs; quantum computing and algorithms for quantum computers; online algorithms; parameterized and exact algorithms; probabilistic andrandomized algorithms; and streaming algorithms.
R 3,930.54



Combinatorial Algorithms
This book constitutes the proceedings of the 27th International Workshop on Combinatorial Algorithms, IWOCA 2016, held in Helsinki, Finland, in August 2016. The 35 papers presented in this volume were carefully reviewed and selected from 87 submissions. They were organized in topical sessions named: computational complexity; computational geometry; networks; enumeration; online algorithms; algorithmic graph theory; dynamic programming; combinatorial algorithms; graph algorithms; combinatorics; and probabilistics.
R 2,203.43


R 2,278.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


Genetic Algorithms in Elixir
From finance to artificial intelligence, genetic algorithms are a powerful tool with a wide array of applications. But you don't need an exotic new language or framework to get started; you can learn about genetic algorithms in a language you're already familiar with. Join us for an in-depth look at the algorithms, techniques, and methods that go into writing a genetic algorithm. From introductory problems to real-world applications, you'll learn the underlying principles of problem solving using genetic algorithms. Evolutionary algorithms are a unique and often overlooked subset of machine learning and artificial intelligence. Because of this, most of the available resources are outdated or too academic in nature, and none of them are made with Elixir programmers in mind. Start from the ground up with genetic algorithms in a language you are familiar with. Discover the power of genetic algorithms through simple solutions to challenging problems. Use Elixir features to write genetic algorithms that are concise and idiomatic. Learn the complete life cycle of solving a problem using genetic algorithms. Understand the different techniques and fine-tuning required to solve a wide array of problems. Plan, test, analyze, and visualize your genetic algorithms with real-world applications. Open your eyes to a unique and powerful field - without having to learn a new language or framework. What You Need: You'll need a macOS, Windows, or Linux distribution with an up-to-date Elixir installation.
R 1,383.00

R 695.00

Algorithmic Aspects of Bioinformatics
This book introduces some key problems in bioinformatics, discusses the models used to formally describe these problems, and analyzes the algorithmic approaches used to solve them. After introducing the basics of molecular biology and algorithmics, Part I explains string algorithms and alignments; Part II details the field of physical mapping and DNA sequencing; and Part III examines the application of algorithmics to the analysis of biological data. Exciting application examples include predicting the spatial structure of proteins, and computing haplotypes from genotype data. Figures, chapter summaries, detailed derivations, and examples, are provided.
R 2,190.33

R 367.00

Evolutionäre Algorithmen
Evolutionäre Algorithmen als Optimierungsverfahren bieten vielfältige Anwendungsmöglichkeiten für ingenieurtechnische Lösungen industrieller Aufgaben. Dieses Buch dient in seiner Aufbereitung als praxisnahes Nachschlagewerk. In anwendungsorientierter Art und Weise werden, von einer einfachen Struktur Evolutionärer Algorithmen ausgehend, grundlegende Bestandteile, Verfahren, Operatoren und Erweiterungen beschrieben und in ihren Anwendungsmöglich- keiten analysiert. Durch die ausführliche Darstellung mehrerer ausgewählter Praxisbeispiele wird ein Einblick in die Anwendung Evolutionärer Algorithmen gegeben. Für den Einsatz in der Praxis ist dies von unschätzbarem Wert. Die dem Buch beiliegende Toolbox für Matlab bietet einen guten Einstieg in die Arbeit mit Evolutionären Algorithmen und kann sofort für die Lösung eigener Praxisprobleme genutzt werden. Der Benutzer erhält neben dem notwendigen Grundwissen ein wertvolles Arbeitsmittel an die Hand.
R 2,504.84

Fundamentals of Computation Theory
This book constitutes the proceedings of the 25th International Symposium on Fundamentals of Computation Theory, FCT 2025, held in Wroclaw, Poland, during September 15-17, 2025. The 32 full papers included in this volume were carefully reviewed and selected from 50 submissions. They present the fundamentals of computation theory including topics such as algorithms, complexity and formal methods.
R 3,154.45

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


R 580.00


Instance-Specific Algorithm Configuration
This book presents a modular and expandable technique in the rapidly emerging research area of automatic configuration and selection of the best algorithm for the instance at hand. The author presents the basic model behind ISAC and then details a number of modifications and practical applications. In particular, he addresses automated feature generation, offline algorithm configuration for portfolio generation, algorithm selection, adaptive solvers, online tuning, and parallelization. The author's related thesis was honorably mentioned (runner-up) for the ACP Dissertation Award in 2014, and this book includes some expanded sections and notes on recent developments. Additionally, the techniques described in this book have been successfully applied to a number of solvers competing in the SAT and MaxSAT International Competitions, winning a total of 18 gold medals between 2011 and 2014. The book will be of interest to researchers and practitioners in artificial intelligence, in particular in the area of machine learning and constraint programming.
R 1,839.84

Algorithms and Models for the Web-Graph
This book constitutes the refereed proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph, WAW 2009, held in Barcelona, Spain, in February 2009 - co-located with WSDM 2009, the Second ACM International Conference on Web Search and Data Mining. The 14 revised full papers presented were carefully reviewed and selected from numerous submissions for inclusion in the book. The papers address a wide variety of topics related to the study of the Web-graph such as theoretical and empirical analysis of the Web graph and Web 2.0 graphs, random walks on the Web and Web 2.0 graphs and their applications, and design and performance evaluation of the algorithms for social networks. The workshop papers have been naturally clustered in three topical sections on graph models for complex networks, pagerank and Web graph, and social networks and search.
R 1,539.34

Evolutionäre Algorithmen
Evolutionäre Algorithmen als Optimierungsverfahren bieten vielfältige Anwendungsmöglichkeiten für ingenieurtechnische Lösungen industrieller Aufgaben. Dieses Buch dient in seiner Aufbereitung als praxisnahes Nachschlagewerk. In anwendungsorientierter Art und Weise werden, von einer einfachen Struktur Evolutionärer Algorithmen ausgehend, grundlegende Bestandteile, Verfahren, Operatoren und Erweiterungen beschrieben und in ihren Anwendungsmöglich- keiten analysiert. Durch die ausführliche Darstellung mehrerer ausgewählter Praxisbeispiele wird ein Einblick in die Anwendung Evolutionärer Algorithmen gegeben. Für den Einsatz in der Praxis ist dies von unschätzbarem Wert. Die dem Buch beiliegende Toolbox für Matlab bietet einen guten Einstieg in die Arbeit mit Evolutionären Algorithmen und kann sofort für die Lösung eigener Praxisprobleme genutzt werden. Der Benutzer erhält neben dem notwendigen Grundwissen ein wertvolles Arbeitsmittel an die Hand.
R 2,503.94



R 2,199.32

R 545.80

R 949.54













































