Design of parallel algorithms for the single resource allocation problem (Q1584827): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3992991 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A study of parallel branch-and-bound algorithms with best-bound-first search / rank | |||
Normal rank | |||
Revision as of 17:12, 30 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Design of parallel algorithms for the single resource allocation problem |
scientific article |
Statements
Design of parallel algorithms for the single resource allocation problem (English)
0 references
2000
0 references
dynamic programming
0 references
resource allocation problem
0 references
parallel computing
0 references
PVM
0 references
MPI
0 references
