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

Bioinformatics Algorithms
Bioinformatics Algorithms: Design and Implementation in Python provides a comprehensive book on many of the most important bioinformatics problems, putting forward the best algorithms and showing how to implement them. The book focuses on the use of the Python programming language and its algorithms, which is quickly becoming the most popular language in the bioinformatics field. Readers will find the tools they need to improve their knowledge and skills with regard to algorithm development and implementation, and will also uncover prototypes of bioinformatics applications that demonstrate the main principles underlying real world applications.
R 3,678.00

WALCOM: Algorithms and Computation
This book constitutes the proceedings of the 13th International Conference and Workshop on Algorithms and Computation, WALCOM 2019, held in Guwahati, India, in February/ March 2019.The 30 full papers presented were carefully reviewed and selected from 100 submissions. The papers are organized in topical headings on the facility location problem; computational geometry; graph drawing; graph algorithms; approximation algorithms; miscellaneous; data structures; parallel and distributed algorithms; and packing and covering.
R 2,196.09

Frontiers in Algorithmics
This book constitutes the proceedings of the 9th International Workshop on Frontiers in Algorithmics, FAW 2015, held in Guilin, China, in July 2015. The 28 papers presented in this volume were carefully reviewed and selected from 65 submissions. They deal with graph algorithms, approximation algorithms, combinatorial optimization, parameterized algorithms, and online algorithms.
R 2,181.53

Analysis of Experimental Algorithms
This book constitutes the refereed post-conference proceedings of the Special Event on the Analysis of Experimental Algorithms, SEA² 2019, held in Kalamata, Greece, in June 2019.The 35 revised full papers presented were carefully reviewed and selected from 45 submissions. The papers cover a wide range of topics in both computer science and operations research/mathematical programming. They focus on the role of experimentation and engineering techniques in the design and evaluation of algorithms, data structures, and computational optimization methods.
R 3,554.48

WALCOM: Algorithms and Computation
This book constitutes the thoroughly refereed conference proceedings of the 9th International Workshop on Algorithms and Computation, WALCOM 2015, held in Dhaka, Bangladesh, in February 2015. The 26 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 85 submissions. The papers are organized in topical sections on approximation algorithms, data structures and algorithms, computational geometry, combinatorial algorithms, distributed and online algorithms, graph drawing and algorithms, combinatorial problems and complexity, and graph enumeration and algorithms.
R 2,183.44

Applied Algorithms
This book constitutes the refereed proceedings of the First International Conference on Applied Algorithms, ICAA 2014, held in Kolkata, India, in January 2014. ICAA is a new conference series with a mission to provide a quality forum for researchers working in applied algorithms. Papers presenting original contributions related to the design, analysis, implementation and experimental evaluation of efficient algorithms and data structures for problems with relevant real-world applications were sought, ideally bridging the gap between academia and industry. The 21 revised full papers presented together with 7 short papers were carefully reviewed and selected from 122 submissions.
R 2,175.34

Algorithmic Aspects in Information and Management
This volume constitutes the proceedings of the 11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016, held in Bergamo, Italy, in July 2016.The 18 revised full papers presented were carefully reviewed and selected from 41 submissions. The papers deal with current trends of research on algorithms, data structures, operation research, combinatorial optimization and their applications.
R 2,163.89

Grundlegende Algorithmen
Jeder Student IT-naher Studiengänge benötigt Grundkenntnisse im Bereich Algorithmen. Lernen Sie anhand alltäglicher Aufgabenstellungen aus der Informatik die richtigen Algorithmen einzusetzen. Sie werden auch die dahinter steckenden, allgemein anwendbaren Entwurfsmethoden sowie die grundlegenden Techniken zur Analyse verstehen und anwenden können.
R 2,131.44

