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

R 1,601.36

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 Discrete Applied Mathematics
This book constitutes the refereed proceedings of the 12th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2026, held in Dharwad, India, during February 12–14, 2026.The 35 full papers included in this book were carefully reviewed and selected from 75 submissions. They focus on algorithms and complexity, discrete applied mathematics, computational geometry, graph theory, network optimization, and machine learning.
R 2,974.07


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

R 1,435.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


R 1,221.00

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

R 1,220.00

R 1,667.36

R 374.00


R 1,221.00


R 1,527.00

R 709.00

Stochastic Algorithms: Foundations and Applications
SAGA 2001, the ?rst Symposium on Stochastic Algorithms, Foundations and Applications, took place on December 13–14, 2001 in Berlin, Germany. The present volume comprises contributed papers and four invited talks that were included in the ?nal program of the symposium. Stochastic algorithms constitute a general approach to ?nding approximate solutions to a wide variety of problems. Although there is no formal proof that stochastic algorithms perform better than deterministic ones, there is evidence by empirical observations that stochastic algorithms produce for a broad range of applications near-optimal solutions in a reasonable run-time. The symposium aims to provide a forum for presentation of original research in the design and analysis, experimental evaluation, and real-world application of stochastic algorithms. It focuses, in particular, on new algorithmic ideas invo- ing stochastic decisions and exploiting probabilistic properties of the underlying problem domain. The program of the symposium re?ects the e?ort to promote cooperation among practitioners and theoreticians and among algorithmic and complexity researchers of the ?eld. In this context, we would like to express our special gratitude to DaimlerChrysler AG for supporting SAGA 2001. The contributed papers included in the proceedings present results in the following areas: Network and distributed algorithms; local search methods for combinatorial optimization with application to constraint satisfaction problems, manufacturing systems, motor control unit calibration, and packing ?exible - jects; and computational learning theory.
R 2,127.62

R 353.00

Metaheuristic and Evolutionary Computation: Algorithms and Applications
This book addresses the principles and applications of metaheuristic approaches in engineering and related fields. The first part covers metaheuristics tools and techniques such as ant colony optimization and Tabu search, and their applications to several classes of optimization problems. In turn, the book’s second part focuses on a wide variety of metaheuristics applications in engineering and/or the applied sciences, e.g. in smart grids and renewable energy. In addition, the simulation codes for the problems discussed are included in an appendix for ready reference.Intended for researchers aspiring to learn and apply metaheuristic techniques, and gathering contributions by prominent experts in the field, the book offers readers an essential introduction to metaheuristics, its theoretical aspects and applications.
R 6,548.23

R 570.00


R 333.00

Grouping Genetic Algorithms
This book presents advances and innovations in grouping genetic algorithms, enriched with new and unique heuristic optimization techniques. These algorithms are specially designed for solving industrial grouping problems where system entities are to be partitioned or clustered into efficient groups according to a set of guiding decision criteria. Examples of such problems are: vehicle routing problems, team formation problems, timetabling problems, assembly line balancing, group maintenance planning, modular design, and task assignment. A wide range of industrial grouping problems, drawn from diverse fields such as logistics, supply chain management, project management, manufacturing systems, engineering design and healthcare, are presented. Typical complex industrial grouping problems, with multiple decision criteria and constraints, are clearly described using illustrative diagrams and formulations. The problems are mapped into a common group structure that can conveniently be used as an input scheme to specific variants of grouping genetic algorithms. Unique heuristic grouping techniques are developed to handle grouping problems efficiently and effectively. Illustrative examples and computational results are presented in tables and graphs to demonstrate the efficiency and effectiveness of the algorithms.Researchers, decision analysts, software developers, and graduate students from various disciplines will find this in-depth reader-friendly exposition of advances and applications of grouping genetic algorithms an interesting, informative and valuable resource.
R 6,174.43


R 608.00

R 458.00

Approximation Algorithms for Combinatorial Optimization
The Workshop on Approximation Algorithms for Combinatorial Optimization ProblemsAPPROX'2000 focuses on algorithmic and complexity aspects ar- ing in the development of e?cient approximate solutions to computationally di?cult problems. It aims, in particular, at fostering cooperation among - gorithmic and complexity researchers in the ?eld. The workshop, to be held at the Max-Planck-Institute for Computer Science in Saarbruc .. ken, Wermany, co-locates with ESA'2020 and WWE'2000. We would like to thank the local organizers at the Max-Planck-Institute (AG 8, Kurt Mehlhorn), for this opp- tunity. APPVOXis an annual meeting, with previousworkshopsin Aalborg and Berkeley. Previous proceedings appeared as LNCS 1464 and 1671. Topics of interest for APPROX'2000 are: design and analysis of appro- mation algorithms, inapproximability results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routingand?owproblems,coloringandiartitioning,cutsandconnectivity,pa- ing and covering, geometric problems, network design, and various applications. The numberof submitted papersto APPROX'2000was68 fromwhich 23 paters were selected.This volume contains the selected papers plus papers by invited speakers. All papers published in the workshop proceedings nere selected by the program committee on the basis of referee reports. Each paper was reviewed vy at least three referees who judged the papers for originality, quality, and consistency with the topics of the conference.
R 1,554.75















































