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

R 1,663.75

Mathematics Of Harmony As A New Interdisciplinary Direction And "Golden" Paradigm Of Modern Science - Volume 2: Algorithmic Measurement Theory, Fibonacci And Golden Arithmetic's And Ternary Mirror-symmetrical Arithmetic
Volume II is the second part of the 3-volume book Mathematics of Harmony as a New Interdisciplinary Direction and 'Golden' Paradigm of Modern Science. 'Mathematics of Harmony' rises in its origin to the 'harmonic ideas' of Pythagoras, Plato and Euclid, this 3-volume book aims to promote more deep understanding of ancient conception of the 'Universe Harmony,' the main conception of ancient Greek science, and implementation of this conception to modern science and education.This 3-volume book is a result of the authors' research in the field of Fibonacci numbers and the Golden Section and their applications. It provides a broad introduction to the fascinating and beautiful subject of the 'Mathematics of Harmony,' a new interdisciplinary direction of modern science. This direction has many unexpected applications in contemporary mathematics (a new approach to a history of mathematics, the generalized Fibonacci numbers and the generalized golden proportions, the generalized Binet's formulas), theoretical physics (new hyperbolic models of Nature) and computer science (algorithmic measurement theory, number systems with irrational bases, Fibonacci computers, ternary mirror-symmetrical arithmetic).The books are intended for a wide audience including mathematics teachers of high schools, students of colleges and universities and scientists in the field of mathematics, theoretical physics and computer science. The book may be used as an advanced textbook by graduate students and even ambitious undergraduates in mathematics and computer science.
R 3,513.92

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

R 391.00

R 1,254.00

R 458.00

Discrete Probability and Algorithms
Discrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer. The papers in this volume address the latest developments in this active field. They are from the IMA Workshops "Probability and Algorithms" and "The Finite Markov Chain Renaissance." They represent the current thinking of many of the world's leading experts in the field.Researchers and graduate students in probability, computer science, combinatorics, and optimization theory will all be interested in this collection of articles. The techniques developed and surveyed in this volume are still undergoing rapid development, and many of the articles of the collection offer an expositionally pleasant entree into a research area of growing importance.
R 3,017.61

Probabilistic Methods for Algorithmic Discrete Mathematics
Leave nothing to chance. This cliche embodies the common belief that ran domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, nothing could be further from the truth. Introducing random choices into algorithms can improve their performance. The application of proba bilistic tools has led to the resolution of combinatorial problems which had resisted attack for decades. The chapters in this volume explore and celebrate this fact. Our intention was to bring together, for the first time, accessible discus sions of the disparate ways in which probabilistic ideas are enriching discrete mathematics. These discussions are aimed at mathematicians with a good combinatorial background but require only a passing acquaintance with the basic definitions in probability (e.g. expected value, conditional probability). A reader who already has a firm grasp on the area will be interested in the original research, novel syntheses, and discussions of ongoing developments scattered throughout the book. Some of the most convincing demonstrations of the power of these tech niques are randomized algorithms for estimating quantities which are hard to compute exactly. One example is the randomized algorithm of Dyer, Frieze and Kannan for estimating the volume of a polyhedron. To illustrate these techniques, we consider a simple related problem. Suppose S is some region of the unit square defined by a system of polynomial inequalities: Pi (x. y) ~ o.
R 4,030.00

Fun with Algorithms
This book constitutes the refereed proceedings of the 7th International Conference, FUN 2014, held in July 2014 in Lipari Island, Sicily, Italy.The 29 revised full papers were carefully reviewed and selected from 49 submissions. They feature a large variety of topics in the field of the use, design and analysis of algorithms and data structures, focusing on results that provide amusing, witty but nonetheless original and scientifically profound contributions to the area. In particular, algorithmic questions rooted in biology, cryptography, game theory, graphs, the internet, robotics and mobility, combinatorics, geometry, stringology, as well as space-conscious, randomized, parallel, distributed algorithms and their visualization are addressed.
R 2,188.29

R 916.00

R 428.00


