1830 search results - page 129 / 366 » Workshop on Graph Computation Models |
157
Voted
SOSP
2009
ACM
16 years 1 months ago
2009
ACM
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
133
click to vote
IJCAI
2001
15 years 6 months ago
2001
The progressive processing model allows a system to trade off resource consumption against the quality of the outcome by mapping each activity to a graph of potential solution met...
147
click to vote
ENDM
2010
15 years 4 months ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
128
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
145
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
Scientific workflows are increasingly used for rapid integration of existing algorithms to form larger and more comgrams. Such workflows promise to provide more abstract, yet execu...