Search results for "Art of Algorithm Design"
Items we need to order for you

R 395.00

Automated Design of Machine Learning and Search Algorithms
This book presents recent advances in automated machine learning (AutoML) and automated algorithm design and indicates the future directions in this fast-developing area. Methods have been developed to automate the design of neural networks, heuristics and metaheuristics using techniques such as metaheuristics, statistical techniques, machine learning and hyper-heuristics. The book first defines the field of automated design, distinguishing it from the similar but different topics of automated algorithm configuration and automated algorithm selection. The chapters report on the current state of the art by experts in the field and include reviews of AutoML and automated design of search, theoretical analyses of automated algorithm design, automated design of control software for robot swarms, and overfitting as a benchmark and design tool. Also covered are automated generation of constructive and perturbative low-level heuristics, selection hyper-heuristics for automated design, automated design of deep-learning approaches using hyper-heuristics, genetic programming hyper-heuristics with transfer knowledge and automated design of classification algorithms. The book concludes by examining future research directions of this rapidly evolving field.The information presented here will especially interest researchers and practitioners in the fields of artificial intelligence, computational intelligence, evolutionary computation and optimisation.
R 4,809.94

R 1,635.10

Art of Artificial Evolution
This comprehensive book gives an up-to-date survey of the relevant bioinspired computing research fields – such as evolutionary computation, artificial life, swarm intelligence and ant colony algorithms – and examines applications in art, music and design. The editors and contributors are researchers and artists with deep experience of the related science, tools and applications, and the book includes overviews of historical developments and future perspectives.
R 4,629.52

Algorithm Design for Networked Information Technology Systems
I felt deeply honored when Professor Sumit Ghosh asked me to write the foreword to his book with an extraordinary perspective. I have long admired him, ?rst as a student leader at Stanford, where he initiated the ?rst IEEE Computer Society’s student chapter, and later as an esteemed and inspiring friend whose transdisciplinary research broadened and enhanced the horizons of practitioners of computer science and engineering, including my own. His ideas, which are derived from his profound vision, deep critical thinking, and personal intuition, reach from information technology to bioscience, as - hibited in this excellent book. To me, an ordinary engineer, it opens up a panoramic view of the Universe of Knowledge that keeps expanding and - spiring,likethegoodIndianproverb,whichsays,“agoodbookinformsyou,an excellent book teaches you, and a great book changes you. ” I sincerely believe that Professor Ghosh’s book will help us change and advance the methods of systems engineering and technology. Vision Inspired vision sees ahead of others what will or may come to be, a vivid, imagined concept or anticipation. An inspired vision personi?es what is good and what like-minded individuals hope for. Our vision is one of creating an Internet of minds, where minds are Web sites or knowledge centers, which create, store, and radiate knowledge through interaction with other minds connected by a universal shared network. This vision will not just hasten the death of distance, but will also - carcerate ignorance.
R 3,061.27

Art of Artificial Evolution
This comprehensive book gives an up-to-date survey of the relevant bioinspired computing research fields – such as evolutionary computation, artificial life, swarm intelligence and ant colony algorithms – and examines applications in art, music and design. The editors and contributors are researchers and artists with deep experience of the related science, tools and applications, and the book includes overviews of historical developments and future perspectives.
R 4,629.52

Art of Computer Programming, The
The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming. –Byte, September 1995 I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up. –Charles Long If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing. –Bill Gates It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. –Jonathan Laventhol This first volume in the series begins with basic programming concepts and techniques, then focuses more particularly on information structures–the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently. Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design. Dozens of simple and important algorithms and techniques have been added to those of the previous edition. The section on mathematical preliminaries has been extensively revised to match present trends in research. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP),http://msp.org
R 2,442.00

Design and Analysis of Randomized Algorithms
Systematically teaches key paradigmic algorithm design methodsProvides a deep insight into randomization
R 1,957.95

Algorithm Theory - SWAT '96
This book constitutes the refereed proceedings of the Fifth Scandinavian Workshop on Algorithm Theory, SWAT '96, held in Reykjavik, Iceland, in July 1996.The 35 full papers included in the book in revised version were carefully selected from a total of 95 submissions; also included are abstracts or full versions of three invited talks by prominent researchers. All in all, the collection of articles reports state-of-the-art results on various topics of current design and analysis of algorithms.
R 1,583.84

