Ant colony optimization
The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the abi...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Dorigo, Marco [verfasserIn] Stützle, Thomas [mitwirkender] |
|---|
| Format: |
E-Book |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
Cambridge, Massachusetts: MIT Press ; c2004 |
|---|
| Schlagwörter: | |
|---|---|
| Schlagwörter: |
| Systematik: |
|
|---|
| Anmerkung: |
"A Bradford book.". - Includes bibliographical references (p. [277]-300) and index. - Description based on PDF viewed 12/23/2015 |
|---|---|
| Umfang: |
1 PDF (xi, 305 pages) ; illustrations. |
| Beschreibung: |
Mode of access: World Wide Web. |
| Weitere Ausgabe: |
Erscheint auch als Druck-Ausgabe Dorigo, Marco, 1961 -: Ant colony optimization - Cambridge, Mass. [u.a.] : MIT Press, 2004 |
|---|
| Links: | |
|---|---|
| ISBN: |
978-0-262-25603-2 |
| Katalog-ID: |
1727350987 |
|---|
| LEADER | 01000cam a22002652 4500 | ||
|---|---|---|---|
| 001 | 1727350987 | ||
| 003 | DE-627 | ||
| 005 | 20231004172559.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 200818s2004 xx |||||o 00| ||eng c | ||
| 020 | |a 9780262256032 |c ebook |9 978-0-262-25603-2 | ||
| 035 | |a (DE-627)1727350987 | ||
| 035 | |a (DE-599)KEP055117724 | ||
| 035 | |a (OCoLC)1196136624 | ||
| 035 | |a (ZBM)1092.90066 | ||
| 035 | |a (MITPRESS)6267250 | ||
| 035 | |a (EBP)055117724 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rda | ||
| 041 | |a eng | ||
| 084 | |a ST 323 |q SEPA |2 rvk |0 (DE-625)rvk/143659: | ||
| 084 | |a SK 890 |q SEPA |2 rvk |0 (DE-625)rvk/143267: | ||
| 084 | |a WC 7000 |q SEPA |2 rvk |0 (DE-625)rvk/148142: | ||
| 084 | |a ST 300 |q SEPA |2 rvk |0 (DE-625)rvk/143650: | ||
| 084 | |a SK 870 |q SEPA |2 rvk |0 (DE-625)rvk/143265: | ||
| 084 | |a *90C59 |2 msc | ||
| 084 | |a 90-02 |2 msc | ||
| 084 | |a 31.80 |2 bkl | ||
| 084 | |a 54.51 |2 bkl | ||
| 084 | |a 54.72 |2 bkl | ||
| 100 | 1 | |a Dorigo, Marco |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Ant colony optimization |c Marco Dorigo, Thomas Stützle |
| 264 | 1 | |a Cambridge, Massachusetts |b MIT Press |c c2004 | |
| 300 | |a 1 PDF (xi, 305 pages) |b illustrations. | ||
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a "A Bradford book.". - Includes bibliographical references (p. [277]-300) and index. - Description based on PDF viewed 12/23/2015 | ||
| 520 | |a The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms. | ||
| 538 | |a Mode of access: World Wide Web. | ||
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Ants ; Behavior ; Mathematical models | |
| 689 | 1 | 0 | |D s |0 (DE-588)4704280-1 |0 (DE-627)355651467 |0 (DE-576)215375157 |a Ameisenalgorithmus |2 gnd |
| 689 | 1 | 1 | |D s |0 (DE-588)4793676-9 |0 (DE-627)394208110 |0 (DE-576)216457432 |a Schwarmintelligenz |2 gnd |
| 689 | 1 | 2 | |D s |0 (DE-588)4043664-0 |0 (DE-627)106208705 |0 (DE-576)209057009 |a Optimierung |2 gnd |
| 689 | 1 | |5 DE-101 | |
| 689 | 0 | 0 | |D s |0 (DE-588)4704280-1 |0 (DE-627)355651467 |0 (DE-576)215375157 |a Ameisenalgorithmus |2 gnd |
| 689 | 0 | 1 | |D s |0 (DE-588)4031826-6 |0 (DE-627)106263900 |0 (DE-576)208994432 |a Kombinatorische Optimierung |2 gnd |
| 689 | 0 | |5 (DE-627) | |
| 700 | 1 | |a Stützle, Thomas |e mitwirkender |4 ctb | |
| 776 | 1 | |z 9780262042192 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780262042192 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Dorigo, Marco, 1961 - |t Ant colony optimization |d Cambridge, Mass. [u.a.] : MIT Press, 2004 |h XIV, 305 S. |w (DE-627)372329926 |w (DE-576)112288391 |z 0262042193 |z 9780262042192 |
| 856 | 4 | 0 | |u https://ieeexplore.ieee.org/book/6267250 |m X:MITPRESS |x Verlag |z lizenzpflichtig |
| 856 | 4 | 2 | |u https://zbmath.org/?q=an:1092.90066 |m B:ZBM |v 2021-04-12 |x Verlag |y Zentralblatt MATH |3 Inhaltstext |
| 912 | |a ZDB-37-IEM |b 2012 | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a ISIL_DE-18 | ||
| 912 | |a SYSFLAG_1 | ||
| 912 | |a GBV_KXP | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_22_i22818 | ||
| 912 | |a GBV_ILN_23 | ||
| 912 | |a ISIL_DE-830 | ||
| 912 | |a GBV_ILN_100 | ||
| 912 | |a ISIL_DE-Ma9 | ||
| 912 | |a GBV_ILN_370 | ||
| 912 | |a ISIL_DE-1373 | ||
| 912 | |a GBV_ILN_2015 | ||
| 912 | |a ISIL_DE-93 | ||
| 936 | r | v | |a ST 323 |b Virtual Reality |k Informatik |k Monografien |k Einzelne Anwendungen der Datenverarbeitung |k Virtual Reality |0 (DE-627)1272613496 |0 (DE-625)rvk/143659: |0 (DE-576)202613496 |
| 936 | r | v | |a SK 890 |b Ganzzahlige und kombinatorische Optimierung, Graphentheorie |k Mathematik |k Monografien |k Ganzzahlige und kombinatorische Optimierung, Graphentheorie |0 (DE-627)1271487969 |0 (DE-625)rvk/143267: |0 (DE-576)201487969 |
| 936 | r | v | |a WC 7000 |b Biometrie, Biomathematik, Biostatistik |k Biologie |k Methoden |k Biometrie, Biomathematik, Biostatistik, Bioinformatik, Biokybernetik |k Biometrie, Biomathematik, Biostatistik |0 (DE-627)1271493756 |0 (DE-625)rvk/148142: |0 (DE-576)201493756 |
| 936 | r | v | |a ST 300 |b Allgemeines |k Informatik |k Monografien |k Künstliche Intelligenz |k Allgemeines |0 (DE-627)1271119005 |0 (DE-625)rvk/143650: |0 (DE-576)201119005 |
| 936 | r | v | |a SK 870 |b Lineare und Nichtlineare Optimierung |k Mathematik |k Monografien |k Lineare und Nichtlineare Optimierung |0 (DE-627)127088123X |0 (DE-625)rvk/143265: |0 (DE-576)20088123X |
| 936 | b | k | |a 31.80 |j Angewandte Mathematik |q SEPA |0 (DE-627)106419005 |
| 936 | b | k | |a 54.51 |j Programmiermethodik |q SEPA |0 (DE-627)106418122 |
| 936 | b | k | |a 54.72 |j Künstliche Intelligenz |q SEPA |0 (DE-627)10641240X |
| 951 | |a BO | ||
| 953 | |2 045F |a 519.6 | ||
| 980 | |2 22 |1 01 |x 0018 |b 3848477009 |h olrm-h228-MITIEEE |y zi22818 |z 03-02-21 | ||
| 980 | |2 23 |1 01 |x 0830 |b 3957242509 |h olr-MIT |u i |y z |z 23-07-21 | ||
| 980 | |2 100 |1 01 |x 3100 |b 4472469618 |c 09 |f --%%-- |d eBook MIT Press |e --%%-- |j --%%-- |h OLR-MIT-CEC |k Vervielfältigungen (z.B. Kopien, Downloads) sind nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. |y z |z 30-01-24 | ||
| 980 | |2 370 |1 01 |x 4370 |b 401122393X |h olr-ebook mitieee |k Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. |u i |y z |z 01-12-21 | ||
| 980 | |2 2015 |1 01 |x DE-93 |b 3740753242 |c 00 |f --%%-- |d --%%-- |e p |j --%%-- |k Campuslizenz |y l01 |z 18-08-20 | ||
| 981 | |2 22 |1 01 |x 0018 |y Volltextzugang Campus |r https://ieeexplore.ieee.org/book/6267250 | ||
| 981 | |2 22 |1 01 |x 0018 |y Nur für Angehörige der Universität Hamburg: Volltextzugang von außerhalb des Campus |r http://emedien.sub.uni-hamburg.de/han/ieee/ieeexplore.ieee.org/book/6267250 | ||
| 981 | |2 23 |1 01 |x 0830 |y MIT Press EBook |r https://ieeexplore.ieee.org/book/6267250 | ||
| 981 | |2 100 |1 01 |x 3100 |r https://ieeexplore.ieee.org/book/6267250 | ||
| 981 | |2 100 |1 01 |x 3100 |y für Uniangehörige: Zugang weltweit |r http://han.med.uni-magdeburg.de/han/mitvia-ieee/ieeexplore.ieee.org/book/6267250 | ||
| 981 | |2 370 |1 01 |x 4370 |y E-Book: Zugriff im HCU-Netz. Zugriff von außerhalb nur für HCU-Angehörige möglich |r https://ieeexplore.ieee.org/book/6267250 | ||
| 981 | |2 2015 |1 01 |x DE-93 |r https://ieeexplore.ieee.org/book/6267250 | ||
| 985 | |2 23 |1 01 |x 0830 |a 2018-01805, 2018-01806, 2018-01808 | ||
| 995 | |2 22 |1 01 |x 0018 |a olrm-h228-MITIEEE | ||
| 995 | |2 23 |1 01 |x 0830 |a olr-MIT | ||
| 995 | |2 100 |1 01 |x 3100 |a OLR-MIT-CEC | ||
| 995 | |2 370 |1 01 |x 4370 |a olr-ebook mitieee | ||
| 998 | |2 370 |1 01 |x 4370 |0 2021.12.01 | ||
| author_variant |
m d md |
|---|---|
| matchkey_str |
book:9780262256032:2004---- |
| oclc_num |
1196136624 |
| hierarchy_sort_str |
c2004 |
| bklnumber |
31.80 54.51 54.72 |
| publishDate |
2004 |
| allfields |
9780262256032 ebook 978-0-262-25603-2 (DE-627)1727350987 (DE-599)KEP055117724 (OCoLC)1196136624 (ZBM)1092.90066 (MITPRESS)6267250 (EBP)055117724 DE-627 ger DE-627 rda eng ST 323 SEPA rvk (DE-625)rvk/143659: SK 890 SEPA rvk (DE-625)rvk/143267: WC 7000 SEPA rvk (DE-625)rvk/148142: ST 300 SEPA rvk (DE-625)rvk/143650: SK 870 SEPA rvk (DE-625)rvk/143265: *90C59 msc 90-02 msc 31.80 bkl 54.51 bkl 54.72 bkl Dorigo, Marco verfasserin aut Ant colony optimization Marco Dorigo, Thomas Stützle Cambridge, Massachusetts MIT Press c2004 1 PDF (xi, 305 pages) illustrations. Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier "A Bradford book.". - Includes bibliographical references (p. [277]-300) and index. - Description based on PDF viewed 12/23/2015 The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms. Mode of access: World Wide Web. Mathematical optimization Ants ; Behavior ; Mathematical models s (DE-588)4704280-1 (DE-627)355651467 (DE-576)215375157 Ameisenalgorithmus gnd s (DE-588)4793676-9 (DE-627)394208110 (DE-576)216457432 Schwarmintelligenz gnd s (DE-588)4043664-0 (DE-627)106208705 (DE-576)209057009 Optimierung gnd DE-101 s (DE-588)4704280-1 (DE-627)355651467 (DE-576)215375157 Ameisenalgorithmus gnd s (DE-588)4031826-6 (DE-627)106263900 (DE-576)208994432 Kombinatorische Optimierung gnd (DE-627) Stützle, Thomas mitwirkender ctb 9780262042192 Erscheint auch als Druck-Ausgabe 9780262042192 Erscheint auch als Druck-Ausgabe Dorigo, Marco, 1961 - Ant colony optimization Cambridge, Mass. [u.a.] : MIT Press, 2004 XIV, 305 S. (DE-627)372329926 (DE-576)112288391 0262042193 9780262042192 https://ieeexplore.ieee.org/book/6267250 X:MITPRESS Verlag lizenzpflichtig https://zbmath.org/?q=an:1092.90066 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext ZDB-37-IEM 2012 GBV_ILN_22 ISIL_DE-18 SYSFLAG_1 GBV_KXP SSG-OPC-MAT GBV_ILN_22_i22818 GBV_ILN_23 ISIL_DE-830 GBV_ILN_100 ISIL_DE-Ma9 GBV_ILN_370 ISIL_DE-1373 GBV_ILN_2015 ISIL_DE-93 ST 323 Virtual Reality Informatik Monografien Einzelne Anwendungen der Datenverarbeitung Virtual Reality (DE-627)1272613496 (DE-625)rvk/143659: (DE-576)202613496 SK 890 Ganzzahlige und kombinatorische Optimierung, Graphentheorie Mathematik Monografien Ganzzahlige und kombinatorische Optimierung, Graphentheorie (DE-627)1271487969 (DE-625)rvk/143267: (DE-576)201487969 WC 7000 Biometrie, Biomathematik, Biostatistik Biologie Methoden Biometrie, Biomathematik, Biostatistik, Bioinformatik, Biokybernetik Biometrie, Biomathematik, Biostatistik (DE-627)1271493756 (DE-625)rvk/148142: (DE-576)201493756 ST 300 Allgemeines Informatik Monografien Künstliche Intelligenz Allgemeines (DE-627)1271119005 (DE-625)rvk/143650: (DE-576)201119005 SK 870 Lineare und Nichtlineare Optimierung Mathematik Monografien Lineare und Nichtlineare Optimierung (DE-627)127088123X (DE-625)rvk/143265: (DE-576)20088123X 31.80 Angewandte Mathematik SEPA (DE-627)106419005 54.51 Programmiermethodik SEPA (DE-627)106418122 54.72 Künstliche Intelligenz SEPA (DE-627)10641240X BO 045F 519.6 22 01 0018 3848477009 olrm-h228-MITIEEE zi22818 03-02-21 23 01 0830 3957242509 olr-MIT i z 23-07-21 100 01 3100 4472469618 09 --%%-- eBook MIT Press --%%-- --%%-- OLR-MIT-CEC Vervielfältigungen (z.B. Kopien, Downloads) sind nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. z 30-01-24 370 01 4370 401122393X olr-ebook mitieee Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. i z 01-12-21 2015 01 DE-93 3740753242 00 --%%-- --%%-- p --%%-- Campuslizenz l01 18-08-20 22 01 0018 Volltextzugang Campus https://ieeexplore.ieee.org/book/6267250 22 01 0018 Nur für Angehörige der Universität Hamburg: Volltextzugang von außerhalb des Campus http://emedien.sub.uni-hamburg.de/han/ieee/ieeexplore.ieee.org/book/6267250 23 01 0830 MIT Press EBook https://ieeexplore.ieee.org/book/6267250 100 01 3100 https://ieeexplore.ieee.org/book/6267250 100 01 3100 für Uniangehörige: Zugang weltweit http://han.med.uni-magdeburg.de/han/mitvia-ieee/ieeexplore.ieee.org/book/6267250 370 01 4370 E-Book: Zugriff im HCU-Netz. Zugriff von außerhalb nur für HCU-Angehörige möglich https://ieeexplore.ieee.org/book/6267250 2015 01 DE-93 https://ieeexplore.ieee.org/book/6267250 23 01 0830 2018-01805, 2018-01806, 2018-01808 22 01 0018 olrm-h228-MITIEEE 23 01 0830 olr-MIT 100 01 3100 OLR-MIT-CEC 370 01 4370 olr-ebook mitieee 370 01 4370 2021.12.01 |
| spelling |
9780262256032 ebook 978-0-262-25603-2 (DE-627)1727350987 (DE-599)KEP055117724 (OCoLC)1196136624 (ZBM)1092.90066 (MITPRESS)6267250 (EBP)055117724 DE-627 ger DE-627 rda eng ST 323 SEPA rvk (DE-625)rvk/143659: SK 890 SEPA rvk (DE-625)rvk/143267: WC 7000 SEPA rvk (DE-625)rvk/148142: ST 300 SEPA rvk (DE-625)rvk/143650: SK 870 SEPA rvk (DE-625)rvk/143265: *90C59 msc 90-02 msc 31.80 bkl 54.51 bkl 54.72 bkl Dorigo, Marco verfasserin aut Ant colony optimization Marco Dorigo, Thomas Stützle Cambridge, Massachusetts MIT Press c2004 1 PDF (xi, 305 pages) illustrations. Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier "A Bradford book.". - Includes bibliographical references (p. [277]-300) and index. - Description based on PDF viewed 12/23/2015 The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms. Mode of access: World Wide Web. Mathematical optimization Ants ; Behavior ; Mathematical models s (DE-588)4704280-1 (DE-627)355651467 (DE-576)215375157 Ameisenalgorithmus gnd s (DE-588)4793676-9 (DE-627)394208110 (DE-576)216457432 Schwarmintelligenz gnd s (DE-588)4043664-0 (DE-627)106208705 (DE-576)209057009 Optimierung gnd DE-101 s (DE-588)4704280-1 (DE-627)355651467 (DE-576)215375157 Ameisenalgorithmus gnd s (DE-588)4031826-6 (DE-627)106263900 (DE-576)208994432 Kombinatorische Optimierung gnd (DE-627) Stützle, Thomas mitwirkender ctb 9780262042192 Erscheint auch als Druck-Ausgabe 9780262042192 Erscheint auch als Druck-Ausgabe Dorigo, Marco, 1961 - Ant colony optimization Cambridge, Mass. [u.a.] : MIT Press, 2004 XIV, 305 S. (DE-627)372329926 (DE-576)112288391 0262042193 9780262042192 https://ieeexplore.ieee.org/book/6267250 X:MITPRESS Verlag lizenzpflichtig https://zbmath.org/?q=an:1092.90066 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext ZDB-37-IEM 2012 GBV_ILN_22 ISIL_DE-18 SYSFLAG_1 GBV_KXP SSG-OPC-MAT GBV_ILN_22_i22818 GBV_ILN_23 ISIL_DE-830 GBV_ILN_100 ISIL_DE-Ma9 GBV_ILN_370 ISIL_DE-1373 GBV_ILN_2015 ISIL_DE-93 ST 323 Virtual Reality Informatik Monografien Einzelne Anwendungen der Datenverarbeitung Virtual Reality (DE-627)1272613496 (DE-625)rvk/143659: (DE-576)202613496 SK 890 Ganzzahlige und kombinatorische Optimierung, Graphentheorie Mathematik Monografien Ganzzahlige und kombinatorische Optimierung, Graphentheorie (DE-627)1271487969 (DE-625)rvk/143267: (DE-576)201487969 WC 7000 Biometrie, Biomathematik, Biostatistik Biologie Methoden Biometrie, Biomathematik, Biostatistik, Bioinformatik, Biokybernetik Biometrie, Biomathematik, Biostatistik (DE-627)1271493756 (DE-625)rvk/148142: (DE-576)201493756 ST 300 Allgemeines Informatik Monografien Künstliche Intelligenz Allgemeines (DE-627)1271119005 (DE-625)rvk/143650: (DE-576)201119005 SK 870 Lineare und Nichtlineare Optimierung Mathematik Monografien Lineare und Nichtlineare Optimierung (DE-627)127088123X (DE-625)rvk/143265: (DE-576)20088123X 31.80 Angewandte Mathematik SEPA (DE-627)106419005 54.51 Programmiermethodik SEPA (DE-627)106418122 54.72 Künstliche Intelligenz SEPA (DE-627)10641240X BO 045F 519.6 22 01 0018 3848477009 olrm-h228-MITIEEE zi22818 03-02-21 23 01 0830 3957242509 olr-MIT i z 23-07-21 100 01 3100 4472469618 09 --%%-- eBook MIT Press --%%-- --%%-- OLR-MIT-CEC Vervielfältigungen (z.B. Kopien, Downloads) sind nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. z 30-01-24 370 01 4370 401122393X olr-ebook mitieee Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. i z 01-12-21 2015 01 DE-93 3740753242 00 --%%-- --%%-- p --%%-- Campuslizenz l01 18-08-20 22 01 0018 Volltextzugang Campus https://ieeexplore.ieee.org/book/6267250 22 01 0018 Nur für Angehörige der Universität Hamburg: Volltextzugang von außerhalb des Campus http://emedien.sub.uni-hamburg.de/han/ieee/ieeexplore.ieee.org/book/6267250 23 01 0830 MIT Press EBook https://ieeexplore.ieee.org/book/6267250 100 01 3100 https://ieeexplore.ieee.org/book/6267250 100 01 3100 für Uniangehörige: Zugang weltweit http://han.med.uni-magdeburg.de/han/mitvia-ieee/ieeexplore.ieee.org/book/6267250 370 01 4370 E-Book: Zugriff im HCU-Netz. Zugriff von außerhalb nur für HCU-Angehörige möglich https://ieeexplore.ieee.org/book/6267250 2015 01 DE-93 https://ieeexplore.ieee.org/book/6267250 23 01 0830 2018-01805, 2018-01806, 2018-01808 22 01 0018 olrm-h228-MITIEEE 23 01 0830 olr-MIT 100 01 3100 OLR-MIT-CEC 370 01 4370 olr-ebook mitieee 370 01 4370 2021.12.01 |
| allfields_unstemmed |
9780262256032 ebook 978-0-262-25603-2 (DE-627)1727350987 (DE-599)KEP055117724 (OCoLC)1196136624 (ZBM)1092.90066 (MITPRESS)6267250 (EBP)055117724 DE-627 ger DE-627 rda eng ST 323 SEPA rvk (DE-625)rvk/143659: SK 890 SEPA rvk (DE-625)rvk/143267: WC 7000 SEPA rvk (DE-625)rvk/148142: ST 300 SEPA rvk (DE-625)rvk/143650: SK 870 SEPA rvk (DE-625)rvk/143265: *90C59 msc 90-02 msc 31.80 bkl 54.51 bkl 54.72 bkl Dorigo, Marco verfasserin aut Ant colony optimization Marco Dorigo, Thomas Stützle Cambridge, Massachusetts MIT Press c2004 1 PDF (xi, 305 pages) illustrations. Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier "A Bradford book.". - Includes bibliographical references (p. [277]-300) and index. - Description based on PDF viewed 12/23/2015 The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms. Mode of access: World Wide Web. Mathematical optimization Ants ; Behavior ; Mathematical models s (DE-588)4704280-1 (DE-627)355651467 (DE-576)215375157 Ameisenalgorithmus gnd s (DE-588)4793676-9 (DE-627)394208110 (DE-576)216457432 Schwarmintelligenz gnd s (DE-588)4043664-0 (DE-627)106208705 (DE-576)209057009 Optimierung gnd DE-101 s (DE-588)4704280-1 (DE-627)355651467 (DE-576)215375157 Ameisenalgorithmus gnd s (DE-588)4031826-6 (DE-627)106263900 (DE-576)208994432 Kombinatorische Optimierung gnd (DE-627) Stützle, Thomas mitwirkender ctb 9780262042192 Erscheint auch als Druck-Ausgabe 9780262042192 Erscheint auch als Druck-Ausgabe Dorigo, Marco, 1961 - Ant colony optimization Cambridge, Mass. [u.a.] : MIT Press, 2004 XIV, 305 S. (DE-627)372329926 (DE-576)112288391 0262042193 9780262042192 https://ieeexplore.ieee.org/book/6267250 X:MITPRESS Verlag lizenzpflichtig https://zbmath.org/?q=an:1092.90066 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext ZDB-37-IEM 2012 GBV_ILN_22 ISIL_DE-18 SYSFLAG_1 GBV_KXP SSG-OPC-MAT GBV_ILN_22_i22818 GBV_ILN_23 ISIL_DE-830 GBV_ILN_100 ISIL_DE-Ma9 GBV_ILN_370 ISIL_DE-1373 GBV_ILN_2015 ISIL_DE-93 ST 323 Virtual Reality Informatik Monografien Einzelne Anwendungen der Datenverarbeitung Virtual Reality (DE-627)1272613496 (DE-625)rvk/143659: (DE-576)202613496 SK 890 Ganzzahlige und kombinatorische Optimierung, Graphentheorie Mathematik Monografien Ganzzahlige und kombinatorische Optimierung, Graphentheorie (DE-627)1271487969 (DE-625)rvk/143267: (DE-576)201487969 WC 7000 Biometrie, Biomathematik, Biostatistik Biologie Methoden Biometrie, Biomathematik, Biostatistik, Bioinformatik, Biokybernetik Biometrie, Biomathematik, Biostatistik (DE-627)1271493756 (DE-625)rvk/148142: (DE-576)201493756 ST 300 Allgemeines Informatik Monografien Künstliche Intelligenz Allgemeines (DE-627)1271119005 (DE-625)rvk/143650: (DE-576)201119005 SK 870 Lineare und Nichtlineare Optimierung Mathematik Monografien Lineare und Nichtlineare Optimierung (DE-627)127088123X (DE-625)rvk/143265: (DE-576)20088123X 31.80 Angewandte Mathematik SEPA (DE-627)106419005 54.51 Programmiermethodik SEPA (DE-627)106418122 54.72 Künstliche Intelligenz SEPA (DE-627)10641240X BO 045F 519.6 22 01 0018 3848477009 olrm-h228-MITIEEE zi22818 03-02-21 23 01 0830 3957242509 olr-MIT i z 23-07-21 100 01 3100 4472469618 09 --%%-- eBook MIT Press --%%-- --%%-- OLR-MIT-CEC Vervielfältigungen (z.B. Kopien, Downloads) sind nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. z 30-01-24 370 01 4370 401122393X olr-ebook mitieee Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. i z 01-12-21 2015 01 DE-93 3740753242 00 --%%-- --%%-- p --%%-- Campuslizenz l01 18-08-20 22 01 0018 Volltextzugang Campus https://ieeexplore.ieee.org/book/6267250 22 01 0018 Nur für Angehörige der Universität Hamburg: Volltextzugang von außerhalb des Campus http://emedien.sub.uni-hamburg.de/han/ieee/ieeexplore.ieee.org/book/6267250 23 01 0830 MIT Press EBook https://ieeexplore.ieee.org/book/6267250 100 01 3100 https://ieeexplore.ieee.org/book/6267250 100 01 3100 für Uniangehörige: Zugang weltweit http://han.med.uni-magdeburg.de/han/mitvia-ieee/ieeexplore.ieee.org/book/6267250 370 01 4370 E-Book: Zugriff im HCU-Netz. Zugriff von außerhalb nur für HCU-Angehörige möglich https://ieeexplore.ieee.org/book/6267250 2015 01 DE-93 https://ieeexplore.ieee.org/book/6267250 23 01 0830 2018-01805, 2018-01806, 2018-01808 22 01 0018 olrm-h228-MITIEEE 23 01 0830 olr-MIT 100 01 3100 OLR-MIT-CEC 370 01 4370 olr-ebook mitieee 370 01 4370 2021.12.01 |
| allfieldsGer |
9780262256032 ebook 978-0-262-25603-2 (DE-627)1727350987 (DE-599)KEP055117724 (OCoLC)1196136624 (ZBM)1092.90066 (MITPRESS)6267250 (EBP)055117724 DE-627 ger DE-627 rda eng ST 323 SEPA rvk (DE-625)rvk/143659: SK 890 SEPA rvk (DE-625)rvk/143267: WC 7000 SEPA rvk (DE-625)rvk/148142: ST 300 SEPA rvk (DE-625)rvk/143650: SK 870 SEPA rvk (DE-625)rvk/143265: *90C59 msc 90-02 msc 31.80 bkl 54.51 bkl 54.72 bkl Dorigo, Marco verfasserin aut Ant colony optimization Marco Dorigo, Thomas Stützle Cambridge, Massachusetts MIT Press c2004 1 PDF (xi, 305 pages) illustrations. Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier "A Bradford book.". - Includes bibliographical references (p. [277]-300) and index. - Description based on PDF viewed 12/23/2015 The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms. Mode of access: World Wide Web. Mathematical optimization Ants ; Behavior ; Mathematical models s (DE-588)4704280-1 (DE-627)355651467 (DE-576)215375157 Ameisenalgorithmus gnd s (DE-588)4793676-9 (DE-627)394208110 (DE-576)216457432 Schwarmintelligenz gnd s (DE-588)4043664-0 (DE-627)106208705 (DE-576)209057009 Optimierung gnd DE-101 s (DE-588)4704280-1 (DE-627)355651467 (DE-576)215375157 Ameisenalgorithmus gnd s (DE-588)4031826-6 (DE-627)106263900 (DE-576)208994432 Kombinatorische Optimierung gnd (DE-627) Stützle, Thomas mitwirkender ctb 9780262042192 Erscheint auch als Druck-Ausgabe 9780262042192 Erscheint auch als Druck-Ausgabe Dorigo, Marco, 1961 - Ant colony optimization Cambridge, Mass. [u.a.] : MIT Press, 2004 XIV, 305 S. (DE-627)372329926 (DE-576)112288391 0262042193 9780262042192 https://ieeexplore.ieee.org/book/6267250 X:MITPRESS Verlag lizenzpflichtig https://zbmath.org/?q=an:1092.90066 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext ZDB-37-IEM 2012 GBV_ILN_22 ISIL_DE-18 SYSFLAG_1 GBV_KXP SSG-OPC-MAT GBV_ILN_22_i22818 GBV_ILN_23 ISIL_DE-830 GBV_ILN_100 ISIL_DE-Ma9 GBV_ILN_370 ISIL_DE-1373 GBV_ILN_2015 ISIL_DE-93 ST 323 Virtual Reality Informatik Monografien Einzelne Anwendungen der Datenverarbeitung Virtual Reality (DE-627)1272613496 (DE-625)rvk/143659: (DE-576)202613496 SK 890 Ganzzahlige und kombinatorische Optimierung, Graphentheorie Mathematik Monografien Ganzzahlige und kombinatorische Optimierung, Graphentheorie (DE-627)1271487969 (DE-625)rvk/143267: (DE-576)201487969 WC 7000 Biometrie, Biomathematik, Biostatistik Biologie Methoden Biometrie, Biomathematik, Biostatistik, Bioinformatik, Biokybernetik Biometrie, Biomathematik, Biostatistik (DE-627)1271493756 (DE-625)rvk/148142: (DE-576)201493756 ST 300 Allgemeines Informatik Monografien Künstliche Intelligenz Allgemeines (DE-627)1271119005 (DE-625)rvk/143650: (DE-576)201119005 SK 870 Lineare und Nichtlineare Optimierung Mathematik Monografien Lineare und Nichtlineare Optimierung (DE-627)127088123X (DE-625)rvk/143265: (DE-576)20088123X 31.80 Angewandte Mathematik SEPA (DE-627)106419005 54.51 Programmiermethodik SEPA (DE-627)106418122 54.72 Künstliche Intelligenz SEPA (DE-627)10641240X BO 045F 519.6 22 01 0018 3848477009 olrm-h228-MITIEEE zi22818 03-02-21 23 01 0830 3957242509 olr-MIT i z 23-07-21 100 01 3100 4472469618 09 --%%-- eBook MIT Press --%%-- --%%-- OLR-MIT-CEC Vervielfältigungen (z.B. Kopien, Downloads) sind nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. z 30-01-24 370 01 4370 401122393X olr-ebook mitieee Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. i z 01-12-21 2015 01 DE-93 3740753242 00 --%%-- --%%-- p --%%-- Campuslizenz l01 18-08-20 22 01 0018 Volltextzugang Campus https://ieeexplore.ieee.org/book/6267250 22 01 0018 Nur für Angehörige der Universität Hamburg: Volltextzugang von außerhalb des Campus http://emedien.sub.uni-hamburg.de/han/ieee/ieeexplore.ieee.org/book/6267250 23 01 0830 MIT Press EBook https://ieeexplore.ieee.org/book/6267250 100 01 3100 https://ieeexplore.ieee.org/book/6267250 100 01 3100 für Uniangehörige: Zugang weltweit http://han.med.uni-magdeburg.de/han/mitvia-ieee/ieeexplore.ieee.org/book/6267250 370 01 4370 E-Book: Zugriff im HCU-Netz. Zugriff von außerhalb nur für HCU-Angehörige möglich https://ieeexplore.ieee.org/book/6267250 2015 01 DE-93 https://ieeexplore.ieee.org/book/6267250 23 01 0830 2018-01805, 2018-01806, 2018-01808 22 01 0018 olrm-h228-MITIEEE 23 01 0830 olr-MIT 100 01 3100 OLR-MIT-CEC 370 01 4370 olr-ebook mitieee 370 01 4370 2021.12.01 |
| allfieldsSound |
9780262256032 ebook 978-0-262-25603-2 (DE-627)1727350987 (DE-599)KEP055117724 (OCoLC)1196136624 (ZBM)1092.90066 (MITPRESS)6267250 (EBP)055117724 DE-627 ger DE-627 rda eng ST 323 SEPA rvk (DE-625)rvk/143659: SK 890 SEPA rvk (DE-625)rvk/143267: WC 7000 SEPA rvk (DE-625)rvk/148142: ST 300 SEPA rvk (DE-625)rvk/143650: SK 870 SEPA rvk (DE-625)rvk/143265: *90C59 msc 90-02 msc 31.80 bkl 54.51 bkl 54.72 bkl Dorigo, Marco verfasserin aut Ant colony optimization Marco Dorigo, Thomas Stützle Cambridge, Massachusetts MIT Press c2004 1 PDF (xi, 305 pages) illustrations. Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier "A Bradford book.". - Includes bibliographical references (p. [277]-300) and index. - Description based on PDF viewed 12/23/2015 The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms. Mode of access: World Wide Web. Mathematical optimization Ants ; Behavior ; Mathematical models s (DE-588)4704280-1 (DE-627)355651467 (DE-576)215375157 Ameisenalgorithmus gnd s (DE-588)4793676-9 (DE-627)394208110 (DE-576)216457432 Schwarmintelligenz gnd s (DE-588)4043664-0 (DE-627)106208705 (DE-576)209057009 Optimierung gnd DE-101 s (DE-588)4704280-1 (DE-627)355651467 (DE-576)215375157 Ameisenalgorithmus gnd s (DE-588)4031826-6 (DE-627)106263900 (DE-576)208994432 Kombinatorische Optimierung gnd (DE-627) Stützle, Thomas mitwirkender ctb 9780262042192 Erscheint auch als Druck-Ausgabe 9780262042192 Erscheint auch als Druck-Ausgabe Dorigo, Marco, 1961 - Ant colony optimization Cambridge, Mass. [u.a.] : MIT Press, 2004 XIV, 305 S. (DE-627)372329926 (DE-576)112288391 0262042193 9780262042192 https://ieeexplore.ieee.org/book/6267250 X:MITPRESS Verlag lizenzpflichtig https://zbmath.org/?q=an:1092.90066 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext ZDB-37-IEM 2012 GBV_ILN_22 ISIL_DE-18 SYSFLAG_1 GBV_KXP SSG-OPC-MAT GBV_ILN_22_i22818 GBV_ILN_23 ISIL_DE-830 GBV_ILN_100 ISIL_DE-Ma9 GBV_ILN_370 ISIL_DE-1373 GBV_ILN_2015 ISIL_DE-93 ST 323 Virtual Reality Informatik Monografien Einzelne Anwendungen der Datenverarbeitung Virtual Reality (DE-627)1272613496 (DE-625)rvk/143659: (DE-576)202613496 SK 890 Ganzzahlige und kombinatorische Optimierung, Graphentheorie Mathematik Monografien Ganzzahlige und kombinatorische Optimierung, Graphentheorie (DE-627)1271487969 (DE-625)rvk/143267: (DE-576)201487969 WC 7000 Biometrie, Biomathematik, Biostatistik Biologie Methoden Biometrie, Biomathematik, Biostatistik, Bioinformatik, Biokybernetik Biometrie, Biomathematik, Biostatistik (DE-627)1271493756 (DE-625)rvk/148142: (DE-576)201493756 ST 300 Allgemeines Informatik Monografien Künstliche Intelligenz Allgemeines (DE-627)1271119005 (DE-625)rvk/143650: (DE-576)201119005 SK 870 Lineare und Nichtlineare Optimierung Mathematik Monografien Lineare und Nichtlineare Optimierung (DE-627)127088123X (DE-625)rvk/143265: (DE-576)20088123X 31.80 Angewandte Mathematik SEPA (DE-627)106419005 54.51 Programmiermethodik SEPA (DE-627)106418122 54.72 Künstliche Intelligenz SEPA (DE-627)10641240X BO 045F 519.6 22 01 0018 3848477009 olrm-h228-MITIEEE zi22818 03-02-21 23 01 0830 3957242509 olr-MIT i z 23-07-21 100 01 3100 4472469618 09 --%%-- eBook MIT Press --%%-- --%%-- OLR-MIT-CEC Vervielfältigungen (z.B. Kopien, Downloads) sind nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. z 30-01-24 370 01 4370 401122393X olr-ebook mitieee Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. i z 01-12-21 2015 01 DE-93 3740753242 00 --%%-- --%%-- p --%%-- Campuslizenz l01 18-08-20 22 01 0018 Volltextzugang Campus https://ieeexplore.ieee.org/book/6267250 22 01 0018 Nur für Angehörige der Universität Hamburg: Volltextzugang von außerhalb des Campus http://emedien.sub.uni-hamburg.de/han/ieee/ieeexplore.ieee.org/book/6267250 23 01 0830 MIT Press EBook https://ieeexplore.ieee.org/book/6267250 100 01 3100 https://ieeexplore.ieee.org/book/6267250 100 01 3100 für Uniangehörige: Zugang weltweit http://han.med.uni-magdeburg.de/han/mitvia-ieee/ieeexplore.ieee.org/book/6267250 370 01 4370 E-Book: Zugriff im HCU-Netz. Zugriff von außerhalb nur für HCU-Angehörige möglich https://ieeexplore.ieee.org/book/6267250 2015 01 DE-93 https://ieeexplore.ieee.org/book/6267250 23 01 0830 2018-01805, 2018-01806, 2018-01808 22 01 0018 olrm-h228-MITIEEE 23 01 0830 olr-MIT 100 01 3100 OLR-MIT-CEC 370 01 4370 olr-ebook mitieee 370 01 4370 2021.12.01 |
| language |
English |
| format_phy_str_mv |
Book |
| building |
22:i 23 100 370 2015:0 |
| bklname |
Angewandte Mathematik Programmiermethodik Künstliche Intelligenz |
| institution |
findex.gbv.de |
| selectbib_iln_str_mv |
22@i22818 23@ 100@ 370@ 2015@01 |
| topic_facet |
Mathematical optimization Ants ; Behavior ; Mathematical models Ameisenalgorithmus Schwarmintelligenz Optimierung Kombinatorische Optimierung |
| isfreeaccess_bool |
false |
| authorswithroles_txt_mv |
Dorigo, Marco @@aut@@ Stützle, Thomas @@ctb@@ |
| publishDateDaySort_date |
2004-01-01T00:00:00Z |
| id |
1727350987 |
| signature_iln |
100:eBook MIT Press 3100:eBook MIT Press |
| signature_iln_str_mv |
100:eBook MIT Press 3100:eBook MIT Press |
| signature_iln_scis_mv |
100:eBook MIT Press 3100:eBook MIT Press |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000cam a22002652 4500</leader><controlfield tag="001">1727350987</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20231004172559.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">200818s2004 xx |||||o 00| ||eng c</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262256032</subfield><subfield code="c">ebook</subfield><subfield code="9">978-0-262-25603-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)1727350987</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KEP055117724</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1196136624</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZBM)1092.90066</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MITPRESS)6267250</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EBP)055117724</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 323</subfield><subfield code="q">SEPA</subfield><subfield code="2">rvk</subfield><subfield code="0">(DE-625)rvk/143659:</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="q">SEPA</subfield><subfield code="2">rvk</subfield><subfield code="0">(DE-625)rvk/143267:</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">WC 7000</subfield><subfield code="q">SEPA</subfield><subfield code="2">rvk</subfield><subfield code="0">(DE-625)rvk/148142:</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 300</subfield><subfield code="q">SEPA</subfield><subfield code="2">rvk</subfield><subfield code="0">(DE-625)rvk/143650:</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 870</subfield><subfield code="q">SEPA</subfield><subfield code="2">rvk</subfield><subfield code="0">(DE-625)rvk/143265:</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">*90C59</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90-02</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.80</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.51</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.72</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dorigo, Marco</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Ant colony optimization</subfield><subfield code="c">Marco Dorigo, Thomas Stützle</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Massachusetts</subfield><subfield code="b">MIT Press</subfield><subfield code="c">c2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 PDF (xi, 305 pages)</subfield><subfield code="b">illustrations.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">"A Bradford book.". - Includes bibliographical references (p. [277]-300) and index. - Description based on PDF viewed 12/23/2015</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: World Wide Web.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ants ; Behavior ; Mathematical models</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="D">s</subfield><subfield code="0">(DE-588)4704280-1</subfield><subfield code="0">(DE-627)355651467</subfield><subfield code="0">(DE-576)215375157</subfield><subfield code="a">Ameisenalgorithmus</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="D">s</subfield><subfield code="0">(DE-588)4793676-9</subfield><subfield code="0">(DE-627)394208110</subfield><subfield code="0">(DE-576)216457432</subfield><subfield code="a">Schwarmintelligenz</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="D">s</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="0">(DE-627)106208705</subfield><subfield code="0">(DE-576)209057009</subfield><subfield code="a">Optimierung</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-101</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="D">s</subfield><subfield code="0">(DE-588)4704280-1</subfield><subfield code="0">(DE-627)355651467</subfield><subfield code="0">(DE-576)215375157</subfield><subfield code="a">Ameisenalgorithmus</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="D">s</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="0">(DE-627)106263900</subfield><subfield code="0">(DE-576)208994432</subfield><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">(DE-627)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Stützle, Thomas</subfield><subfield code="e">mitwirkender</subfield><subfield code="4">ctb</subfield></datafield><datafield tag="776" ind1="1" ind2=" "><subfield code="z">9780262042192</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780262042192</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="a">Dorigo, Marco, 1961 - </subfield><subfield code="t">Ant colony optimization</subfield><subfield code="d">Cambridge, Mass. [u.a.] : MIT Press, 2004</subfield><subfield code="h">XIV, 305 S.</subfield><subfield code="w">(DE-627)372329926</subfield><subfield code="w">(DE-576)112288391</subfield><subfield code="z">0262042193</subfield><subfield code="z">9780262042192</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ieeexplore.ieee.org/book/6267250</subfield><subfield code="m">X:MITPRESS</subfield><subfield code="x">Verlag</subfield><subfield code="z">lizenzpflichtig</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://zbmath.org/?q=an:1092.90066</subfield><subfield code="m">B:ZBM</subfield><subfield code="v">2021-04-12</subfield><subfield code="x">Verlag</subfield><subfield code="y">Zentralblatt MATH</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-37-IEM</subfield><subfield code="b">2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-18</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_1</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_KXP</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22_i22818</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-830</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-Ma9</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-1373</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-93</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">ST 323</subfield><subfield code="b">Virtual Reality</subfield><subfield code="k">Informatik</subfield><subfield code="k">Monografien</subfield><subfield code="k">Einzelne Anwendungen der Datenverarbeitung</subfield><subfield code="k">Virtual Reality</subfield><subfield code="0">(DE-627)1272613496</subfield><subfield code="0">(DE-625)rvk/143659:</subfield><subfield code="0">(DE-576)202613496</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SK 890</subfield><subfield code="b">Ganzzahlige und kombinatorische Optimierung, Graphentheorie</subfield><subfield code="k">Mathematik</subfield><subfield code="k">Monografien</subfield><subfield code="k">Ganzzahlige und kombinatorische Optimierung, Graphentheorie</subfield><subfield code="0">(DE-627)1271487969</subfield><subfield code="0">(DE-625)rvk/143267:</subfield><subfield code="0">(DE-576)201487969</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">WC 7000</subfield><subfield code="b">Biometrie, Biomathematik, Biostatistik</subfield><subfield code="k">Biologie</subfield><subfield code="k">Methoden</subfield><subfield code="k">Biometrie, Biomathematik, Biostatistik, Bioinformatik, Biokybernetik</subfield><subfield code="k">Biometrie, Biomathematik, Biostatistik</subfield><subfield code="0">(DE-627)1271493756</subfield><subfield code="0">(DE-625)rvk/148142:</subfield><subfield code="0">(DE-576)201493756</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">ST 300</subfield><subfield code="b">Allgemeines</subfield><subfield code="k">Informatik</subfield><subfield code="k">Monografien</subfield><subfield code="k">Künstliche Intelligenz</subfield><subfield code="k">Allgemeines</subfield><subfield code="0">(DE-627)1271119005</subfield><subfield code="0">(DE-625)rvk/143650:</subfield><subfield code="0">(DE-576)201119005</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SK 870</subfield><subfield code="b">Lineare und Nichtlineare Optimierung</subfield><subfield code="k">Mathematik</subfield><subfield code="k">Monografien</subfield><subfield code="k">Lineare und Nichtlineare Optimierung</subfield><subfield code="0">(DE-627)127088123X</subfield><subfield code="0">(DE-625)rvk/143265:</subfield><subfield code="0">(DE-576)20088123X</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">31.80</subfield><subfield code="j">Angewandte Mathematik</subfield><subfield code="q">SEPA</subfield><subfield code="0">(DE-627)106419005</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.51</subfield><subfield code="j">Programmiermethodik</subfield><subfield code="q">SEPA</subfield><subfield code="0">(DE-627)106418122</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.72</subfield><subfield code="j">Künstliche Intelligenz</subfield><subfield code="q">SEPA</subfield><subfield code="0">(DE-627)10641240X</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">BO</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">519.6</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">22</subfield><subfield code="1">01</subfield><subfield code="x">0018</subfield><subfield code="b">3848477009</subfield><subfield code="h">olrm-h228-MITIEEE</subfield><subfield code="y">zi22818</subfield><subfield code="z">03-02-21</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">23</subfield><subfield code="1">01</subfield><subfield code="x">0830</subfield><subfield code="b">3957242509</subfield><subfield code="h">olr-MIT</subfield><subfield code="u">i</subfield><subfield code="y">z</subfield><subfield code="z">23-07-21</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">100</subfield><subfield code="1">01</subfield><subfield code="x">3100</subfield><subfield code="b">4472469618</subfield><subfield code="c">09</subfield><subfield code="f">--%%--</subfield><subfield code="d">eBook MIT Press</subfield><subfield code="e">--%%--</subfield><subfield code="j">--%%--</subfield><subfield code="h">OLR-MIT-CEC</subfield><subfield code="k">Vervielfältigungen (z.B. Kopien, Downloads) sind nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots.</subfield><subfield code="y">z</subfield><subfield code="z">30-01-24</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">370</subfield><subfield code="1">01</subfield><subfield code="x">4370</subfield><subfield code="b">401122393X</subfield><subfield code="h">olr-ebook mitieee</subfield><subfield code="k">Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots.</subfield><subfield code="u">i</subfield><subfield code="y">z</subfield><subfield code="z">01-12-21</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">2015</subfield><subfield code="1">01</subfield><subfield code="x">DE-93</subfield><subfield code="b">3740753242</subfield><subfield code="c">00</subfield><subfield code="f">--%%--</subfield><subfield code="d">--%%--</subfield><subfield code="e">p</subfield><subfield code="j">--%%--</subfield><subfield code="k">Campuslizenz</subfield><subfield code="y">l01</subfield><subfield code="z">18-08-20</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">22</subfield><subfield code="1">01</subfield><subfield code="x">0018</subfield><subfield code="y">Volltextzugang Campus</subfield><subfield code="r">https://ieeexplore.ieee.org/book/6267250</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">22</subfield><subfield code="1">01</subfield><subfield code="x">0018</subfield><subfield code="y">Nur für Angehörige der Universität Hamburg: Volltextzugang von außerhalb des Campus</subfield><subfield code="r">http://emedien.sub.uni-hamburg.de/han/ieee/ieeexplore.ieee.org/book/6267250</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">23</subfield><subfield code="1">01</subfield><subfield code="x">0830</subfield><subfield code="y">MIT Press EBook</subfield><subfield code="r">https://ieeexplore.ieee.org/book/6267250</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">100</subfield><subfield code="1">01</subfield><subfield code="x">3100</subfield><subfield code="r">https://ieeexplore.ieee.org/book/6267250</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">100</subfield><subfield code="1">01</subfield><subfield code="x">3100</subfield><subfield code="y">für Uniangehörige: Zugang weltweit</subfield><subfield code="r">http://han.med.uni-magdeburg.de/han/mitvia-ieee/ieeexplore.ieee.org/book/6267250</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">370</subfield><subfield code="1">01</subfield><subfield code="x">4370</subfield><subfield code="y">E-Book: Zugriff im HCU-Netz. Zugriff von außerhalb nur für HCU-Angehörige möglich</subfield><subfield code="r">https://ieeexplore.ieee.org/book/6267250</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">2015</subfield><subfield code="1">01</subfield><subfield code="x">DE-93</subfield><subfield code="r">https://ieeexplore.ieee.org/book/6267250</subfield></datafield><datafield tag="985" ind1=" " ind2=" "><subfield code="2">23</subfield><subfield code="1">01</subfield><subfield code="x">0830</subfield><subfield code="a">2018-01805, 2018-01806, 2018-01808</subfield></datafield><datafield tag="995" ind1=" " ind2=" "><subfield code="2">22</subfield><subfield code="1">01</subfield><subfield code="x">0018</subfield><subfield code="a">olrm-h228-MITIEEE</subfield></datafield><datafield tag="995" ind1=" " ind2=" "><subfield code="2">23</subfield><subfield code="1">01</subfield><subfield code="x">0830</subfield><subfield code="a">olr-MIT</subfield></datafield><datafield tag="995" ind1=" " ind2=" "><subfield code="2">100</subfield><subfield code="1">01</subfield><subfield code="x">3100</subfield><subfield code="a">OLR-MIT-CEC</subfield></datafield><datafield tag="995" ind1=" " ind2=" "><subfield code="2">370</subfield><subfield code="1">01</subfield><subfield code="x">4370</subfield><subfield code="a">olr-ebook mitieee</subfield></datafield><datafield tag="998" ind1=" " ind2=" "><subfield code="2">370</subfield><subfield code="1">01</subfield><subfield code="x">4370</subfield><subfield code="0">2021.12.01</subfield></datafield></record></collection>
|
| standort_str_mv |
--%%-- |
| standort_iln_str_mv |
100:--%%-- 3100:--%%-- 2015:--%%-- DE-93:--%%-- |
| author |
Dorigo, Marco |
| spellingShingle |
Dorigo, Marco rvk ST 323 rvk SK 890 rvk WC 7000 rvk ST 300 rvk SK 870 msc *90C59 msc 90-02 bkl 31.80 bkl 54.51 bkl 54.72 misc Mathematical optimization misc Ants ; Behavior ; Mathematical models gnd Ameisenalgorithmus gnd Schwarmintelligenz gnd Optimierung gnd Kombinatorische Optimierung Ant colony optimization |
| authorStr |
Dorigo, Marco |
| ppnlink_with_tag_str_mv |
@@776@@(DE-627)372329926 |
| format |
eBook |
| delete_txt_mv |
keep |
| author_role |
aut |
| typewithnormlink_str_mv |
SubjectHeading@(DE-588)4704280-1 SubjectHeadingSensoStricto@(DE-588)4704280-1 SubjectHeadingSensoStricto@(DE-588)4793676-9 SubjectHeading@(DE-588)4793676-9 SubjectHeading@(DE-588)4043664-0 SubjectHeadingSensoStricto@(DE-588)4043664-0 SubjectHeading@(DE-588)4031826-6 SubjectHeadingSensoStricto@(DE-588)4031826-6 |
| collection |
KXP GVK SWB |
| publishPlace |
Cambridge, Massachusetts |
| remote_str |
true |
| abrufzeichen_iln_str_mv |
22@olrm-h228-MITIEEE 23@olr-MIT 100@OLR-MIT-CEC 370@olr-ebook mitieee |
| abrufzeichen_iln_scis_mv |
22@olrm-h228-MITIEEE 23@olr-MIT 100@OLR-MIT-CEC 370@olr-ebook mitieee |
| last_changed_iln_str_mv |
22@03-02-21 23@23-07-21 100@30-01-24 370@01-12-21 2015@18-08-20 |
| illustrated |
Not Illustrated |
| topic_title |
ST 323 SEPA rvk (DE-625)rvk/143659 SK 890 SEPA rvk (DE-625)rvk/143267 WC 7000 SEPA rvk (DE-625)rvk/148142 ST 300 SEPA rvk (DE-625)rvk/143650 SK 870 SEPA rvk (DE-625)rvk/143265 *90C59 msc 90-02 msc 31.80 bkl 54.51 bkl 54.72 bkl Ant colony optimization Marco Dorigo, Thomas Stützle Mathematical optimization Ants ; Behavior ; Mathematical models s (DE-588)4704280-1 (DE-627)355651467 (DE-576)215375157 Ameisenalgorithmus gnd s (DE-588)4793676-9 (DE-627)394208110 (DE-576)216457432 Schwarmintelligenz gnd s (DE-588)4043664-0 (DE-627)106208705 (DE-576)209057009 Optimierung gnd DE-101 s (DE-588)4031826-6 (DE-627)106263900 (DE-576)208994432 Kombinatorische Optimierung gnd (DE-627) |
| publisher |
MIT Press |
| publisherStr |
MIT Press |
| topic |
rvk ST 323 rvk SK 890 rvk WC 7000 rvk ST 300 rvk SK 870 msc *90C59 msc 90-02 bkl 31.80 bkl 54.51 bkl 54.72 misc Mathematical optimization misc Ants ; Behavior ; Mathematical models gnd Ameisenalgorithmus gnd Schwarmintelligenz gnd Optimierung gnd Kombinatorische Optimierung |
| topic_unstemmed |
rvk ST 323 rvk SK 890 rvk WC 7000 rvk ST 300 rvk SK 870 msc *90C59 msc 90-02 bkl 31.80 bkl 54.51 bkl 54.72 misc Mathematical optimization misc Ants ; Behavior ; Mathematical models gnd Ameisenalgorithmus gnd Schwarmintelligenz gnd Optimierung gnd Kombinatorische Optimierung |
| topic_browse |
rvk ST 323 rvk SK 890 rvk WC 7000 rvk ST 300 rvk SK 870 msc *90C59 msc 90-02 bkl 31.80 bkl 54.51 bkl 54.72 misc Mathematical optimization misc Ants ; Behavior ; Mathematical models gnd Ameisenalgorithmus gnd Schwarmintelligenz gnd Optimierung gnd Kombinatorische Optimierung |
| format_facet |
Elektronische Bücher Bücher Elektronische Ressource |
| standort_txtP_mv |
--%%-- |
| format_main_str_mv |
Text Buch |
| carriertype_str_mv |
cr |
| author2_variant |
t s ts |
| normlinkwithtype_str_mv |
(DE-588)4704280-1@SubjectHeading (DE-588)4704280-1@SubjectHeadingSensoStricto (DE-588)4793676-9@SubjectHeadingSensoStricto (DE-588)4793676-9@SubjectHeading (DE-588)4043664-0@SubjectHeading (DE-588)4043664-0@SubjectHeadingSensoStricto (DE-588)4031826-6@SubjectHeading (DE-588)4031826-6@SubjectHeadingSensoStricto |
| signature |
eBook MIT Press --%%-- |
| signature_str_mv |
eBook MIT Press --%%-- |
| isbn |
9780262256032 0262256037 9780262042192 0262042193 |
| isfreeaccess_txt |
false |
| normlinkwithrole_str_mv |
(DE-588)4704280-1@@689@@ (DE-588)4793676-9@@689@@ (DE-588)4043664-0@@689@@ (DE-588)4031826-6@@689@@ |
| title |
Ant colony optimization |
| ctrlnum |
(DE-627)1727350987 (DE-599)KEP055117724 (OCoLC)1196136624 (ZBM)1092.90066 (MITPRESS)6267250 (EBP)055117724 |
| exemplarkommentar_str_mv |
100@Vervielfältigungen (z.B. Kopien, Downloads) sind nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. 370@Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. 2015@Campuslizenz |
| title_full |
Ant colony optimization Marco Dorigo, Thomas Stützle |
| author_sort |
Dorigo, Marco |
| callnumber-first-code |
e |
| lang_code |
eng |
| selektneu_str_mv |
370@2021.12.01 |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2004 |
| contenttype_str_mv |
txt |
| author_browse |
Dorigo, Marco |
| selectkey |
22:z 23:z 100:z 370:z 2015:l |
| physical |
1 PDF (xi, 305 pages) illustrations. |
| class |
ST 323 SEPA rvk (DE-625)rvk/143659 SK 890 SEPA rvk (DE-625)rvk/143267 WC 7000 SEPA rvk (DE-625)rvk/148142 ST 300 SEPA rvk (DE-625)rvk/143650 SK 870 SEPA rvk (DE-625)rvk/143265 *90C59 msc 90-02 msc 31.80 bkl 54.51 bkl 54.72 bkl |
| format_se |
Elektronische Bücher |
| author-letter |
Dorigo, Marco |
| normlink |
RVK/143659: RVK/143267: RVK/148142: RVK/143650: RVK/143265: 4704280-1 355651467 215375157 4793676-9 394208110 216457432 4043664-0 106208705 209057009 4031826-6 106263900 208994432 1272613496 202613496 1271487969 201487969 1271493756 201493756 1271119005 201119005 127088123X 20088123X 106419005 106418122 10641240X 2021.12.01 |
| normlink_prefix_str_mv |
(DE-625)rvk/143659: (DE-625)rvk/143267: (DE-625)rvk/148142: (DE-625)rvk/143650: (DE-625)rvk/143265: (DE-588)4704280-1 (DE-627)355651467 (DE-576)215375157 (DE-588)4793676-9 (DE-627)394208110 (DE-576)216457432 (DE-588)4043664-0 (DE-627)106208705 (DE-576)209057009 (DE-588)4031826-6 (DE-627)106263900 (DE-576)208994432 (DE-627)1272613496 (DE-576)202613496 (DE-627)1271487969 (DE-576)201487969 (DE-627)1271493756 (DE-576)201493756 (DE-627)1271119005 (DE-576)201119005 (DE-627)127088123X (DE-576)20088123X (DE-627)106419005 (DE-627)106418122 (DE-627)10641240X 2021.12.01 |
| author2-role |
mitwirkender |
| title_sort |
ant colony optimization |
| title_auth |
Ant colony optimization |
| abstract |
The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms. "A Bradford book.". - Includes bibliographical references (p. [277]-300) and index. - Description based on PDF viewed 12/23/2015 |
| abstractGer |
The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms. "A Bradford book.". - Includes bibliographical references (p. [277]-300) and index. - Description based on PDF viewed 12/23/2015 |
| abstract_unstemmed |
The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms. "A Bradford book.". - Includes bibliographical references (p. [277]-300) and index. - Description based on PDF viewed 12/23/2015 |
| collection_details |
ZDB-37-IEM GBV_ILN_22 ISIL_DE-18 SYSFLAG_1 GBV_KXP SSG-OPC-MAT GBV_ILN_22_i22818 GBV_ILN_23 ISIL_DE-830 GBV_ILN_100 ISIL_DE-Ma9 GBV_ILN_370 ISIL_DE-1373 GBV_ILN_2015 ISIL_DE-93 |
| title_short |
Ant colony optimization |
| url |
https://ieeexplore.ieee.org/book/6267250 https://zbmath.org/?q=an:1092.90066 |
| ausleihindikator_str_mv |
22 23 100:- 370 2015:p |
| rolewithnormlink_str_mv |
@@689@@(DE-588)4704280-1 @@689@@(DE-588)4793676-9 @@689@@(DE-588)4043664-0 @@689@@(DE-588)4031826-6 |
| remote_bool |
true |
| author2 |
Stützle, Thomas |
| author2Str |
Stützle, Thomas |
| ppnlink |
372329926 |
| GND_str_mv |
Ant colony optimization ACO-System Ameisenalgorithmus Schwarm-Intelligenz Kollektive Intelligenz Gruppenintelligenz Swarm intelligence Schwarmintelligenz Mathematische Programmierung Programmierung <Optimierung> Mathematisches Optimieren Programmieren <Optimierung> Planungsrechnung <Operations research> Optimieren Mathematische Optimierung Optimierung Kombinatorische Optimierung |
| GND_txt_mv |
Ant colony optimization ACO-System Ameisenalgorithmus Schwarm-Intelligenz Kollektive Intelligenz Gruppenintelligenz Swarm intelligence Schwarmintelligenz Mathematische Programmierung Programmierung <Optimierung> Mathematisches Optimieren Programmieren <Optimierung> Planungsrechnung <Operations research> Optimieren Mathematische Optimierung Optimierung Kombinatorische Optimierung |
| GND_txtF_mv |
Ant colony optimization ACO-System Ameisenalgorithmus Schwarm-Intelligenz Kollektive Intelligenz Gruppenintelligenz Swarm intelligence Schwarmintelligenz Mathematische Programmierung Programmierung <Optimierung> Mathematisches Optimieren Programmieren <Optimierung> Planungsrechnung <Operations research> Optimieren Mathematische Optimierung Optimierung Kombinatorische Optimierung |
| mediatype_str_mv |
c |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
ctb |
| callnumber-a |
eBook MIT Press |
| up_date |
2024-07-04T22:59:34.824Z |
| _version_ |
1803691202788196352 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000cam a22002652 4500</leader><controlfield tag="001">1727350987</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20231004172559.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">200818s2004 xx |||||o 00| ||eng c</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262256032</subfield><subfield code="c">ebook</subfield><subfield code="9">978-0-262-25603-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)1727350987</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KEP055117724</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1196136624</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZBM)1092.90066</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MITPRESS)6267250</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EBP)055117724</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 323</subfield><subfield code="q">SEPA</subfield><subfield code="2">rvk</subfield><subfield code="0">(DE-625)rvk/143659:</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="q">SEPA</subfield><subfield code="2">rvk</subfield><subfield code="0">(DE-625)rvk/143267:</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">WC 7000</subfield><subfield code="q">SEPA</subfield><subfield code="2">rvk</subfield><subfield code="0">(DE-625)rvk/148142:</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 300</subfield><subfield code="q">SEPA</subfield><subfield code="2">rvk</subfield><subfield code="0">(DE-625)rvk/143650:</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 870</subfield><subfield code="q">SEPA</subfield><subfield code="2">rvk</subfield><subfield code="0">(DE-625)rvk/143265:</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">*90C59</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90-02</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.80</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.51</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.72</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dorigo, Marco</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Ant colony optimization</subfield><subfield code="c">Marco Dorigo, Thomas Stützle</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Massachusetts</subfield><subfield code="b">MIT Press</subfield><subfield code="c">c2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 PDF (xi, 305 pages)</subfield><subfield code="b">illustrations.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">"A Bradford book.". - Includes bibliographical references (p. [277]-300) and index. - Description based on PDF viewed 12/23/2015</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: World Wide Web.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ants ; Behavior ; Mathematical models</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="D">s</subfield><subfield code="0">(DE-588)4704280-1</subfield><subfield code="0">(DE-627)355651467</subfield><subfield code="0">(DE-576)215375157</subfield><subfield code="a">Ameisenalgorithmus</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="D">s</subfield><subfield code="0">(DE-588)4793676-9</subfield><subfield code="0">(DE-627)394208110</subfield><subfield code="0">(DE-576)216457432</subfield><subfield code="a">Schwarmintelligenz</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="D">s</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="0">(DE-627)106208705</subfield><subfield code="0">(DE-576)209057009</subfield><subfield code="a">Optimierung</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-101</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="D">s</subfield><subfield code="0">(DE-588)4704280-1</subfield><subfield code="0">(DE-627)355651467</subfield><subfield code="0">(DE-576)215375157</subfield><subfield code="a">Ameisenalgorithmus</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="D">s</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="0">(DE-627)106263900</subfield><subfield code="0">(DE-576)208994432</subfield><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">(DE-627)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Stützle, Thomas</subfield><subfield code="e">mitwirkender</subfield><subfield code="4">ctb</subfield></datafield><datafield tag="776" ind1="1" ind2=" "><subfield code="z">9780262042192</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780262042192</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="a">Dorigo, Marco, 1961 - </subfield><subfield code="t">Ant colony optimization</subfield><subfield code="d">Cambridge, Mass. [u.a.] : MIT Press, 2004</subfield><subfield code="h">XIV, 305 S.</subfield><subfield code="w">(DE-627)372329926</subfield><subfield code="w">(DE-576)112288391</subfield><subfield code="z">0262042193</subfield><subfield code="z">9780262042192</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ieeexplore.ieee.org/book/6267250</subfield><subfield code="m">X:MITPRESS</subfield><subfield code="x">Verlag</subfield><subfield code="z">lizenzpflichtig</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://zbmath.org/?q=an:1092.90066</subfield><subfield code="m">B:ZBM</subfield><subfield code="v">2021-04-12</subfield><subfield code="x">Verlag</subfield><subfield code="y">Zentralblatt MATH</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-37-IEM</subfield><subfield code="b">2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-18</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_1</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_KXP</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22_i22818</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-830</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-Ma9</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-1373</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-93</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">ST 323</subfield><subfield code="b">Virtual Reality</subfield><subfield code="k">Informatik</subfield><subfield code="k">Monografien</subfield><subfield code="k">Einzelne Anwendungen der Datenverarbeitung</subfield><subfield code="k">Virtual Reality</subfield><subfield code="0">(DE-627)1272613496</subfield><subfield code="0">(DE-625)rvk/143659:</subfield><subfield code="0">(DE-576)202613496</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SK 890</subfield><subfield code="b">Ganzzahlige und kombinatorische Optimierung, Graphentheorie</subfield><subfield code="k">Mathematik</subfield><subfield code="k">Monografien</subfield><subfield code="k">Ganzzahlige und kombinatorische Optimierung, Graphentheorie</subfield><subfield code="0">(DE-627)1271487969</subfield><subfield code="0">(DE-625)rvk/143267:</subfield><subfield code="0">(DE-576)201487969</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">WC 7000</subfield><subfield code="b">Biometrie, Biomathematik, Biostatistik</subfield><subfield code="k">Biologie</subfield><subfield code="k">Methoden</subfield><subfield code="k">Biometrie, Biomathematik, Biostatistik, Bioinformatik, Biokybernetik</subfield><subfield code="k">Biometrie, Biomathematik, Biostatistik</subfield><subfield code="0">(DE-627)1271493756</subfield><subfield code="0">(DE-625)rvk/148142:</subfield><subfield code="0">(DE-576)201493756</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">ST 300</subfield><subfield code="b">Allgemeines</subfield><subfield code="k">Informatik</subfield><subfield code="k">Monografien</subfield><subfield code="k">Künstliche Intelligenz</subfield><subfield code="k">Allgemeines</subfield><subfield code="0">(DE-627)1271119005</subfield><subfield code="0">(DE-625)rvk/143650:</subfield><subfield code="0">(DE-576)201119005</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SK 870</subfield><subfield code="b">Lineare und Nichtlineare Optimierung</subfield><subfield code="k">Mathematik</subfield><subfield code="k">Monografien</subfield><subfield code="k">Lineare und Nichtlineare Optimierung</subfield><subfield code="0">(DE-627)127088123X</subfield><subfield code="0">(DE-625)rvk/143265:</subfield><subfield code="0">(DE-576)20088123X</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">31.80</subfield><subfield code="j">Angewandte Mathematik</subfield><subfield code="q">SEPA</subfield><subfield code="0">(DE-627)106419005</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.51</subfield><subfield code="j">Programmiermethodik</subfield><subfield code="q">SEPA</subfield><subfield code="0">(DE-627)106418122</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.72</subfield><subfield code="j">Künstliche Intelligenz</subfield><subfield code="q">SEPA</subfield><subfield code="0">(DE-627)10641240X</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">BO</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">519.6</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">22</subfield><subfield code="1">01</subfield><subfield code="x">0018</subfield><subfield code="b">3848477009</subfield><subfield code="h">olrm-h228-MITIEEE</subfield><subfield code="y">zi22818</subfield><subfield code="z">03-02-21</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">23</subfield><subfield code="1">01</subfield><subfield code="x">0830</subfield><subfield code="b">3957242509</subfield><subfield code="h">olr-MIT</subfield><subfield code="u">i</subfield><subfield code="y">z</subfield><subfield code="z">23-07-21</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">100</subfield><subfield code="1">01</subfield><subfield code="x">3100</subfield><subfield code="b">4472469618</subfield><subfield code="c">09</subfield><subfield code="f">--%%--</subfield><subfield code="d">eBook MIT Press</subfield><subfield code="e">--%%--</subfield><subfield code="j">--%%--</subfield><subfield code="h">OLR-MIT-CEC</subfield><subfield code="k">Vervielfältigungen (z.B. Kopien, Downloads) sind nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots.</subfield><subfield code="y">z</subfield><subfield code="z">30-01-24</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">370</subfield><subfield code="1">01</subfield><subfield code="x">4370</subfield><subfield code="b">401122393X</subfield><subfield code="h">olr-ebook mitieee</subfield><subfield code="k">Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots.</subfield><subfield code="u">i</subfield><subfield code="y">z</subfield><subfield code="z">01-12-21</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">2015</subfield><subfield code="1">01</subfield><subfield code="x">DE-93</subfield><subfield code="b">3740753242</subfield><subfield code="c">00</subfield><subfield code="f">--%%--</subfield><subfield code="d">--%%--</subfield><subfield code="e">p</subfield><subfield code="j">--%%--</subfield><subfield code="k">Campuslizenz</subfield><subfield code="y">l01</subfield><subfield code="z">18-08-20</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">22</subfield><subfield code="1">01</subfield><subfield code="x">0018</subfield><subfield code="y">Volltextzugang Campus</subfield><subfield code="r">https://ieeexplore.ieee.org/book/6267250</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">22</subfield><subfield code="1">01</subfield><subfield code="x">0018</subfield><subfield code="y">Nur für Angehörige der Universität Hamburg: Volltextzugang von außerhalb des Campus</subfield><subfield code="r">http://emedien.sub.uni-hamburg.de/han/ieee/ieeexplore.ieee.org/book/6267250</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">23</subfield><subfield code="1">01</subfield><subfield code="x">0830</subfield><subfield code="y">MIT Press EBook</subfield><subfield code="r">https://ieeexplore.ieee.org/book/6267250</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">100</subfield><subfield code="1">01</subfield><subfield code="x">3100</subfield><subfield code="r">https://ieeexplore.ieee.org/book/6267250</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">100</subfield><subfield code="1">01</subfield><subfield code="x">3100</subfield><subfield code="y">für Uniangehörige: Zugang weltweit</subfield><subfield code="r">http://han.med.uni-magdeburg.de/han/mitvia-ieee/ieeexplore.ieee.org/book/6267250</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">370</subfield><subfield code="1">01</subfield><subfield code="x">4370</subfield><subfield code="y">E-Book: Zugriff im HCU-Netz. Zugriff von außerhalb nur für HCU-Angehörige möglich</subfield><subfield code="r">https://ieeexplore.ieee.org/book/6267250</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">2015</subfield><subfield code="1">01</subfield><subfield code="x">DE-93</subfield><subfield code="r">https://ieeexplore.ieee.org/book/6267250</subfield></datafield><datafield tag="985" ind1=" " ind2=" "><subfield code="2">23</subfield><subfield code="1">01</subfield><subfield code="x">0830</subfield><subfield code="a">2018-01805, 2018-01806, 2018-01808</subfield></datafield><datafield tag="995" ind1=" " ind2=" "><subfield code="2">22</subfield><subfield code="1">01</subfield><subfield code="x">0018</subfield><subfield code="a">olrm-h228-MITIEEE</subfield></datafield><datafield tag="995" ind1=" " ind2=" "><subfield code="2">23</subfield><subfield code="1">01</subfield><subfield code="x">0830</subfield><subfield code="a">olr-MIT</subfield></datafield><datafield tag="995" ind1=" " ind2=" "><subfield code="2">100</subfield><subfield code="1">01</subfield><subfield code="x">3100</subfield><subfield code="a">OLR-MIT-CEC</subfield></datafield><datafield tag="995" ind1=" " ind2=" "><subfield code="2">370</subfield><subfield code="1">01</subfield><subfield code="x">4370</subfield><subfield code="a">olr-ebook mitieee</subfield></datafield><datafield tag="998" ind1=" " ind2=" "><subfield code="2">370</subfield><subfield code="1">01</subfield><subfield code="x">4370</subfield><subfield code="0">2021.12.01</subfield></datafield></record></collection>
|
| score |
7.39839 |