( en | de | ru )

 

Disambiguation of "Kameda, Hisao"

Author of the publication

copydeleteadd this publication to your clipboard
A Decomposition Algorithm for Optimal Static Load Balancing in Tree Hierarchy Network Configurations.

, and . IEEE Trans. Parallel Distributed Syst., 5 (5): 540-548 (1994)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Hisao Ito

Genn Kameda

 

Other publications of authors with the same name

Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers., and . J. ACM, 49 (3): 407-433 (2002)Optimal Load Balancing in Tree Networks Two-Way Traffic., and . Comput. Networks ISDN Syst., 25 (12): 1335-1348 (1993)Distributed Hierarchical Access Control for Secure Group Communications., , and . ICCNMC, volume 3619 of Lecture Notes in Computer Science, page 539-548. Springer, (2005)Simulation Study on Load Balanced Multiple Home Agents for Mobile IP Networks., , and . DNIS, volume 1966 of Lecture Notes in Computer Science, page 228-245. Springer, (2000)Adaptive Bidding Load Balancing Algorithms in Heterogeneous Distributed Systems., , and . MASCOTS, page 250-254. IEEE Computer Society, (1994)Modeling and Control of Economic Systems 2001, , and . chapter Effects of Symmetry on Paradoxical Cost Degradation in a Nash Non-Cooperative Network System, page 99--104. Elsevier Science Ltd, Oxford, (2003)Optimality of a Central Processor Scheduling Policy for Processing a Job Stream. ACM Trans. Comput. Syst., 2 (1): 78-90 (1984)Nash equilibrium based fairness., , , and . GAMENETS, page 533-539. IEEE, (2009)Optimal Dynamic Location Update for PCS Networks., , and . ICDCS, page 134-141. IEEE Computer Society, (1999)Bounds on Benefits and Harms of Adding Connections to Noncooperative Networks.. NETWORKING, volume 3042 of Lecture Notes in Computer Science, page 405-417. Springer, (2004)