컨텐츠로 이동
Advances in bio-inspired computing for combinatorial optimization problems 해당 항목을 미리보기
닫기해당 항목을 미리보기
확인중입니다…

Advances in bio-inspired computing for combinatorial optimization problems

저자: Camelia-Mihaela Pintea
출판사: Berlin : Springer, [2013?] ©2014
시리즈: Intelligent systems reference library, v.57
판/형식:   전자도서 : 문서 : 영어모든 판과 형식 보기
데이터베이스:WorldCat
요약:
"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  더 읽기…
평가:

(아무런 평가가 없습니다.) 0 리뷰와 함께 - 첫번째로 올려주세요.

주제
다음과 같습니다:

 

온라인으로 문서 찾기

이 항목에 대한 링크

도서관에서 사본 찾기

&AllPage.SpinnerRetrieving; 해당항목을 보유하고 있는 도서관을 찾는 중

상세정보

장르/형태: Electronic books
자료 유형: 문서, 인터넷 자료
문서 형식: 인터넷 자원, 컴퓨터 파일
모든 저자 / 참여자: Camelia-Mihaela Pintea
ISBN: 9783642401794 3642401791
OCLC 번호: 857586057
설명: 1 online resource (x, 188 pages) : illustrations.
내용: Part I. Biological Computing and Optimization --
Part II. Ant Algorithms --
Part III. Bio-inspired Multi-Agent Systems --
Part IV. Applications with Bio-inspired Algorithms --
Part V. Conclusions and Remarks.
일련 제목: Intelligent systems reference library, v.57
책임: Camelia-Mihaela Pintea.
더 많은 정보:

초록:

This book illustrates recent bio-inspired efficient algorithms for solving NP-hard problems. Discusses theoretical bio-inspired concepts and models, in particular for agents, ants and virtual robots,  더 읽기…

리뷰

사용자-기여 리뷰
GoodReads 리뷰 가져오는 중…
DOGObooks 리뷰를 가지고 오는 중…

태그

첫번째 되기
요청하신 것을 확인하기

이 항목을 이미 요청하셨을 수도 있습니다. 만약 이 요청을 계속해서 진행하시려면 Ok을 선택하세요.

링크된 데이터


<http://www.worldcat.org/oclc/857586057>
library:oclcnum"857586057"
library:placeOfPublication
owl:sameAs<info:oclcnum/857586057>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:bookFormatschema:EBook
schema:copyrightYear"2014"
schema:creator
schema:datePublished"2013"
schema:description"Part I. Biological Computing and Optimization -- Part II. Ant Algorithms -- Part III. Bio-inspired Multi-Agent Systems -- Part IV. Applications with Bio-inspired Algorithms -- Part V. Conclusions and Remarks."
schema: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."
schema:exampleOfWork<http://worldcat.org/entity/work/id/1393974402>
schema:genre"Electronic books."
schema:inLanguage"en"
schema:name"Advances in bio-inspired computing for combinatorial optimization problems"
schema:url
schema:url
schema:url<http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=629957>
schema:workExample
schema:workExample

Content-negotiable representations

윈도우 닫기

WorldCat에 로그인 하십시오 

계정이 없으세요? 아주 간단한 절차를 통하여 무료 계정을 만드실 수 있습니다.