A maximum entropy based scalable algorithm for resource allocation problems

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we propose a scalable algorithm for solving resource allocation problems on large datasets. This class of problems is posed as a multi-objective optimization problem in a Maximum Entropy Principle framework. This algorithm solves a multi-objective optimization problem that minimizes simultaneously the coverage cost and the computational cost by appropriate recursive prescription of smaller subsets required for a 'divide and conquer' strategy. It provides characterization of the inherent trade-off between reduction in computation time and the coverage cost. Simulations are presented that show significant improvements in the computational time required for solving the coverage problem while maintaining the coverage costs within prespecified tolerance limits.

Original languageEnglish (US)
Title of host publicationProceedings of the 2007 American Control Conference, ACC
Pages516-521
Number of pages6
DOIs
StatePublished - Dec 1 2007
Event2007 American Control Conference, ACC - New York, NY, United States
Duration: Jul 9 2007Jul 13 2007

Publication series

NameProceedings of the American Control Conference
ISSN (Print)0743-1619

Other

Other2007 American Control Conference, ACC
CountryUnited States
CityNew York, NY
Period7/9/077/13/07

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A maximum entropy based scalable algorithm for resource allocation problems'. Together they form a unique fingerprint.

  • Cite this

    Sharma, P., Salapaka, S., & Beck, C. (2007). A maximum entropy based scalable algorithm for resource allocation problems. In Proceedings of the 2007 American Control Conference, ACC (pp. 516-521). [4282846] (Proceedings of the American Control Conference). https://doi.org/10.1109/ACC.2007.4282846