Search results for "Data Structures and Algorithms in Java"
Items we need to order for you
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
Parallel Algorithms for Irregularly Structured Problems
This book constitutes the refereed proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems, IRREGULAR '96, held in Santa Barbara, California, in August 1996.The volume presents 28 revised full papers selected from 51 submissions; also included are one full invited paper by Torben Hagerup and abstracts of four other invited talks. The papers are organized in topical sections on sparse matrix problems, partitioning and domain composition, irregular applications, communication and synchronization, systems support, and mapping and load balancing.
R 1,568.42
Time Structures
The notion of time plays an important role in modern science. In computer science and artificial intelligence, the parameter of time is of particular importance, e.g. for planning robot activity, natural language processing, and time-varying scene analysis. This work investigates the relationship between classic, first-order theories of point- and interval-based time structures, modal logics of corresponding structures, and their algorithmic representations. To make this relationship complete, a formalisation of Allen's famous algorithm, applicable to various structures of time, is presented along with its translation to modal logics. All in all, the book is a competent and comprehensive analysis of logical descriptions and algorithmic representations of time structures.
R 1,549.76
Algorithms in Combinatorial Geometry
Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field.
R 3,060.38
Algorithms and Computation
This volume presents the proceedings of the fourth annualInternational Symposium on Algorithms and Computation, heldin Hong Kong in December 1993.Numerous selected paperspresent original research in such areas as design andanalysis of algorithms, computational complexity, and theoryof computation. Topics covered include:- automata, languages, and computability,- combinatorial, graph, geometric, and randomizedalgorithms,- networks and distributed algorithms,- VLSIand parallel algorithms,- theory of learning and robotics,- number theory and robotics.Three invited papers are also included.
R 3,081.39
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
Advances in Metaheuristic Algorithms for Optimal Design of Structures
This book presents efficient metaheuristic algorithms for optimal design of structures. Many of these algorithms are developed by the author and his graduate students, consisting of Particle Swarm Optimization, Charged System Search, Magnetic Charged System Search, Field of Forces Optimization, Democratic Particle Swarm Optimization, Dolphin Echolocation Optimization, Colliding Bodies Optimization, Ray Optimization. These are presented together with algorithms which are developed by other authors and have been successfully applied to various optimization problems. These consist of Partical Swarm Optimization, Big Band Big Crunch algorithm, Cuckoo Search Optimization, Imperialist Competitive Algorithm and Chaos Embedded Metaheuristic Algorithm. Finally a multi-objective Optimization is presented to Solve large scale structural problems based on the Charged System Search algorithm, In the second edition seven new chapters are added consisting of Enhance colliding bodies optimization, Global sensitivity analysis, Tug of War Optimization, Water evaporation optimization, Vibrating System Optimization and Cyclical Parthenogenesis Optimization algorithm. In the third edition, five new chapters are included consisting of the recently developed algorithms. These are Shuffled Shepherd Optimization Algorithm, Set Theoretical Shuffled Shepherd Optimization Algorithm, Set Theoretical Teaching-Learning-Based Optimization Algorithm, Thermal Exchange Metaheuristic Optimization Algorithm, and Water Strider Optimization Algorithm and Its Enhancement. The concepts and algorithm presented in this book are not only applicable to optimization of skeletal structure, finite element models, but can equally be utilized for optimal design of other systems such as hydraulic and electrical networks.
R 9,630.24
Algorithms
Algorithms: Technology, Culture, Politics develops a relational, situated approach to algorithms. It takes a middle ground between theories that give the algorithm a singular and stable meaning in using it as a central analytic category for contemporary society and theories that dissolve the term into the details of empirical studies.The book discusses algorithms in relation to hardware and material conditions, code, data, and subjects such as users, programmers, but also “data doubles”. The individual chapters bridge critical discussions on bias, exclusion, or responsibility with the necessary detail on the contemporary state of information technology. The examples include state of the art applications of machine learning, such as self-driving cars and large language models such as GPT.The book will be of interest for everyone engaging critically with algorithms, particularly in the social sciences, media studies, STS, political theory, or philosophy. With its broad scope it can serve as a high-level introduction that picks up and builds on more than two decades of critical research on algorithms.
R 2,467.71
Algorithms: A Top-down Approach
This comprehensive compendium provides a rigorous framework to tackle the daunting challenges of designing correct and efficient algorithms. It gives a uniform approach to the design, analysis, optimization, and verification of algorithms. The volume also provides essential tools to understand algorithms and their associated data structures.This useful reference text describes a way of thinking that eases the task of proving algorithm correctness. Working through a proof of correctness reveals an algorithm's subtleties in a way that a typical description does not. Algorithm analysis is presented using careful definitions that make the analyses mathematically rigorous.Related Link(s)
R 6,002.37
Java All-in-One For Dummies
A beginning coder’s resource for learning the most popular coding language With Java All-in-One For Dummies, you get 8 books in one, for the most well-rounded Java knowledge on the market. Updated for Java 19, this book includes all the major changes to the programming language, so you won’t fall behind. Start by learning the basics of Java—you can do it, even if you’ve never written a line of code in your life. Then go in-depth, with all the info you need on object-oriented programming, Java FX, Java web development, and beyond. Grab a hot cup of java and settle in to learn some Java, with friendly For Dummies guidance! Learn the basics of computer programming and get started with the Java languageMaster strings, arrays, and collectionsDiscover the most recent Java updates and the latest in programming techniquesLaunch or further your career as a coder with easy-to-follow instructionThis is the go-to Dummies guide for future and current coders who need an all-inclusive guide Java to take their knowledge to the next level.
R 1,082.00
Algorithms in Bioinformatics
We are pleased to present the proceedings of the Second Workshop on Al- rithms in Bioinformatics (WABI 2002), which took place on September 17-21, 2002 in Rome, Italy. The WABI workshop was part of a three-conference me- ing, which, in addition to WABI, included the ESA and APPROX 2002. The three conferences are jointly called ALGO 2002, and were hosted by the F- ulty of Engineering, University of Rome “La Sapienza”. Seehttp://www.dis. uniroma1.it/˜algo02 for more details. The Workshop on Algorithms in Bioinformatics covers research in all areas of algorithmic work in bioinformatics and computational biology. The emphasis is on discrete algorithms that address important problems in molecular biology, genomics,andgenetics,thatarefoundedonsoundmodels,thatarecomputati- ally e?cient, and that have been implemented and tested in simulations and on real datasets. The goal is to present recent research results, including signi?cant work in progress, and to identify and explore directions of future research. Original research papers (including signi?cant work in progress) or sta- of-the-art surveys were solicited on all aspects of algorithms in bioinformatics, including, but not limited to: exact and approximate algorithms for genomics, genetics, sequence analysis, gene and signal recognition, alignment, molecular evolution, phylogenetics, structure determination or prediction, gene expression and gene networks, proteomics, functional genomics, and drug design.
R 4,654.68
Algorithms and Computation
This volume contains the proceedings of the 21st Annual International S- posium on Algorithms and Computations (ISAAC 2010), held in Jeju, Korea during December 15-17, 2010. Past editions have been held in Tokyo, Taipei, Nagoya,HongKong,Beijing,Cairns,Osaka,Singapore,Taejon,Chennai,Taipei, Christchurch, Vancouver, Kyoto, Hong Kong, Hainan, Kolkata, Sendai, Gold Coast, and Hawaii over the years 1990-2009. ISAACis anannualinternationalsymposiumthatcoversthe verywide range of topics in algorithms and computation. The main purpose of the symposium is to provide a forum for researchers working in algorithms and the theory of computation where they can exchange ideas in this active research community. In response to the call for papers, ISAAC 2010 received 182 papers. Each submission was reviewed by at least three Program Committee members with the assistance of external referees. Since there were many high-quality papers, the Program Committee's task was extremely di?cult. Through an extensive discussion, the Program Committee accepted 77 of the submissions to be p- sented at the conference.Two special issues, one of Algorithmica and one of the International Journal of Computational Geometry and Applications,were prepared with selected papers from ISAAC 2010. The best paper award was given to "From Holant to #CSP and Back: c DichotomyforHolant Problems"byJin-YiCai,SangxiaHuangandPinyanLu, and the best student paper award to "Satis?ability with Index Dependency" by Hongyu Liang and Jing He. Two eminent invited speakers,David Eppstein from UniversityofCalifornia,Irvine,andMattFranklinfromUniversityofCalifornia, Davis, also contributed to this volume.
R 3,993.00
How to Think about Algorithms
Understand algorithms and their design with this revised student-friendly textbook. Unlike other algorithms books, this one is approachable, the methods it explains are straightforward, and the insights it provides are numerous and valuable. Without grinding through lots of formal proof, students will benefit from step-by-step methods for developing algorithms, expert guidance on common pitfalls, and an appreciation of the bigger picture. Revised and updated, this second edition includes a new chapter on machine learning algorithms, and concise key concept summaries at the end of each part for quick reference. Also new to this edition are more than 150 new exercises: selected solutions are included to let students check their progress, while a full solutions manual is available online for instructors. No other text explains complex topics such as loop invariants as clearly, helping students to think abstractly and preparing them for creating their own innovative ways to solve problems.
R 5,932.56
Stochastic Algorithms: Foundations and Applications
The second Symposium on Stochastic Algorithms, Foundations and Applications (SAGA 2003),took place on September 22-23,2003, in Hat?eld, England.The present volume comprises 12 contributed papers and 3 invited talks. The contributed papers included in the proceedings present results in the following areas: ant colony optimization; randomized algorithmsfor the intersection problem; - cal search for constraint satisfaction problems; randomized local search methods for combinatorial optimization, in particular, simulated annealing techniques; probabilistic global search algorithms; network communication complexity; open shop scheduling; aircraft routing; traf?c control; randomized straight-line programs; and stochastic - tomata and probabilistic transformations. TheinvitedtalkbyRolandKirschnerprovidesabriefintroductiontoquantuminf- matics. The requirements and the prospects of the physical implementation of a qu- tum computer are addressed. Lucila Ohno-Machado and Winston P.Kuo describe the factors that make the an- ysis of high-throughput gene expression data especially challenging, and indicate why properly evaluated stochastic algorithms can play a particularly important role in this process. John Vaccaro et al. review a fundamental element of quantum information theory, source coding, which entails the compression of quantum data. A recent experiment that demonstrates this fundamental principle is presented and discussed. Our special thanks go to all who supported SAGA 2003, to all authors who subm- ted papers, to the members of the program committee, to the invited speakers, and to the members of the organizing committee. Andreas Albrecht Kathleen Steinhofel .. Organization SAGA2003wasorganizedbytheUniversityofHertfordshire,DepartmentofComputer Science, Hat?eld, Hertfordshire AL10 9AB, United Kingdom.
R 1,537.57
Nested algorithms for optimal reservoir operation and their embedding in a decision support platform
Reservoir operation is a multi-objective optimization problem, and is traditionally solved with dynamic programming (DP) and stochastic dynamic programming (SDP) algorithms. The thesis presents novel algorithms for optimal reservoir operation, named nested DP (nDP), nested SDP (nSDP), nested reinforcement learning (nRL) and their multi-objective (MO) variants, correspondingly MOnDP, MOnSDP and MOnRL. The idea is to include a nested optimization algorithm into each state transition, which reduces the initial problem dimension and alleviates the curse of dimensionality. These algorithms can solve multi-objective optimization problems, without significantly increasing the algorithm complexity or the computational expenses. It can additionally handle dense and irregular variable discretization. All algorithms are coded in Java and were tested on the case study of the Knezevo reservoir in the Republic of Macedonia. Nested optimization algorithms are embedded in a cloud application platform for water resources modeling and optimization. The platform is available 24/7, accessible from everywhere, scalable, distributed, interoperable, and it creates a real-time multiuser collaboration platform.This thesis contributes with new and more powerful algorithms for an optimal reservoir operation and cloud application platform. All source codes are available for public use and can be used by researchers and practitioners to further advance the mentioned areas.
R 10,263.45
Wireless Algorithms, Systems, and Applications
The three-volume set constitutes the proceedings of the 17th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2022, which was held during October 28-30, 2022. The conference took place in Dalian, China.The 95 full and 62 short papers presented in these proceedings were carefully reviewed and selected from 265 submissions. The contributions in algorithms, systems; and applications of internet of things;information processing and data management;radar and sonar networks
R 4,334.80
Advances in Metaheuristic Algorithms for Optimal Design of Structures
This book presents efficient metaheuristic algorithms for optimal design of structures. Many of these algorithms are developed by the author and his graduate students, consisting of Particle Swarm Optimization, Charged System Search, Magnetic Charged System Search, Field of Forces Optimization, Democratic Particle Swarm Optimization, Dolphin Echolocation Optimization, Colliding Bodies Optimization, Ray Optimization. These are presented together with algorithms which are developed by other authors and have been successfully applied to various optimization problems. These consist of Partical Swarm Optimization, Big Band Big Crunch algorithm, Cuckoo Search Optimization, Imperialist Competitive Algorithm and Chaos Embedded Metaheuristic Algorithm. Finally a multi-objective Optimization is presented to Solve large scale structural problems based on the Charged System Search algorithm, In the second edition seven new chapters are added consisting of Enhance colliding bodies optimization, Global sensitivity analysis, Tug of War Optimization, Water evaporation optimization, Vibrating System Optimization and Cyclical Parthenogenesis Optimization algorithm. In the third edition, five new chapters are included consisting of the recently developed algorithms. These are Shuffled Shepherd Optimization Algorithm, Set Theoretical Shuffled Shepherd Optimization Algorithm, Set Theoretical Teaching-Learning-Based Optimization Algorithm, Thermal Exchange Metaheuristic Optimization Algorithm, and Water Strider Optimization Algorithm and Its Enhancement. The concepts and algorithm presented in this book are not only applicable to optimization of skeletal structure, finite element models, but can equally be utilized for optimal design of other systems such as hydraulic and electrical networks.
R 10,658.02
Algorithms in Bioinformatics
The refereed proceedings from the 7th International Workshop on Algorithms in Bioinformatics are provided in this volume. Papers address current issues in algorithms in bioinformatics, ranging from mathematical tools to experimental studies of approximation algorithms to significant computational analyses. Biological problems examined include genetic mapping, sequence alignment and analysis, phylogeny, comparative genomics, and protein structure.
R 1,580.46
R 1,238.00
Multiobjective Genetic Algorithms for Clustering
This is the first book primarily dedicated to clustering using multiobjective genetic algorithms with extensive real-life applications in data mining and bioinformatics. The authors first offer detailed introductions to the relevant techniques – genetic algorithms, multiobjective optimization, soft computing, data mining and bioinformatics. They then demonstrate systematic applications of these techniques to real-world problems in the areas of data mining, bioinformatics and geoscience. The authors offer detailed theoretical and statistical notes, guides to future research, and chapter summaries.The book can be used as a textbook and as a reference book by graduate students and academic and industrial researchers in the areas of soft computing, data mining, bioinformatics and geoscience.
R 2,015.00
Algorithms and Computations
This book presents the refereed proceedings of the 6th International Symposium on Algorithms and Computation, ISAAC '95, held in Cairns, Australia, in December 1995.The 45 revised full papers presented together with the abstracts of three invited talks were selected from a total of 130 submissions. The papers address many current aspects of research and advanced applications of algorithms and computations; among the topics covered are graph theory and graph algorithms, computational geometry, computational logics, searching and sorting, approximation and optimization, algebraic manipulation, and coding.
R 1,582.83
Algorithms
An accessible introduction to algorithms, explaining not just what they are but how they work, with examples from a wide range of application areas.Digital technology runs on algorithms, sets of instructions that describe how to do something efficiently. Application areas range from search engines to tournament scheduling, DNA sequencing, and machine learning. Arguing that every educated person today needs to have some understanding of algorithms and what they do, in this volume in the MIT Press Essential Knowledge series, Panos Louridas offers an introduction to algorithms that is accessible to the nonspecialist reader. Louridas explains not just what algorithms are but also how they work, offering a wide range of examples and keeping mathematics to a minimum. After discussing what an algorithm does and how its effectiveness can be measured, Louridas covers three of the most fundamental applications areas: graphs, which describe networks, from eighteenth-century problems to today's social networks; searching, and how to find the fastest way to search; and sorting, and the importance of choosing the best algorithm for particular tasks. He then presents larger-scale applications: PageRank, Google's founding algorithm; and neural networks and deep learning. Finally, Louridas describes how all algorithms are nothing more than simple moves with pen and paper, and how from such a humble foundation rise all their spectacular achievements.
R 387.00
Parallel Architectures, Algorithms and Programming
This book constitutes the refereed proceedings of the 10th International Symposium on Parallel Architectures, Algorithms and Programming, PAAP 2019, held in Guangzhou, China, in December 2019.The 39 revised full papers and 8 revised short papers presented were carefully reviewed and selected from 121 submissions. The papers deal with research results and development activities in all aspects of parallel architectures, algorithms and programming techniques.
R 1,600.01
Algorithms and Complexity
The papers in this volume were presented at the SecondItalian Conference onAlgorithms and Complexity, held inFebruary 1994 in Rome. This biannual conference series isintended to present research contributions in theory andapplications of sequential, parallel, and distributedalgorithms, data structures, and computational complexity.The volume contains four invited presentations and 14regular presentations selected from 32 submissions, each ofwhich was evaluated by at least four program committeemembers. The invited presentations are by J. Hartmanis andS. Chari, A. Garg and R. Tamassia, S.C. Sahinalp and U.Vishkin, and M. Yannakakis.
R 1,546.52
Wireless Algorithms, Systems, and Applications
The three-volume set constitutes the proceedings of the 16th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2021, which was held during June 25-27, 2021. The conference took place in Nanjing, China.The 103 full and 57 short papers presented in these proceedings were carefully reviewed and selected from 315 submissions. The contributions in Part II of the set are subdivided into the following topical sections: Scheduling & Optimization II; Security; Data Center Networks and Cloud Computing; Privacy-Aware Computing; Internet of Vehicles; Visual Computing for IoT; Mobile Ad-Hoc Networks.
R 4,330.85
R 2,060.00
Design Patterns and Best Practices in Java
Create various design patterns to master the art of solving problems using Java Key Features This book demonstrates the shift from OOP to functional programming and covers reactive and functional patterns in a clear and step-by-step manner All the design patterns come with a practical use case as part of the explanation, which will improve your productivity Tackle all kinds of performance-related issues and streamline your developmentBook DescriptionHaving a knowledge of design patterns enables you, as a developer, to improve your code base, promote code reuse, and make the architecture more robust. As languages evolve, new features take time to fully understand before they are adopted en masse. The mission of this book is to ease the adoption of the latest trends and provide good practices for programmers.We focus on showing you the practical aspects of smarter coding in Java. We'll start off by going over object-oriented (OOP) and functional programming (FP) paradigms, moving on to describe the most frequently used design patterns in their classical format and explain how Java’s functional programming features are changing them.You will learn to enhance implementations by mixing OOP and FP, and finally get to know about the reactive programming model, where FP and OOP are used in conjunction with a view to writing better code. Gradually, the book will show you the latest trends in architecture, moving from MVC to microservices and serverless architecture. We will finish off by highlighting the new Java features and best practices. By the end of the book, you will be able to efficiently address common problems faced while developing applications and be comfortable working on scalable and maintainable projects of any size.What you will learn Understand the OOP and FP paradigms Explore the traditional Java design patterns Get to know the new functional features of Java See how design patterns are changed and affected by the new features Discover what reactive programming is and why is it the natural augmentation of FP Work with reactive design patterns and find the best ways to solve common problems using them See the latest trends in architecture and the shift from MVC to serverless applications Use best practices when working with the new featuresWho this book is forThis book is for those who are familiar with Java development and want to be in the driver’s seat when it comes to modern development techniques. Basic OOP Java programming experience and elementary familiarity with Java is expected.
R 1,661.00
Algorithms and Architectures for Parallel Processing
This two volume set LNCS 8630 and 8631 constitutes the proceedings of the 14th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2014, held in Dalian, China, in August 2014. The 70 revised papers presented in the two volumes were selected from 285 submissions. The first volume comprises selected papers of the main conference and papers of the 1st International Workshop on Emerging Topics in Wireless and Mobile Computing, ETWMC 2014, the 5th International Workshop on Intelligent Communication Networks, IntelNet 2014, and the 5th International Workshop on Wireless Networks and Multimedia, WNM 2014. The second volume comprises selected papers of the main conference and papers of the Workshop on Computing, Communication and Control Technologies in Intelligent Transportation System, 3C in ITS 2014, and the Workshop on Security and Privacy in Computer and Network Systems, SPCNS 2014.
R 1,623.38
Algorithms and Computation
This book constitutes the refereed proceedings of the 7th International Symposium on Algorithms and Computation, ISAAC'96, held in Osaka, Japan, in December 1996.The 43 revised full papers were selected from a total of 119 submissions; also included are an abstract of one invited talk and a full version of a second. Among the topics covered are computational geometry, graph theory, graph algorithms, combinatorial optimization, searching and sorting, networking, scheduling, and coding and cryptology.
R 1,583.55
Combinatorial Algorithms
This book constitutes the refereed post-conference proceedings of the 29th International Workshop on Combinatorial Algorithms, IWOCA 2018, held in Singapore, Singapore, in July 2018. The 31 regular papers presented in this volume were carefully reviewed and selected from 69 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 randomised algorithms, algorithms for big data analytics, and new paradigms of computation.
R 2,191.38
Design and Analysis of Randomized Algorithms
Systematically teaches key paradigmic algorithm design methodsProvides a deep insight into randomization
R 1,689.45
Algorithms and Architectures for Parallel Processing
This fourvolume set LNCS 9528, 9529, 9530 and 9531 constitutes the refereed proceedingsof the 15th International Conference on Algorithms and Architectures for ParallelProcessing, ICA3PP 2015, held in Zhangjiajie, China, in November 2015.The 219revised full papers presented together with 77 workshop papers in these fourvolumes were carefully reviewed and selected from 807 submissions (602 fullpapers and 205 workshop papers). The first volume comprises the followingtopics: parallel and distributed architectures; distributed and network-basedcomputing and internet of things and cyber-physical-social computing. Thesecond volume comprises topics such as big data and its applications andparallel and distributed algorithms. The topics of the third volume are:applications of parallel and distributed computing and service dependabilityand security in distributed and parallel systems. The covered topics of the fourthvolume are: software systems and programming models and performance modelingand evaluation.
R 2,270.58
R 168.00
Algorithmic Aspects in Information and Management
This book constitutes the refereed proceedings of the Third International Conference on Algorithmic Aspects in Information and Management, AAIM 2007, held in Portland, OR, USA in June 2007.It covers graph algorithms, combinatorics, scheduling, graph theory, network algorithms, game theory, option theory, computational geometry, graph theory and combinatorics, as well as networks and data.
R 1,579.58
Map Construction Algorithms
The book provides an overview of the state-of-the-art of map construction algorithms, which use tracking data in the form of trajectories to generate vector maps. The most common trajectory type is GPS-based trajectories. It introduces three emerging algorithmic categories, outlines their general algorithmic ideas, and discusses three representative algorithms in greater detail. To quantify map construction algorithms, the authors include specific datasets and evaluation measures. The datasets, source code of map construction algorithms and evaluation measures are publicly available on http://www.mapconstruction.org. The web site serves as a repository for map construction data and algorithms and researchers can contribute by uploading their own code and benchmark data.Map Construction Algorithms is an excellent resource for professionals working in computational geometry, spatial databases, and GIS. Advanced-level students studying computer science, geography and mathematics will also find this book a useful tool.
R 2,147.00
Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes
As the demand for data reliability increases, coding for error control becomes increasingly important in data transmission systems and has become an integral part of almost all data communication system designs. In recent years, various trellis-based soft-decoding algorithms for linear block codes have been devised. New ideas developed in the study of trellis structure of block codes can be used for improving decoding and analyzing the trellis complexity of convolutional codes. These recent developments provide practicing communication engineers with more choices when designing error control systems. Trellises and Trellis-based Decoding Algorithms for Linear Block Codes combines trellises and trellis-based decoding algorithms for linear codes together in a simple and unified form. The approach is to explain the material in an easily understood manner with minimal mathematical rigor. Trellises and Trellis-based Decoding Algorithms for Linear Block Codes is intended for practicing communication engineers who want to have a fast grasp and understanding of the subject. Only material considered essential and useful for practical applications is included. This book can also be used as a text for advanced courses on the subject.
R 4,655.02
Introduction to Parallel Algorithms
Parallel algorithms Made Easy The complexity of today's applications coupled with the widespread use of parallel computing has made the design and analysis of parallel algorithms topics of growing interest. This volume fills a need in the field for an introductory treatment of parallel algorithms-appropriate even at the undergraduate level, where no other textbooks on the subject exist. It features a systematic approach to the latest design techniques, providing analysis and implementation details for each parallel algorithm described in the book. Introduction to Parallel Algorithms covers foundations of parallel computing; parallel algorithms for trees and graphs; parallel algorithms for sorting, searching, and merging; and numerical algorithms. This remarkable book: * Presents basic concepts in clear and simple terms * Incorporates numerous examples to enhance students' understanding * Shows how to develop parallel algorithms for all classical problems in computer science, mathematics, and engineering * Employs extensive illustrations of new design techniques * Discusses parallel algorithms in the context of PRAM model * Includes end-of-chapter exercises and detailed references on parallel computing. This book enables universities to offer parallel algorithm courses at the senior undergraduate level in computer science and engineering. It is also an invaluable text/reference for graduate students, scientists, and engineers in computer science, mathematics, and engineering.
R 6,772.00
Bio-inspired Algorithms for Data Streaming and Visualization, Big Data Management, and Fog Computing
This book aims to provide some insights into recently developed bio-inspired algorithms within recent emerging trends of fog computing, sentiment analysis, and data streaming as well as to provide a more comprehensive approach to the big data management from pre-processing to analytics to visualization phases. The subject area of this book is within the realm of computer science, notably algorithms (meta-heuristic and, more particularly, bio-inspired algorithms). Although application domains of these new algorithms may be mentioned, the scope of this book is not on the application of algorithms to specific or general domains but to provide an update on recent research trends for bio-inspired algorithms within a specific application domain or emerging area. These areas include data streaming, fog computing, and phases of big data management. One of the reasons for writing this book is that the bio-inspired approach does not receive much attention but shows considerable promise and diversity in terms of approach of many issues in big data and streaming. Some novel approaches of this book are the use of these algorithms to all phases of data management (not just a particular phase such as data mining or business intelligence as many books focus on); effective demonstration of the effectiveness of a selected algorithm within a chapter against comparative algorithms using the experimental method. Another novel approach is a brief overview and evaluation of traditional algorithms, both sequential and parallel, for use in data mining, in order to provide an overview of existing algorithms in use. This overview complements a further chapter on bio-inspired algorithms for data mining to enable readers to make a more suitable choice of algorithm for data mining within a particular context. In all chapters, references for further reading are provided, and in selected chapters, the author also include ideas for future research.
R 5,417.17
Genetic Algorithms and Genetic Programming
Genetic Algorithms and Genetic Programming: Modern Concepts and Practical Applications discusses algorithmic developments in the context of genetic algorithms (GAs) and genetic programming (GP). It applies the algorithms to significant combinatorial optimization problems and describes structure identification using HeuristicLab as a platform for algorithm development.The book focuses on both theoretical and empirical aspects. The theoretical sections explore the important and characteristic properties of the basic GA as well as main characteristics of the selected algorithmic extensions developed by the authors. In the empirical parts of the text, the authors apply GAs to two combinatorial optimization problems: the traveling salesman and capacitated vehicle routing problems. To highlight the properties of the algorithmic measures in the field of GP, they analyze GP-based nonlinear structure identification applied to time series and classification problems. Written by core members of the HeuristicLab team, this book provides a better understanding of the basic workflow of GAs and GP, encouraging readers to establish new bionic, problem-independent theoretical concepts. By comparing the results of standard GA and GP implementation with several algorithmic extensions, it also shows how to substantially increase achievable solution quality.
R 4,357.08
Algorithms and Computation
This volume contains the proceedings of the 15th Annual International Sym- sium on Algorithms and Computation (ISAAC 2004), held in Hong Kong, 20–22 December, 2004. In the past, it has been held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Taejon (1998), Chennai (1999), Taipei (2000), Christchurch (2001), Vancouver (2002), and Kyoto (2003). ISAAC is an annual international symposium that covers a wide range of topics,namelyalgorithmsandcomputation.Themainpurposeofthesymposium is to provide a forum for researchers working in the active research community of algorithms and the theory of computation to present and exchange new ideas. In response to our call for papers we received 226 submissions. The task of selectingthepapersinthisvolumewasdonebyourprogramcommitteeandother referees. After a thorough review process the committee selected 76 papers, the decisions being based on originality and relevance to the ?eld of algorithms and computation. We hope all accepted papers will eventually appear in scienti?c journals in a more polished form. Two special issues, one of Algorithmica and one of the International Journal of Computational Geometry and Applications, with selected papers from ISAAC 2004 are in preparation. Thebeststudentpaperawardwillbegivenfor“Geometricoptimizationpr- lems over sliding windows” by Bashir S. Sadjad and Timothy M. Chan from the University of Waterloo. Two eminent invited speakers, Prof. Erik D. Demaine, MIT, and Prof. David M. Mount, University of Maryland, also contributed to this volume.
R 4,030.00
Algorithms – ESA 2013
This book constitutes the refereed proceedings of the 21st Annual European Symposium on Algorithms, ESA 2013, held in Sophia Antipolis, France, in September 2013 in the context of the combined conference ALGO 2013. The 69 revised full papers presented were carefully reviewed and selected from 303 initial submissions: 53 out of 229 in track "Design and Analysis" and 16 out of 74 in track "Engineering and Applications". The papers in this book present original research in all areas of algorithmic research, including but not limited to: algorithm engineering; algorithmic aspects of networks; algorithmic game theory; approximation algorithms; computational biology; computational finance; computational geometry; combinatorial optimization; data compression; data structures; databases and information retrieval; distributed and parallel computing; graph algorithms; hierarchical memories; heuristics and meta-heuristics; mathematical programming; mobile computing; on-line algorithms; parameterized complexity; pattern matching; quantum computing; randomized algorithms; scheduling and resource allocation problems; streaming algorithms.
R 2,262.34
Mathematics of Discrete Structures for Computer Science
Mathematics plays a key role in computer science, some researchers would consider computers as nothing but the physical embodiment of mathematical systems. And whether you are designing a digital circuit, a computer program or a new programming language, you need mathematics to be able to reason about the design -- its correctness, robustness and dependability. This book covers the foundational mathematics necessary for courses in computer science.The common approach to presenting mathematical concepts and operators is to define them in terms of properties they satisfy, and then based on these definitions develop ways of computing the result of applying the operators and prove them correct. This book is mainly written for computer science students, so here the author takes a different approach: he starts by defining ways of calculating the results of applying the operators and then proves that they satisfy various properties. After justifying his underlying approach the author offers detailed chapters covering propositional logic, predicate calculus, sets, relations, discrete structures, structured types, numbers, and reasoning about programs.The book contains chapter and section summaries, detailed proofs and many end-of-section exercises -- key to the learning process. The book is suitable for undergraduate and graduate students, and although the treatment focuses on areas with frequent applications in computer science, the book is also suitable for students of mathematics and engineering.
R 1,557.97
R 1,407.10
Foundations and Methods in Combinatorial and Statistical Data Analysis and Clustering
This book offers an original and broad exploration of the fundamental methods in Clustering and Combinatorial Data Analysis, presenting new formulations and ideas within this very active field. With extensive introductions, formal and mathematical developments and real case studies, this book provides readers with a deeper understanding of the mutual relationships between these methods, which are clearly expressed with respect to three facets: logical, combinatorial and statistical. Using relational mathematical representation, all types of data structures can be handled in precise and unified ways which the author highlights in three stages:Clustering a set of descriptive attributesClustering a set of objects or a set of object categories Establishing correspondence between these two dual clusterings Tools for interpreting the reasons of a given cluster or clustering are also included.Foundations and Methods in Combinatorial and Statistical Data Analysis and Clustering will be a valuable resource for students and researchers who are interested in the areas of Data Analysis, Clustering, Data Mining and Knowledge Discovery.
R 4,713.36
Frontiers in Algorithmics
This book constitutes the refereed proceedings of the First Annual International Frontiers of Algorithmics Workshop, FAW 2007, held in Lanzhou, China in August 2007. Topics covered in the papers include bioinformatics, discrete structures, geometric information processing and communication, games and incentive analysis, graph algorithms, internet algorithms and protocols, and algorithms in medical applications.
R 1,566.81
Algorithms and Architectures for Parallel Processing
This book constitutes the refereed proceedings of theWorkshops and Symposiums of the 15th International Conference on Algorithms andArchitectures for Parallel Processing, ICA3PP 2015, held in Zhangjiajie, China,in November 2015.The program of this year consists of 6symposiums/workshops that cover a wide range of research topics on parallelprocessing technology: the Sixth International Workshop on Trust, Security andPrivacy for Big Data, TrustData 2015; the Fifth International Symposium onTrust, Security and Privacy for Emerging Applications, TSP 2015; the ThirdInternational Workshop on Network Optimization and Performance Evaluation, NOPE2015; the Second International Symposium on Sensor-Cloud Systems, SCS 2015; theSecond International Workshop on Security and Privacy Protection in Computerand Network Systems, SPPCN 2015; and the First International Symposium onDependability in Sensor, Cloud, and Big Data Systems and Applications,DependSys 2015.The aim of these symposiums/workshops is to provide aforum to bring together practitioners and researchers from academia andindustry for discussion and presentations on the current research and futuredirections related to parallel processing technology. The themes and topics ofthese symposiums/workshops are a valuable complement to the overall scope ofICA3PP 2015 and give additional values and interests.
R 4,371.11
