214 search results - page 8 / 43 » The node capacitated graph partitioning problem: A computati... |
245
click to vote
SPAA
2012
ACM
13 years 6 months ago
2012
ACM
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
126
click to vote
SBACPAD
2003
IEEE
15 years 9 months ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
150
click to vote
ENDM
2010
15 years 4 months ago
2010
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
114
click to vote
LPAR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
157
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...