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 CREW PRAM algorithm has been given to solve such dynamic programming problems. The algorithm us...

Celý popis

Podrobná bibliografia

Vydané v:	Parallel and Distributed Processing, 2nd IEEE Symposium On s. 497 - 500
Hlavní autori:	Viswanathan, V., Huang, S.-H.S., Hongfei Liu
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE Comput. Soc. Press 1990
Predmet:	Binary search trees Binary trees Computer science Dynamic programming Equations H infinity control NASA Open systems Phase change random access memory
ISBN:	0818620870, 9780818620874
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!