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

R 443.00

R 519.00

Algorithms and Data Structures
This book constitutes the refereed proceedings of the 10th International Workshop on Algorithms and Data Structures, WADS 2007, held in Halifax, Canada, in August 2007. The papers present original research on the theory and application of algorithms and data structures in all areas, including combinatorics, computational geometry, databases, graphics, parallel and distributed computing.
R 3,099.49


R 1,525.65

Quantum Algorithms for Cryptographically Significant Boolean Functions
This book is a timely report of the state-of-the-art analytical techniques in the domain of quantum algorithms related to Boolean functions. It bridges the gap between recent developments in the area and the hands-on analysis of the spectral properties of Boolean functions from a cryptologic viewpoint. Topics covered in the book include Qubit, Deutsch–Jozsa and Walsh spectrum, Grover’s algorithm, Simon’s algorithm and autocorrelation spectrum. The book aims at encouraging readers to design and implement practical algorithms related to Boolean functions. Apart from combinatorial techniques, this book considers implementing related programs in a quantum computer. Researchers, practitioners and educators will find this book valuable.
R 2,369.70

Algorithmic Antitrust
Algorithms are ubiquitous in our daily lives. They affect the way we shop, interact, and make exchanges on the marketplace. In this regard, algorithms can also shape competition on the marketplace. Companies employ algorithms as technologically innovative tools in an effort to edge out competitors. Antitrust agencies have increasingly recognized the competitive benefits, but also competitive risks that algorithms entail. Over the last few years, many algorithm-driven companies in the digital economy have been investigated, prosecuted and fined, mostly for allegedly unfair algorithm design. Legislative proposals aim at regulating the way algorithms shape competition. Consequently, a so-called “algorithmic antitrust” theory and practice have also emerged. This book provides a more innovation-driven perspective on the way antitrust agencies should approach algorithmic antitrust. To date, the analysis of algorithmic antitrust has predominantly been shaped by pessimistic approaches to the risks of algorithms on the competitive environment. With the benefit of the lessons learned over the last few years, this book assesses whether these risks have actually materialized and whether antitrust laws need to be adapted accordingly. Effective algorithmic antitrust requires to adequately assess the pro- and anti-competitive effects of algorithms on the basis of concrete evidence and innovation-related concerns. With a particular emphasis on the European perspective, this book brings together experts and scrutinizes on the implications of algorithmic antitrust for regulation and innovation.
R 5,234.52

Algorithmic Aspects in Information and Management
This book constitutes the proceedings of the 16th International Conference on Algorithmic Aspects in Information and Management, AAIM 2022, which was held online during August 13-14, 2022. The conference was originally planned to take place in Guangzhou, China, but changed to a virtual event due to the COVID-19 pandemic.The 41 regular papers included in this book were carefully reviewed and selected from 59 submissions.
R 2,205.05

Algorithmic Language and Program Development
The title of this book contains the words ALGORITHMIC LANGUAGE, in the singular. This is meant to convey the idea that it deals not so much with the diversity of program ming languages, but rather with their commonalities. The task of formal program develop It allows classifying ment proved to be the ideal frame for demonstrating this unity. concepts and distinguishing fundamental notions from notational features; and it leads immediately to a systematic disposition. This approach is supported by didactic, practical, and theoretical considerations. The clarity of the structure of a programming language de signed according to the principles of program transformation is remarkable. Of course there are various notations for such a language. The notation used in this book is mainly oriented towards ALGOL 68, but is also strongly influenced by PASCAL - it could equally well have been the other way round. In the appendices there are occa sional references to the styles used in ALGOL, PASCAL, LISP, and elsewhere.
R 1,591.78

Frontiers in Algorithmics
This book constitutes the refereed proceedings of the Third International Frontiers of Algorithmics Workshop, FAW 2009, held in Hefei, Anhui, China, in June 2009. The 33 revised full papers presented together with the abstracts of 3 invited talks were carefully reviewed and selected from 87 submissions. The papers are organized in topical sections on graph algorithms; game theory with applications; graph theory, computational geometry; machine learning; parameterized algorithms, heuristics and analysis; approximation algorithms; as well as pattern recognition algorithms, large scale data mining.
R 1,570.63

R 458.00

