4586 search results - page 164 / 918 » Computing stable models in parallel |
123
Voted
SPAA
1996
ACM
15 years 7 months ago
1996
ACM
A quantitative comparison of the BSP and LogP models of parallel computation is developed. We concentrate on a variant of LogP that disallows the so-called stalling behavior, alth...
149
Voted
SC
2009
ACM
15 years 10 months ago
2009
ACM
One of the main advantages of using a scientific workflow management system (SWfMS) to orchestrate data flows among scientific activities is to control and register the whole work...
128
Voted
CSR
2008
Springer
15 years 5 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
105
Voted
ISPA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. A loop with irregular assignment computations contains loopcarried output data dependences that can only be detected at run-time. In this paper, a load-balanced method ba...
114
Voted
INTERSPEECH
2010
14 years 10 months ago
2010
The emergence of highly parallel computing platforms is enabling new trade-offs in algorithm design for automatic speech recognition. It naturally motivates the following investig...