Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
A machine model in which load operations can be performed in parallel with arithmetic operations by two separate functional units is considered. For this model, the evaluation of a set of expression trees is discussed. A dynamic programming algorithm for producing an approximate solution is described and analyzed. For binary trees its worse-case cost is at most min (1.091, 1 + (2 log n)/n) times the optimal cost.
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997