20 products were found matching your search for Larichkin Alexey Objective Algorithms in 1 shops:

The Wiley Paperback Series makes valuable content more accessible to a new generation of statisticians, mathematicians and scientists. Evolutionary algorithms are very powerful techniques used to find solutions to real-world search and optimization problems. Many of these problems have multiple objectives, which leads to the need to obtain a set of optimal solutions, known as effective solutions. It has been found that using evolutionary algorithms is a highly effective way of finding multiple effective solutions in a single simulation run. Comrephensive coverage of this growing area of research. Carefully introduces each algorithm with examples and in-depth discussion. Includes many applications to real-world problems, including engineering design and scheduling. Includes discussion of advanced topics and future research. Accessible to those with limited knowledge of multi-objective optimization and evolutionary algorithms Provides an extensive discussion on the principles of multi-objective optimization and on a number of classical approaches. This integrated presentation of theory, algorithms and examples will benefit those working in the areas of optimization, optimal design and evolutionary computing.

The Wiley Paperback Series makes valuable content more accessible to a new generation of statisticians, mathematicians and scientists. Evolutionary algorithms are very powerful techniques used to find solutions to real-world search and optimization problems. Many of these problems have multiple objectives, which leads to the need to obtain a set of optimal solutions, known as effective solutions. It has been found that using evolutionary algorithms is a highly effective way of finding multiple effective solutions in a single simulation run. Comrephensive coverage of this growing area of research. Carefully introduces each algorithm with examples and in-depth discussion. Includes many applications to real-world problems, including engineering design and scheduling. Includes discussion of advanced topics and future research. Accessible to those with limited knowledge of multi-objective optimization and evolutionary algorithms Provides an extensive discussion on the principles of multi-objective optimization and on a number of classical approaches. This integrated presentation of theory, algorithms and examples will benefit those working in the areas of optimization, optimal design and evolutionary computing.

Spiking neural network (SNN) plays an essential role in classification problems. Although there are many models of SNN, Evolving Spiking Neural Network (ESNN) is widely used in many recent research works. Evolutionary algorithms, mainly differential evolution (DE) have been used for enhancing ESNN algorithm. However, many real-world optimisation problems include several contradictory objectives. Rather than single optimisation, Multi-Objective Optimisation (MOO) can be utilised as a set of optimal solutions to solve these problems.In this book, Harmony Search (HS) and memetic approach were used to improve the performance of MOO with ESNN. Consequently, Memetic Harmony Search Multi-Objective Differential Evolution with Evolving Spiking Neural Network (MEHSMODE-ESNN) was applied to improve ESNN structure and accuracy rates. Standard data sets from the UCI machine learning are used for evaluating the performance of this enhanced multi objective hybrid model. The experimental results have proved that the Memetic Harmony Search Multi-Objective Differential Evolution with Evolving Spiking Neural Network (MEHSMODE-ESNN) gives better results in terms of accuracy and network structure.

This work presents a new approach to portfolio composition in the stock market. It incorporates a fundamental approach using financial ratios and technical indicators with a Multi-Objective Evolutionary Algorithms to choose the portfolio composition with two objectives the return and the risk. Two different chromosomes are used for representing different investment models with real constraints equivalents to the ones faced by managers of mutual funds, hedge funds, and pension funds. To validate the present solution two case studies are presented for the SP&500 for the period June 2010 until end of 2012. The simulations demonstrates that stock selection based on financial ratios is a combination that can be used to choose the best companies in operational terms, obtaining returns above the market average with low variances in their returns. In this case the optimizer found stocks with high return on investment in a conjunction with high rate of growth of the net income and a high profit margin. To obtain stocks with high valuation potential it is necessary to choose companies with a lower or average market capitalization, low PER, high rates of revenue growth and high operating leverage