Designing Evolutionary Algorithms for Dynamic Environments
Details robustness, stability, and performance of Evolutionary Algorithms in dynamic environments
R 1,534.15

Simple Art of SoC Design
This book tackles head-on the challenges of digital design in the era of billion-transistor SoCs. It discusses fundamental design concepts in design and coding required to produce robust, functionally correct designs. It also provides specific techniques for measuring and minimizing complexity in RTL code. Finally, it discusses the tradeoff between RTL and high-level (C-based) design and how tools and languages must progress to address the needs of tomorrow’s SoC designs.
R 4,914.87

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

Power of Algorithms
To examine, analyze, and manipulate a problem to the point of designing an algorithm for solving it is an exercise of fundamental value in many fields. With so many everyday activities governed by algorithmic principles, the power, precision, reliability and speed of execution demanded by users have transformed the design and construction of algorithms from a creative, artisanal activity into a full-fledged science in its own right. This book is aimed at all those who exploit the results of this new science, as designers and as consumers. The first chapter is an overview of the related history, demonstrating the long development of ideas such as recursion and more recent formalizations such as computability. The second chapter shows how the design of algorithms requires appropriate techniques and sophisticated organization of data. In the subsequent chapters the contributing authors present examples from diverse areas – such as routing and networking problems, Web search, information security, auctions and games, complexity and randomness, and the life sciences – that show how algorithmic thinking offers practical solutions and also deepens domain knowledge. The contributing authors are top-class researchers with considerable academic and industrial experience; they are also excellent educators and communicators and they draw on this experience with enthusiasm and humor. This book is an excellent introduction to an intriguing domain and it will be enjoyed by undergraduate and postgraduate students in computer science, engineering, and mathematics, and more broadly by all those engaged with algorithmic thinking.
R 1,832.00

Algorithm Engineering and Experimentation
Symmetric multiprocessors (SMPs) dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Yet, the design of e cient parallel algorithms for this platform c- rently poses several challenges. The reason for this is that the rapid progress in microprocessor speed has left main memory access as the primary limitation to SMP performance. Since memory is the bottleneck, simply increasing the n- ber of processors will not necessarily yield better performance. Indeed, memory bus limitations typically limit the size of SMPs to 16 processors. This has at least twoimplicationsfor the algorithmdesigner. First, since there are relatively few processors availableon an SMP, any parallel algorithm must be competitive with its sequential counterpart with as little as one processor in order to be r- evant. Second, for the parallel algorithm to scale with the number of processors, it must be designed with careful attention to minimizing the number and type of main memory accesses. In this paper, we present a computational model for designing e cient al- rithms for symmetric multiprocessors. We then use this model to create e cient solutions to two widely di erent types of problems - linked list pre x com- tations and generalized sorting. Both problems are memory intensive, but in die rent ways. Whereas generalized sorting algorithms typically require a large numberofmemoryaccesses, they areusuallytocontiguousmemorylocations. By contrast, prex computation algorithms typically require a more modest qu- tity of memory accesses, but they are are usually to non-contiguous memory locations.
R 1,566.66


Design of Well-Structured and Correct Programs
The major goal of this book is to present the techniques of top-down program design and verification of program correctness hand-in-hand. It thus aims to give readers a new way of looking at algorithms and their design, synthesizing ten years of research in the process. It provides many examples of program and proof development with the aid of a formal and informal treatment of Hoare's method of invariants. Modem widely accepted control structures and data structures are explained in detail, together with their formal definitions, as a basis for their use in the design of correct algorithms. We provide and apply proof rules for a wide range of program structures, including conditionals, loops, procedures and recur sion. We analyze situations in which the restricted use of gotos can be justified, providing a new approach to proof rules for such situations. We study several important techniques of data structuring, including arrays, files, records and linked structures. The secondary goal of this book is to teach the reader how to use the programming language Pascal. This is the first text to teach Pascal pro gramming in a fashion which not only includes advanced algorithms which operate on advanced data structures, but also provides the full axiomatic definition of Pascal due to Wirth and Hoare. Our approach to the language is very different from that of a conventional programming text.
R 1,557.84