Algorithms as a Basis of Modern Applied Mathematics
This book offers a self-contained guide to advanced algorithms and their applications in various fields of science. Gathering contributions by authoritative researchers in the field of mathematics, statistics and computer science, it aims at offering a comprehensive and up-to-date view of algorithms, including the theory behind them, as well as practical considerations, current limitations and solutions. It covers applications in energy management, decision making, computer networks, materials science, mechanics and process optimization. It offers an integrated and timely guide to important algorithms, and represents a valuable reference resource for graduate students and researchers in various fields of applied mathematics, statistics and engineering.
R 9,616.57

Permutation Group Algorithms
Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, including developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear time algorithms. The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses.
R 5,840.20

Algorithm Engineering
Algorithm Engineering is a methodology for algorithmic research that combines theory with implementation and experimentation in order to obtain better algorithms with high practical impact. Traditionally, the study of algorithms was dominated by mathematical (worst-case) analysis. In Algorithm Engineering, algorithms are also implemented and experiments conducted in a systematic way, sometimes resembling the experimentation processes known from fields such as biology, chemistry, or physics. This helps in counteracting an otherwise growing gap between theory and practice.
R 2,194.76

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

R 611.00

Algorithmentheorie
Die Algorithmentheorie ist Ende der dreiBiger Jahre entstanden in Ver- bindung mit Problemen der mathematischen Logik. Hit dem Aufkommen einer wissenschaftlich fundierten Informatik hat sie, insbesondere in den letzten zwanzig Jahren, an Bedeutung und Tragweite gewonnen. Das wird begreiflich, wenn man bedenkt, daB ein Programm flir eine elektronische Rechenanlage im wesentlichen ein Algorithmus ist und daB Resultate der Algorithmentheorie deshalb auch auf Programme anwendbar sind. Insbeson- dere gibt es eine enge Verbindung zwischen der Algorithmentheorie und anderen flir die Informatik bedeutsamen Zweigen, wie der Automatentheorie, der Theorie der formalen Sprachen und der sich in den letzten Jahren heranbildenden Theorie der Programmierung. Wahrend die meisten Blicher liber Algorithmentheorie sich an Studenten der mathematischen Logik richten, ist dieses Buch flir Informatikstuden- ten bestimmt. Zwar wird das Thema mit mathematischer Scharfe behandelt, aber es werden keine besonderen mathematischen Kenntnisse vorausgesetzt und die zahlreichen Kommentare zielen daraufhin, ein gutes intuitives Verstandnis zu ermoglichen; auBerdem hebt das Buch regelmaBig die Be- deutung der Resultate flir die Informatik hervor. SchlieBlich sind die Notationen und bestimmte Beweismethoden der Automatentheorie und der Theorie der formalen Sprachen entnommen; insbesondere wird grundsatz- lich mit Worten statt mit natlirlichen Zahlen gearbeitet.
R 2,442.03

Agronomy Algorithm
Algorithim (mathematics) helps in understanding the direct and indirect relationship of plants that exist within it and other environmental factors. This book helps to understand how yield is related to different growth parameters, how growth is influenced by different environmental phenomenon, how best the resources can be used for crop production, etc. The numerical examples in the book guide a student to coordinate the different parameters and understand the subject of Agronomy well. This book is divided into thirteen chapters and covers comprehensively the different agronomic aspects to understand the science of mathematical Agronomy to meet the current and future challenges related to cropping practices.Note: Taylor and Francis does not sell or distribute the print editions of this title in India, Pakistan, Nepal, Bhutan, Bangladesh and Sri Lanka.
R 7,575.14

Algorithmic Aspects of Analysis, Prediction, and Control in Science and Engineering
This book demonstrates how to describe and analyze a system's behavior and extract the desired prediction and control algorithms from this analysis. A typical prediction is based on observing similar situations in the past, knowing the outcomes of these past situations, and expecting that the future outcome of the current situation will be similar to these past observed outcomes. In mathematical terms, similarity corresponds to symmetry, and similarity of outcomes to invariance. This book shows how symmetries can be used in all classes of algorithmic problems of sciences and engineering: from analysis to prediction to control. Applications cover chemistry, geosciences, intelligent control, neural networks, quantum physics, and thermal physics. Specifically, it is shown how the approach based on symmetry and similarity can be used in the analysis of real-life systems, in the algorithms of prediction, and in the algorithms of control.
R 3,016.01

