A systolic linear array for the 0/1 knapsack problem:
Abstract: "A modular systolic linear array for the 0/1 Knapsack problem is described. The design consists of a unidirectional array of homogeneous elementary cells making the array completely modular and extensible. Each cell has a fixed storage capacity of size [alpha], where [alpha] is a para...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Lyon
1990
|
Schriftenreihe: | Laboratoire d'Informatique du Parallélisme <Lyon>: Rapports de recherche du LIP
1990,12 |
Schlagworte: | |
Zusammenfassung: | Abstract: "A modular systolic linear array for the 0/1 Knapsack problem is described. The design consists of a unidirectional array of homogeneous elementary cells making the array completely modular and extensible. Each cell has a fixed storage capacity of size [alpha], where [alpha] is a parameter of the design. For a problem of size m and capacity of the knapsack c a linear array of m[c/[alpha]] cells is proposed solving the problem in T=c+m[c/[alpha]]+m time-steps. The modularity of the array permits to solve larger problems only by using more cells, without any modification in the design and/or in the cell program." |
Beschreibung: | 12 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010676933 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 960322s1990 |||| 00||| engod | ||
035 | |a (OCoLC)24333026 | ||
035 | |a (DE-599)BVBBV010676933 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-91G | ||
100 | 1 | |a Andonov, Rumen |e Verfasser |4 aut | |
245 | 1 | 0 | |a A systolic linear array for the 0/1 knapsack problem |c Rumen Andonov ; Abdelhamid Benaini |
264 | 1 | |a Lyon |c 1990 | |
300 | |a 12 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Laboratoire d'Informatique du Parallélisme <Lyon>: Rapports de recherche du LIP |v 1990,12 | |
520 | 3 | |a Abstract: "A modular systolic linear array for the 0/1 Knapsack problem is described. The design consists of a unidirectional array of homogeneous elementary cells making the array completely modular and extensible. Each cell has a fixed storage capacity of size [alpha], where [alpha] is a parameter of the design. For a problem of size m and capacity of the knapsack c a linear array of m[c/[alpha]] cells is proposed solving the problem in T=c+m[c/[alpha]]+m time-steps. The modularity of the array permits to solve larger problems only by using more cells, without any modification in the design and/or in the cell program." | |
650 | 4 | |a Dynamic programming | |
650 | 4 | |a Systolic array circuits | |
700 | 1 | |a Benaini, Abdelhamid |e Verfasser |4 aut | |
830 | 0 | |a Laboratoire d'Informatique du Parallélisme <Lyon>: Rapports de recherche du LIP |v 1990,12 |w (DE-604)BV010675085 |9 1990,12 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-007125475 |
Datensatz im Suchindex
_version_ | 1804125154008104960 |
---|---|
any_adam_object | |
author | Andonov, Rumen Benaini, Abdelhamid |
author_facet | Andonov, Rumen Benaini, Abdelhamid |
author_role | aut aut |
author_sort | Andonov, Rumen |
author_variant | r a ra a b ab |
building | Verbundindex |
bvnumber | BV010676933 |
ctrlnum | (OCoLC)24333026 (DE-599)BVBBV010676933 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01679nam a2200313 cb4500</leader><controlfield tag="001">BV010676933</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960322s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24333026</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010676933</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Andonov, Rumen</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A systolic linear array for the 0/1 knapsack problem</subfield><subfield code="c">Rumen Andonov ; Abdelhamid Benaini</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Lyon</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">12 S.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Laboratoire d'Informatique du Parallélisme <Lyon>: Rapports de recherche du LIP</subfield><subfield code="v">1990,12</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A modular systolic linear array for the 0/1 Knapsack problem is described. The design consists of a unidirectional array of homogeneous elementary cells making the array completely modular and extensible. Each cell has a fixed storage capacity of size [alpha], where [alpha] is a parameter of the design. For a problem of size m and capacity of the knapsack c a linear array of m[c/[alpha]] cells is proposed solving the problem in T=c+m[c/[alpha]]+m time-steps. The modularity of the array permits to solve larger problems only by using more cells, without any modification in the design and/or in the cell program."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Systolic array circuits</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Benaini, Abdelhamid</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Laboratoire d'Informatique du Parallélisme <Lyon>: Rapports de recherche du LIP</subfield><subfield code="v">1990,12</subfield><subfield code="w">(DE-604)BV010675085</subfield><subfield code="9">1990,12</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007125475</subfield></datafield></record></collection> |
id | DE-604.BV010676933 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:57:02Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007125475 |
oclc_num | 24333026 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM |
owner_facet | DE-91G DE-BY-TUM |
physical | 12 S. |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
record_format | marc |
series | Laboratoire d'Informatique du Parallélisme <Lyon>: Rapports de recherche du LIP |
series2 | Laboratoire d'Informatique du Parallélisme <Lyon>: Rapports de recherche du LIP |
spelling | Andonov, Rumen Verfasser aut A systolic linear array for the 0/1 knapsack problem Rumen Andonov ; Abdelhamid Benaini Lyon 1990 12 S. txt rdacontent n rdamedia nc rdacarrier Laboratoire d'Informatique du Parallélisme <Lyon>: Rapports de recherche du LIP 1990,12 Abstract: "A modular systolic linear array for the 0/1 Knapsack problem is described. The design consists of a unidirectional array of homogeneous elementary cells making the array completely modular and extensible. Each cell has a fixed storage capacity of size [alpha], where [alpha] is a parameter of the design. For a problem of size m and capacity of the knapsack c a linear array of m[c/[alpha]] cells is proposed solving the problem in T=c+m[c/[alpha]]+m time-steps. The modularity of the array permits to solve larger problems only by using more cells, without any modification in the design and/or in the cell program." Dynamic programming Systolic array circuits Benaini, Abdelhamid Verfasser aut Laboratoire d'Informatique du Parallélisme <Lyon>: Rapports de recherche du LIP 1990,12 (DE-604)BV010675085 1990,12 |
spellingShingle | Andonov, Rumen Benaini, Abdelhamid A systolic linear array for the 0/1 knapsack problem Laboratoire d'Informatique du Parallélisme <Lyon>: Rapports de recherche du LIP Dynamic programming Systolic array circuits |
title | A systolic linear array for the 0/1 knapsack problem |
title_auth | A systolic linear array for the 0/1 knapsack problem |
title_exact_search | A systolic linear array for the 0/1 knapsack problem |
title_full | A systolic linear array for the 0/1 knapsack problem Rumen Andonov ; Abdelhamid Benaini |
title_fullStr | A systolic linear array for the 0/1 knapsack problem Rumen Andonov ; Abdelhamid Benaini |
title_full_unstemmed | A systolic linear array for the 0/1 knapsack problem Rumen Andonov ; Abdelhamid Benaini |
title_short | A systolic linear array for the 0/1 knapsack problem |
title_sort | a systolic linear array for the 0 1 knapsack problem |
topic | Dynamic programming Systolic array circuits |
topic_facet | Dynamic programming Systolic array circuits |
volume_link | (DE-604)BV010675085 |
work_keys_str_mv | AT andonovrumen asystoliclineararrayforthe01knapsackproblem AT benainiabdelhamid asystoliclineararrayforthe01knapsackproblem |