Algorithms and Data Structures in VLSI Design
One of the main problems in chip design is the enormous number of possible combinations of individual chip elements within a system, and the problem of their compatibility. The recent application of data structures, efficient algorithms, and ordered binary decision diagrams (OBDDs) has proven vital in designing the computer chips of tomorrow. This book provides an introduction to the foundations of this interdisciplinary research area, emphasizing its applications in computer aided circuit design.
R 2,015.00

Guide to Numerical Algorithm Design and Development
The focus of this unique textbook/reference is on numerical algorithms that are stable and provide high precision in common numerical problems encountered in large-scale modeling projects. The techniques presented are based on algorithms developed by the author over six decades of research and publications in peer-reviewed journals. The exposition includes topics typical of numerical analysis courses and is supplemented with examples of algorithms demonstrated in an engineering worksheet that is easy to read and comprehend. Each chapter ends with exercises and programming problems. Additional examples are available as downloadable Fortran code based on the author's large-scale models in computational physics. The limitations of commodity processors and modern compilers is discussed, with advice provided on how to control them in an algorithm's code design. An ample bibliography of over 200 citations provides a guide to further reading. Topics, features, and emphases: - Stability: knowing the range of algorithm parameters for producing reliable results - Accuracy: understanding convergence to a result through quantitative metrics - Precision: advance knowledge of the expected numerical precision and how to control it - Efficiency: translating an algorithm into code with limited redundant computation The primary target audience of this textbook/guide are senior graduate (or postgraduate) students in computer science and scientific or engineering fields who are starting on a career path as the next generation of model developers for high-performance computing (HPC). Additionally, the book will appeal to professionals engaged in large-scale computer model development who could use the volume as a course supplement or reference. The author is an Honorary Fellow of the University of Wollongong, New South Wales, Australia. He is active as a private consultant in HPC and CEO of HiPERiSM Consulting, LLC, in the United States of America.
R 3,114.00

Genome-Scale Algorithm Design
Presenting the fundamental algorithms and data structures that power bioinformatics workflows, this book covers a range of topics from the foundations of sequence analysis (alignments and hidden Markov models) to classical index structures (k-mer indexes, suffix arrays, and suffix trees), Burrows–Wheeler indexes, graph algorithms, network flows, and a number of advanced omics applications. The chapters feature numerous examples, algorithm visualizations, and exercises, providing graduate students, researchers, and practitioners with a powerful algorithmic toolkit for the applications of high-throughput sequencing. An accompanying website (www.genome-scale.info) offers supporting teaching material. The second edition strengthens the toolkit by covering minimizers and other advanced data structures and their use in emerging pangenomics approaches.
R 2,526.00

Handbook of Nature-Inspired Optimization Algorithms: The State of the Art
This book presents recent contributions and significant development, advanced issues, and challenges. In real-world problems and applications, most of the optimization problems involve different types of constraints. These problems are called constrained optimization problems (COPs). The optimization of the constrained optimization problems is considered a challenging task since the optimum solution(s) must be feasible. In their original design, evolutionary algorithms (EAs) are able to solve unconstrained optimization problems effectively. As a result, in the past decade, many researchers have developed a variety of constraint handling techniques, incorporated into (EAs) designs, to counter this deficiency.The main objective for this book is to make available a self-contained collection of modern research addressing the general constrained optimization problems in many real-world applications using nature-inspired optimization algorithms. This book is suitable for a graduate class on optimization, but will also be useful for interested senior students working on their research projects.
R 5,120.40

R 457.00

Parallel Algorithms for Irregular Problems: State of the Art
Efficient parallel solutions have been found to many problems. Some of them can be obtained automatically from sequential programs, using compilers. However, there is a large class of problems - irregular problems - that lack efficient solutions. IRREGULAR 94 - a workshop and summer school organized in Geneva - addressed the problems associated with the derivation of efficient solutions to irregular problems. This book, which is based on the workshop, draws on the contributions of outstanding scientists to present the state of the art in irregular problems, covering aspects ranging from scientific computing, discrete optimization, and automatic extraction of parallelism. Audience: This first book on parallel algorithms for irregular problems is of interest to advanced graduate students and researchers in parallel computer science.
R 4,662.37