Problems in Set Theory, Mathematical Logic and the Theory of Algorithms
Problems in Set Theory, Mathematical Logic and the Theory of Algorithms by I. Lavrov & L. Maksimova is an English translation of the fourth edition of the most popular student problem book in mathematical logic in Russian. It covers major classical topics in proof theory and the semantics of propositional and predicate logic as well as set theory and computation theory. Each chapter begins with 1-2 pages of terminology and definitions that make the book self-contained. Solutions are provided. The book is likely to become an essential part of curricula in logic.
R 3,037.01


DNA Computing Based Genetic Algorithm
This book focuses on the implementation, evaluation and application of DNA/RNA-based genetic algorithms in connection with neural network modeling, fuzzy control, the Q-learning algorithm and CNN deep learning classifier. It presents several DNA/RNA-based genetic algorithms and their modifications, which are tested using benchmarks, as well as detailed information on the implementation steps and program code. In addition to single-objective optimization, here genetic algorithms are also used to solve multi-objective optimization for neural network modeling, fuzzy control, model predictive control and PID control. In closing, new topics such as Q-learning and CNN are introduced. The book offers a valuable reference guide for researchers and designers in system modeling and control, and for senior undergraduate and graduate students at colleges and universities.
R 5,583.04

Models and Algorithms of Time-Dependent Scheduling
This is a comprehensive study of various time-dependent scheduling problems in single-, parallel- and dedicated-machine environments. In addition to complexity issues and exact or heuristic algorithms which are typically presented in scheduling books, the author also includes more advanced topics such as matrix methods in time-dependent scheduling, time-dependent scheduling with two criteria and time-dependent two-agent scheduling.The reader should be familiar with the basic notions of calculus, discrete mathematics and combinatorial optimization theory, while the book offers introductory material on theory of algorithms, NP-complete problems, and the basics of scheduling theory. The author includes numerous examples, figures and tables, he presents different classes of algorithms using pseudocode, he completes all chapters with extensive bibliographies, and he closes the book with comprehensive symbol and subject indexes.The previous edition of the book focused on computational complexity of time-dependent scheduling problems. In this edition, the author concentrates on models of time-dependent job processing times and algorithms for solving time-dependent scheduling problems. The book is suitable for researchers working on scheduling, problem complexity, optimization, heuristics and local search algorithms.
R 6,605.29

Nature-Inspired Algorithms
This comprehensive reference text discusses nature inspired algorithms and their applications. It presents the methodology to write new algorithms with the help of MATLAB programs and instructions for better understanding of concepts. It covers well-known algorithms including evolutionary algorithms, genetic algorithm, particle Swarm optimization and differential evolution, and recent approached including gray wolf optimization. A separate chapter discusses test case generation using techniques such as particle swarm optimization, genetic algorithm, and differential evolution algorithm.The book- Discusses in detail various nature inspired algorithms and their applications Provides MATLAB programs for the corresponding algorithm Presents methodology to write new algorithms Examines well-known algorithms like the genetic algorithm, particle swarm optimization and differential evolution, and recent approaches like gray wolf optimization. Provides conceptual linking of algorithms with theoretical concepts The text will be useful for graduate students in the field of electrical engineering, electronics engineering, computer science and engineering. Discussing nature inspired algorithms and their applications in a single volume, this text will be useful as a reference text for graduate students in the field of electrical engineering, electronics engineering, computer science and engineering. It discusses important algorithms including deterministic algorithms, randomized algorithms, evolutionary algorithms, particle swarm optimization, big bang big crunch (BB-BC) algorithm, genetic algorithm and grey wolf optimization algorithm. "
R 7,585.56

