Advances in Bio-inspired Computing for Combinatorial Optimization Problems
Book Details:
Pages: | 188 |
Published: | Aug 20 2013 |
Posted: | Nov 19 2014 |
Language: | English |
Book format: | PDF |
Book size: | 3.87 MB |
Book Description:
"Advances in Bio-inspired Combinatorial Optimization Problems" illustrates several recent bio-inspired efficient algorithms for solving NP-hard problems.Theoretical bio-inspired concepts and models, in particular for agents, ants and virtual robots are described. Large-scale optimization problems, for example: the Generalized Traveling Salesman Problem and the Railway Traveling Salesman Problem, are solved and their results are discussed.Some of the main concepts and models described in this book are: inner rule to guide ant search - a recent model in ant optimization, heterogeneous sensitive ants; virtual sensitive robots; ant-based techniques for static and dynamic routing problems; stigmergic collaborative agents and learning sensitive agents.This monograph is useful for researchers, students and all people interested in the recent natural computing frameworks. The reader is presumed to have knowledge of combinatorial optimization, graph theory, algorithms and programming. The book should furthermore allow readers to acquire ideas, concepts and models to use and develop new software for solving complex real-life problems.
Future Paradigms and Directions
The development and availability of new computing and communication devices, and the increased connectivity between these devices, thanks to wired and wireless networks, are enabling new opportunities for people to perform their operations anywhere and anytime. This technological expansion has developed a multitude of challenges that demand further research. ,bAdvances in Ubiquitous Computing: Future Paradigms and Directions investigates the technology foreground of ubiquitous computing, the emerging applications and services, as well as certain social issues that are vital for the successful deployment of a ubiquitous computing application, through a multi-perspective analytical lens. Providing academics and practitioners with high quality, authorit...
2nd Edition
The second edition of this 5-volume handbook is intended to be a basic yet comprehensive reference work in combinatorial optimization that will benefit newcomers and researchers for years to come. This multi-volumework deals with several algorithmic approaches for discrete problems as well as with many combinatorial problems. The editors have brought together almost every aspect of this enormous field of combinatorial optimization, an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communica...
Distributed Computing Through Combinatorial Topology describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. The authors present a solid theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, such as multicore microprocessors, wireless networks, distributed systems, and Internet protocols. Today, a new student or researcher must assemble a collection of scattered conference publications, which are typically terse and commonly use different notations and terminologies. This book provides a self-contained explanation of the mathematics to readers with computer science backgrounds, as well as explaining computer science concepts to readers with back...
2007 - 2021 © eBooks-IT.org