東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Theory of randomized search heuristi...

Auger, Anne.

Linked to FindBook

Google Book

Amazon

博客來

Theory of randomized search heuristics = foundations and recent developments /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Theory of randomized search heuristics/ editors, Anne Auger, Benjamin Doerr.{me_controlnum}{me_controlnum}
Reminder of title:	foundations and recent developments /
other author:	Auger, Anne.
Published:	Singapore ;World Scientific Pub. Co., : c2011.,
Description:	x, 359 p. :ill. (some col.)
Subject:	Heuristic programming. -
Online resource:	http://www.worldscientific.com/worldscibooks/10.1142/7438#t=toc
ISBN:	9789814282673 (electronic bk.)

Theory of randomized search heuristics = foundations and recent developments /
Theory of randomized search heuristicsfoundations and recent developments /[electronic resource] :editors, Anne Auger, Benjamin Doerr.{me_controlnum}{me_controlnum} - Singapore ;World Scientific Pub. Co.,c2011. - x, 359 p. :ill. (some col.) - Series on theoretical computer science ;v. 1. - Series on theoretical computer science ;v. 1..

Includes bibliographical references and index.

Randomized search heuristics such as evolutionary algorithms, genetic algorithms, evolution strategies, ant colony and particle swarm optimization turn out to be highly successful for optimization in practice. The theory of randomized search heuristics, which has been growing rapidly in the last five years, also attempts to explain the success of the methods in practical applications. This book covers both classical results and the most recent theoretical developments in the field of randomized search heuristics such as runtime analysis, drift analysis and convergence. Each chapter provides an overview of a particular domain and gives insights into the proofs and proof techniques of more specialized areas. Open problems still remain widely in randomized search heuristics - being a relatively young and vast field. These problems and directions for future research are addressed and discussed in this book. The book will be an essential source of reference for experts in the domain of randomized search heuristics and also for researchers who are involved or ready to embark in this field. As an advanced textbook, graduate students will benefit from the comprehensive coverage of topics.

Electronic reproduction.
Singapore :
World Scientific Publishing Co.,
2011.

System requirements: Adobe Acrobat Reader.

ISBN: 9789814282673 (electronic bk.)Subjects--Topical Terms:

698997
Heuristic programming.

LC Class. No.: QA402.5

Dewey Class. No.: 519.7

Theory of randomized search heuristics = foundations and recent developments /
LDR:02382nmm a2200289 a 4500 001 1295542
003 WSP
005 20110530145437.0
006 m d
007 cr cuu|||uu|||
008 121114s2011 si a sb 001 0 eng d
020 $a 9789814282673 (electronic bk.)
020 $z 9814282669
020 $z 9789814282666
035 $a 00001306
040 $a WSPC $b eng $c WSPC
050 4 $a QA402.5
082 0 4 $a 519.7 $2 22
245 0 0 $a Theory of randomized search heuristics $h [electronic resource] : $b foundations and recent developments / $c editors, Anne Auger, Benjamin Doerr.{me_controlnum}{me_controlnum}
260 $a Singapore ; $a Hackensack, N.J. : $b World Scientific Pub. Co., $c c2011.
300 $a x, 359 p. : $b ill. (some col.)
490 1 $a Series on theoretical computer science ; $v v. 1
504 $a Includes bibliographical references and index.
520 $a Randomized search heuristics such as evolutionary algorithms, genetic algorithms, evolution strategies, ant colony and particle swarm optimization turn out to be highly successful for optimization in practice. The theory of randomized search heuristics, which has been growing rapidly in the last five years, also attempts to explain the success of the methods in practical applications. This book covers both classical results and the most recent theoretical developments in the field of randomized search heuristics such as runtime analysis, drift analysis and convergence. Each chapter provides an overview of a particular domain and gives insights into the proofs and proof techniques of more specialized areas. Open problems still remain widely in randomized search heuristics - being a relatively young and vast field. These problems and directions for future research are addressed and discussed in this book. The book will be an essential source of reference for experts in the domain of randomized search heuristics and also for researchers who are involved or ready to embark in this field. As an advanced textbook, graduate students will benefit from the comprehensive coverage of topics.
533 $a Electronic reproduction. $b Singapore : $c World Scientific Publishing Co., $d 2011. $n System requirements: Adobe Acrobat Reader. $n Mode of access: World Wide Web. $n Available to subscribing institutions.
650 0 $a Heuristic programming. $3 698997
650 0 $a Heuristic algorithms. $3 1066682
700 1 $a Auger, Anne. $3 1572843
700 1 $a Doerr, Benjamin. $3 1572844
710 2 $a World Scientific (Firm) $3 560950
776 1 $z 9814282669
776 1 $z 9789814282666
830 0 $a Series on theoretical computer science ; $v v. 1. $3 1572845
856 4 0 $u http://www.worldscientific.com/worldscibooks/10.1142/7438#t=toc