Algorithmik für Einsteiger
Wer ein GPS benutzt oder einen Routenplaner befragt, profitiert von einem Algorithmus. Wer sich von einem medizinischen Roboter operieren lässt oder beim Onlinebanking auf sicheren Datentransfer hofft, vertraut auf Algorithmen. Algorithmen und die ausführenden Computer bestimmen und beeinflussen unser heutiges Leben in starkem Maße. Im Zentrum dieses Buches steht die Frage, was ein Algorithmus ist, was Algorithmen können und was nicht. Der Leser, die Leserin erfährt, was genau ein Algorithmus ist, und hat die Möglichkeit, aus zahlreichen historisch wichtigen oder aktuellen Beispielen von Algorithmen auszuwählen. Eine Untersuchung darüber, ob und wie Algorithmen noch beschleunigt werden können, mündet in eine kurze Einführung in die moderne mathematische Disziplin der "Komplexitätstheorie". Mit der Turing-Maschine wird ein einfaches und zugleich ungeheuer mächtiges theoretisches Computermodell vergestellt, das Anlass zu interessanten Fragen über die Möglichkeiten und Grenzen der Computer gibt. Zum Schluss wird der Leser, die Leserin zu einem Ausflug eingeladen zu den Grenzen der Informatik, zu Problemen, die bewiesenermaßen algorithmisch unlösbar sind. Dank sehr ausführlicher und gut zugänglicher Erklärungen und zahlreicher interessanter Aufgaben bereitet das Lernen mit diesem Buch Freude. Der Text wurde für die zweite Auflage vollkommen neu geschrieben.
R 1,605.32

Rise of the Algorithms
The meteoric rise of online video is reshaping the competition for human attention. The Rise of the Algorithms argues that this new technology has changed the way we interact with others, our relationships with public institutions, and our very own behaviors and psyches. In tracing the origins and evolution of online video, John M. Jordan examines the mechanics—and the ethical stakes—of online video platforms, especially YouTube and TikTok, but also others such as Twitch. Tracing the use of algorithms pioneered by Facebook and Google and so successfully exploited by TikTok’s corporate parent, ByteDance, Jordan shows how these platforms now engineer human behavior—with consequences for culture, politics, and identity. Jordan argues that we are at an inflection point. Until now we have proved, as a society, ill-prepared or unwilling to address such problems as the power of digital platforms, the personal cost of viral celebrity, the invasion of privacy, and the proliferation of disinformation. The Rise of the Algorithms combines this urgent assessment with a clear-eyed discussion of present challenges and recommendations for reclaiming our online futures. A valuable resource for understanding the transformations that have been and will be brought by YouTube, TikTok, and similar platforms, Jordan’s timely book is a vital work for anyone who uses the internet, and especially for policy makers, technologists, communication and media specialists, and researchers who have a direct hand in determining the future of our online world.
R 2,941.00

R 603.89

R 1,663.75

Nature of Computation: Logic, Algorithms, Applications
This book constitutes the refereed proceedings of the 9th Conference on Computability in Europe, CiE 2013, held in Milan, Italy, in July 2013. The 48 revised papers presented together with 1 invited lecture and 2tutorials were carefully reviewed and selected with an acceptance rate of under 31,7%. Both the conference series and the association promote the development of computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences such as physics and biology, and also including the promotion of related non-scientific fields such as philosophy and history of computing.
R 2,200.33

Introduction To Genetic Algorithms For Scientists And Engineers, An
This invaluable book has been designed to be useful to most practising scientists and engineers, whatever their field and however rusty their mathematics and programming might be. The approach taken is largely practical, with algorithms being presented in full and working code (in BASIC, FORTRAN, PASCAL AND C) included on a floppy disk to help the reader get up and running as quickly as possible. The text could also be used as part of an undergraduate course on search and optimisation. Student exercises are included at the end of several of the chapters, many of which are computer-based and designed to encourage exploration of the method.
R 1,630.04

