Parallel algorithms for knapsack type problems:
This book brings together current research direction in the mapping of dynamic programming recurrence equations for Knapsack Type problems, which include Unbounded Knapsack Problem, 0/1 Knapsack Problem, Subset Sum Problem, Change Making Problem, onto so-called regular parallel architectures. In par...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Singapore
World Scientific Pub. Co.
c1998
|
| Schlagworte: | |
| Online-Zugang: | FHN01 Volltext |
| Zusammenfassung: | This book brings together current research direction in the mapping of dynamic programming recurrence equations for Knapsack Type problems, which include Unbounded Knapsack Problem, 0/1 Knapsack Problem, Subset Sum Problem, Change Making Problem, onto so-called regular parallel architectures. In particular, it focuses on heuristic and more formal techniques for mapping. The text is based on substantially revised papers published by the authors and their colleagues in the literature but re-written to provide an overall view of the subject area |
| Beschreibung: | ix, 287 p. ill |
| ISBN: | 9789812817518 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV044636641 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 171120s1998 |||| o||u| ||||||eng d | ||
| 020 | |a 9789812817518 |9 978-981-281-751-8 | ||
| 024 | 7 | |a 10.1142/2616 |2 doi | |
| 035 | |a (ZDB-124-WOP)00004512 | ||
| 035 | |a (OCoLC)1012626376 | ||
| 035 | |a (DE-599)BVBBV044636641 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-92 | ||
| 082 | 0 | |a 004.35 |2 22 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a UF 4000 |0 (DE-625)145577: |2 rvk | ||
| 100 | 1 | |a Alexandrov, Vassil |d 1962- |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Parallel algorithms for knapsack type problems |c V.N. Alexandrov, G.M. Megson |
| 264 | 1 | |a Singapore |b World Scientific Pub. Co. |c c1998 | |
| 300 | |a ix, 287 p. |b ill | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 520 | |a This book brings together current research direction in the mapping of dynamic programming recurrence equations for Knapsack Type problems, which include Unbounded Knapsack Problem, 0/1 Knapsack Problem, Subset Sum Problem, Change Making Problem, onto so-called regular parallel architectures. In particular, it focuses on heuristic and more formal techniques for mapping. The text is based on substantially revised papers published by the authors and their colleagues in the literature but re-written to provide an overall view of the subject area | ||
| 650 | 4 | |a Parallel algorithms | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 650 | 4 | |a Computational complexity | |
| 650 | 0 | 7 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Rucksackproblem |0 (DE-588)4178600-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Rucksackproblem |0 (DE-588)4178600-2 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Megson, G. M. |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9789810221201 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9810220529 |
| 856 | 4 | 0 | |u http://www.worldscientific.com/worldscibooks/10.1142/2616#t=toc |x Verlag |z URL des Erstveroeffentlichers |3 Volltext |
| 912 | |a ZDB-124-WOP | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030034614 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u http://www.worldscientific.com/worldscibooks/10.1142/2616#t=toc |l FHN01 |p ZDB-124-WOP |q FHN_PDA_WOP |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804178051212247040 |
|---|---|
| any_adam_object | |
| author | Alexandrov, Vassil 1962- |
| author_facet | Alexandrov, Vassil 1962- |
| author_role | aut |
| author_sort | Alexandrov, Vassil 1962- |
| author_variant | v a va |
| building | Verbundindex |
| bvnumber | BV044636641 |
| classification_rvk | ST 130 UF 4000 |
| collection | ZDB-124-WOP |
| ctrlnum | (ZDB-124-WOP)00004512 (OCoLC)1012626376 (DE-599)BVBBV044636641 |
| dewey-full | 004.35 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.35 |
| dewey-search | 004.35 |
| dewey-sort | 14.35 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Physik Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02593nmm a2200529zc 4500</leader><controlfield tag="001">BV044636641</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">171120s1998 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789812817518</subfield><subfield code="9">978-981-281-751-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1142/2616</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-124-WOP)00004512</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1012626376</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044636641</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">004.35</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">UF 4000</subfield><subfield code="0">(DE-625)145577:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Alexandrov, Vassil</subfield><subfield code="d">1962-</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel algorithms for knapsack type problems</subfield><subfield code="c">V.N. Alexandrov, G.M. Megson</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Singapore</subfield><subfield code="b">World Scientific Pub. Co.</subfield><subfield code="c">c1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">ix, 287 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">This book brings together current research direction in the mapping of dynamic programming recurrence equations for Knapsack Type problems, which include Unbounded Knapsack Problem, 0/1 Knapsack Problem, Subset Sum Problem, Change Making Problem, onto so-called regular parallel architectures. In particular, it focuses on heuristic and more formal techniques for mapping. The text is based on substantially revised papers published by the authors and their colleagues in the literature but re-written to provide an overall view of the subject area</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Paralleler Algorithmus</subfield><subfield code="0">(DE-588)4193615-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Rucksackproblem</subfield><subfield code="0">(DE-588)4178600-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Paralleler Algorithmus</subfield><subfield code="0">(DE-588)4193615-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Rucksackproblem</subfield><subfield code="0">(DE-588)4178600-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Megson, G. M.</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">9789810221201</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">9810220529</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.worldscientific.com/worldscibooks/10.1142/2616#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-030034614</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://www.worldscientific.com/worldscibooks/10.1142/2616#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.BV044636641 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:57:49Z |
| institution | BVB |
| isbn | 9789812817518 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030034614 |
| oclc_num | 1012626376 |
| open_access_boolean | |
| owner | DE-92 |
| owner_facet | DE-92 |
| physical | ix, 287 p. ill |
| psigel | ZDB-124-WOP ZDB-124-WOP FHN_PDA_WOP |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | World Scientific Pub. Co. |
| record_format | marc |
| spelling | Alexandrov, Vassil 1962- Verfasser aut Parallel algorithms for knapsack type problems V.N. Alexandrov, G.M. Megson Singapore World Scientific Pub. Co. c1998 ix, 287 p. ill txt rdacontent c rdamedia cr rdacarrier This book brings together current research direction in the mapping of dynamic programming recurrence equations for Knapsack Type problems, which include Unbounded Knapsack Problem, 0/1 Knapsack Problem, Subset Sum Problem, Change Making Problem, onto so-called regular parallel architectures. In particular, it focuses on heuristic and more formal techniques for mapping. The text is based on substantially revised papers published by the authors and their colleagues in the literature but re-written to provide an overall view of the subject area Parallel algorithms Parallel programming (Computer science) Computational complexity Paralleler Algorithmus (DE-588)4193615-2 gnd rswk-swf Rucksackproblem (DE-588)4178600-2 gnd rswk-swf Paralleler Algorithmus (DE-588)4193615-2 s 1\p DE-604 Rucksackproblem (DE-588)4178600-2 s 2\p DE-604 Megson, G. M. Sonstige oth Erscheint auch als Druck-Ausgabe 9789810221201 Erscheint auch als Druck-Ausgabe 9810220529 http://www.worldscientific.com/worldscibooks/10.1142/2616#t=toc Verlag URL des Erstveroeffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Alexandrov, Vassil 1962- Parallel algorithms for knapsack type problems Parallel algorithms Parallel programming (Computer science) Computational complexity Paralleler Algorithmus (DE-588)4193615-2 gnd Rucksackproblem (DE-588)4178600-2 gnd |
| subject_GND | (DE-588)4193615-2 (DE-588)4178600-2 |
| title | Parallel algorithms for knapsack type problems |
| title_auth | Parallel algorithms for knapsack type problems |
| title_exact_search | Parallel algorithms for knapsack type problems |
| title_full | Parallel algorithms for knapsack type problems V.N. Alexandrov, G.M. Megson |
| title_fullStr | Parallel algorithms for knapsack type problems V.N. Alexandrov, G.M. Megson |
| title_full_unstemmed | Parallel algorithms for knapsack type problems V.N. Alexandrov, G.M. Megson |
| title_short | Parallel algorithms for knapsack type problems |
| title_sort | parallel algorithms for knapsack type problems |
| topic | Parallel algorithms Parallel programming (Computer science) Computational complexity Paralleler Algorithmus (DE-588)4193615-2 gnd Rucksackproblem (DE-588)4178600-2 gnd |
| topic_facet | Parallel algorithms Parallel programming (Computer science) Computational complexity Paralleler Algorithmus Rucksackproblem |
| url | http://www.worldscientific.com/worldscibooks/10.1142/2616#t=toc |
| work_keys_str_mv | AT alexandrovvassil parallelalgorithmsforknapsacktypeproblems AT megsongm parallelalgorithmsforknapsacktypeproblems |