Algorithms in Machine Learning Paradigms
This book presents studies involving algorithms in the machine learning paradigms. It discusses a variety of learning problems with diverse applications, including prediction, concept learning, explanation-based learning, case-based (exemplar-based) learning, statistical rule-based learning, feature extraction-based learning, optimization-based learning, quantum-inspired learning, multi-criteria-based learning and hybrid intelligence-based learning.
R 6,124.70


R 764.00

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

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

R 646.46


Algorithms for Graphics and Image Processing
The technological developments of the last ten years have made com puter graphics and image processing by computer popular. Pictorial pat tern recognition has also shown significant progress. Clearly, there exist overlapping interests among the three areas of research. Graphic displays are of concern to anyone involved in image processing or pic torial pattern recognition and many problems in graphics require methodologies from image processing for their solutions. The data structures used in all three areas are similar. It seems that there is a common body of knowledge underlying all three areas, pictorial informa tion processing by computer. The novelty of these fields makes it difficult to design a course or to a write a book covering their basic concepts. Some of the treatises on graphics focus on the hardware and methods of current interest while treatises on image processing often emphasize applications and classical signal processing. The fast evolution of technology causes such material to lose its relevance. For example, the development of optical fibers has reduced the importance of bandwidth compression.
R 3,064.65


Algorithmic Algebra and Number Theory
This book contains 22 lectures presented at the final conference of the Ger man research program (Schwerpunktprogramm) Algorithmic Number The ory and Algebra 1991-1997, sponsored by the Deutsche Forschungsgemein schaft. The purpose of this research program and of the meeting was to bring together developers of computer algebra software and researchers using com putational methods to gain insight into experimental problems and theoret ical questions in algebra and number theory. The book gives an overview on algorithmic methods and on results ob tained during this period. This includes survey articles on the main research projects within the program: • algorithmic number theory emphasizing class field theory, constructive Galois theory, computational aspects of modular forms and of Drinfeld modules • computational algebraic geometry including real quantifier elimination and real algebraic geometry, and invariant theory of finite groups • computational aspects of presentations and representations of groups, especially finite groups of Lie type and their Heeke algebras, and of the isomorphism problem in group theory. Some of the articles illustrate the current state of computer algebra sys tems and program packages developed with support by the research pro gram, such as KANT and LiDIA for algebraic number theory, SINGULAR, RED LOG and INVAR for commutative algebra and invariant theory respec tively, and GAP, SYSYPHOS and CHEVIE for group theory and representation theory.
R 4,296.76

Grundkurs Algorithmen und Datenstrukturen in JAVA
Dieses Lehrbuch für Ausbildung und Studium stellt die klassischen Informatik-Inhalte wie Sortieralgorithmen, Baumstrukturen, Komplexität, Rekursion und Algorithmenklassen bereit und wurde angepasst für die aktuelle Java-Version, wobei die verwendeten Neuerungen (Lambda-Ausdrücke, Ströme usw.) kurz erklärt werden. Vorteil des Buches sind die klare Ausrichtung an der Praxis und die Implementierung der Algorithmen in Java. Das Buch wurde für Studierende der Informatik im Haupt- oder Nebenfach entwickelt, ist aber auch für Schüler in Leistungskursen oder IT-Ausbildungsklassen geeignet. Die Themen werden verständlich behandelt und mit in Java formulierten, gut lesbaren Algorithmen dargestellt.
R 1,862.50

R 915.00

Models, Algorithms, Logics and Tools
This Festschrift is published in honor of Kim Guldstrand Larsen, one of the earliest precursors of computer science in Denmark, on the occasion of his 60th birthday. During the last three decades, Kim Guldstrand Larsen has given major contributions across a remarkably wide range of topics, including real-time, concurrent, and probabilistic models of computation, logic in computer science, and model checking. Since 1995, he has been one of the prime movers behind the model checking tool for real-time systems UPPAAL, for which he was a co-recipient of the CAV Award in 2013.The Festschrift contains 32 papers that feature the broad range of Kim Guldstrand Larsen's research topics, such as formal languages and automata theory; logic; verification, model checking and testing; algorithmic game theory and mechanism design; semantics and reasoning; real-time and distributed systems; and modeling and simulation.
R 2,235.17