Advances in Computational Algorithms and Data Analysis
Advances in Computational Algorithms and Data Analysis offers state of the art tremendous advances in computational algorithms and data analysis. The selected articles are representative in these subjects sitting on the top-end-high technologies. The volume serves as an excellent reference work for researchers and graduate students working on computational algorithms and data analysis.
R 6,561.94

Algorithms for Sensor Systems
This book constitutes revised selected papers from the 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, held in Vienna, in September 2017.The 17 full papers presented in this volume were carefully reviewed and selected from 30 submissions. ALGOSENSORS is an international symposium dedicated to the algorithmic aspects of wireless networks. Originally focused on sensor networks, it now covers algorithmic issues arising in wireless networks of all types of computational entities, static or mobile, including sensor networks, sensor-actuator networks, autonomous robots. The focus is on the design and analysis of algorithms, models of computation, and experimental analysis.
R 2,165.36

R 871.23


Concentration of Measure for the Analysis of Randomized Algorithms
Randomized algorithms have become a central part of the algorithms curriculum, based on their increasingly widespread use in modern applications. This book presents a coherent and unified treatment of probabilistic techniques for obtaining high probability estimates on the performance of randomized algorithms. It covers the basic toolkit from the Chernoff–Hoeffding bounds to more sophisticated techniques like martingales and isoperimetric inequalities, as well as some recent developments like Talagrand's inequality, transportation cost inequalities and log-Sobolev inequalities. Along the way, variations on the basic theme are examined, such as Chernoff–Hoeffding bounds in dependent settings. The authors emphasise comparative study of the different methods, highlighting respective strengths and weaknesses in concrete example applications. The exposition is tailored to discrete settings sufficient for the analysis of algorithms, avoiding unnecessary measure-theoretic details, thus making the book accessible to computer scientists as well as probabilists and discrete mathematicians.
R 6,333.37

Swarm Intelligence Algorithms
Swarm intelligence algorithms are a form of nature-based optimization algorithms. Their main inspiration is the cooperative behavior of animals within specific communities. This can be described as simple behaviors of individuals along with the mechanisms for sharing knowledge between them, resulting in the complex behavior of the entire community. Examples of such behavior can be found in ant colonies, bee swarms, schools of fish or bird flocks.Swarm intelligence algorithms are used to solve difficult optimization problems for which there are no exact solving methods or the use of such methods is impossible, e.g. due to unacceptable computational time.This book thoroughly presents the basics of 24 algorithms selected from the entire family of swarm intelligence algorithms. Each chapter deals with a different algorithm describing it in detail and showing how it works in the form of a pseudo-code. In addition, the source code is provided for each algorithm in Matlab and in the C ++ programming language. In order to better understand how each swarm intelligence algorithm works, a simple numerical example is included in each chapter, which guides the reader step by step through the individual stages of the algorithm, showing all necessary calculations.This book can provide the basics for understanding how swarm intelligence algorithms work, and aid readers in programming these algorithms on their own to solve various computational problems.This book should also be useful for undergraduate and postgraduate students studying nature-based optimization algorithms, and can be a helpful tool for learning the basics of these algorithms efficiently and quickly. In addition, it can be a useful source of knowledge for scientists working in the field of artificial intelligence, as well as for engineers interested in using this type of algorithms in their work.If the reader already has basic knowledge of swarm intelligence algorithms, we recommend the book: "Swarm Intelligence Algorithms: Modifications and Applications" (Edited by A. Slowik, CRC Press, 2020), which describes selected modifications of these algorithms and presents their practical applications.
R 8,572.00

R 1,901.67

