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

Algorithms for Continuous Optimization
The NATO Advanced Study Institute on "Algorithms for continuous optimiza tion: the state of the art" was held September 5-18, 1993, at II Ciocco, Barga, Italy. It was attended by 75 students (among them many well known specialists in optimiza tion) from the following countries: Belgium, Brasil, Canada, China, Czech Republic, France, Germany, Greece, Hungary, Italy, Poland, Portugal, Rumania, Spain, Turkey, UK, USA, Venezuela. The lectures were given by 17 well known specialists in the field, from Brasil, China, Germany, Italy, Portugal, Russia, Sweden, UK, USA. Solving continuous optimization problems is a fundamental task in computational mathematics for applications in areas of engineering, economics, chemistry, biology and so on. Most real problems are nonlinear and can be of quite large size. Devel oping efficient algorithms for continuous optimization has been an important field of research in the last 30 years, with much additional impetus provided in the last decade by the availability of very fast and parallel computers. Techniques, like the simplex method, that were already considered fully developed thirty years ago have been thoroughly revised and enormously improved. The aim of this ASI was to present the state of the art in this field. While not all important aspects could be covered in the fifty hours of lectures (for instance multiob jective optimization had to be skipped), we believe that most important topics were presented, many of them by scientists who greatly contributed to their development.
R 1,602.20

Algorithm Theory - SWAT 2004
This volume contains the papers presented at SWAT 2004, the 9th Scandi- vian Workshop on Algorithm Theory, which was held on July 8-10, 2004, at the Louisiana Museum of Modern Art in Humlebaek on the Oresund coast north of Copenhagen. The SWAT workshop, in reality a full-?edged conference, has been held biennially since 1988 and rotates among the ?ve Nordic countries, D- mark, Finland, Iceland, Norway, and Sweden. The previous meetings took place ? in Halmstad (1988), Bergen (1990), Helsinki (1992), Arhus (1994), Reykjavik (1996), Stockholm (1998), Bergen (2000), and Turku (2002). SWAT alternates with the Workshop on Algorithms and Data Structures (WADS), held in o- numbered years. Thecallforpapersinvitedcontributionsonallaspectsofalgorithmtheory.A totalof121submissionswasreceived-anoverallSWAThigh.Theseunderwent thorough reviewing, and the program committee met in Copenhagen on March 20-21, 2004, and selected 40 papers for presentation at the conference. The programcommitteewasimpressedwiththequalityofthesubmissionsand,given the constraints imposed by the choice of conference venue and duration, had to make some tough decisions. The scienti?c program was enriched by invited presentations by Gerth Stolting Brodal (University of Aarhus) and Charles E.Leiserson (Massachusetts Institute of Technology). TwosatelliteeventswereheldimmediatelybeforeSWAT2004:theWorkshop on On-Line Algorithms (OLA 2004), organized by members of the Department of Mathematics and Computer Science at the University of Southern Denmark, and the Summer School on Experimental Algorithmics, organized by the Perf- mance Engineering Laboratory in the Department of Computing at the Univ- sity of Copenhagen. More information about SWAT 2004 and its satellite events is available at the conference web sitehttp://swat.diku.dk/.
R 2,015.00

R 275.00

R 849.00


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

R 428.00

R 426.43


Algorithm
A dead man in a room no one entered.An experimental system that kept running after everyone had gone home.An inspector surrounded by people who tell the truth only when it suits them.The records are clear. So are the facts.But someone arranged them to tella particular story.Because someone decided Tomás Valente was an obstacle.The question is: who?
R 813.33

R 1,010.00


Algorithm Portfolios
This book covers algorithm portfolios, multi-method schemes that harness optimization algorithms into a joint framework to solve optimization problems. It is expected to be a primary reference point for researchers and doctoral students in relevant domains that seek a quick exposure to the field. The presentation focuses primarily on the applicability of the methods and the non-expert reader will find this book useful for starting designing and implementing algorithm portfolios. The book familiarizes the reader with algorithm portfolios through current advances, applications, and open problems. Fundamental issues in building effective and efficient algorithm portfolios such as selection of constituent algorithms, allocation of computational resources, interaction between algorithms and parallelism vs. sequential implementations are discussed. Several new applications are analyzed and insights on the underlying algorithmic designs are provided. Future directions, new challenges, and open problems in the design of algorithm portfolios and applications are explored to further motivate research in this field.
R 2,715.21

Frontiers of Algorithmics
This book LNCS15828 constitutes the refereed proceedings of the 19th International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom (IJTCS-FAW 2025), consisting of the 19th International Conference on Frontier of Algorithmic Wisdom (FAW) and the 6th International Joint Conference on Theoretical Computer Science (IJTCS), held in Paris, France, during June 30-July 2, 2025. The 28 full papers and 2 short papers were carefully reviewed and selected from 63 submissions. The proceedings focuses on Frontiers of Algorithmic Wisdom; Block-chain, Distributed Computing, Multi-Agents; Game Theory, Algorithmic Game Theory, Machine Learning, Electronic Commerce.
R 2,958.63




R 2,151.52


