Isbn: 9783642401787 - advances in bio-inspired computing for combinatorial optimization problems: 57 (intelligent systems reference library, 57) (15 resultados)

Condición: New.

Condición: New. In English.

Condición: New. pp. x + 188.

Hardcover. Condición: Neu. Neu Neuware, auf Lager - '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.…

Hardcover. Condición: Brand New. 2014 edition. 200 pages. 9.25x6.50x0.75 inches. In Stock.

Condición: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | "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.…

Hardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condición: As New. Unread book in perfect condition.

Condición: gut. 2013. Advances in Bio-inspired Computing for Combinatorial Optimization Problems (Intelligent Systems Reference Library, 57, Band 57) In deutscher Sprache. pages.

Condición: new. Questo è un articolo print on demand.

Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -'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. 200 pp. Englisch.…

Gebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Introduces new bio-inspired techniques based on ants, agents and virtual robots Solves real-life complex problems using the introduced bio-inspired techniques Recent research on Bio-inspired Computing for Combinatorial Optimization Problems.…

Condición: New. Print on Demand pp. x + 188 45 Illus. (3 Col.).

Buch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -'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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 200 pp. Englisch.…

Condición: New. PRINT ON DEMAND pp. x + 188.