This work presents a new approach to portfolio composition in the stock market. It incorporates a fundamental approach using financial ratios and technical indicators with a Multi-Objective Evolutionary Algorithms to choose the portfolio composition with two objectives the return and the risk. Two different chromosomes are used for representing different investment models with real constraints equivalents to the ones faced by managers of mutual funds, hedge funds, and pension funds. To validate the present solution two case studies are presented for the SP&500 for the period June 2010 until end of 2012. The simulations demonstrates that stock selection based on financial ratios is a combination that can be used to choose the best companies in operational terms, obtaining returns above the market average with low variances in their returns. In this case the optimizer found stocks with high return on investment in a conjunction with high rate of growth of the net income and a high profit margin. To obtain stocks with high valuation potential it is necessary to choose companies with a lower or average market capitalization, low PER, high rates of revenue growth and high operating leverage

Various mechanisms to improve the learning process with the main objective of maximizing learning and dynamically selecting the best teaching operation to achieve learning goals have been done in the field of personalized learning. Despite recommending a personalized learning sequence, e-learning instructional strategists have failed to perform or address the necessary corrective measures to remediate immediately learning misconceptions or difficulties. As e-learning materials continue to evolve, it is necessary that an alternative, dynamic, and real time multi-performance be developed and implemented in e-learning systems. Two major contributions in the field of e-learning have been asserted by this study: it personalizes the learning sequence using reversed roulette wheel selection algorithm blended with linear ranking based on real time, dynamic multi-based performance matrix; and implements the reinforcement and mastery learning to motivate students and improve their learning output. Based on experiments, personalized learning sequence (PLS) were dynamic and heuristic but simultaneously considers the curriculum difficulty level.

The primary objective of this essential text is to emphasize the deep relations existing between the semiring and dioïd structures with graphs and their combinatorial properties. It does so at the same time as demonstrating the modeling and problem-solving flexibility of these structures. In addition the book provides an extensive overview of the mathematical properties employed by "nonclassical" algebraic structures which either extend usual algebra or form a new branch of it.

The comprehensive introduction to the art and science of locating facilities to make your organization more efficient, effective, and profitable. For the professional siting facilities, the task of translating organizational goals and objectives into concrete facilities requires a working familiarity with the theoretical and practical fundamentals of facility location planning and modeling. The first hands-on guide to using and developing facility location models, Network and Discrete Location offers a practiceoriented introduction to model-building methods and solution algorithms, complete with software to solve classical problems of realistic size and end-of-chapter exercises to enhance the reader's understanding. The text introduces the reader to the key classical location problems (covering, center, median, and fixed charge) which form the nucleus of facility location modeling. It also discusses real-life extensions of the basic models used in locating: production and distribution facilities, interacting services and facilities, and undesirable facilities. The book outlines a host of methodological tools for solving location models and provides insights into when each approach is useful and what information it provides. Designed to give readers a working familiarity with the basic facility location model types as well as an intuitive knowledge of the uses and limits of modeling techniques, Network and Discrete Location brings students and professionals alike swiftly from basic theory to technical fluency.

The objectives of this book are to provide a solid foundation for the theory of algorithms. The book is intended to serve as a text for a core upper division undergraduate course in the design and analysis of algorithms.

A comprehensive introduction to optimization with a focus on practical algorithms for the design of engineering systems.This book offers a comprehensive introduction to optimization with a focus on practical algorithms. The book approaches optimization from an engineering perspective, where the objective is to design a system that optimizes a set of metrics subject to constraints. Readers will learn about computational approaches for a range of challenges, including searching high-dimensional spaces, handling problems where there are multiple competing objectives, and accommodating uncertainty in the metrics. Figures, examples, and exercises convey the intuition behind the mathematical approaches. The text provides concrete implementations in the Julia programming language. Topics covered include derivatives and their generalization to multiple dimensions; local descent and first- and second-order methods that inform local descent; stochastic methods, which introduce randomness into the optimization process; linear constrained optimization, when both the objective function and the constraints are linear; surrogate models, probabilistic surrogate models, and using probabilistic surrogate models to guide optimization; optimization under uncertainty; uncertainty propagation; expression optimization; and multidisciplinary design optimization. Appendixes offer an introduction to the Julia language, test functions for evaluating algorithm performance, and mathematical concepts used in the derivation and analysis of the optimization methods discussed in the text. The book can be used by advanced undergraduates and graduate students in mathematics, statistics, computer science, any engineering field, (including electrical engineering and aerospace engineering), and operations research, and as a reference for professionals.

