Parallel dynamic programming

Recurrence formulations for various problems, such as finding an optimal order of matrix multiplication, finding an optimal binary search tree, and optimal triangulation of polygons, assume a similar form. A. Gibbons and W. Rytter (1988) gave a CREW PRAM algorithm to solve such dynamic programming p...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on parallel and distributed systems Ročník 5; číslo 3; s. 326 - 328
Hlavní autoři:	Huang, S.-H.S., Hongfei Liu, Viswanathan, V.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Los Alamitos, CA IEEE 01.03.1994 IEEE Computer Society
Témata:	Applied sciences Binary search trees Computer architecture Computer science; control theory; systems Computer systems and distributed systems. User interface Concurrent computing Conferences Dynamic programming Exact sciences and technology Histograms Labeling Parallel processing Phase change random access memory Software Very large scale integration Parallel algorithm Reduction Processor Parallelism Dynamic programming Distributed system Algorithm analysis
ISSN:	1045-9219
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!