Algorithms for Computational Biology
This book constitutes the proceedings of the 6th InternationalConference on Algorithms for Computational Biology, AlCoB 2019, held in Berkeley, CA, USA, in May 2019.The 15 full papers presented together with 1 invited paper were carefully reviewed and selected from 30 submissions. They are organized in the following topical sections: Biological networks and graph algorithms; genome rearrangement, assembly and classification; sequence analysis, phylogenetics and other biological processes.
R 2,546.28

Algorithmic Aspects of Machine Learning
This book bridges theoretical computer science and machine learning by exploring what the two sides can teach each other. It emphasizes the need for flexible, tractable models that better capture not what makes machine learning hard, but what makes it easy. Theoretical computer scientists will be introduced to important models in machine learning and to the main questions within the field. Machine learning researchers will be introduced to cutting-edge research in an accessible format, and gain familiarity with a modern, algorithmic toolkit, including the method of moments, tensor decompositions and convex programming relaxations. The treatment beyond worst-case analysis is to build a rigorous understanding about the approaches used in practice and to facilitate the discovery of exciting, new ways to solve important long-standing problems.
R 3,882.03

R 580.00

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


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 in Bioinformatics
This book constitutes the refereed proceedings of the 16th International Workshop on Algorithms in Bioinformatics, WABI 2016, held in Aarhus, Denmark. The 25 full papers together with 2 invited talks presented were carefully reviewed and selected from 54 submissions.The selected papers cover a wide range of topics from networks, tophylogenetic studies, sequence and genome analysis, comparative genomics, and mass spectrometry data analysis.
R 1,562.82

R 305.00



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


R 5,815.12

R 1,091.64

Guide to Distributed Algorithms
The study of distributed algorithms provides the needed background in many real-life applications, such as: distributed real-time systems, wireless sensor networks, mobile ad hoc networks and distributed databases.The main goal of Guide to Distributed Algorithms is to provide a detailed study of the design and analysis methods of distributed algorithms and to supply the implementations of most of the presented algorithms in Python language, which is the unique feature of the book not found in any other contemporary books on distributed computing.Topics and features:Presents comprehensive design methods for distributed algorithmsProvides detailed analysis for the algorithms presentedUses graph templates to demonstrate the working of algorithmsProvides working Python code for most of the algorithms presentedThis unique textbook/study manual can serve as a comprehensive manual of distributed algorithms for Computer Science and non-CS majors as well as practitioners of distributed algorithms in research projects.
R 2,564.00

Innovations in Data Methodologies and Computational Algorithms for Medical Applications
Innovations in Data Methodologies and Computational Algorithms for Medical Applications offers the most cutting edge research in the field, offering insights into case studies and methodologies from around the world. The text details the latest developments and will serve as a vital resource to practitioners and academics alike in the burgeoning field of medical applications of technologies. As security and privacy improve, Electronic Health Records and informatics in the medical field are becoming ubiquitous, and staying abreast of the latest information can be difficult. This volume serves as a reference handbook and theoretical framework for the future of the field.
R 9,474.29

Parallel Algorithm Derivation and Program Transformation
This book contains selected papers from the ONR Workshop on Parallel Algorithm Design and Program Transformation that took place at New York University, Courant Institute, from Aug. 30 to Sept. 1, 1991. The aim of the workshop was to bring together computer scientists in transformational programming and parallel algorithm design in order to encourage a sharing of ideas that might benefit both communities. It was hoped that exposurt: to algorithm design methods developed within the algorithm community would stimulate progress in software development for parallel architectures within the transformational community. It was also hoped that exposure to syntax directed methods and pragmatic programming concerns developed within the transformational community would encourage more realistic theoretical models of parallel architectures and more systematic and algebraic approaches to parallel algorithm design within the algorithm community. The workshop Organizers were Robert Paige, John Reif, and Ralph Wachter. The workshop was sponsored by the Office of Naval Research under grant number N00014-90-J-1421. There were 44 attendees, 28 presentations, and 5 system demonstrations. All attendees were invited to submit a paper for publication in the book. Each submitted paper was refereed by participants from the Workshop. The final decision on publication was made by the editors. There were several motivations for holding the workshop and for publishing papers contributed by its participants. Transformational programming and parallel computation are two emerging fields that may ultimately depend on each other for success.
R 4,646.37

