187 search results - page 5 / 38 » Approximation Algorithms for Multiprocessor Scheduling under... |
105
Voted
DAM
2006
15 years 3 months ago
2006
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
137
Voted
DATE
2009
IEEE
15 years 7 months ago
2009
IEEE
As application complexity increases, modern embedded systems have adopted heterogeneous processing elements to enhance the computing capability or to reduce the power consumption. ...
149
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
The problem of coalition formation when agents are uncertain about the types or capabilities of their potential partners is a critical one. In [3] a Bayesian reinforcement learnin...
124
Voted
TON
2010
14 years 10 months ago
2010
In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node ...
163
Voted
ECRTS
2003
IEEE
15 years 9 months ago
2003
IEEE
In uniform multiprocessor platforms, the various processors comprising the multiprocessor platform may have different computing capacities. The focus of this paper is the design o...