Abstract
An efficient approach to the accurate computer modeling of phenomena and processes is discussed. The "divide-and-conquer" technique is used to develop a generalized parallel-recursive algorithm for simultaneous solution of a collection of interrelated problems that use a common unified data structure (weighted concatenable queue) at the merge stage. The decomposition stage is common and is executed only once for all tasks. These means are efficient and convenient for constructing and studying complex computational models.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.