Search results for "data structures and algorithms in java"
Items we need to order for you
R 916.00
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional dynamic programming algorithm returns an optimal object from a given set of objects. This book develops extensions of dynamic programming, enabling us to (i) describe the set of objects under consideration; (ii) perform a multi-stage optimization of objects relative to different criteria; (iii) count the number of optimal objects; (iv) find the set of Pareto optimal points for bi-criteria optimization problems; and (v) to study relationships between two criteria. It considers various applications, including optimization of decision trees and decision rule systems as algorithms for problem solving, as ways for knowledge representation, and as classifiers; optimization of element partition trees for rectangular meshes, which are used in finite element methods for solving PDEs; and multi-stage optimization for such classic combinatorial optimization problems as matrix chain multiplication, binary search trees, global sequence alignment, and shortest paths. The results presented are useful for researchers in combinatorial optimization, data mining, knowledge discovery, machine learning, and finite element methods, especially those working in rough set theory, test theory, logical analysis of data, and PDE solvers. This book can be used as the basis for graduate courses.
R 4,007.64
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
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
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
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
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 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
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
Advanced Topics in Intelligent Information and Database Systems
This book presents recent research in intelligent information and database systems. The carefully selected contributions were initially accepted for presentation as posters at the 9th Asian Conference on Intelligent Information and Database Systems (ACIIDS 2017) held from to 5 April 2017 in Kanazawa, Japan. While the contributions are of an advanced scientific level, several are accessible for non-expert readers. The book brings together 47 chapters divided into six main parts:• Part I. From Machine Learning to Data Mining.• Part II. Big Data and Collaborative Decision Support Systems,• Part III. Computer Vision Analysis, Detection, Tracking and Recognition,• Part IV. Data-Intensive Text Processing,• Part V. Innovations in Web and Internet Technologies, and• Part VI. New Methods and Applications in Information and Software Engineering. The book is an excellent resource for researchers and those working in algorithmics, artificial and computational intelligence, collaborative systems, decision management and support systems, natural language processing, image and text processing, Internet technologies, and information and software engineering, as well as for students interested in such research areas.
R 6,228.00
R 4,502.00
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
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
Advanced Topics in Intelligent Information and Database Systems
This book presents recent research in intelligent information and database systems. The carefully selected contributions were initially accepted for presentation as posters at the 9th Asian Conference on Intelligent Information and Database Systems (ACIIDS 2017) held from to 5 April 2017 in Kanazawa, Japan. While the contributions are of an advanced scientific level, several are accessible for non-expert readers. The book brings together 47 chapters divided into six main parts:• Part I. From Machine Learning to Data Mining.• Part II. Big Data and Collaborative Decision Support Systems,• Part III. Computer Vision Analysis, Detection, Tracking and Recognition,• Part IV. Data-Intensive Text Processing,• Part V. Innovations in Web and Internet Technologies, and• Part VI. New Methods and Applications in Information and Software Engineering. The book is an excellent resource for researchers and those working in algorithmics, artificial and computational intelligence, collaborative systems, decision management and support systems, natural language processing, image and text processing, Internet technologies, and information and software engineering, as well as for students interested in such research areas.
R 6,228.00
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
Handbook of Nature-Inspired Optimization Algorithms: The State of the Art
This book presents recent contributions and significant development, advanced issues, and challenges. In real-world problems and applications, most of the optimization problems involve different types of constraints. These problems are called constrained optimization problems (COPs). The optimization of the constrained optimization problems is considered a challenging task since the optimum solution(s) must be feasible. In their original design, evolutionary algorithms (EAs) are able to solve unconstrained optimization problems effectively. As a result, in the past decade, many researchers have developed a variety of constraint handling techniques, incorporated into (EAs) designs, to counter this deficiency.The main objective for this book is to make available a self-contained collection of modern research addressing the general 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,120.40
Intelligent Algorithms in Software Engineering
This book gathers the refereed proceedings of the Intelligent Algorithms in Software Engineering Section of the 9th Computer Science On-line Conference 2020 (CSOC 2020), held on-line in April 2020.Software engineering research and its applications to intelligent algorithms have now assumed an essential role in computer science research. In this book, modern research methods, together with applications of machine and statistical learning in software engineering research, are presented.
R 6,228.00
Advances in Metaheuristics Algorithms: Methods and Applications
This book explores new alternative metaheuristic developments that have proved to be effective in their application to several complex problems. Though most of the new metaheuristic algorithms considered offer promising results, they are nevertheless still in their infancy. To grow and attain their full potential, new metaheuristic methods must be applied in a great variety of problems and contexts, so that they not only perform well in their reported sets of optimization problems, but also in new complex formulations. The only way to accomplish this is to disseminate these methods in various technical areas as optimization tools. In general, once a scientist, engineer or practitioner recognizes a problem as a particular instance of a more generic class, he/she can select one of several metaheuristic algorithms that guarantee an expected optimization performance. Unfortunately, the set of options are concentrated on algorithms whose popularity and high proliferation outstrip those of the new developments. This structure is important, because the authors recognize this methodology as the best way to help researchers, lecturers, engineers and practitioners solve their own optimization problems.
R 4,757.00
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,629.52
Modeling Approaches and Algorithms for Advanced Computer Applications
"During the last decades Computational Intelligence has emerged and showed its contributions in various broad research communities (computer science, engineering, finance, economic, decision making, etc.). This was done by proposing approaches and algorithms based either on turnkey techniques belonging to the large panoply of solutions offered by computational intelligence such as data mining, genetic algorithms, bio-inspired methods, Bayesian networks, machine learning, fuzzy logic, artificial neural networks, etc. or inspired by computational intelligence techniques to develop new ad-hoc algorithms for the problem under consideration. This volume is a comprehensive collection of extended contributions from the 4th International Conference on Computer Science and Its Applications (CIIA’2013) organized into four main tracks: Track 1: Computational Intelligence, Track 2: Security & Network Technologies, Track 3: Information Technology and Track 4: Computer Systems and Applications. This book presents recent advances in the use and exploitation of computational intelligence in several real world hard problems covering these tracks such as image processing, Arab text processing, sensor and mobile networks, physical design of advanced databases, model matching, etc. that require advanced approaches and algorithms borrowed from computational intelligence for solving them.
R 4,356.47
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 7,326.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 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