Distributed Algorithms
This volume contains the proceedings of the fifthInternational Workshop on Distributed Algorithms (WDAG '91)held in Delphi, Greece, in October 1991. The workshopprovided a forum for researchers and others interested indistributed algorithms, communication networks, anddecentralized systems. The aim was to present recentresearch results, explore directions for future research,and identify common fundamental techniques that serve asbuilding blocks in many distributed algorithms.The volume contains 23 papers selected by the ProgramCommittee from about fifty extended abstracts on the basisof perceived originality and quality and on thematicappropriateness and topical balance. The workshop wasorganizedby the Computer Technology Institute of PatrasUniversity, Greece.
R 1,561.94

R 610.00

Algorithms and Models for the Web-Graph
The World Wide Web has become part of our everyday life and information retrieval and data mining on the Web are now of enormous practical interest. The algorithms supporting these activities combine the view of the Web as a text repository and as a graph, induced in various ways by links among pages, links among hosts, or other similar networks. The aim of the 4th Workshop on Algorithms and Models for the Web-Graph (WAW 2006)wasto further the understanding of these Web-induced graphsand stimulate the developmentofhigh-performancealgorithmsandapplicationsthat use the graph structure of the Web. The workshop was meant both to foster an exchange 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. The workshop program included invited keynote talks by Fan Chung-Graham (UCSD), Soumen Chakrabarti (IITB), Walter Willinger (ATT Research) and Filippo Menczer (Indiana). WAW 2006tookplaceonNovember30 andDecember 1 at the Ban?Inter- tionalResearchInstitute(BIRS),inBan?,Alberta(Canada).Itwasthefourthin a seriesof verysuccessful workshopson the Web graph.WAW 2002 (Vancouver) and 2004 (Rome) were held in conjunction with the Annual IEEE Symposium on Foundations of Computer Science (FOCS). WAW 2003 (Budapest) was held in conjunction with the 12th International World Wide Web Conference.
R 1,537.57

Tools and Algorithms for the Construction of Analysis of Systems
ETAPS’99 is the second instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conferences. This year it comprises ve conferences (FOSSACS, FASE, ESOP, CC, TACAS), four satellite workshops (CMCS, AS, WAGA, CoFI), seven invited lectures, two invited tutorials, and six contributed tutorials. The events that comprise ETAPS address various aspects of the system - velopment process, including speci cation, design, implementation, analysis and improvement. The languages, methodologies and tools which support these - tivities are all well within its scope. Dieren t blends of theory and practice are represented, with an inclination towards theory with a practical motivation on one hand and soundly-based practice on the other. Many of the issues involved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive.
R 1,583.55


R 2,984.57

R 1,222.00

R 977.00

Algorithmic Bioprocesses
A fundamental understanding of algorithmic bioprocesses is key to learning how information processing occurs in nature at the cell level. The field is concerned with the interactions between computer science on the one hand and biology, chemistry, and DNA-oriented nanoscience on the other. In particular, this book offers a comprehensive overview of research into algorithmic self-assembly, RNA folding, the algorithmic foundations for biochemical reactions, and the algorithmic nature of developmental processes.The editors of the book invited 36 chapters, written by the leading researchers in this area, and their contributions include detailed tutorials on the main topics, surveys of the state of the art in research, experimental results, and discussions of specific research goals. The main subjects addressed are sequence discovery, generation, and analysis; nanoconstructions and self-assembly; membrane computing; formal models and analysis; process calculi and automata; biochemical reactions; and other topics from natural computing, including molecular evolution, regulation of gene expression, light-based computing, cellular automata, realistic modelling of biological systems, and evolutionary computing. This subject is inherently interdisciplinary, and this book will be of value to researchers in computer science and biology who study the impact of the exciting mutual interaction between our understanding of bioprocesses and our understanding of computation.
R 8,059.00


R 1,069.00


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

R 772.74

Glowworm Swarm Optimization
This book provides a comprehensive account of the glowworm swarm optimization (GSO) algorithm, including details of the underlying ideas, theoretical foundations, algorithm development, various applications, and MATLAB programs for the basic GSO algorithm. It also discusses several research problems at different levels of sophistication that can be attempted by interested researchers. The generality of the GSO algorithm is evident in its application to diverse problems ranging from optimization to robotics. Examples include computation of multiple optima, annual crop planning, cooperative exploration, distributed search, multiple source localization, contaminant boundary mapping, wireless sensor networks, clustering, knapsack, numerical integration, solving fixed point equations, solving systems of nonlinear equations, and engineering design optimization. The book is a valuable resource for researchers as well as graduate and undergraduate studentsin the area of swarm intelligence and computational intelligence and working on these topics.
R 4,268.68

Approximation and Online Algorithms
This book constitutes the thoroughly refereed post-proceedings of the 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, held in Saarbrücken, Germany, in September 2011. The 21 papers presented were carefully reviewed and selected from 48 submissions. The volume also contains an extended abstract of the invited talk of Prof. Klaus Jansen. The Workshop on Approximation and Online Algorithms focuses on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applicationsin a wide variety of fields. Topics of interest for WAOA 2011 were: algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques and scheduling problems.
R 1,958.56

Statistical Mechanics: Algorithms and Computations
This book discusses the computational approach in modern statistical physics in a clear yet accessible way, and works out its intimate relations with other approaches in theoretical physics. Individual chapters focus on subjects as diverse as the hard sphere liquid, classical spin models, single quantum particles and Bose-Einstein condensation. They contain in-depth discussions of algorithms ranging from basic enumeration methods to modern Monte Carlo techniques. Theemphasis is on orientation. Discussions of implementation details are kept to a minimum.The book heavily relies on illustrations, tables and concise printed algorithms to convey key information: all the material remains easily accessible. The book is fully self-contained: graphs and tables can be readily reproduced by programming at most a few dozen lines of computer code. Most sections lead from an elementary discussion to the rich and difficult problems of contemporary computational and statistical physics, and will be of interest to a wide range of students, teachers andresearchers in physics and the neighboring sciences. A companion website allows to incorporate the layout material (illustrations, tables, schematic programs) into the reader's own presentations.
R 3,171.00

R 305.00

R 489.00

R 275.00

R 1,796.14


R 489.00

R 1,177.00

Algorithmic Information Theory
Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gödel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation.
R 2,422.00

















