Representations for Genetic and Evolutionary Algorithms
In the field of genetic and evolutionary algorithms (GEAs), much theory and empirical study has been heaped upon operators and test problems, but problem representation has often been taken as given. This monograph breaks with this tradition and studies a number of critical elements of a theory of representations for GEAs and applies them to the empirical study of various important idealized test functions and problems of commercial import. The book considers basic concepts of representations, such as redundancy, scaling and locality and describes how GEAs'performance is influenced. Using the developed theory representations can be analyzed and designed in a theory-guided manner. The theoretical concepts are used as examples for efficiently solving integer optimization problems and network design problems. The results show that proper representations are crucial for GEAs'success.
R 1,557.71

Algorithms and Data Structures
This book constitutes the refereed proceedings of the 14th Algorithms and Data Structures Symposium, WADS 2015, held in Victoria, BC, Canada, August 2015. The 54 revised full papers presented in this volume were carefully reviewed and selected from 148 submissions. The Algorithms and Data Structures Symposium - WADS (formerly Workshop on Algorithms And Data Structures), which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. WADS includes papers presenting original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.
R 1,614.56

Algorithms and Discrete Applied Mathematics
This book collects the refereed proceedings of the First International Conference onon Algorithms and Discrete Applied Mathematics, CALDAM 2015, held in Kanpur, India, in February 2015. The volume contains 26 full revised papers from 58 submissions along with 2 invited talks presented at the conference. The workshop covered a diverse range of topics on algorithms and discrete mathematics, including computational geometry, algorithms including approximation algorithms, graph theory and computational complexity.
R 2,176.09

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

Algorithmic Aspects in Information and Management
This book constitutes the refereed proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management, AAIM 2008, held in Shanghai, China, in June 2008. The 30 revised full papers presented together with abstracts of 2 invited talks were carefully reviewed and selected from 53 submissions. The papers cover original algorithmic research on immediate applications and/or fundamental problems pertinent to information management and management science. Topics addressed are: approximation algorithms, geometric data management, biological data management, graph algorithms, computational finance, mechanism design, computational game theory, network optimization, data structures, operations research, discrete optimization, online algorithms, FPT algorithms, and scheduling algorithms.
R 1,566.81

Combinatorial Algorithms
This book constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Combinatorial Algorithms, IWOCA 2013, held in Rouen, France, in July 2013. The 33 revised full papers presented together with 10 short papers and 5 invited talks were carefully reviewed and selected from a total of 91 submissions. The papers are organized in topical sections on algorithms on graphs; algorithms on strings; discrete geometry and satisfiability.
R 1,588.40

R 1,253.74

Algorithm Engineering
This work considers practical parallel list-ranking algorithms. The model for which programs are written is a single-program multiple-data (SPMD) \bri- ingmodel". Thismodel isdesignated asa programmer'smodelfora ne-grained computation framework called Explicit Multi-Threading (XMT), which was - troduced in [VDBN98]; the XMT framework covers the spectrum from al- rithms through architecture to implementation; it is meant to provide a pl- form for faster single-task completion time by way of instruction-level par- lelism (ILP). The performance of XMT programs is evaluated as follow: the performance of a matching optimized XMT assembly code is measured within an XMT execution model. (We use in the current paper the so-called Spawn- MT programmingmodel - the easier to implement amongthe two programming modelspresented in[VDBN98]). The XMT approach deviatesfromthe standard PRAM approach by incorporating reduced synchrony and departing from the lock-step structure in its so-called asynchronous mode. Our envisioned platform uses an extension to a standard serial instruction set.This extension e ciently implements PRAM-style algorithms using explicit multi-threaded ILP, which allows considerably more n e-grained parallelism than the previously studied parallel computing implementation platforms/models. The list ranking problem was the rst problem considered as we examined and re ned many of the concepts in the XMT framework. The problem arises in parallel algorithmson lists, trees and graphs and is considered a fundamental problemin the theory of parallelalgorithms. Experimental results are presented.
R 1,568.42

