Showing results for "thomas jansen"
Showing 1 - 2 of 2 Results
Adult content is visible.
Analyzing Evolutionary Algorithms
The Computer Science Perspective
- Series -
- Computer Science (R0)
2013
EN
Evolutionary algorithms is a class of randomized heuristics inspired by natural evolution. They are applied in many different contexts, in particular in optimization, and analysis of such algorithms has seen tremendous advances in recent years.In this book the author provides an introduction to the methods used to analyze evolutionary algorithms and other randomized search heuristics. He starts with an algorithmic and modular perspective and gives guidelines for the design of evolu...
Advances in Computational Intelligence Systems
Contributions Presented at the 20th UK Workshop on Computational Intelligence, September 8-10, 2021, Aberystwyth, Wales, UK
2021
EN
This book contains the papers presented at the 20th UK Workshop on Computational Intelligence (UKCI 2021), held virtually by Aberystwyth University, 8–10th September 2021. This marks the 20th anniversary of UKCI; a testament to the increasing role and importance of Computational Intelligence (CI) and the continuing interest in its development. UKCI provides a forum for the academic community and industry to share ideas and experience in this field. EDMA 2021, the 4th International Engineer...
People who read this also enjoyed
2013
EN
A comprehensive treatment of numerical linear algebra from the standpoint of both theory and practice.The fourth edition of Gene H. Golub and Charles F. Van Loan's classic is an essential reference for computational scientists and engineers in addition to researchers in the numerical linear algebra community. Anyone whose work requires the solution to a matrix problem and an appreciation of its mathematical properties will find this book to be an indispensible tool...
Performance Modeling and Design of Computer Systems
Queueing Theory in Action
2013
EN
Tackling the questions that systems designers care about, this book brings queueing theory decisively back to computer science. The book is written with computer scientists and engineers in mind and is full of examples from computer systems, as well as manufacturing and operations research. Fun and readable, the book is highly approachable, even for undergraduates, while still being thoroughly rigorous and also covering a much wider span of topics than many queueing books. Readers benefit ...
Computational Intelligence
Synergies of Fuzzy Logic, Neural Networks and Evolutionary Computing
2013
EN
Computational Intelligence: Synergies of Fuzzy Logic, Neural Networks and Evolutionary Computing presents an introduction to some of the cutting edge technological paradigms under the umbrella of computational intelligence. Computational intelligence schemes are investigated with the development of a suitable framework for fuzzy logic, neural networks and evolutionary computing, neuro-fuzzy systems, evolutionary-fuzzy systems and evolutionary neural systems. Applications to linear...
- Series -
- Computer Science (R0)
2015
EN
This book presents basic ideas of machine learning in a way that is easy to understand, by providing hands-on practical advice, using simple examples, and motivating students with discussions of interesting applications. The main topics include Bayesian classifiers, nearest-neighbor classifiers, linear and polynomial classifiers, decision trees, neural networks, and support vector machines. Later chapters show how to combine these simple tools by way of “boosting,” how to exploit them in m...
2012
EN
The positive reciprocal pairwise comparison matrix (PCM) is one of the key components which is used to quantify the qualitative and/or intangible attributes into measurable quantities. This book examines six understudied issues of PCM, i.e. consistency test, inconsistent data identification and adjustment, data collection, missing or uncertain data estimation, and sensitivity analysis of rank reversal. The maximum eigenvalue threshold method is proposed as the new consistency index for the...
2013
EN
Markov decision process (MDP) models are widely used for modeling sequential decision-making problems that arise in engineering, economics, computer science, and the social sciences. Many real-world problems modeled by MDPs have huge state and/or action spaces, giving an opening to the curse of dimensionality and so making practical solution of the resulting models intractable. In other cases, the system of interest is too complex to allow explicit specification of some of the MDP model pa...
2009
EN
Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce).Cryptographic Boolean Functions and Applications is a concise reference that shows how Boolean functions are used in cryptography. Currently, practitioners who need to apply Boolean functions in the design of cryptographic algorithms and protocols need t...
2015
EN
In an attempt to introduce application scientists and graduate students to the exciting topic of positive definite kernels and radial basis functions, this book presents modern theoretical results on kernel-based approximation methods and demonstrates their implementation in various settings. The authors explore the historical context of this fascinating topic and explain recent advances as strategies to address long-standing problems. Examples are drawn from fields as diverse as function ...
Genetic Algorithms and their Applications
Proceedings of the Second International Conference on Genetic Algorithms
2013
EN
Accessible
First Published in 1987. This is the collected proceedings of the second International Conference on Genetic Algorithms held at the Massachusetts Institute of Technology, Cambridge, MA on the 28th to the 31st July 1987. With papers on Genetic search theory, Adaptive search operators, representation issues, connectionism and parallelism, credit assignment ad learning, and applications.
2011
EN
Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorit...











