Hasil Pencarian  ::  Simpan CSV :: Kembali

"Memetic Algorithms (MAs) are computational intelligence structures combining multiple and various operators in order to address optimization problems. The combination and interaction amongst operators evolves and promotes the diffusion of the most successful units and generates an algorithmic behavior which can handle complex objective functions and hard fitness landscapes. “Handbook of memetic algorithms” organizes, in a structured way, all the the most important results in the field of MAs since their earliest definition until now. A broad review including various algorithmic solutions as well as successful applications is included in this book. Each class of optimization problems, such as constrained optimization, multi-objective optimization, continuous vs combinatorial problems, uncertainties, are analysed separately and, for each problem, memetic recipes for tackling the difficulties are given with some successful examples. "

"This book constitutes the thoroughly refereed post-conference proceedings of the 7th International ICST Conference on Broadband Communications, Networks and Systems (BROADNETS 2010) held in October 2010 in Athens, Greece. The 39 revised full papers were carefully selected from numerous submissions. The conference was divided in 3 tracks: Optical, Wireless and Internet. The optical track covers topics such as optical switch architectures, reliable optical networking, routing, wavelength assignment, and traffic grooming, network control and management. The wireless track highlights MIMO and OFDM techniques, mobility management, routing protocols, hybrid networks and the internet track covers routing, scheduling, security, trust, semantic technologies and social networks."

"Algorithms are a fundamental building block of artificial intelligence - and, increasingly, society - but our legal institutions have largely failed to recognize or respond to this reality. The Cambridge Handbook of the Law of Algorithms, which features contributions from US, EU, and Asian legal scholars, discusses the specific challenges algorithms pose not only to current law, but also - as algorithms replace people as decision makers - to the foundations of society itself. The work includes wide coverage of the law as it relates to algorithms, with chapters analyzing how human biases have crept into algorithmic decision-making about who receives housing or credit, the length of sentences for defendants convicted of crimes, and many other decisions that impact constitutionally protected groups. Other issues covered in the work include the impact of algorithms on the law of free speech, intellectual property, and commercial and human rights law."

"This clearly structured and easy to read textbook explains the concepts and techniques required to write programs that can handle large amounts of data efficiently.Project-oriented and classroom-tested, the book presents a number of important algorithms supported by motivating examples that bring meaning to the problems faced by computer programmers. The idea of computational complexity is also introduced, demonstrating what can and cannot be computed efficiently so that the programmer can make informed judgements about the algorithms they use. The text assumes some basic experience in computer programming and familiarity in an object-oriented language, but not necessarily with Python.Topics and features:- Includes both introductory and advanced data structures and algorithms topics, with suggested chapter sequences for those respective courses provided in the preface- Provides learning goals, review questions and programming exercises in each chapter, as well as numerous illustrative examples- Offers downloadable programs and supplementary files at an associated website, with instructor materials available from the author- Presents a primer on Python for those coming from a different language background- Reviews the use of hashing in sets and maps, along with an examination of binary search trees and tree traversals, and material on depth first search of graphs- Discusses topics suitable for an advanced course, such as membership structures, heaps, balanced binary search trees, B-trees and heuristic search."

"This book constitutes the refereed proceedings of the 12th International Workshop on Algorithms in Bioinformatics, WABI 2012, held in Ljubljana, Slovenia, in September 2012. WABI 2012 is one of six workshops which, along with the European Symposium on Algorithms (ESA), constitute the ALGO annual meeting and focuses on algorithmic advances in bioinformatics, computational biology, and systems biology with a particular emphasis on discrete algorithms and machine-learning methods that address important problems in molecular biology. The 35 full papers presented were carefully reviewed and selected from 92 submissions. The papers include algorithms for a variety of biological problems including phylogeny, DNA and RNA sequencing and analysis, protein structure, and others."

"Unlike other books on theoretical computer science, this textbook organizes approximation algorithms into chapters based on the design techniques for the algorithms. based on the design techniques for the algorithms. It helps the reader to better understand the design and analysis techniques for approximation algorithms."