A comprehensive introduction to optimization with a focus on practical algorithms for the design of engineering systems.This book offers a comprehensive introduction to optimization with a focus on practical algorithms. The book approaches optimization from an engineering perspective, where the objective is to design a system that optimizes a set of metrics subject to constraints. Readers will learn about computational approaches for a range of challenges, including searching high-dimensional spaces, handling problems where there are multiple competing objectives, and accommodating uncertainty in the metrics. Figures, examples, and exercises convey the intuition behind the mathematical approaches. The text provides concrete implementations in the Julia programming language. Topics covered include derivatives and their generalization to multiple dimensions; local descent and first- and second-order methods that inform local descent; stochastic methods, which introduce randomness into the optimization process; linear constrained optimization, when both the objective function and the constraints are linear; surrogate models, probabilistic surrogate models, and using probabilistic surrogate models to guide optimization; optimization under uncertainty; uncertainty propagation; expression optimization; and multidisciplinary design optimization. Appendixes offer an introduction to the Julia language, test functions for evaluating algorithm performance, and mathematical concepts used in the derivation and analysis of the optimization methods discussed in the text. The book can be used by advanced undergraduates and graduate students in mathematics, statistics, computer science, any engineering field, (including electrical engineering and aerospace engineering), and operations research, and as a reference for professionals.

The first full-color ACLS (Advanced Cardiac Life Support) study guide in print follows the American Heart Association's topic format to help prepare for the ACLS Certification Examination. Well-organized, with current AHA guidelines, it covers learner objectives, algorithms, multiple quizzes, pretests, and post-tests to thoroughly cover required material.

Designing algorithms to recommend items such as news articles and movies to users is a challenging task in numerous web applications. The crux of the problem is to rank items based on users' responses to different items to optimize for multiple objectives. Major technical challenges are high dimensional prediction with sparse data and constructing high dimensional sequential designs to collect data for user modeling and system design. This comprehensive treatment of the statistical issues that arise in recommender systems includes detailed, in-depth discussions of current state-of-the-art methods such as adaptive sequential designs (multi-armed bandit methods), bilinear random-effects models (matrix factorization) and scalable model fitting using modern computing paradigms like MapReduce. The authors draw upon their vast experience working with such large-scale systems at Yahoo! and LinkedIn, and bridge the gap between theory and practice by illustrating complex concepts with examples from applications they are directly involved with.

Asymptotics in one form or another are part of the landscape for every mathematician. The objective of this book is to present the ideas of how to approach asymptotic problems that arise in discrete mathematics, analysis of algorithms, and number theory. A broad range of topics is covered, including distribution of prime integers, Erd?s Magic, random graphs, Ramsey numbers, and asymptotic geometry.The author is a disciple of Paul Erd?s, who taught him about Asymptopia. Primes less than n , graphs with v vertices, random walks of t steps - Erd?s was fascinated by the limiting behavior as the variables approached, but never reached, infinity. Asymptotics is very much an art. The various functions nlnn , n 2 , lnn n , lnn ? ? ? ? , 1 nlnn all have distinct personalities. Erd?s knew these functions as personal friends. It is the author's hope that these insights may be passed on, that the reader may similarly feel which function has the right temperament for a given task. This book is aimed at strong undergraduates, though it is also suitable for particularly good high school students or for graduates wanting to learn some basic techniques.Asymptopia is a beautiful world. Enjoy!