Algorithmic Dimension
Fifty years after the first experiments in computational art, international interest in the history of this subject remains strong and at the same time almost uncovered. This book began with the exhibition Algorithmic Signs, which was conceived, researched and curated by Francesca Franco in Venice in 2017. The origins of the exhibition included a series of meetings that gathered together the most celebrated international pioneers in the world of digital arts and the rare opportunity to interview them in their studios.Francesca Franco explores the history of computer art and its contribution to the broader field of contemporary art from the 1960s to the present. It is illustrated by the creative work of five of the most influential pioneers of computer art - Ernest Edmonds, Manfred Mohr, Vera Molnár, Frieder Nake, and Roman Verostko and includes the full visual documentation of the exhibition.The Algorithmic Dimension - Five Artists in Conversation offers more than a theoretical perspective; it offers readers the rare opportunity to hear the histories and developments of the fascinating art, created through the algorithm, in an accessible and stimulating narrative. The personal achievements of each artist are followed, including their original inspirations, and how they develop in parallel with technological advances. It also brings together for the first time the artists' common ideas and differences, and tales about how their paths have crossed over the years.
R 7,551.74


Algorithmic Learning Theory
This volume contains all the papers presented at the Ninth International Con- rence on Algorithmic Learning Theory (ALT’98), held at the European education centre Europ¨aisches Bildungszentrum (ebz) Otzenhausen, Germany, October 8{ 10, 1998. The Conference was sponsored by the Japanese Society for Arti cial Intelligence (JSAI) and the University of Kaiserslautern. Thirty-four papers on all aspects of algorithmic learning theory and related areas were submitted, all electronically. Twenty-six papers were accepted by the program committee based on originality, quality, and relevance to the theory of machine learning. Additionally, three invited talks presented by Akira Maruoka of Tohoku University, Arun Sharma of the University of New South Wales, and Stefan Wrobel from GMD, respectively, were featured at the conference. We would like to express our sincere gratitude to our invited speakers for sharing with us their insights on new and exciting developments in their areas of research. This conference is the ninth in a series of annual meetings established in 1990. The ALT series focuses on all areas related to algorithmic learning theory including (but not limited to): the theory of machine learning, the design and analysis of learning algorithms, computational logic of/for machine discovery, inductive inference of recursive functions and recursively enumerable languages, learning via queries, learning by arti cial and biological neural networks, pattern recognition, learning by analogy, statistical learning, Bayesian/MDL estimation, inductive logic programming, robotics, application of learning to databases, and gene analyses.
R 1,582.10

Algorithmic Architecture
Why does the word design owe its origin to Latin and not Greek roots? Where do the limits of the human mind lie? How does ambiguity enter the deterministic world of computation? Who was Parmenides and why is his philosophy still puzzling today? This unique volume challenges the reader to tackle all these complex questions and more.Algorithmic Architecture is not a typical theory-based architectural book; it is not a computer programming or language tutorial book either. It contains a series of provocative design projects, and yet it is not just a design or graphic art book per se. Following the tradition of architecture as a conglomeration of various design fields - engineering, theory, art, and recently, computation - the challenge of this book is to present a concept that, like architecture, is a unifying theme for many diverse disciplines. An algorithm is not only a step-by-step problem-solving procedure, a series of lines of computer codes or a mechanistic linguistic expression, but is also an ontological construct with deep philosophical, social, design, and artistic repercussions. Consequently, this book presents many, various and often seemingly disparate points of view that lead to the establishment of one common theme; algorithmic architecture.
R 3,334.47

Evolutionary Optimization Algorithms
A clear and lucid bottom-up approach to the basic principles of evolutionary algorithms Evolutionary algorithms (EAs) are a type of artificial intelligence. EAs are motivated by optimization processes that we observe in nature, such as natural selection, species migration, bird swarms, human culture, and ant colonies. This book discusses the theory, history, mathematics, and programming of evolutionary optimization algorithms. Featured algorithms include genetic algorithms, genetic programming, ant colony optimization, particle swarm optimization, differential evolution, biogeography-based optimization, and many others. Evolutionary Optimization Algorithms: Provides a straightforward, bottom-up approach that assists the reader in obtaining a clearbut theoretically rigorousunderstanding of evolutionary algorithms, with an emphasis on implementationGives a careful treatment of recently developed EAsincluding opposition-based learning, artificial fish swarms, bacterial foraging, and many others and discusses their similarities and differences from more well-established EAsIncludes chapter-end problems plus a solutions manual available online for instructorsOffers simple examples that provide the reader with an intuitive understanding of the theoryFeatures source code for the examples available on the author's websiteProvides advanced mathematical techniques for analyzing EAs, including Markov modeling and dynamic system modeling Evolutionary Optimization Algorithms: Biologically Inspired and Population-Based Approaches to Computer Intelligence is an ideal text for advanced undergraduate students, graduate students, and professionals involved in engineering and computer science.
R 4,655.00

Nature-inspired Metaheuristic Algorithms
This comprehensive text provides practical guidance for implementing nature-inspired algorithms and metaheuristics in real-life scenarios to solve complex optimization problems. It further demonstrates how nature inspired metaheuristic algorithms have the potential to contribute to multiple United Nations sustainable development goals such as climate action, clean energy, and sustainable cities.This book:Discusses load balancing and demand response using nature-inspired optimization techniquesPresents energy-efficient routing and scheduling, energy management, and optimization using metaheuristic algorithmsCovers disease diagnosis, and prognosis using metaheuristic algorithms, drug discovery, and development using nature-inspired optimization techniquesExplains waste reduction and recycling, image processing, and computer vision using nature-inspired optimization techniquesIllustrates medical image analysis and segmentation using Ant Colony optimization, and Particle Swarm optimization techniquesNature-inspired Metaheuristic Algorithms is primarily written for senior undergraduates, graduate students, and academic researchers in the fields of electrical engineering, electronics and communication engineering, computer engineering, and information technology.
R 9,968.45


R 183.00

Parallel Architectures and Bioinspired Algorithms
This monograph presents examples of best practices when combining bioinspired algorithms with parallel architectures. The book includes recent work by leading researchers in the field and offers a map with the main paths already explored and new ways towards the future.Parallel Architectures and Bioinspired Algorithms will be of value to both specialists in Bioinspired Algorithms, Parallel and Distributed Computing, as well as computer science students trying to understand the present and the future of Parallel Architectures and Bioinspired Algorithms.
R 5,617.21

R 751.78

Algorithmen Und Rekursive Funktionen
Keine ausf�hrliche Beschreibung f�r "Algorithmen und rekursive Funktionen" verf�gbar.
R 6,071.00

R 456.00

R 1,414.17

Algorithms in Bioinformatics
This book constitutes the refereed proceedings of the 11th International Workshop on Algorithms in Bioinformatics, WABI 2011, held in Saarbrücken, Germany, in September 2011. The 30 papers presented were carefully reviewed and selected from 77 submissions. They cover aspects of algorithms in bioinformatics, computational biology and systems biology.
R 2,015.00

R 489.00

R 2,593.11

R 1,114.02

Combinatorial Algorithms
This book constitutes the refereed post-conference proceedings of the 30th International Workshop on Combinatorial Algorithms, IWOCA 2019, held in Pisa, Italy, in July 2019. The 36 regular papers presented in this volume were carefully reviewed and selected from 73 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, cryptography and information security, algorithms on strings and graphs, graph drawing and labelling, computational algebra and geometry, computational biology, probabilistic and randomized algorithms, algorithms for big data analytics, and new paradigms of computation.
R 3,156.67

Dynamics of Algorithms
The articles collected in this volume represent the contributions presented at the IMA workshop on "Dynamics of Algorithms" which took place in November 1997. The workshop was an integral part of the 1997 -98 IMA program on "Emerging Applications of Dynamical Systems." The interaction between algorithms and dynamical systems is mutually beneficial since dynamical methods can be used to study algorithms that are applied repeatedly. Convergence, asymptotic rates are indeed dynamical properties. On the other hand, the study of dynamical systems benefits enormously from having efficient algorithms to compute dynamical objects.
R 1,533.60

R 611.00

Algorithmic Aspects of Graph Connectivity
Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory, emphasizing its algorithmic aspects. Because of its wide applications in the fields of communication, transportation, and production, graph connectivity has made tremendous algorithmic progress under the influence of the theory of complexity and algorithms in modern computer science. The book contains various definitions of connectivity, including edge-connectivity and vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts. The authors thoroughly discuss new concepts and algorithms that allow for quicker and more efficient computing, such as maximum adjacency ordering of vertices. Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses in mathematical sciences, such as discrete mathematics, combinatorics, and operations research, and as a reference book for specialists in discrete mathematics and its applications.
R 4,542.83

Anomaly Detection Principles and Algorithms
This book provides a readable and elegant presentation of the principles of anomaly detection,providing an easy introduction for newcomers to the field. A large number of algorithms are succinctly described, along with a presentation of their strengths and weaknesses.The authors also cover algorithms that address different kinds of problems of interest with single and multiple time series data and multi-dimensional data. New ensemble anomaly detection algorithms are described, utilizing the benefits provided by diverse algorithms, each of which work well on some kinds of data. With advancements in technology and the extensive use of the internet as a medium for communications and commerce, there has been a tremendous increase in the threats faced by individuals and organizations from attackers and criminal entities. Variations in the observable behaviors of individuals (from others and from their own past behaviors) have been found to be useful in predicting potential problems of various kinds. Hence computer scientists and statisticians have been conducting research on automatically identifying anomalies in large datasets. This book will primarily target practitioners and researchers who are newcomers to the area of modern anomaly detection techniques. Advanced-level students in computer science will also find this book helpful with their studies.
R 4,344.12

Algorithms for Next Generation Networks
Data networking now plays a major role in everyday life and new applications continue to appear at a blinding pace. Yet we still do not have a sound foundation for designing, evaluating and managing these networks.This book covers topics at the intersection of algorithms and networking. It builds a complete picture of the current state of research on Next Generation Networks and the challenges for the years ahead. Particular focus is given to evolving research initiatives and the architecture they propose and implications for networking.Topics: Network design and provisioning, hardware issues, layer-3 algorithms and MPLS, BGP and Inter AS routing, packet processing for routing, security and network management, load balancing, oblivious routing and stochastic algorithms, network coding for multicast, overlay routing for P2P networking and content delivery.This timely volume will be of interest to a broad readership from graduate students to researchers looking to survey recent research its open questions.
R 5,465.83

Algorithmic Approaches to Financial Technology
Today, algorithms steer and inform more than 75% of modern trades. These mathematical constructs play an intricate role in automating processes, predicting market trends, optimizing portfolios, and fortifying decision-making in the financial domain. In an era where algorithms underpin the very foundation of financial services, it is imperative to hold a deep understanding of the intricate web of computational finance. Algorithmic Approaches to Financial Technology: Forecasting, Trading, and Optimization takes a comprehensive approach, spotlighting the fusion of artificial intelligence(AI) and algorithms in financial operations. The chapters explore the expansive landscape of algorithmic applications, from scrutinizing market trends to managing risks. The emphasis extends to AI-driven personnel selection, implementing trusted financial services, crafting recommendation systems for financial platforms, and critical fraud detection. This book serves as a vital resource for researchers, students, and practitioners. Its core strength lies in discussing AI-based algorithms as a catalyst for evolving market trends. It provides algorithmic solutions for stock markets, portfolio optimization, and robust financial fraud detection mechanisms. The text also casts a forward-looking gaze on the industry, predicting future trends while spotlighting the genetic algorithms in high-frequency trading, predictive analysis, and forecasting. Including research findings, case studies, best practices, and conceptual insights makes this book an indispensable reference for undergraduate, graduate, and executive students specializing in business, finance, economics, and technology. Beyond academia, the book finds resonance with industry professionals, policymakers, investors, and corporate executives, offering a nuanced understanding of the transformative impact of algorithmic approaches in shaping the future of financial technology.
R 10,603.08

R 4,274.00

Practical Handbook of Genetic Algorithms
Rapid developments in the field of genetic algorithms along with the popularity of the first edition precipitated this completely revised, thoroughly updated second edition of The Practical Handbook of Genetic Algorithms. Like its predecessor, this edition helps practitioners stay up to date on recent developments in the field and provides material they can use productively in their own endeavors. For this edition, the editor again recruited authors at the top of their field and from a cross section of academia and industry, theory and practice. Their contributions detail their own research, new applications, experiment results, and recent advances. Among the applications explored are scheduling problems, optimization, multidimensional scaling, constraint handling, and feature selection and classification. The science and art of GA programming and application has come a long way in the five years since publication of the bestselling first edition. But there still is a long way to go before its bounds are reached-we are still just scratching the surface of GA applications and refinements. By introducing intriguing new applications, offering extensive lists of code, and reporting advances both subtle and dramatic, The Practical Handbook of Genetic Algorithms is designed to help readers contribute to scratching that surface a bit deeper.
R 15,918.31

R 452.76

R 427.92

R 1,068.00

Classification Algorithms for Codes and Designs
A new starting-point and a new method are requisite, to insure a complete [classi?cation of the Steiner triple systems of order 15]. This method was furnished, and its tedious and di?cult execution und- taken, by Mr. Cole. F. N. Cole, L. D. Cummings, and H. S. White (1917) [129] The history of classifying combinatorial objects is as old as the history of the objects themselves. In the mid-19th century, Kirkman, Steiner, and others became the fathers of modern combinatorics, and their work – on various objects, including (what became later known as) Steiner triple systems – led to several classi?cation results. Almost a century earlier, in 1782, Euler [180] published some results on classifying small Latin squares, but for the ?rst few steps in this direction one should actually go at least as far back as ancient Greece and the proof that there are exactly ?ve Platonic solids. One of the most remarkable achievements in the early, pre-computer era is the classi?cation of the Steiner triple systems of order 15, quoted above. An onerous task that, today, no sensible person would attempt by hand calcu- tion. Because, with the exception of occasional parameters for which com- natorial arguments are e?ective (often to prove nonexistence or uniqueness), classi?cation in general is about algorithms and computation.
R 3,596.67

Algorithmic Governance and Governance of Algorithms
Algorithms are now widely employed to make decisions that have increasingly far-reaching impacts on individuals and society as a whole (“algorithmic governance”), which could potentially lead to manipulation, biases, censorship, social discrimination, violations of privacy, property rights, and more. This has sparked a global debate on how to regulate AI and robotics (“governance of algorithms”). This book discusses both of these key aspects: the impact of algorithms, and the possibilities for future regulation.
R 6,923.69

Textbook of Data Structures and Algorithms, Volume 3
Data structures and algorithms is a fundamental course in Computer Science, which enables learners across any discipline to develop the much-needed foundation of efficient programming, leading to better problem solving in their respective disciplines. A Textbook of Data Structures and Algorithms is a textbook that can be used as course material in classrooms, or as self-learning material. The book targets novice learners aspiring to acquire advanced knowledge of the topic. Therefore, the content of the book has been pragmatically structured across three volumes and kept comprehensive enough to help them in their progression from novice to expert. With this in mind, the book details concepts, techniques and applications pertaining to data structures and algorithms, independent of any programming language. It includes 181 illustrative problems and 276 review questions to reinforce a theoretical understanding and presents a suggestive list of 108 programming assignments to aid in the implementation of the methods covered.
R 5,373.00

Theory of Semi-Feasible Algorithms
The primary goal of this book is unifying and making more widely accessible the vibrant stream of research - spanning more than two decades - on the theory of semi-feasible algorithms. In doing so it demonstrates the richness inherent in central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. The book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science. Another aim of this book is to lay out a path along which the reader can quickly reach the frontiers of current research, and meet and engage the many exciting open problems in this area.
R 4,030.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

Algorithmic Adventures
The ?rst and foremost goal of this lecture series was to show the beauty, depth and usefulness of the key ideas in computer science. While working on the lecture notes, we came to understand that one can recognize the true spirit of a scienti?c discipline only by viewing its contributions in the framework of science as a whole. We present computer science here as a fundamental science that, interacting with other scienti?c disciplines, changed and changes our view on the world, that contributes to our understanding of the fundamental concepts of science and that sheds new light on and brings new meaning to several of these concepts. We show that computer science is a discipline that discovers spectacular, unexpected facts, that ?nds ways out in seemingly unsolvable s- uations, and that can do true wonders. The message of this book is that computer science is a fascinating research area with a big impact on the real world, full of spectacular ideas and great ch- lenges. It is an integral part of science and engineering with an above-average dynamic over the last 30 years and a high degree of interdisciplinarity. The goal of this book is not typical for popular science writing, whichoftenrestrictsitselftooutliningtheimportanceofaresearch area. Whenever possible we strive to bring full understanding of the concepts and results presented.
R 1,569.16

Network Algorithmics
In designing a network device, you make dozens of decisions that affect the speed with which it will perform—sometimes for better, but sometimes for worse. Network Algorithmics provides a complete, coherent methodology for maximizing speed while meeting your other design goals. Author George Varghese begins by laying out the implementation bottlenecks that are most often encountered at four disparate levels of implementation: protocol, OS, hardware, and architecture. He then derives 15 solid principles—ranging from the commonly recognized to the groundbreaking—that are key to breaking these bottlenecks. The rest of the book is devoted to a systematic application of these principles to bottlenecks found specifically in endnodes, interconnect devices, and specialty functions such as security and measurement that can be located anywhere along the network. This immensely practical, clearly presented information will benefit anyone involved with network implementation, as well as students who have made this work their goal. FOR INSTRUCTORS: To obtain access to the solutions manual for this title simply register on our textbook website (textbooks.elsevier.com)and request access to the Computer Science subject area. Once approved (usually within one business day) you will be able to access all of the instructor-only materials through the "Instructor Manual" link on this book's academic web page at textbooks.elsevier.com.
R 2,618.00
















































