
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Nachiket V. Kale, Srinivasa M. Salapaka, "Maximum Entropy PrincipleBased Algorithm for Simultaneous Resource Location and Multihop Routing in Multiagent Networks," IEEE Transactions on Mobile Computing, vol. 11, no. 4, pp. 591602, April, 2012.  
BibTex  x  
@article{ 10.1109/TMC.2011.93, author = {Nachiket V. Kale and Srinivasa M. Salapaka}, title = {Maximum Entropy PrincipleBased Algorithm for Simultaneous Resource Location and Multihop Routing in Multiagent Networks}, journal ={IEEE Transactions on Mobile Computing}, volume = {11}, number = {4}, issn = {15361233}, year = {2012}, pages = {591602}, doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2011.93}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Mobile Computing TI  Maximum Entropy PrincipleBased Algorithm for Simultaneous Resource Location and Multihop Routing in Multiagent Networks IS  4 SN  15361233 SP591 EP602 EPD  591602 A1  Nachiket V. Kale, A1  Srinivasa M. Salapaka, PY  2012 KW  Networks KW  optimization methods KW  resource management KW  routing. VL  11 JA  IEEE Transactions on Mobile Computing ER   
[1] P. Sharma, S. Salapaka, and C. Beck, “A Maximum Entropy Based Scalable Algorithm for Resource Allocation Problems,” Proc. Am. Control Conf., pp. 516521, 2007.
[2] P. Sharma, S. Salapaka, and C. Beck, “A Scalable Deterministic Annealing Algorithm for Resource Allocation Problems,” Proc. Am. Control Conf., pp. 30923097, 2006.
[3] P. Sharma, S. Salapaka, and C. Beck, “A Scalable Approach to Combinatorial Library Design for Drug Discovery,” J. Chemical Information and Modeling, vol. 48, no. 1, pp. 2741, 2008.
[4] J. Cortés, S. Martínez, T. Karatas, and F. Bullo, “Coverage Control for Mobile Sensing Networks: Variations on a Theme,” Proc. Mediterranean Conf. Control and Automation, July 2002.
[5] S. Salapaka and A. Khalak, “Locational Optimization Problems with Constraints on Resources,” Proc. 41st Allerton Conf., pp. 12401249, Oct. 2003.
[6] S. Salapaka and A. Khalak, “Constraints on Locational Optimization Problems,” Proc. IEEE Control and Decision Conf., pp. 17411746, Dec. 2003.
[7] K. Rose, “Deterministic Annealing for Clustering, Compression, Classification, Regression and Related Optimization Problems,” Proc. IEEE, vol. 86, no. 11, pp. 221039, Nov. 1998.
[8] Z. Drezner, Facility Location: A Survey of Applications and Methods. Springer Verlag, 1995.
[9] S. Lloyd, “Least Squares Quantization in PCM,” IEEE Trans. Information Theory, vol. 28, no. 2, pp. 129137, Mar. 1982.
[10] A. Gersho and R. Gray, Vector Quantization and Signal Compression, first ed. Kluwer, 1991.
[11] S. Kirkpatrick, C. Gelatt, and M. Vechhi, “Optimization by Simulated Annealing,” Science, vol. 220, pp. 671680, 1983.
[12] J.N. AlKaraki and A.E. Kamal, “Routing Techniques in Wireless Sensor Networks: A Survey,” IEEE Wireless Comm., vol. 11, no. 6, pp. 627, Dec. 2004.
[13] F. Kuhn, R. Wattenhofer, and A. Zollinger, “An Algorithmic Approach to Geographic Routing in Ad Hoc and Sensor Networks,” IEEE/ACM Trans. Networking, vol. 16, no. 1, pp. 5162, Feb. 2008.
[14] T. Moscibroda, M. Wattenhofer, R. O'Dell, and R. Wattenhofer, “Virtual Coordinates for Ad Hoc and Sensor Networks,” Proc. Joint Workshop Foundations of Mobile Computing (DIALMPOMC '04), pp. 816, 2004.
[15] N.S. Kulkarnit, B. Ramantt, and I. Gupta, “On Demand Routing Protocols for Mobile Ad Hoc Networks: A Review,” Proc. IEEE Int'l Advance Computing Conf. (IACC '09), pp. 586591, 2009.
[16] C. Liu and J. Wu, “Efficient Adaptive Routing in Delay Tolerant Networks,” Proc. IEEE Int'l Conf. Comm., 2009.
[17] S. Geman and D. Geman, “Stochastic Relaxation, Gibbs Distribution, and the Bayesian Restoration of Images,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, no. 6, pp. 721741, Nov. 1984.
[18] M. Mahajan, P. Nimbhorkar, and K. Varadarajan, “The Planar kMeans Problem Is npHard,” Proc. the Third Int'l Workshop Algorithms and Computation (WALCOM '09), pp. 274285, 2009.
[19] D. Aloise, A. Deshpande, P. Hansen, and P. Popat, “NPHardness of Euclidean SumofSquares Clustering,” Machine Learning, vol. 75, no. 2, pp. 245248, 2009.
[20] P. Drineas, A. Friexe, R. Kannan, S. Vempala, and V. Vinay, “Clustering Large Graphs via the Singular Value Decomposition,” Machine Learning, vol. 56, pp. 933, 2004.
[21] E.T. Jaynes, “Information Theory and Statistical Mechanics,” Physical Rev., vol. 106, pp. 620630, 1957.
[22] E.T. Jaynes, Probability Theory—The Logic of Science. Cambridge Univ., 2003.
[23] C.E. Shannon and W. Weaver, The Mathematical Theory of Communication. Univ. of Illi nois, 1949.
[24] L.D. Landau and E.M. Lifshitz, Statistical Physics, Part 1, third ed., vol. 3. Oxford, 1980.