Sciweavers

309 search results - page 27 / 62
» Approximation algorithms for dynamic resource allocation
Sort
View
IJCSA
2007
110views more  IJCSA 2007»
13 years 7 months ago
Multiprocessor Scheduling Using Hybrid Particle Swarm Optimization with Dynamically Varying Inertia
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
S. N. Sivanandam, P. Visalakshi, A. Bhuvaneswari
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
13 years 9 months ago
Robust cost colorings
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
Takuro Fukunaga, Magnús M. Halldórss...
GCC
2004
Springer
14 years 1 months ago
Maintaining Comprehensive Resource Availability in P2P Networks
Abstract. In this paper, the resource availability issue has been addressed with respect to the intermittent connectivity and dynamic presence of peers in a P2P system. We aim to m...
Bin Xiao, Jiannong Cao, Edwin Hsing-Mean Sha
INFOCOM
2008
IEEE
14 years 2 months ago
Self-Organizing Dynamic Fractional Frequency Reuse in OFDMA Systems
—We describe an algorithm for sub-carrier and power allocation that achieves out-of-cell interference avoidance through dynamic fractional frequency reuse (FFR) in downlink of ce...
Alexander L. Stolyar, Harish Viswanathan
ICRA
2003
IEEE
165views Robotics» more  ICRA 2003»
14 years 1 months ago
Multi-robot task-allocation through vacancy chains
Existing task allocation algorithms generally do not consider the effects of task interaction, such as interference, but instead assume that tasks are independent. That assumptio...
Torbjørn S. Dahl, Maja J. Mataric, Gaurav S...