Ara
Toplam kayıt 3, listelenen: 1-3
Crossing minimization in weighted bipartite graphs
(Springer, 2007)
Given a bipartite graph G = (L-0, L-1, E) and a fixed ordering of the nodes in L-0, the problem of finding an ordering of the nodes in L-1 that minimizes the number of crossings has received much attention in literature. ...
Optimal and near-optimal partner selection algorithms in cooperative OFDMA
(IEEE, 2012)
We obtain the jointly optimal power allocation and partner selection policies, that maximize the sum rate of a cooperative OFDMA system with mutually cooperating pairs of users. We show that the power allocation and partner ...
Optimal project duration for resource leveling
(Elsevier Science BV, 2018-04-16)
Resource leveling is important in project management as resource fluctuations are costly and undesired. Typically, schedules with better resource profiles are obtained by shifting the activities within their float times ...