6598 search results - page 301 / 1320 » Graph Theory with Applications |
163
click to vote
SIAMDM
2010
15 years 5 months ago
2010
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
199
click to vote
RSA
2011
15 years 1 months ago
2011
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
254
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
Abstract-- Communications between individuals can be represented by (weighted, multi-) graphs. Many applications operate on communication graphs associated with telephone calls, em...
179
click to vote
CLUSTER
2006
IEEE
15 years 6 months ago
2006
IEEE
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper pre...
200
click to vote
ECRTS
2010
IEEE
15 years 7 months ago
2010
IEEE
A full exploitation of the computational power available in a multi-core platform requires the software to be specified in terms of parallel execution flows. At the same time, mode...