Ethical Algorithm
Over the course of a generation, algorithms have gone from mathematical abstractions to powerful mediators of daily life. In evolving from static computer programs hand-coded by engineers to the products of machine learning, these technologies have made our lives more efficient, more entertaining, and, sometimes, better informed. At the same time, complex algorithms are increasingly crushing the basic rights of individual citizens. Allegedly anonymized datasets andstatistical models routinely leak our most sensitive personal information; applications for everything from loans to college reflect racial and gender bias. Meanwhile, users manipulate algorithms to "game" search engines, spam filters, online reviewing services and navigation apps. Understanding and improving the science behind the algorithms that run our lives is quickly becoming one of the most pressing issues of this century. Traditional solutions, such as laws, regulations and watchdog groups, have proven woefully inadequate, at best. Derived from the cutting-edge of scientific research, The Ethical Algorithm offers a new approach: a set of principled solutions based on the emerging and exciting science of socially aware algorithm design. Weaving together thescience behind algorithm design with stories of citizens, lawyers, scientists, and activists experiencing the trial-and-error of research in real-time, Michael Kearns and Aaron Roth present a strikingly original way forward, showing how we can begin to work together to protect people from the unintendedimpacts of algorithms—and, sometimes, protect the science that could save us from ourselves.
R 684.00


Automating the Design of Data Mining Algorithms
Data mining is a very active research area with many successful real-world app- cations. It consists of a set of concepts and methods used to extract interesting or useful knowledge (or patterns) from real-world datasets, providing valuable support for decision making in industry, business, government, and science. Although there are already many types of data mining algorithms available in the literature, it is still dif cult for users to choose the best possible data mining algorithm for their particular data mining problem. In addition, data mining al- rithms have been manually designed; therefore they incorporate human biases and preferences. This book proposes a new approach to the design of data mining algorithms. - stead of relying on the slow and ad hoc process of manual algorithm design, this book proposes systematically automating the design of data mining algorithms with an evolutionary computation approach. More precisely, we propose a genetic p- gramming system (a type of evolutionary computation method that evolves c- puter programs) to automate the design of rule induction algorithms, a type of cl- si cation method that discovers a set of classi cation rules from data. We focus on genetic programming in this book because it is the paradigmatic type of machine learning method for automating the generation of programs and because it has the advantage of performing a global search in the space of candidate solutions (data mining algorithms in our case), but in principle other types of search methods for this task could be investigated in the future.
R 4,612.37

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

Controversial Encounters in the Age of Algorithms
How can we have meaningful public conversations in the algorithmic age? This book explores how digital technologies shape our opinions and interactions, often in ways that limit our exposure to diverse perspectives and fuel polarization. Drawing on the ancient art of arguing all sides of a case, the book offers a way to revive public debate as a source of trust and legitimacy in democratic societies. This is a timely and urgent book for anyone who cares about the future of democracy in the digital era.
R 1,623.00

Algorithms for VLSI Physical Design Automation
Algorithms for VLSI Physical Design Automation, Second Edition is a core reference text for graduate students and CAD professionals. Based on the very successful First Edition, it provides a comprehensive treatment of the principles and algorithms of VLSI physical design, presenting the concepts and algorithms in an intuitive manner. Each chapter contains 3-4 algorithms that are discussed in detail. Additional algorithms are presented in a somewhat shorter format. References to advanced algorithms are presented at the end of each chapter. Algorithms for VLSI Physical Design Automation covers all aspects of physical design. In 1992, when the First Edition was published, the largest available microprocessor had one million transistors and was fabricated using three metal layers. Now we process with six metal layers, fabricating 15 million transistors on a chip. Designs are moving to the 500-700 MHz frequency goal. These stunning developments have significantly altered the VLSI field: over-the-cell routing and early floorplanning have come to occupy a central place in the physical design flow. This Second Edition introduces a realistic picture to the reader, exposing the concerns facing the VLSI industry, while maintaining the theoretical flavor of the First Edition. New material has been added to all chapters, new sections have been added to most chapters, and a few chapters have been completely rewritten. The textual material is supplemented and clarified by many helpful figures. Audience: An invaluable reference for professionals in layout, design automation and physical design.
R 1,599.70

Variation-Aware Design of Custom Integrated Circuits: A Hands-on Field Guide
This book targets custom IC designers who are encountering variation issues in their designs, especially for modern process nodes at 45nm and below, such as statistical process variations, environmental variations, and layout effects. It teaches them the state-of-the-art in Variation-Aware Design tools, which help the designer to analyze quickly the variation effects, identify the problems, and fix the problems. Furthermore, this book describes the algorithms and algorithm behavior/performance/limitations, which is of use to designers considering these tools, designers using these tools, CAD researchers, and CAD managers.
R 2,753.24

