2474 search results - page 129 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
147
click to vote
EUROPAR
2004
Springer
15 years 10 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
131
click to vote
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
148
click to vote
ISPDC
2007
IEEE
15 years 11 months ago
2007
IEEE
Mixed-parallel applications can take advantage of largescale computing platforms but scheduling them efficiently on such platforms is challenging. In this paper we compare the tw...
112
Voted
IFIP
1994
Springer
15 years 9 months ago
1994
Springer
The aim of this discussion paper is to stimulate (or perhaps to provoke) stronger interactions among theoreticians and practitioners interested in efficient problem solutions. We ...
150
Voted
ENDM
2010
15 years 5 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...