Abstract
In this paper, we develop a scalable algorithm for solving resource allocation problems on large datasets. The algorithm is based on the deterministic annealing (DA) algorithm presented in the work of Rose (1998). The capability of the DA algorithm to identify clusters at successive iteration steps is exploited to truncate certain large computations in the algorithm. These truncations are obtained by recursively grouping the clusters into appropriate groups and running the DA algorithm, in parallel, on the groups. This paper develops a notion of interaction between groups which is used to measure the deviation of this algorithm from the DA algorithm. Simulations are presented that show significant improvements in the computational time while keeping the error in resource allocations within pre-specified tolerance limits
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