Lifetime Reliability-aware Design of Integrated Circuits
This book covers the state-of-the-art research in design of modern electronic systems used in safety-critical applications such as medical devices, aircraft flight control, and automotive systems. The authors discuss lifetime reliability of digital systems, as well as an overview of the latest research in the field of reliability-aware design of integrated circuits. They address modeling approaches and techniques for evaluation and improvement of lifetime reliability for nano-scale CMOS digital circuits, as well as design algorithms that are the cornerstone of Computer Aided Design (CAD) of reliable VLSI circuits. In addition to developing lifetime reliability analysis and techniques for clocked storage elements (such as flip-flops), the authors also describe analysis and improvement strategies targeting commercial digital circuits.
R 3,663.00

Automatic Generation of Combinatorial Test Data
This book reviews the state-of-the-art in combinatorial testing, with particular emphasis on the automatic generation of test data. It describes the most commonly used approaches in this area - including algebraic construction, greedy methods, evolutionary computation, constraint solving and optimization - and explains major algorithms with examples. In addition, the book lists a number of test generation tools, as well as benchmarks and applications. Addressing a multidisciplinary topic, it will be of particular interest to researchers and professionals in the areas of software testing, combinatorics, constraint solving and evolutionary computation.
R 1,525.37

Algorithm Theory -- SWAT 2012
This book constitutes the refereed proceedings of the 13th International Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2012, held in Helsinki, Finland, in July 2012, co-located with the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012. The 34 papers were carefully reviewed and selected from a total of 127 submissions. The papers present original research and cover a wide range of topics in the field of design and analysis of algorithms and data structures.
R 1,575.46


Art of Hardware Architecture
This book highlights the complex issues, tasks and skills that must be mastered by an IP designer, in order to design an optimized and robust digital circuit to solve a problem. The techniques and methodologies described can serve as a bridge between specifications that are known to the designer and RTL code that is final outcome, reducing significantly the time it takes to convert initial ideas and concepts into right-first-time silicon. Coverage focuses on real problems rather than theoretical concepts, with an emphasis on design techniques across various aspects of chip-design.
R 4,104.90

Design of Dynamic Data Structures
In numerous computer applications there is a need of storing large sets of objects in such a way that some questions about those objects can be answered efficiently. Data structures that store such sets of objects can be either static (built for a fixed set of objects) or dynamic (insertions of new objects and deletions of existing objects can be performed). Especially for more complex searching problems as they arise in such fields as computational geometry, database design and computer graphics, only static data structures are available. This book aims at remedying this lack of flexibility by providing a number of general techniques for turning static data structures for searching problems into dynamic structures. Although the approach is basically theoretical, the techniques offered are often practically applicable. The book is written in such a way that it is readable for those who have some elementary knowledge of data structures and algorithms. Although this monograph was first published in 1983, it is still unique as a general treatment of methods for constructing dynamic data structures.
R 1,538.58

Algorithm
From a former President of Tesla comes The Algorithm—the first book written by any of Elon Musk’s direct reports—a transformative guide for leaders, entrepreneurs, and innovators who want to emulate the paradigm-shattering approach Musk used to launch Tesla and SpaceX to meteoric success.Jonathan McNeill had already founded and sold six startups when Sheryl Sandberg introduced him to Elon Musk, who was looking for help at Tesla. McNeill was steeped in the lean principles that had made Toyota a global powerhouse—principles focused on achieving efficiency and optimization by incrementally improving existing systems and processes. What he learned from Elon at Tesla was its antithesis, an approach that required radical rethinking to explode the status quo, attack complexity, and set seemingly unrealistic goals.Elon called this five-step framework “The Algorithm.”1. Question every requirement.2. Delete every possible step in the process.3. Simplify and optimize.4. Accelerate cycle time.5. Automate.In this book, McNeill details this tremendously powerful set of tools, which brought Tesla from a production crisis that threatened to derail it to a period of hypergrowth. During his tenure, revenue boomed from $2B to $20B in just 30 months. Since his departure from Tesla, McNeill has used The Algorithm in every enterprise he has worked with to supercharge speed, efficiency, innovation, and growth. Featuring case studies from Tesla and SpaceX, as well as from Lululemon, GM, and companies of various sizes across industries, he reveals how any business can do the same and achieve the unimaginable.
R 691.00

