Thumbnail
Access Restriction
Subscribed

Author Yu-Chi Ho ♦ Mei Deng
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©1994
Language English
Subject Domain (in DDC) Technology ♦ Engineering & allied operations ♦ Other branches of engineering
Subject Keyword Stochastic processes ♦ Costs ♦ Sampling methods ♦ Probability ♦ Space technology ♦ Analytical models ♦ Concurrent computing ♦ Systems engineering and theory ♦ Computer networks ♦ Production facilities
Abstract We have demonstrated that the problem of large search space in stochastic optimization can be effectively attacked. A great deal of computational burden can be shared if we are simulating a set of parametrically different but structurally similar systems. The metaphor here is the data compression scheme used in the transmission of moving pictures; one transmits the first frame followed by the difference in succeeding frame to minimize transmission channel capacity requirements. Similarly, the evaluation of the performances of a set of experiments involve a great deal of commonality that can be shared and leveraged for maximal efficiency. In particular, the computation is well adapted to SIMD massively parallel computers. Also, softening the strict requirement of optimality can often transform an infeasible problem (in terms of computation burden) into a tractable one.<<ETX>>
Description Author affiliation: Div. of Appl. Sci., Harvard Univ., Cambridge, MA, USA (Yu-Chi Ho; Mei Deng)
ISBN 0780319680
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1994-12-14
Publisher Place USA
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 550.48 kB
Page Count 6
Starting Page 1470
Ending Page 1475


Source: IEEE Xplore Digital Library