Search results for "Data Structures and Algorithms in Java"
Items we need to order for you
R 916.00
Algorithms And Complexity - Proceedings Of The First Italian Conference
This proceedings contains contributions on topics such as the models of computation, analysis and design of sequential and parallel algorithms, data structures and their applications, approximating algorithms and probabilistic analysis, and computational complexity.
R 3,590.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
Evolutionary Algorithms
This IMA Volume in Mathematics and its Applications EVOLUTIONARY ALGORITHMS is based on the proceedings of a workshop that was an integral part of the 1996-97 IMA program on "MATHEMATICS IN HIGH-PERFORMANCE COMPUTING." I thank Lawrence David Davis (Tica Associates), Kenneth De Jong (Computer Science, George Mason University), Michael D. Vose (Computer Science, The University of Tennessee), and L. Darrell Whitley (Computer Science, Colorado State University) for their excellent work in organizing the workshop and for editing the proceedings. Further appreciation is ex tended to Donald G. Truhlar (Chemistry and Supercomputing Institute, University of Minnesota) who was also one of the workshop organizers. In addition, I also take this opportunity to thank the National Science Foundation (NSF), Minnesota Supercomputing Institute (MSI), and the Army Research Office (ARO), whose financial support made the workshop possible. Willard Miller, Jr., Professor and Director v PREFACE The IMA Workshop on Evolutionary Algorithms brought together many of the top researchers working in the area of Evolutionary Com putation for a week of intensive interaction. The field of Evolutionary Computation has developed significantly over the past 30 years and today consists a variety of subfields such as genetic algorithms, evolution strate gies, evolutionary programming, and genetic programming, each with their own algorithmic perspectives and goals.
R 1,559.31
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
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,280.05
Parallel Iterative Algorithms
Focusing on grid computing and asynchronism, Parallel Iterative Algorithms explores the theoretical and practical aspects of parallel numerical algorithms. Each chapter contains a theoretical discussion of the topic, an algorithmic section that fully details implementation examples and specific algorithms, and an evaluation of the advantages and drawbacks of the algorithms. Several exercises also appear at the end of most chapters.The first two chapters introduce the general features of sequential iterative algorithms and their applications to numerical problems. The book then describes different kinds of parallel systems and parallel iterative algorithms. It goes on to address both linear and nonlinear parallel synchronous and asynchronous iterative algorithms for numerical computation, with an emphasis on the multisplitting approach. The final chapter discusses the features required for efficient implementation of asynchronous iterative algorithms.Providing the theoretical and practical knowledge needed to design and implement efficient parallel iterative algorithms, this book illustrates how to apply these algorithms to solve linear and nonlinear numerical problems in parallel environments, including local, distant, homogeneous, and heterogeneous clusters.
R 9,308.95
Evolutionary and Swarm Intelligence Algorithms
This book is a delight for academics, researchers and professionals working in evolutionary and swarm computing, computational intelligence, machine learning and engineering design, as well as search and optimization in general. It provides an introduction to the design and development of a number of popular and recent swarm and evolutionary algorithms with a focus on their applications in engineering problems in diverse domains. The topics discussed include particle swarm optimization, the artificial bee colony algorithm, Spider Monkey optimization algorithm, genetic algorithms, constrained multi-objective evolutionary algorithms, genetic programming, and evolutionary fuzzy systems. A friendly and informative treatment of the topics makes this book an ideal reference for beginners and those with experience alike.
R 6,822.61
Computing in Cause-Effect Structures
This book focuses on numerous examples of tasks represented by c-e structure. Cause–effect (c-e) structures are dynamic objects devised for algebraic and graphic description of realistic tasks. They constitute a formal system providing means to specify or implement (depending on degree of description generality) the tasks. They can be transformed, thus come under simplification, in accordance with rules-axioms of their algebra. Also, their properties can be inferred from the axioms. One objective of this book is presentation, by many realistic examples, of computing capability of c-e structures, without entering into mathematical details of their algebra. In particular, how computing with natural numbers and in propositional calculus can be performed by c-e structures and how to specify behavior of data structures. But also demonstration of many other tasks taken from the area of parallel processing, specified as c-e structures. Another objective is modelling or simulation by means of c-e structures, of other descriptive systems, devised for tasks from various fields. Also without formalizing by usage of functions between the systems. This concerns formalisms such as reaction systems, rough sets, Petri nets and CSP-like languages. Also on such, where temporal interdependence between actions matters. The presentation of examples is prevalently graphic, in the form of peculiar nets, but accompanied by their algebraic and set-theoretic expressions. A fairly complete exposition of concepts and properties of the algebra of cause-effect structures is in the previous book appeared in the Lecture Notes in Networks and Systems series. But basic notions of c-e structures are here provided for understanding the examples.
R 4,230.08
R 4,502.00
Parallel Iterative Algorithms
Focusing on grid computing and asynchronism, Parallel Iterative Algorithms explores the theoretical and practical aspects of parallel numerical algorithms. Each chapter contains a theoretical discussion of the topic, an algorithmic section that fully details implementation examples and specific algorithms, and an evaluation of the advantages and drawbacks of the algorithms. Several exercises also appear at the end of most chapters.The first two chapters introduce the general features of sequential iterative algorithms and their applications to numerical problems. The book then describes different kinds of parallel systems and parallel iterative algorithms. It goes on to address both linear and nonlinear parallel synchronous and asynchronous iterative algorithms for numerical computation, with an emphasis on the multisplitting approach. The final chapter discusses the features required for efficient implementation of asynchronous iterative algorithms.Providing the theoretical and practical knowledge needed to design and implement efficient parallel iterative algorithms, this book illustrates how to apply these algorithms to solve linear and nonlinear numerical problems in parallel environments, including local, distant, homogeneous, and heterogeneous clusters.
R 3,699.18
Computing in Cause-Effect Structures
This book focuses on numerous examples of tasks represented by c-e structure. Cause–effect (c-e) structures are dynamic objects devised for algebraic and graphic description of realistic tasks. They constitute a formal system providing means to specify or implement (depending on degree of description generality) the tasks. They can be transformed, thus come under simplification, in accordance with rules-axioms of their algebra. Also, their properties can be inferred from the axioms. One objective of this book is presentation, by many realistic examples, of computing capability of c-e structures, without entering into mathematical details of their algebra. In particular, how computing with natural numbers and in propositional calculus can be performed by c-e structures and how to specify behavior of data structures. But also demonstration of many other tasks taken from the area of parallel processing, specified as c-e structures. Another objective is modelling or simulation by means of c-e structures, of other descriptive systems, devised for tasks from various fields. Also without formalizing by usage of functions between the systems. This concerns formalisms such as reaction systems, rough sets, Petri nets and CSP-like languages. Also on such, where temporal interdependence between actions matters. The presentation of examples is prevalently graphic, in the form of peculiar nets, but accompanied by their algebraic and set-theoretic expressions. A fairly complete exposition of concepts and properties of the algebra of cause-effect structures is in the previous book appeared in the Lecture Notes in Networks and Systems series. But basic notions of c-e structures are here provided for understanding the examples.
R 4,446.82
Applied Nature-Inspired Computing: Algorithms and Case Studies
This book presents a cutting-edge research procedure in the Nature-Inspired Computing (NIC) domain and its connections with computational intelligence areas in real-world engineering applications. It introduces readers to a broad range of algorithms, such as genetic algorithms, particle swarm optimization, the firefly algorithm, flower pollination algorithm, collision-based optimization algorithm, bat algorithm, ant colony optimization, and multi-agent systems. In turn, it provides an overview of meta-heuristic algorithms, comparing the advantages and disadvantages of each. Moreover, the book provides a brief outline of the integration of nature-inspired computing techniques and various computational intelligence paradigms, and highlights nature-inspired computing techniques in a range of applications, including: evolutionary robotics, sports training planning, assessment of water distribution systems, flood simulation and forecasting, traffic control, gene expression analysis, antenna array design, and scheduling/dynamic resource management.
R 4,030.00
Data Mining with Computational Intelligence
Finding information hidden in data is as theoretically difficult as it is practically important. With the objective of discovering unknown patterns from data, the methodologies of data mining were derived from statistics, machine learning, and artificial intelligence, and are being used successfully in application areas such as bioinformatics, banking, retail, and many others.Wang and Fu present in detail the state of the art on how to utilize fuzzy neural networks, multilayer perceptron neural networks, radial basis function neural networks, genetic algorithms, and support vector machines in such applications. They focus on three main data mining tasks: data dimensionality reduction, classification, and rule extraction. The book is targeted at researchers in both academia and industry, while graduate students and developers of data mining systems will also profit from the detailed algorithmic descriptions.
R 3,035.54
Optinformatics in Evolutionary Learning and Optimization
This book provides readers the recent algorithmic advances towards realizing the notion of optinformatics in evolutionary learning and optimization. The book also provides readers a variety of practical applications, including inter-domain learning in vehicle route planning, data-driven techniques for feature engineering in automated machine learning, as well as evolutionary transfer reinforcement learning. Through reading this book, the readers will understand the concept of optinformatics, recent research progresses in this direction, as well as particular algorithm designs and application of optinformatics.Evolutionary algorithms (EAs) are adaptive search approaches that take inspiration from the principles of natural selection and genetics. Due to their efficacy of global search and ease of usage, EAs have been widely deployed to address complex optimization problems occurring in a plethora of real-world domains, including image processing, automation of machine learning, neural architecture search, urban logistics planning, etc. Despite the success enjoyed by EAs, it is worth noting that most existing EA optimizers conduct the evolutionary search process from scratch, ignoring the data that may have been accumulated from different problems solved in the past. However, today, it is well established that real-world problems seldom exist in isolation, such that harnessing the available data from related problems could yield useful information for more efficient problem-solving. Therefore, in recent years, there is an increasing research trend in conducting knowledge learning and data processing along the course of an optimization process, with the goal of achieving accelerated search in conjunction with better solution quality. To this end, the term optinformatics has been coined in the literature as the incorporation of information processing and data mining (i.e., informatics) techniques into the optimization process.The primary market of this book is researchers from both academia and industry, who are working on computational intelligence methods and their applications. This book is also written to be used as a textbook for a postgraduate course in computational intelligence emphasizing methodologies at the intersection of optimization and machine learning.
R 4,750.36
Variants of Evolutionary Algorithms for Real-World Applications
Evolutionary Algorithms (EAs) are population-based, stochastic search algorithms that mimic natural evolution. Due to their ability to find excellent solutions for conventionally hard and dynamic problems within acceptable time, EAs have attracted interest from many researchers and practitioners in recent years. This book “Variants of Evolutionary Algorithms for Real-World Applications” aims to promote the practitioner’s view on EAs by providing a comprehensive discussion of how EAs can be adapted to the requirements of various applications in the real-world domains. It comprises 14 chapters, including an introductory chapter re-visiting the fundamental question of what an EA is and other chapters addressing a range of real-world problems such as production process planning, inventory system and supply chain network optimisation, task-based jobs assignment, planning for CNC-based work piece construction, mechanical/ship design tasks that involve runtime-intense simulations, data mining for the prediction of soil properties, automated tissue classification for MRI images, and database query optimisation, among others. These chapters demonstrate how different types of problems can be successfully solved using variants of EAs and how the solution approaches are constructed, in a way that can be understood and reproduced with little prior knowledge on optimisation.
R 4,030.00
Machine Learning Algorithms for Industrial Applications
This book explores several problems and their solutions regarding data analysis and prediction for industrial applications. Machine learning is a prominent topic in modern industries: its influence can be felt in many aspects of everyday life, as the world rapidly embraces big data and data analytics. Accordingly, there is a pressing need for novel and innovative algorithms to help us find effective solutions in industrial application areas such as media, healthcare, travel, finance, and retail. In all of these areas, data is the crucial parameter, and the main key to unlocking the value of industry. The book presents a range of intelligent algorithms that can be used to filter useful information in the above-mentioned application areas and efficiently solve particular problems. Its main objective is to raise awareness for this important field among students, researchers, and industrial practitioners.
R 5,371.28
Optinformatics in Evolutionary Learning and Optimization
This book provides readers the recent algorithmic advances towards realizing the notion of optinformatics in evolutionary learning and optimization. The book also provides readers a variety of practical applications, including inter-domain learning in vehicle route planning, data-driven techniques for feature engineering in automated machine learning, as well as evolutionary transfer reinforcement learning. Through reading this book, the readers will understand the concept of optinformatics, recent research progresses in this direction, as well as particular algorithm designs and application of optinformatics.Evolutionary algorithms (EAs) are adaptive search approaches that take inspiration from the principles of natural selection and genetics. Due to their efficacy of global search and ease of usage, EAs have been widely deployed to address complex optimization problems occurring in a plethora of real-world domains, including image processing, automation of machine learning, neural architecture search, urban logistics planning, etc. Despite the success enjoyed by EAs, it is worth noting that most existing EA optimizers conduct the evolutionary search process from scratch, ignoring the data that may have been accumulated from different problems solved in the past. However, today, it is well established that real-world problems seldom exist in isolation, such that harnessing the available data from related problems could yield useful information for more efficient problem-solving. Therefore, in recent years, there is an increasing research trend in conducting knowledge learning and data processing along the course of an optimization process, with the goal of achieving accelerated search in conjunction with better solution quality. To this end, the term optinformatics has been coined in the literature as the incorporation of information processing and data mining (i.e., informatics) techniques into the optimization process.The primary market of this book is researchers from both academia and industry, who are working on computational intelligence methods and their applications. This book is also written to be used as a textbook for a postgraduate course in computational intelligence emphasizing methodologies at the intersection of optimization and machine learning.
R 4,574.54
Metaheuristics Algorithms for Medical Applications
Metaheuristics Algorithms for Medical Applications: Methods and Applications provides readers with the most complete reference for developing metaheuristics techniques with machine learning for solving biomedical problems. This book is organized to present a stepwise progression beginning with the basics of metaheuristics, leading into methods and practices, and concluding with advanced topics. The first section of this book presents the fundamental concepts of metaheuristics and machine learning and provides a comprehensive taxonomic view of metaheuristics methods according to a variety of criteria such as data type, scope, and method. The second section of this book explains how to apply metaheuristics techniques for solving large-scale biomedical problems, including analysis and validation under different strategies. The final portion of the book focuses on advanced topics in metaheuristics in four different applications. Readers will discover a variety of new methods, approaches, and techniques, as well as a wide range of applications demonstrating key concepts in metaheuristics for biomedical science. This book provides a leading-edge resource for researchers in a variety of scientific fields who are interested in metaheuristics, including mathematics, biomedical engineering, computer science, biological sciences, and clinicians in medical practice.
R 5,297.00
Deep Learning: Algorithms and Applications
This book presents a wealth of deep-learning algorithms and demonstrates their design process. It also highlights the need for a prudent alignment with the essential characteristics of the nature of learning encountered in the practical problems being tackled. Intended for readers interested in acquiring practical knowledge of analysis, design, and deployment of deep learning solutions to real-world problems, it covers a wide range of the paradigm’s algorithms and their applications in diverse areas including imaging, seismic tomography, smart grids, surveillance and security, and health care, among others. Featuring systematic and comprehensive discussions on the development processes, their evaluation, and relevance, the book offers insights into fundamental design strategies for algorithms of deep learning.
R 7,326.00
Handbook of Nature-Inspired Optimization Algorithms: The State of the Art
The introduction of nature-inspired optimization algorithms (NIOAs), over the past three decades, helped solve nonlinear, high-dimensional, and complex computational optimization problems. NIOAs have been originally developed to overcome the challenges of global optimization problems such as nonlinearity, non-convexity, non-continuity, non-differentiability, and/or multimodality which traditional numerical optimization techniques had difficulties solving.The main objective for this book is to make available a self-contained collection of modern research addressing the general bound-constrained optimization problems in many real-world applications using nature-inspired optimization algorithms. This book is suitable for a graduate class on optimization, but will also be useful for interested senior students working on their research projects.
R 5,270.94
Deep Learning: Algorithms and Applications
This book presents a wealth of deep-learning algorithms and demonstrates their design process. It also highlights the need for a prudent alignment with the essential characteristics of the nature of learning encountered in the practical problems being tackled. Intended for readers interested in acquiring practical knowledge of analysis, design, and deployment of deep learning solutions to real-world problems, it covers a wide range of the paradigm’s algorithms and their applications in diverse areas including imaging, seismic tomography, smart grids, surveillance and security, and health care, among others. Featuring systematic and comprehensive discussions on the development processes, their evaluation, and relevance, the book offers insights into fundamental design strategies for algorithms of deep learning.
R 8,511.14
Cultural Algorithms
A thorough look at how societies can use cultural algorithms to understand human social evolution For those working in computational intelligence, developing an understanding of how cultural algorithms and social intelligence form the essential framework for the evolution of human social interaction is essential. This book, Cultural Algorithms: Tools to Model Complex Dynamic Social Systems, is the foundation of that study. It showcases how we can use cultural algorithms to organize social structures and develop socio-political systems that work. For such a vast topic, the text covers everything from the history of the development of cultural algorithms and the basic framework with which it was organized. Readers will also learn how other nature-inspired algorithms can be expressed and how to use social metrics to assess the performance of various algorithms. In addition to these topics, the book covers topics including: The CAT system including the Repast Simphony System and CAT Sample RunsHow to problem solve using social networks in cultural algorithms with auctionsUnderstanding Common Value Action to enhance Social Knowledge Distribution SystemsCase studies on team formationsAn exploration of virtual worlds using cultural algorithms For industry professionals or new students, Cultural Algorithms provides an impactful and thorough look at both social intelligence and how human social evolution translates into the modern world.
R 4,557.00
Dependency Structures and Lexicalized Grammars
Since 2002, FoLLI has awarded an annual prize for outstanding dissertations in the fields of Logic, Language and Information. This book is based on the PhD thesis of Marco Kuhlmann, joint winner of the E.W. Beth dissertation award in 2008.Kuhlmann’s thesis lays new theoretical foundations for the study of non-projective dependency grammars. These grammars are becoming increasingly important for approaches to statistical parsing in computational linguistics that deal with free word order and long-distance dependencies. The author provides new formal tools to define and understand dependency grammars, presents two new dependency language hierarchies with polynomial parsing algorithms, establishes the practical significance of these hierarchies through corpus studies, and links his work to the phrase-structure grammar tradition through an equivalence result with tree-adjoining grammars. The work bridges the gaps between linguistics and theoretical computer science, between theoretical and empirical approaches in computational linguistics, and between previously disconnected strands of formal language research.
R 1,532.13