Algorithm Theory - SWAT'98
This book constitutes the refereed proceedings of the 6th Scandinavian Workshop on Algorithm Theory, SWAT'98, held in Stockholm, Sweden, in July 1998.The volume presents 28 revised full papers selected from 56 submissions; also included are three invited contributions. The papers present original research on algorithms and data structures in various areas including computational geometry, parallel and distributed systems, graph theory, approximation, computational biology, queueing, Voronoi diagrams, and combinatorics in general.
R 1,566.66

R 367.00

R 471.73

High Level Synthesis of ASICs under Timing and Synchronization Constraints
Computer-aided synthesis of digital circuits from behavioral level specifications offers an effective means to deal with increasing complexity of digital hardware design. High Level Synthesis of ASICs Under Timing and Synchronization Constraints addresses both theoretical and practical aspects in the design of a high-level synthesis system that transforms a behavioral level description of hardware to a synchronous logic-level implementation consisting of logic gates and registers. High Level Synthesis of ASICs Under Timing and Synchronization Constraints addresses specific issues in applying high-level synthesis techniques to the design of ASICs. This complements previous results achieved in synthesis of general-purpose and signal processors, where data-path design is of utmost importance. In contrast, ASIC designs are often characterized by complex control schemes, to support communication and synchronization with the environment. The combined design of efficient data-path control-unit is the major contribution of this book. Three requirements are important in modeling ASIC designs: concurrency, external synchronization, and detailed timing constraints. The objective of the research work presented here is to develop a hardware model incorporating these requirements as well as synthesis algorithms that operate on this hardware model. The contributions of this book address both the theory and the implementation of algorithm for hardware synthesis.
R 4,656.05

Fireworks Algorithm
This book is devoted to the state-of-the-art in all aspects of fireworks algorithm (FWA), with particular emphasis on the efficient improved versions of FWA. It describes the most substantial theoretical analysis including basic principle and implementation of FWA and modeling and theoretical analysis of FWA. It covers exhaustively the key recent significant research into the improvements of FWA so far. In addition, the book describes a few advanced topics in the research of FWA, including multi-objective optimization (MOO), discrete FWA (DFWA) for combinatorial optimization, and GPU-based FWA for parallel implementation. In sequels, several successful applications of FWA on non-negative matrix factorization (NMF), text clustering, pattern recognition, and seismic inversion problem, and swarm robotics, are illustrated in details, which might shed new light on more real-world applications in future. Addressing a multidisciplinary topic, it will appeal to researchers and professionals in the areas of metahuristics, swarm intelligence, evolutionary computation, complex optimization solving, etc.
R 3,048.35

Age of Algorithms
Algorithms are probably the most sophisticated tools that people have had at their disposal since the beginnings of human history. They have transformed science, industry, society. They upset the concepts of work, property, government, private life, even humanity. Going easily from one extreme to the other, we rejoice that they make life easier for us, but fear that they will enslave us. To get beyond this vision of good vs evil, this book takes a new look at our time, the age of algorithms. Creations of the human spirit, algorithms are what we made them. And they will be what we want them to be: it's up to us to choose the world we want to live in.
R 2,475.00

Nature-Inspired Design of Hybrid Intelligent Systems
This book highlights recent advances in the design of hybrid intelligent systems based on nature-inspired optimization and their application in areas such as intelligent control and robotics, pattern recognition, time series prediction, and optimization of complex problems. The book is divided into seven main parts, the first of which addresses theoretical aspects of and new concepts and algorithms based on type-2 and intuitionistic fuzzy logic systems. The second part focuses on neural network theory, and explores the applications of neural networks in diverse areas, such as time series prediction and pattern recognition. The book’s third part presents enhancements to meta-heuristics based on fuzzy logic techniques and describes new nature-inspired optimization algorithms that employ fuzzy dynamic adaptation of parameters, while the fourth part presents diverse applications of nature-inspired optimization algorithms. In turn, the fifth part investigates applications of fuzzy logic in diverse areas, such as time series prediction and pattern recognition. The sixth part examines new optimization algorithms and their applications. Lastly, the seventh part is dedicated to the design and application of different hybrid intelligent systems.
R 8,863.96

