1502 search results - page 208 / 301 » Node weighted scheduling |
ICALP
2011
Springer
13 years 1 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
ICAS
2006
IEEE
14 years 4 months ago
2006
IEEE
The size, complexity, heterogeneity, and dynamism of largescale computational grids make autonomic grid services and solutions necessary. In particular, grid schedulers must map a...
CCGRID
2005
IEEE
14 years 3 months ago
2005
IEEE
Before an application modelled as a Directed Acyclic Graph (DAG) is executed on a heterogeneous system, a DAG mapping policy is often enacted. After mapping, the tasks (in the DAG...
ASPDAC
2001
ACM
14 years 1 months ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
INFOCOM
2010
IEEE
13 years 8 months ago
2010
IEEE
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...