Computational Aeroacoustics (CAA) is a relatively new research area. CAA algorithms have developed rapidly and the methods have been applied in many areas of aeroacoustics. The objective of CAA is not simply to develop computational methods but also to use these methods to solve practical aeroacoustics problems and to perform numerical simulation of aeroacoustic phenomena. By analyzing the simulation data, an investigator can determine noise generation mechanisms and sound propagation processes. This is both a textbook for graduate students and a reference for researchers in CAA and as such is self-contained. No prior knowledge of numerical methods for solving PDE's is needed, however, a general understanding of partial differential equations and basic numerical analysis is assumed. Exercises are included and are designed to be an integral part of the chapter content. In addition, sample computer programs are included to illustrate the implementation of the numerical algorithms.

Gain a contemporary overview of today's computer science with the best-selling INVITATION TO COMPUTER SCIENCE, 8E. This flexible, non-language-specific book uses an algorithm-centered approach that's ideal for your first introduction to computer science. Measurable learning objectives and a clear hierarchy help introduce algorithms, hardware, virtual machines, software development, applications, and social issues. Exercises, practice problems, and feature boxes emphasize real-life context as well as the latest material on privacy, drones, cloud computing, and net neutrality. Optional online language modules for C++, Java, Python, C#, and Ada let you learn a programming language. MindTap is available with online study tools, a digital Lab Manual and lab software with 20 laboratory projects. Hands-on activities enable you to truly experience the fundamentals of today's computer science.

Gain a contemporary overview of today's computer science with the best-selling INVITATION TO COMPUTER SCIENCE, 8E. This flexible, non-language-specific book uses an algorithm-centered approach that's ideal for your first introduction to computer science. Measurable learning objectives and a clear hierarchy help introduce algorithms, hardware, virtual machines, software development, applications, and social issues. Exercises, practice problems, and feature boxes emphasize real-life context as well as the latest material on privacy, drones, cloud computing, and net neutrality. Optional online language modules for C++, Java, Python, C#, and Ada let you learn a programming language. MindTap is available with online study tools, a digital Lab Manual and lab software with 20 laboratory projects. Hands-on activities enable you to truly experience the fundamentals of today's computer science.

Goal programming is one of the most widely used methodologies in operations research and management science, and encompasses most classes of multiple objective programming models. Ignizio provides a concise and lucid overview of (a) the linear goal programming model, (b) a computationally efficient algorithm for solution, (c) duality and sensitivity analysis and (d) extensions of the methodology to integer as well as non-linear models.

Designing algorithms to recommend items such as news articles and movies to users is a challenging task in numerous web applications. The crux of the problem is to rank items based on users' responses to different items to optimize for multiple objectives. Major technical challenges are high dimensional prediction with sparse data and constructing high dimensional sequential designs to collect data for user modeling and system design. This comprehensive treatment of the statistical issues that arise in recommender systems includes detailed, in-depth discussions of current state-of-the-art methods such as adaptive sequential designs (multi-armed bandit methods), bilinear random-effects models (matrix factorization) and scalable model fitting using modern computing paradigms like MapReduce. The authors draw upon their vast experience working with such large-scale systems at Yahoo! and LinkedIn, and bridge the gap between theory and practice by illustrating complex concepts with examples from applications they are directly involved with.

Computational Aeroacoustics (CAA) is a relatively new research area. CAA algorithms have developed rapidly and the methods have been applied in many areas of aeroacoustics. The objective of CAA is not simply to develop computational methods but also to use these methods to solve practical aeroacoustics problems and to perform numerical simulation of aeroacoustic phenomena. By analyzing the simulation data, an investigator can determine noise generation mechanisms and sound propagation processes. This is both a textbook for graduate students and a reference for researchers in CAA and as such is self-contained. No prior knowledge of numerical methods for solving PDE's is needed, however, a general understanding of partial differential equations and basic numerical analysis is assumed. Exercises are included and are designed to be an integral part of the chapter content. In addition, sample computer programs are included to illustrate the implementation of the numerical algorithms.