Partitions: optimality and clustering
The need of optimal partition arises from many real-world problems involving the distribution of limited resources to many users. The "clustering" problem, which has recently received a lot of attention, is a special case of optimal partitioning. This book is the first attempt to collect a...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Singapore
World Scientific Pub. Co.
c2012
|
| Schlagworte: | |
| Online-Zugang: | FHN01 Volltext |
| Zusammenfassung: | The need of optimal partition arises from many real-world problems involving the distribution of limited resources to many users. The "clustering" problem, which has recently received a lot of attention, is a special case of optimal partitioning. This book is the first attempt to collect all theoretical developments of optimal partitions, many of them derived by the authors, in an accessible place for easy reference. Much more than simply collecting the results, the book provides a general framework to unify these results and present them in an organized fashion. Many well-known practical problems of optimal partitions are dealt with. The authors show how they can be solved using the theory - or why they cannot be. These problems include: allocation of components to maximize system reliability; experiment design to identify defectives; design of circuit card library and of blood analyzer lines; abstraction of finite state machines and assignment of cache items to pages; the division of property and partition bargaining as well as touching on those well-known research areas such as scheduling, inventory, nearest neighbor assignment, the traveling salesman problem, vehicle routing, and graph partitions. The authors elucidate why the last three problems cannot be solved in the context of the theory |
| Beschreibung: | xi, 350 p. ill |
| ISBN: | 9789812770158 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV044634635 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 171120s2012 |||| o||u| ||||||eng d | ||
| 020 | |a 9789812770158 |c electronic bk. |9 978-981-277-015-8 | ||
| 024 | 7 | |a 10.1142/6518 |2 doi | |
| 035 | |a (ZDB-124-WOP)00002581 | ||
| 035 | |a (OCoLC)1012722203 | ||
| 035 | |a (DE-599)BVBBV044634635 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-92 | ||
| 082 | 0 | |a 512.73 |2 22 | |
| 100 | 1 | |a Hwang, Frank |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Partitions |b optimality and clustering |c Frank K. Hwang, Uriel G. Rothblum |
| 264 | 1 | |a Singapore |b World Scientific Pub. Co. |c c2012 | |
| 300 | |a xi, 350 p. |b ill | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 520 | |a The need of optimal partition arises from many real-world problems involving the distribution of limited resources to many users. The "clustering" problem, which has recently received a lot of attention, is a special case of optimal partitioning. This book is the first attempt to collect all theoretical developments of optimal partitions, many of them derived by the authors, in an accessible place for easy reference. Much more than simply collecting the results, the book provides a general framework to unify these results and present them in an organized fashion. Many well-known practical problems of optimal partitions are dealt with. The authors show how they can be solved using the theory - or why they cannot be. These problems include: allocation of components to maximize system reliability; experiment design to identify defectives; design of circuit card library and of blood analyzer lines; abstraction of finite state machines and assignment of cache items to pages; the division of property and partition bargaining as well as touching on those well-known research areas such as scheduling, inventory, nearest neighbor assignment, the traveling salesman problem, vehicle routing, and graph partitions. The authors elucidate why the last three problems cannot be solved in the context of the theory | ||
| 650 | 4 | |a Partitions (Mathematics) | |
| 700 | 1 | |a Rothblum, Uriel G. |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9789812708120 (hbk.) |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 981270812X (hbk.) |
| 856 | 4 | 0 | |u http://www.worldscientific.com/worldscibooks/10.1142/6518#t=toc |x Verlag |z URL des Erstveroeffentlichers |3 Volltext |
| 912 | |a ZDB-124-WOP | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030032606 | ||
| 966 | e | |u http://www.worldscientific.com/worldscibooks/10.1142/6518#t=toc |l FHN01 |p ZDB-124-WOP |q FHN_PDA_WOP |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804178046590124032 |
|---|---|
| any_adam_object | |
| author | Hwang, Frank |
| author_facet | Hwang, Frank |
| author_role | aut |
| author_sort | Hwang, Frank |
| author_variant | f h fh |
| building | Verbundindex |
| bvnumber | BV044634635 |
| collection | ZDB-124-WOP |
| ctrlnum | (ZDB-124-WOP)00002581 (OCoLC)1012722203 (DE-599)BVBBV044634635 |
| dewey-full | 512.73 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 512 - Algebra |
| dewey-raw | 512.73 |
| dewey-search | 512.73 |
| dewey-sort | 3512.73 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02717nmm a2200385zc 4500</leader><controlfield tag="001">BV044634635</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">171120s2012 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789812770158</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-981-277-015-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1142/6518</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-124-WOP)00002581 </subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1012722203</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044634635</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">512.73</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hwang, Frank</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Partitions</subfield><subfield code="b">optimality and clustering</subfield><subfield code="c">Frank K. Hwang, Uriel G. Rothblum</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Singapore</subfield><subfield code="b">World Scientific Pub. Co.</subfield><subfield code="c">c2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xi, 350 p.</subfield><subfield code="b">ill</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The need of optimal partition arises from many real-world problems involving the distribution of limited resources to many users. The "clustering" problem, which has recently received a lot of attention, is a special case of optimal partitioning. This book is the first attempt to collect all theoretical developments of optimal partitions, many of them derived by the authors, in an accessible place for easy reference. Much more than simply collecting the results, the book provides a general framework to unify these results and present them in an organized fashion. Many well-known practical problems of optimal partitions are dealt with. The authors show how they can be solved using the theory - or why they cannot be. These problems include: allocation of components to maximize system reliability; experiment design to identify defectives; design of circuit card library and of blood analyzer lines; abstraction of finite state machines and assignment of cache items to pages; the division of property and partition bargaining as well as touching on those well-known research areas such as scheduling, inventory, nearest neighbor assignment, the traveling salesman problem, vehicle routing, and graph partitions. The authors elucidate why the last three problems cannot be solved in the context of the theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Partitions (Mathematics)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rothblum, Uriel G.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</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">9789812708120 (hbk.)</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">981270812X (hbk.)</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.worldscientific.com/worldscibooks/10.1142/6518#t=toc</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveroeffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-124-WOP</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030032606</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://www.worldscientific.com/worldscibooks/10.1142/6518#t=toc</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-124-WOP</subfield><subfield code="q">FHN_PDA_WOP</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV044634635 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:57:45Z |
| institution | BVB |
| isbn | 9789812770158 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030032606 |
| oclc_num | 1012722203 |
| open_access_boolean | |
| owner | DE-92 |
| owner_facet | DE-92 |
| physical | xi, 350 p. ill |
| psigel | ZDB-124-WOP ZDB-124-WOP FHN_PDA_WOP |
| publishDate | 2012 |
| publishDateSearch | 2012 |
| publishDateSort | 2012 |
| publisher | World Scientific Pub. Co. |
| record_format | marc |
| spelling | Hwang, Frank Verfasser aut Partitions optimality and clustering Frank K. Hwang, Uriel G. Rothblum Singapore World Scientific Pub. Co. c2012 xi, 350 p. ill txt rdacontent c rdamedia cr rdacarrier The need of optimal partition arises from many real-world problems involving the distribution of limited resources to many users. The "clustering" problem, which has recently received a lot of attention, is a special case of optimal partitioning. This book is the first attempt to collect all theoretical developments of optimal partitions, many of them derived by the authors, in an accessible place for easy reference. Much more than simply collecting the results, the book provides a general framework to unify these results and present them in an organized fashion. Many well-known practical problems of optimal partitions are dealt with. The authors show how they can be solved using the theory - or why they cannot be. These problems include: allocation of components to maximize system reliability; experiment design to identify defectives; design of circuit card library and of blood analyzer lines; abstraction of finite state machines and assignment of cache items to pages; the division of property and partition bargaining as well as touching on those well-known research areas such as scheduling, inventory, nearest neighbor assignment, the traveling salesman problem, vehicle routing, and graph partitions. The authors elucidate why the last three problems cannot be solved in the context of the theory Partitions (Mathematics) Rothblum, Uriel G. Sonstige oth Erscheint auch als Druck-Ausgabe 9789812708120 (hbk.) Erscheint auch als Druck-Ausgabe 981270812X (hbk.) http://www.worldscientific.com/worldscibooks/10.1142/6518#t=toc Verlag URL des Erstveroeffentlichers Volltext |
| spellingShingle | Hwang, Frank Partitions optimality and clustering Partitions (Mathematics) |
| title | Partitions optimality and clustering |
| title_auth | Partitions optimality and clustering |
| title_exact_search | Partitions optimality and clustering |
| title_full | Partitions optimality and clustering Frank K. Hwang, Uriel G. Rothblum |
| title_fullStr | Partitions optimality and clustering Frank K. Hwang, Uriel G. Rothblum |
| title_full_unstemmed | Partitions optimality and clustering Frank K. Hwang, Uriel G. Rothblum |
| title_short | Partitions |
| title_sort | partitions optimality and clustering |
| title_sub | optimality and clustering |
| topic | Partitions (Mathematics) |
| topic_facet | Partitions (Mathematics) |
| url | http://www.worldscientific.com/worldscibooks/10.1142/6518#t=toc |
| work_keys_str_mv | AT hwangfrank partitionsoptimalityandclustering AT rothblumurielg partitionsoptimalityandclustering |