Algorithms in Bioinformatics
This book constitutes the refereed proceedings of the 13th International Workshop on Algorithms in Bioinformatics, WABI 2013, held in Sophia Antipolis, France, in September 2013. WABI 2013 is one of seven workshops which, along with the European Symposium on Algorithms (ESA), constitute the ALGO annual meeting and highlights research in algorithmic work for bioinformatics, computational biology and systems biology. The goal is to present recent research results, including significant work-in-progress, and to identify and explore directions of future research. The 27 full papers presented were carefully reviewed and selected from 61 submissions. The papers cover all aspects of algorithms in bioinformatics, computational biology and systems biology.
R 2,188.88

Cultural Algorithms
This book covers the latest advances in Cultural Algorithms, their general framework, different variants, hybridized versions with other meta-heuristic and search techniques, and their applications. Cultural Algorithms are meta-heuristic numerical optimization techniques inspired by the bio-cultural evolutionary theory, in which both types of vertical and horizontal learning behaviors are modeled. The book includes well-briefed basics of optimization and theoretical backgrounds of Cultural Algorithms in its initial chapters and then discusses their applications in different branches of science and engineering. It provides detailed mathematical formulations and algorithmic pseudo-codes of hybridized, extended, and multi-population variants of cultural algorithms. The book will serve the research students, fellows, professors, and industry professionals to implement real-time applications of Cultural Algorithms.
R 7,326.00

Algorithmic Culture
Algorithmic Culture: How Big Data and Artificial Intelligence are Transforming Everyday Life explores the complex ways in which algorithms and big data, or algorithmic culture, are simultaneously reshaping everyday culture while perpetuating inequality and intersectional discrimination. Contributors situate issues of humanity, identity, and culture in relation to free will, surveillance, capitalism, neoliberalism, consumerism, solipsism, and creativity, offering a critique of the myriad constraints enacted by algorithms. This book argues that consumers are undergoing an ontological overhaul due to the enhanced manipulability and increasingly mandatory nature of algorithms in the market, while also positing that algorithms may help navigate through chaos that is intrinsically present in the market democracy. Ultimately, Algorithmic Culture calls attention to the present-day cultural landscape as a whole as it has been reconfigured and re-presented by algorithms.
R 3,531.00

Datenstrukturen und effiziente Algorithmen
Der Entwurf und die Analyse von Datenstrukturen und effizienten Algorithmen hat in den letzten Jahren große Bedeutung erlangt: Algorithmus ist der zentrale Begriff der Informatik und Effizienz bedeutet Geld. Ich habe den Stoff in drei Bände und neun Kapitel gegliedert. Band 1: Sortieren und Suchen (Kapitel I bis ill) Band 2: Graphenalgorithmen und NP-Vollständigkeit (Kapitel IV bis VI) Band 3: Mehrdimensionales Suchen und Algorithmische Geometrie (Kapitel VII und Vill), Algorithmische Paradigmen (Kapitel IX) Die Bände 2 und 3 haben Band 1 als gemeinsame Basis, sind aber voneinander un abhängig. Große Teile dieser Bände können ohne detaillierte Kenntnis von Band 1 gelesen werden; eine Kenntnis der algorithmischen Grundprinzipien, wie sie etwa in Kapitel I oder in vielen anderen Büchern über Datenstrukturen und Algorith men vermittelt werden, genügt. Die spezifischen Voraussetzungen für die Bände 2 und 3 sind in den jeweiligen Vorworten angegeben. In allen drei Bänden stellen wir wichtige effiziente Algorithmen für die grundlegenden Probleme in dem jeweiligen Gebiet vor und analysieren sie. Wir messen dabei Effizienz durch die Laufzeit auf einem realistischen Modell einer Rechenanlage, das wir in Kapitel I einführen. Die meisten der vorgestellten Algorithmen wurden erst in den letzten Jahren gefunden; die Informatik ist ja schließlich eine sehr junge Wissenschaft. Es gibt kaum Sätze in diesem Buch, die älter als 20 Jahre sind, und mindestens die Hälfte des Stoffes ist jünger als 10 Jahre. Ich habe stets versucht, den Leser bis an den Stand der Forschung heranzuführen.
R 2,484.81

R 611.00

R 489.00















