Innovative Computational Intelligence: A Rough Guide to 134 Clever Algorithms
The first notable feature of this book is its innovation: Computational intelligence (CI), a fast evolving area, is currently attracting lots of researchers’ attention in dealing with many complex problems. At present, there are quite a lot competing books existing in the market. Nevertheless, the present book is markedly different from the existing books in that it presents new paradigms of CI that have rarely mentioned before, as opposed to the traditional CI techniques or methodologies employed in other books. During the past decade, a number of new CI algorithms are proposed. Unfortunately, they spread in a number of unrelated publishing directions which may hamper the use of such published resources. These provide us with motivation to analyze the existing research for categorizing and synthesizing it in a meaningful manner. The mission of this book is really important since those algorithms are going to be a new revolution in computer science. We hope it will stimulate the readers to make novel contributions or even start a new paradigm based on nature phenomena. Although structured as a textbook, the book's straightforward, self-contained style will also appeal to a wide audience of professionals, researchers and independent learners. We believe that the book will be instrumental in initiating an integrated approach to complex problems by allowing cross-fertilization of design principles from different design philosophies.The second feature of this book is its comprehensiveness: Through an extensive literature research, there are 134 innovative CI algorithms covered in this book.
R 3,067.86

Algorithms and Architectures for Parallel Processing
It is our great pleasure to welcome you to the proceedings of the 10th annual event of the International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP). ICA3PP is recognized as the main regular event covering the many dimensions of parallel algorithms and architectures, encompassing fundamental theoretical - proaches, practical experimental projects, and commercial components and systems. As applications of computing systems have permeated every aspect of daily life, the power of computing systems has become increasingly critical. Therefore, ICA3PP 2010 aimed to permit researchers and practitioners from industry to exchange inf- mation regarding advancements in the state of the art and practice of IT-driven s- vices and applications, as well as to identify emerging research topics and define the future directions of parallel processing. We received a total of 157 submissions this year, showing by both quantity and quality that ICA3PP is a premier conference on parallel processing. In the first stage, all papers submitted were screened for their relevance and general submission - quirements. These manuscripts then underwent a rigorous peer-review process with at least three reviewers per paper. In the end, 47 papers were accepted for presentation and included in the main proceedings, comprising a 30% acceptance rate.
R 3,086.39

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

Organisation and Governance Using Algorithms
Following a recent mathematical, algorithmic, and computational turn in the field of social sciences, and particularly design aspects of contemporary organisations, Organisation and Governance Using Algorithms explores the problem of governance in organisations from a mathematical perspective.Avramopoulos offers a ground-breaking theory and application on organisational systems design, including discussions on organisational systems design requirements, such as productivity, emotion, and reward, the problems of unaccountability, including hierarchical delegation, and the benefits of accountable design.The suggested theoretical approach views organizational actors as computer processors that communicate through a shared infrastructure – both physical and digital – and suggests scientific principles and mechanisms by which to correct inequality and advance democratic governance in organisations.
R 2,468.09

R 751.78

Models, Algorithms, and Technologies for Network Analysis
This valuable source for graduate students and researchers provides a comprehensive introduction to current theories and applications in optimization methods and network models. Contributions to this book are focused on new efficient algorithms and rigorous mathematical theories, which can be used to optimize and analyze mathematical graph structures with massive size and high density induced by natural or artificial complex networks. Applications to social networks, power transmission grids, telecommunication networks, stock market networks, and human brain networks are presented.Chapters in this book cover the following topics:Linear max min fairnessHeuristic approaches for high-quality solutionsEfficient approaches for complex multi-criteria optimization problemsComparison of heuristic algorithmsNew heuristic iterative local search Power in network structuresClustering nodes in random graphsPower transmission grid structureNetwork decomposition problemsHomogeneity hypothesis testingNetwork analysis of international migrationSocial networks with node attributesTesting hypothesis on degree distribution in the market graphsMachine learning applications to human brain network studies This proceeding is a result of The 6th International Conference on Network Analysis held at the Higher School of Economics, Nizhny Novgorod in May 2016. The conference brought together scientists and engineers from industry, government, and academia to discuss the links between network analysis and a variety of fields.
R 4,270.28
















































