4865 search results - page 600 / 973 » The Complexity of Graph Connectivity |
175
click to vote
CLUSTER
2005
IEEE
16 years 13 days ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
181
click to vote
SAC
2005
ACM
16 years 11 days ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
167
click to vote
WINE
2005
Springer
16 years 8 days ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
168
click to vote
ASPDAC
2004
ACM
16 years 7 days ago
2004
ACM
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...
148
click to vote
STACS
2004
Springer
16 years 4 days ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...