Search results for "Data Structures and Algorithms in Java"
Items we need to order for you
Algorithms and Models for the Web Graph
This book constitutes the proceedings of the 17th International Workshop on Algorithms and Models for the Web Graph, WAW 2020, held in Warsaw, Poland, in September 2020. The 12 full papers presented in this volume were carefully reviewed and selected from 19 submissions. The aim of the workshop was to further the understanding of graphs that arise from the Web and various user activities on the Web, and stimulate the development of high-performance algorithms and applications that exploit these graphs.Due to the corona pandemic the conference was postponed from June 2020 to September 2020.
R 2,154.94
Static and Dynamic Analysis of Structures
This book is concerned with the static and dynamic analysis of structures. Specifi cally, it uses the stiffness formulated matrix methods for use on computers to tackle some of the fundamental problems facing engineers in structural mechanics. This is done by covering the Mechanics of Structures, its rephrasing in terms of the Matrix Methods, and then their Computational implementation, all within a cohesivesetting. Although this book is designed primarily as a text for use at the upper-undergraduate and beginning graduate level, many practicing structural engineers will find it useful as a reference and self-study guide. Several dozen books on structural mechanics and as many on matrix methods are currently available. A natural question to ask is why another text? An odd devel opment has occurred in engineering in recent years that can serve as a backdrop to why this book was written. With the widespread availability and use of comput ers, today's engineers have on their desk tops an analysis capability undreamt of by previous generations. However, the ever increasing quality and range of capabilities of commercially available software packages has divided the engineering profession into two groups: a small group of specialist program writers that know the ins and outs of the coding, algorithms, and solution strategies; and a much larger group of practicing engineers who use the programs. It is possible for this latter group to use this enormous power without really knowing anything of its source.
R 6,026.25
Representations for Genetic and Evolutionary Algorithms
In the field of genetic and evolutionary algorithms (GEAs), much theory and empirical study has been heaped upon operators and test problems, but problem representation has often been taken as given. This monograph breaks with this tradition and studies a number of critical elements of a theory of representations for GEAs and applies them to the empirical study of various important idealized test functions and problems of commercial import. The book considers basic concepts of representations, such as redundancy, scaling and locality and describes how GEAs'performance is influenced. Using the developed theory representations can be analyzed and designed in a theory-guided manner. The theoretical concepts are used as examples for efficiently solving integer optimization problems and network design problems. The results show that proper representations are crucial for GEAs'success.
R 1,557.71
Frontiers in Algorithmics
This book constitutes the refereed proceedings of the Third International Frontiers of Algorithmics Workshop, FAW 2009, held in Hefei, Anhui, China, in June 2009. The 33 revised full papers presented together with the abstracts of 3 invited talks were carefully reviewed and selected from 87 submissions. The papers are organized in topical sections on graph algorithms; game theory with applications; graph theory, computational geometry; machine learning; parameterized algorithms, heuristics and analysis; approximation algorithms; as well as pattern recognition algorithms, large scale data mining.
R 1,570.63
Algorithmic Regimes
Algorithms have risen to become one, if not the central technology for producing, circulating, and evaluating knowledge in multiple societal arenas. In this book, scholars from the social sciences, humanities, and computer science argue that this shift has, and will continue to have, profound implications for how knowledge is produced and what and whose knowledge is valued and deemed valid. To attend to this fundamental change, the authors propose the concept of algorithmic regimes and demonstrate how they transform the epistemological, methodological, and political foundations of knowledge production, sensemaking, and decision-making in contemporary societies. Across sixteen chapters, the volume offers a diverse collection of contributions along three perspectives on algorithmic regimes: the methods necessary to research and design algorithmic regimes, the ways in which algorithmic regimes reconfigure sociotechnical interactions, and the politics engrained in algorithmic regimes.
R 2,381.00
Logic and Games on Automatic Structures
The evaluation of a logical formula can be viewed as a game played by two opponents, one trying to show that the formula is true and the other trying to prove it is false. This correspondence has been known for a very long time and has inspired numerous research directions. In this book, the author extends this connection between logic and games to the class of automatic structures, where relations are recognized by synchronous finite automata.In model-checking games for automatic structures, two coalitions play against each other with a particular kind of hierarchical imperfect information. The investigation of such games leads to the introduction of a game quantifier on automatic structures, which connects alternating automata with the classical model-theoretic notion of a game quantifier. This study is then extended, determining the memory needed for strategies in infinitary games on the one hand, and characterizing regularity-preserving Lindström quantifiers on the other. Counting quantifiers are investigated in depth: it is shown that all countable omega-automatic structures are in fact finite-word automatic and that the infinity and uncountability set quantifiers are definable in MSO over countable linear orders and over labeled binary trees.This book is based on the PhD thesis of Lukasz Kaiser, which was awarded with the E.W. Beth award for outstanding dissertations in the fields of logic, language, and information in 2009. The work constitutes an innovative study in the area of algorithmic model theory, demonstrating the deep interplay between logic and computability in automatic structures. It displays very high technical and presentational quality and originality, advances significantly the field of algorithmic model theory and raises interesting new questions, thus emerging as a fruitful and inspiring source for future research.
R 2,146.27
Grouping Genetic Algorithms
This book presents advances and innovations in grouping genetic algorithms, enriched with new and unique heuristic optimization techniques. These algorithms are specially designed for solving industrial grouping problems where system entities are to be partitioned or clustered into efficient groups according to a set of guiding decision criteria. Examples of such problems are: vehicle routing problems, team formation problems, timetabling problems, assembly line balancing, group maintenance planning, modular design, and task assignment. A wide range of industrial grouping problems, drawn from diverse fields such as logistics, supply chain management, project management, manufacturing systems, engineering design and healthcare, are presented. Typical complex industrial grouping problems, with multiple decision criteria and constraints, are clearly described using illustrative diagrams and formulations. The problems are mapped into a common group structure that can conveniently be used as an input scheme to specific variants of grouping genetic algorithms. Unique heuristic grouping techniques are developed to handle grouping problems efficiently and effectively. Illustrative examples and computational results are presented in tables and graphs to demonstrate the efficiency and effectiveness of the algorithms.Researchers, decision analysts, software developers, and graduate students from various disciplines will find this in-depth reader-friendly exposition of advances and applications of grouping genetic algorithms an interesting, informative and valuable resource.
R 6,174.43
Algorithms, Artificial Intelligence and Beyond
This volume brings together eminent scholars from various parts of the world, representing different fields of knowledge in order to explore the social, cultural, political, and economic effects of the development of new technologies.On the one hand, the book contextualizes the discussion of algorithms and AI within the broader framework of the digital revolution, but it also examines individual experiences and practices. Moreover, in light of the speed at which algorithms and AI are being incorporated into various aspects of life, contributors also question the ethical implications of their development. The widespread development of artificial intelligence and algorithmic solutions is one of the most important contemporary phenomena. It has an overwhelming impact on the social and cultural life of the 21st century. In this context, one can point to both exciting examples of the application of algorithms and AI in business and popular culture, as well as the challenges of widening social inequality or the expanding scope of surveillance.The scope of the impact of algorithms and AI makes the formation of new theoretical frameworks vital. This is the aim of this book, which will be of interest to academics within the humanities and social sciences with an interest in technology and the impact of algorithms and AI on society and culture.
R 9,311.30
Experimental Algorithms
This book constitutes the refereed proceedings of the 11th International Symposium on Experimental Algorithms, SEA 2012, held Bordeaux, France, in June 2012. The 31 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 64 submissions and present current research in the area of design, analysis, and experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications.
R 2,193.14
Tools and Algorithms for the Construction and Analysis of Systems
This book presents 12 revised refereed papers selected as the best from 32 submissions for the First International Workshop on Tools and Algorithms for the Construction and Analysis of Systems, TACAS '95, held in Aarhus, Denmark, in May 1995.The workshop brought together 46 researchers interested in the development and application of tools and algorithms for specification, verification, analysis, and construction of distributed systems. The papers included in the book are devoted to refinement-based and compositional verification, construction techniques, analysis and verification via theorem proving, process algebras, temporal and modal logics, techniques for real-time, hybrid and probabilistic systems, and value-passing systems.
R 1,557.71
Multilevel Optimization: Algorithms and Applications
Researchers working with nonlinear programming often claim "the word is non linear" indicating that real applications require nonlinear modeling. The same is true for other areas such as multi-objective programming (there are always several goals in a real application), stochastic programming (all data is uncer tain and therefore stochastic models should be used), and so forth. In this spirit we claim: The word is multilevel. In many decision processes there is a hierarchy of decision makers, and decisions are made at different levels in this hierarchy. One way to handle such hierar chies is to focus on one level and include other levels' behaviors as assumptions. Multilevel programming is the research area that focuses on the whole hierar chy structure. In terms of modeling, the constraint domain associated with a multilevel programming problem is implicitly determined by a series of opti mization problems which must be solved in a predetermined sequence. If only two levels are considered, we have one leader (associated with the upper level) and one follower (associated with the lower level).
R 6,019.21
Pervasive Systems, Algorithms and Networks
This book constitutes the refereed proceedings of the 16th International Symposium on Pervasive Systems, Algorithms and Networks, I-SPAN 2019, held in Naples, Italy, in September 2019.The 32 full papers and 8 short papers were carefully reviewed and selected from 89 submissions. The papers focus on all aspects of: big data analytics & machine learning; cyber security; cloud fog & edge computing; communication solutions; high performance computing and applications; consumer cyber security; and vehicular technology.
R 2,191.38
Sensors: Theory, Algorithms, and Applications
The objective of this book is to advance the current knowledge of sensor research particularly highlighting recent advances, current work, and future needs. The goal is to share current technologies and steer future efforts in directions that will benefit the majority of researchers and practitioners working in this broad field of study.
R 3,857.31
Algorithms: Design Techniques And Analysis
Problem solving is an essential part of every scientific discipline. It has two components: (1) problem identification and formulation, and (2) solution of the formulated problem. One can solve a problem on its own using ad hoc techniques or follow those techniques that have produced efficient solutions to similar problems. This requires the understanding of various algorithm design techniques, how and when to use them to formulate solutions and the context appropriate for each of them. This book advocates the study of algorithm design techniques by presenting most of the useful algorithm design techniques and illustrating them through numerous examples.
R 5,036.86
Experimental Algorithms
This book constitutes the refereed proceedings of the 6th International Workshop on Experimental and Efficient Algorithms, WEA 2007, held in Rome, Italy, in June 2007. The 30 revised full papers presented together with three invited talks cover the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms.
R 1,583.55
Tools and Algorithms for the Construction and Analysis of Systems
ETAPS 2010 was the 13th instance of the European Joint Conferences on T- oryandPracticeofSoftware. ETAPSisanannualfederatedconferencethatwas establishedin1998bycombininganumberofexistingandnewconferences. This yearitcomprisedtheusual?vesisterconferences(CC,ESOP,FASE,FOSSACS, TACAS), 19 satellite workshops (ACCAT, ARSPA-WITS, Bytecode, CMCS, COCV, DCC, DICE, FBTC, FESCA, FOSS-AMA, GaLoP, GT-VMT, LDTA, MBT, PLACES, QAPL, SafeCert, WGT, and WRLA) and seven invited l- tures (excluding those that were speci?c to the satellite events). The ?ve main conferences this year received 497 submissions (including 31 tool demonstration papers), 130 of which were accepted (10 tool demos), giving an overall acc- tance rateof 26%, with most of the conferencesat around24%. Congratulations thereforetoalltheauthorswhomadeittothe?nalprogramme!Ihopethatmost of the other authors will still have found a way of participating in this exciting event, and that you will all continue submitting to ETAPS and contributing to make of it the best conference on software science and engineering. The events that comprise ETAPS address various aspects of the system - velopmentprocess,including speci?cation,design, implementation, analysisand improvement.The languages, methodologies and tools which support these - tivities are all well within its scope. Di?erent blends of theory and practice are represented,withaninclinationtowardtheorywithapracticalmotivationonthe one hand and soundly based practice on the other. Many of the issues involved in software design apply to systems in general, including hardwaresystems, and the emphasis on software is not intended to be exclusive. ETAPS is a confederation in which each event retains its own identity, with a separate Programme Committee and proceedings. Its format is open-ended, allowing it to grow and evolve as time goes by.
R 2,015.00
Combinatorial Optimization and Graph Algorithms
Covering network designs, discrete convex analysis, facility location and clustering problems, matching games, and parameterized complexity, this book discusses theoretical aspects of combinatorial optimization and graph algorithms. Contributions are by renowned researchers who attended NII Shonan meetings on this essential topic. The collection contained here provides readers with the outcome of the authors’ research and productive meetings on this dynamic area, ranging from computer science and mathematics to operations research.Networks are ubiquitous in today's world: the Web, online social networks, and search-and-query click logs can lead to a graph that consists of vertices and edges. Such networks are growing so fast that it is essential to design algorithms to work for these large networks. Graph algorithms comprise an area in computer science that works to design efficient algorithms for networks. Here one can work on theoretical or practical problems where implementation of an algorithm for large networks is needed. In two of the chapters, recent results in graph matching games and fixed parameter tractability are surveyed.Combinatorial optimization is an intersection of operations research and mathematics, especially discrete mathematics, which deals with new questions and new problems, attempting to find an optimum object from a finite set of objects. Most problems in combinatorial optimization are not tractable (i.e., NP-hard). Therefore it is necessary to design an approximation algorithm for them. To tackle these problems requires the development and combination of ideas and techniques from diverse mathematical areas including complexity theory, algorithm theory, and matroids as well as graph theory, combinatorics, convex and nonlinear optimization, and discrete and convex geometry. Overall, the book presents recent progress in facility location, network design, and discrete convex analysis.
R 4,675.20
R 2,107.00
Parallel Algorithms
Focusing on algorithms for distributed-memory parallel architectures, Parallel Algorithms presents a rigorous yet accessible treatment of theoretical models of parallel computation, parallel algorithm design for homogeneous and heterogeneous platforms, complexity and performance analysis, and essential notions of scheduling. The book extracts fundamental ideas and algorithmic principles from the mass of parallel algorithm expertise and practical implementations developed over the last few decades.In the first section of the text, the authors cover two classical theoretical models of parallel computation (PRAMs and sorting networks), describe network models for topology and performance, and define several classical communication primitives. The next part deals with parallel algorithms on ring and grid logical topologies as well as the issue of load balancing on heterogeneous computing platforms. The final section presents basic results and approaches for common scheduling problems that arise when developing parallel algorithms. It also discusses advanced scheduling topics, such as divisible load scheduling and steady-state scheduling. With numerous examples and exercises in each chapter, this text encompasses both the theoretical foundations of parallel algorithms and practical parallel algorithm design.
R 6,680.32
Algorithms in Bioinformatics
Here are the refereed proceedings of the 6th International Workshop on Algorithms in Bioinformatics, WABI 2006, held in the course of the ALGO 2006 conference meetings. The book presents 36 revised full papers addressing all current issues of algorithms in bioinformatics, from mathematical tools to experimental studies of approximation algorithms and reports on significant computational analyses. For the first time, coverage extends to machine-learning approaches along with combinatorial optimization.
R 2,015.00
Wireless Algorithms, Systems, and Applications
This book constitutes the refereed proceedings of the 9th International Conference on Wireless Algorithms, Systems and Applications, WASA 2014, held in Harbin, China, in June 2014. The 41 revised full papers presented together with 30 invited papers were carefully reviewed and selected from 134 submissions. The papers cover a wide range of topics including cognitive radio networks, wireless sensor networks, cyber-physical systems, distributed and localized algorithm design and analysis, information and coding theory for wireless networks, localization, mobile cloud computing, topology control and coverage, security and privacy, underwater and underground networks, vehicular networks, information processing and data management, programmable service interfaces, energy-efficient algorithms, system and protocol design, operating system and middle-ware support and experimental test-beds and models.
R 4,357.45
Wireless Algorithms, Systems, and Applications
This book constitutes the proceedings of the 11th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2016, held in Bozeman, MT, USA, in August 2016.The 50 full papers and 9 invited papers presented werde carefully reviewed and selected from 148 submissions. WASA is designed to be a forum for theoreticians, system and application designers, protocol developers and practitioners to discuss and express their views on the current trends, challenges, and state-of-the-art solutions related to various issues in wireless networks. Topics of interests include, but not limited to, effective and efficient state-of-the-art algorithm design and analysis, reliable and secure system development and implementations, experimental study and testbed validation, and new application exploration in wireless networks.
R 2,222.08
New Algorithms, Architectures and Applications for Reconfigurable Computing
New Algorithms, Architectures and Applications for Reconfigurable Computing consists of a collection of contributions from the authors of some of the best papers from the Field Programmable Logic conference (FPL’03) and the Design and Test Europe conference (DATE’03). In all, seventy-nine authors, from research teams from all over the world, were invited to present their latest research in the extended format permitted by this special volume. The result is a valuable book that is a unique record of the state of the art in research into field programmable logic and reconfigurable computing.The contributions are organized into twenty-four chapters and are grouped into three main categories: architectures, tools and applications. Within these three broad areas the most strongly represented themes are coarse-grained architectures; dynamically reconfigurable and multi-context architectures; tools for coarse-grained and reconfigurable architectures; networking, security and encryption applications.Field programmable logic and reconfigurable computing are exciting research disciplines that span the traditional boundaries of electronic engineering and computer science. When the skills of both research communities are combined to address the challenges of a single research discipline they serve as a catalyst for innovative research. The work reported in the chapters of this book captures that spirit of that innovation.
R 4,659.12
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
Implementation of Machine Learning Algorithms Using Control-Flow and Dataflow Paradigms
Based on current literature and cutting-edge advances in the machine learning field, there are four algorithms whose usage in new application domains must be explored: neural networks, rule induction algorithms, tree-based algorithms, and density-based algorithms. A number of machine learning related algorithms have been derived from these four algorithms. Consequently, they represent excellent underlying methods for extracting hidden knowledge from unstructured data, as essential data mining tasks.Implementation of Machine Learning Algorithms Using Control-Flow and Dataflow Paradigms presents widely used data-mining algorithms and explains their advantages and disadvantages, their mathematical treatment, applications, energy efficient implementations, and more. It presents research of energy efficient accelerators for machine learning algorithms. Covering topics such as control-flow implementation, approximate computing, and decision tree algorithms, this book is an essential resource for computer scientists, engineers, students and educators of higher education, researchers, and academicians.
R 7,921.17
Tools and Algorithms for the Construction and Analysis of Systems
This book constitutes the refereed proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2001.The 36 revised full papers presented together with an invited contribution were carefully reviewed and selected from a total of 125 submissions. The papers are organized in sections on symbolic verification, infinite state systems - deduction and abstraction, application of model checking techniques, timed and probabilistic systems, hardware - design and verification, software verification, testing - techniques and tools, implementation techniques, semantics and compositional verification, logics and model checking, and ETAPS tool demonstration.
R 4,760.42
Advances in Computational Dynamics of Particles, Materials and Structures
Computational methods for the modeling and simulation of the dynamic response and behavior of particles, materials and structural systems have had a profound influence on science, engineering and technology. Complex science and engineering applications dealing with complicated structural geometries and materials that would be very difficult to treat using analytical methods have been successfully simulated using computational tools. With the incorporation of quantum, molecular and biological mechanics into new models, these methods are poised to play an even bigger role in the future. Advances in Computational Dynamics of Particles, Materials and Structures not only presents emerging trends and cutting edge state-of-the-art tools in a contemporary setting, but also provides a unique blend of classical and new and innovative theoretical and computational aspects covering both particle dynamics, and flexible continuum structural dynamics applications. It provides a unified viewpoint and encompasses the classical Newtonian, Lagrangian, and Hamiltonian mechanics frameworks as well as new and alternative contemporary approaches and their equivalences in [start italics]vector and scalar formalisms[end italics] to address the various problems in engineering sciences and physics. Highlights and key features Provides practical applications, from a unified perspective, to both particle and continuum mechanics of flexible structures and materialsPresents new and traditional developments, as well as alternate perspectives, for space and time discretization Describes a unified viewpoint under the umbrella of Algorithms by Design for the class of linear multi-step methodsIncludes fundamentals underlying the theoretical aspects and numerical developments, illustrative applications and practice exercises The completeness and breadth and depth of coverage makes Advances in Computational Dynamics of Particles, Materials and Structures a valuable textbook and reference for graduate students, researchers and engineers/scientists working in the field of computational mechanics; and in the general areas of computational sciences and engineering.
R 6,023.00
R 1,010.00
Algorithms for Sensor Systems
This book constitutes revised selected papers from the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2016, held in Aarhus, Denmark, in August 2016. The 9 full papers presented in this volume were carefully reviewed and selected from 19 submissions. This year papers were solicited into three tracks: Distributed and Mobile, Experiments and Applications, and Wireless and Geometry.
R 2,150.22
Algorithms in Bioinformatics
This book constitutes the refereed proceedings of the 11th International Workshop on Algorithms in Bioinformatics, WABI 2011, held in Saarbrücken, Germany, in September 2011. The 30 papers presented were carefully reviewed and selected from 77 submissions. They cover aspects of algorithms in bioinformatics, computational biology and systems biology.
R 2,015.00
Algorithms and Applications
For many years Esko Ukkonen has played a major role in the advancement of computer science in Finland. He was the key person in the development of the school of algorithmic research and has contributed considerably to post-graduate education in his country.Esko Ukkonen has over the years worked within many areas of computer science, including numerical methods, complexity theory, theoretical aspects of compiler construction, and logic programming. However, the main focus of his research has been on algorithms and their applications. This Festschrift volume, published to honor Esko Ukkonen on his 60th birthday, includes 18 refereed contributions by his former PhD students and colleagues, with whom he has cooperated closely during the course of his career. The Festschrift was presented to Esko during a festive symposium organized at the University of Helsinki to celebrate his birthday. The essays primarily present research on computational pattern matching and string algorithms, two areas that have benefited significantly from the work of Esko Ukonen.
R 2,359.71
Introduction to the Design and Analysis of Algorithms
Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal treatment while thoroughly covering the material required in an introductory algorithms course. Popular puzzles are used to motivate students' interest and strengthen their skills in algorithmic problem solving. Other learning-enhancement features include chapter summaries, hints to the exercises, and a detailed solution manual.
R 6,473.00
Tools and Algorithms for the Construction and Analysis of Systems
This open access book constitutes the proceedings of the 29th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2023, which was held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, during April 22-27, 2023, in Paris, France.The 56 full papers and 6 short tool demonstration papers presented in this volume were carefully reviewed and selected from 169 submissions. The proceedings also contain 1 invited talk in full paper length, 13 tool papers of the affiliated competition SV-Comp and 1 paper consisting of the competition report.TACAS is a forum for researchers, developers, and users interested in rigorously based tools and algorithms for the construction and analysis of systems. The conference aims to bridge the gaps between different communities with this common interest and to support them in their quest to improve the utility, reliability, flexibility, and efficiency of tools and algorithms for building computer-controlled systems.
R 2,036.12
Evolutionary Algorithms and Agricultural Systems
Evolutionary Algorithms and Agricultural Systems deals with the practical application of evolutionary algorithms to the study and management of agricultural systems. The rationale of systems research methodology is introduced, and examples listed of real-world applications. It is the integration of these agricultural systems models with optimization techniques, primarily genetic algorithms, which forms the focus of this book. The advantages are outlined, with examples of agricultural models ranging from national and industry-wide studies down to the within-farm scale. The potential problems of this approach are also discussed, along with practical methods of resolving these problems. Agricultural applications using alternate optimization techniques (gradient and direct-search methods, simulated annealing and quenching, and the tabu search strategy) are also listed and discussed. The particular problems and methodologies of these algorithms, including advantageous features that may benefit a hybrid approach or be usefully incorporated into evolutionary algorithms, are outlined. From consideration of this and the published examples, it is concluded that evolutionary algorithms are the superior method for the practical optimization of models of agricultural and natural systems. General recommendations on robust options and parameter settings for evolutionary algorithms are given for use in future studies. Evolutionary Algorithms and Agricultural Systems will prove useful to practitioners and researchers applying these methods to the optimization of agricultural or natural systems, and would also be suited as a text for systems management, applied modeling, or operations research.
R 5,971.29
Linear Programming: Mathematics, Theory and Algorithms
Linear Programming provides an in-depth look at simplex based as well as the more recent interior point techniques for solving linear programming problems. Starting with a review of the mathematical underpinnings of these approaches, the text provides details of the primal and dual simplex methods with the primal-dual, composite, and steepest edge simplex algorithms. This then is followed by a discussion of interior point techniques, including projective and affine potential reduction, primal and dual affine scaling, and path following algorithms. Also covered is the theory and solution of the linear complementarity problem using both the complementary pivot algorithm and interior point routines. A feature of the book is its early and extensive development and use of duality theory. Audience: The book is written for students in the areas of mathematics, economics, engineering and management science, and professionals who need a sound foundation in the important and dynamic discipline of linear programming.
R 6,035.38
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
Frontiers in Algorithmics
The Annual International Frontiers in Algorithmics Workshop is a focused - rum on current trends in research on algorithms, discrete structures, and their applications. It intends to bring together international experts at the research frontiers in those areas to exchange ideas and to present signi?cant new results. The mission of the workshop is to stimulate the various ?elds for which al- rithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western algorithmics research communities. The Second Inter- tional Frontiers in Algorithmics Workshop (FAW 2008) took place in Changsha, China, June 19–21, 2008. In response to the Call for Papers, 80 papers were submitted from 15 co- tries and regions: Canada, China, France, Germany, Greece, Hong Kong, India, Iran, Japan, Mexico, Norway, Singapore, South Korea, Taiwan, and the USA. After a six-week period of careful reviewing and discussion, the Program C- mittee accepted 32 submissions for presentation at the conference. These papers were selected for nine special focus tracks in the areas of biomedical inform- ics, discrete structures, geometric information processing and communication, games and incentive analysis, graph algorithms, internet algorithms and pro- cols, parameterized algorithms, design and analysis of heuristics, approximate and online algorithms, and machine learning. The program of FAW 2008 also included three keynote talks by Xiaotie Deng, John E. Hopcroft, and Milan Sonka.
R 1,567.38
Evolutionary Algorithms
Evolutionary algorithms are bio-inspired algorithms based on Darwin’s theory of evolution. They are expected to provide non-optimal but good quality solutions to problems whose resolution is impracticable by exact methods. In six chapters, this book presents the essential knowledge required to efficiently implement evolutionary algorithms. Chapter 1 describes a generic evolutionary algorithm as well as the basic operators that compose it. Chapter 2 is devoted to the solving of continuous optimization problems, without constraint. Three leading approaches are described and compared on a set of test functions. Chapter 3 considers continuous optimization problems with constraints. Various approaches suitable for evolutionary methods are presented. Chapter 4 is related to combinatorial optimization. It provides a catalog of variation operators to deal with order-based problems. Chapter 5 introduces the basic notions required to understand the issue of multi-objective optimization and a variety of approaches for its application. Finally, Chapter 6 describes different approaches of genetic programming able to evolve computer programs in the context of machine learning.
R 5,795.00
Tools and Algorithms for the Construction and Analysis of Systems
The two-book set LNCS 10205 + 10206 constitutes the proceedings of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017.The 48 full papers, 4 tool demonstration papers, and 12 software competition papers presented in these volumes were carefully reviewed and selected from 181 submissions to TACAS and 32 submissions to the software competition. They were organized in topical sections named: verification techniques; learning; synthesis; automata; concurrency and bisimulation; hybrid systems; security; run-time verification and logic; quantitative systems; SAT and SMT; and SV COMP.
R 1,610.45
Combinatorial Algorithms
This book constitutes the proceedings of the 32nd International Workshop on Combinatorial Algorithms which was planned to take place in Ottawa, ON, Canada, in July 2021. Due to the COVID-19 pandemic the conference changed to a virtual format.The 38 full papers included in this book together with 2 invited talks were carefully reviewed and selected from 107 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business.Chapter “Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
R 3,941.13
Network Flow Algorithms
Network flow theory has been used across a number of disciplines, including theoretical computer science, operations research, and discrete math, to model not only problems in the transportation of goods and information, but also a wide range of applications from image segmentation problems in computer vision to deciding when a baseball team has been eliminated from contention. This graduate text and reference presents a succinct, unified view of a wide variety of efficient combinatorial algorithms for network flow problems, including many results not found in other books. It covers maximum flows, minimum-cost flows, generalized flows, multicommodity flows, and global minimum cuts and also presents recent work on computing electrical flows along with recent applications of these flows to classical problems in network flow theory.
R 1,983.43
Nature-Inspired Algorithms and Applied Optimization
This book reviews the state-of-the-art developments in nature-inspired algorithms and their applications in various disciplines, ranging from feature selection and engineering design optimization to scheduling and vehicle routing. It introduces each algorithm and its implementation with case studies as well as extensive literature reviews, and also includes self-contained chapters featuring theoretical analyses, such as convergence analysis and no-free-lunch theorems so as to provide insights into the current nature-inspired optimization algorithms. Topics include ant colony optimization, the bat algorithm, B-spline curve fitting, cuckoo search, feature selection, economic load dispatch, the firefly algorithm, the flower pollination algorithm, knapsack problem, octonian and quaternion representations, particle swarm optimization, scheduling, wireless networks, vehicle routing with time windows, and maximally different alternatives. This timely book serves as a practical guide and reference resource for students, researchers and professionals.
R 6,197.74
Distributed Algorithms
This book includes the papers presented at the Third International Workshop on Distributed Algorithms organized at La Colle-sur-Loup, near Nice, France, September 26-28, 1989 which followed the first two successful international workshops in Ottawa (1985) and Amsterdam (1987). This workshop provided a forum for researchers and others interested in distributed algorithms on communication networks, graphs, and decentralized systems. The aim was to present recent research results, explore directions for future research, and identify common fundamental techniques that serve as building blocks in many distributed algorithms. Papers describe original results in all areas of distributed algorithms and their applications, including: distributed combinatorial algorithms, distributed graph algorithms, distributed algorithms for control and communication, distributed database techniques, distributed algorithms for decentralized systems, fail-safe and fault-tolerant distributed algorithms, distributed optimization algorithms, routing algorithms, design of network protocols, algorithms for transaction management, composition of distributed algorithms, and analysis of distributed algorithms.
R 1,561.22
Big Data, Algorithms and Food Safety
This book identifies the principles that should be applied when processing Big Data in the context of food safety risk assessments. Food safety is a critical goal in the protection of individuals’ right to health and the flourishing of the food and feed market. Big Data is fostering new applications capable of enhancing the accuracy of food safety risk assessments. An extraordinary amount of information is analysed to detect the existence or predict the likelihood of future risks, also by means of machine learning algorithms. Big Data and novel analysis techniques are topics of growing interest for food safety agencies, including the European Food Safety Authority (EFSA). This wealth of information brings with it both opportunities and risks concerning the extraction of meaningful inferences from data. However, conflicting interests and tensions among the parties involved are hindering efforts to find shared methods for steering the processing of Big Data in a sound, transparent and trustworthy way. While consumers call for more transparency, food business operators tend to be reluctant to share informational assets. This has resulted in a considerable lack of trust in the EU food safety system. A recent legislative reform, supported by new legal cases, aims to restore confidence in the risk analysis system by reshaping the meaning of data ownership in this domain. While this regulatory approach is being established, breakthrough analytics techniques are encouraging thinking about the next steps in managing food safety data in the age of machine learning.The book focuses on two core topics – data ownership and data governance – by evaluating how the regulatory framework addresses the challenges raised by Big Data and its analysis in an applied, significant, and overlooked domain. To do so, it adopts an interdisciplinary approach that considers both the technological advances and the policy tools adopted in the European Union, while also assuming an ethical perspective when exploring potential solutions. The conclusion puts forward a proposal: an ethical blueprint for identifying the principles – Security, Accountability, Fairness, Explainability, Transparency and Privacy – to be observed when processing Big Data for food safety purposes, including by means of machine learning. Possible implementations are then discussed, also in connection with two recent legislative proposals, namely the Data Governance Act and the Artificial Intelligence Act.
R 3,517.70
Tools and Algorithms for the Construction and Analysis of Systems
This book constitutes the refereed proceedings of the Third International Workshop on Tools and Algorithms for the Construction and Analysis of Systems, TACAS '97, held in Enschede, The Netherlands, in April 1997.The book presents 20 revised full papers and 5 tool demonstrations carefully selected out of 54 submissions; also included are two extended abstracts and a full paper corresponding to invited talks. The papers are organized in topical sections on space reduction techniques, tool demonstrations, logical techniques, verification support, specification and analysis, and theorem proving, model checking and applications.
R 1,580.61