Language of Design
“The Language of Design” articulates the theory that there is a language of design. Drawing upon insights from computational language processing, the language of design is modeled computationally through latent semantic analysis (LSA), lexical chain analysis (LCA), and sentiment analysis (SA). The statistical co-occurrence of semantics (LSA), semantic relations (LCA), and semantic modifiers (SA) in design text is used to illustrate how the reality producing effect of language is itself an enactment of design, allowing a new understanding of the connections between creative behaviors. The computation of the language of design makes it possible to make direct measurements of creative behaviors which are distributed across social spaces and mediated through language. The book demonstrates how machine understanding of design texts based on computation over the language of design yields practical applications for design management.
R 3,831.69

Applications of Emerging Technologies and AI/ML Algorithms
This book provides practical insights into applications of the state-of-the-art of Machine Learning and Artificial Intelligence (AI) for solving intriguing and complex problems in procurement and supply chain management. The application domain includes perishable food supply chain, steel price prediction, electric vehicle charging infrastructure design, contract price negotiation, reverse logistics network design, and demand forecasting. Further, the book highlights the advanced topics in the procurement field, like AI in green procurement and e-procurement in the pharma sector. Furthermore, the book covers applications of well-established methodologies such as heuristics, optimization, game theory, and MCDM based on the nature of the problem. The inclusion of the vaccine supply chain digital twin and blockchain-based procurement signals the significance of the book. This book is a comprehensive guide for industry professionals to understand the power of data analytics, enabling them to improve efficiency and effectiveness in the procurement and supply chain sectors.
R 8,620.62

Beyond the Worst-Case Analysis of Algorithms
There are no silver bullets in algorithm design, and no single algorithmic idea is powerful and flexible enough to solve every computational problem. Nor are there silver bullets in algorithm analysis, as the most enlightening method for analyzing an algorithm often depends on the problem and the application. However, typical algorithms courses rely almost entirely on a single analysis framework, that of worst-case analysis, wherein an algorithm is assessed by its worst performance on any input of a given size. The purpose of this book is to popularize several alternatives to worst-case analysis and their most notable algorithmic applications, from clustering to linear programming to neural network training. Forty leading researchers have contributed introductions to different facets of this field, emphasizing the most important models and results, many of which can be taught in lectures to beginning graduate students in theoretical computer science and machine learning.
R 3,087.41

Algorithm Theory - SWAT 2006
This book constitutes the refereed proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006, held in Riga, Latvia, in July 2006. The proceedings includes 36 revised full papers presented together with 3 invited papers, addressing issues of theoretical algorithmics and applications in various fields including graph algorithms, computational geometry, scheduling, approximation algorithms, network algorithms, data storage and manipulation, combinatorics, sorting, searching, online algorithms, optimization, amd more.
R 1,580.61

Logic and Theory of Algorithms
CiE 2008: Logic and Theory of Algorithms Athens, Greece, June 15–20, 2008 Computability in Europe (CiE) is an informal network of European scientists working on computability theory, including its foundations, technical devel- ment, and applications. Among the aims of the network is to advance our t- oretical understanding of what can and cannot be computed, by any means of computation. Its scienti?c vision is broad: computations may be performed with discrete or continuous data by all kinds of algorithms, programs, and - chines. Computations may be made by experimenting with any sort of physical system obeying the laws of a physical theory such as Newtonian mechanics, quantum theory, or relativity. Computations may be very general, depending on the foundations of set theory; or very speci?c, using the combinatorics of ?nite structures. CiE also works on subjects intimately related to computation, especially theories of data and information, and methods for formal reasoning about computations. The sources of new ideas and methods include practical developments in areas such as neural networks, quantum computation, natural computation, molecular computation, computational learning. Applications are everywhere,especially, in algebra,analysisand geometry, or data types and p- gramming. Within CiE there is general recognition of the underlying relevance of computability to physics and a broad range of other sciences, providing as it does a basic analysis of the causal structure of dynamical systems. Thisvolume,Logic andTheory of Algorithms,istheproceedingsofthefourth in a series of conferences of CiE that was held at the University of Athens, June 15–20, 2008.
R 3,090.38
















































