Sciweavers

7092 search results - page 139 / 1419
» Parallelizing constraint programs
Sort
View
ACL
2008
13 years 12 months ago
Soft Syntactic Constraints for Hierarchical Phrased-Based Translation
In adding syntax to statistical MT, there is a tradeoff between taking advantage of linguistic analysis, versus allowing the model to exploit linguistically unmotivated mappings l...
Yuval Marton, Philip Resnik
IPPS
1998
IEEE
14 years 2 months ago
Experiments with Program Parallelization Using Archetypes and Stepwise Refinement
Parallel programming continues to be difficult and error-prone, whether starting from specifications or from an existing sequential program. This paper presents (1) a methodology f...
Berna L. Massingill
ICPP
1991
IEEE
14 years 1 months ago
Automatic Parallel Program Generation and Optimization from Data Decompositions
Data decomposition is probably the most successful method for generating parallel programs. In this paper a general framework is described for the automatic generation of parallel...
Edwin M. R. M. Paalvast, Henk J. Sips, Arjan J. C....
IPPS
1998
IEEE
14 years 2 months ago
Predicting the Running Times of Parallel Programs by Simulation
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
Radu Rugina, Klaus E. Schauser
ISCA
2009
IEEE
137views Hardware» more  ISCA 2009»
14 years 5 months ago
A case for an interleaving constrained shared-memory multi-processor
Shared-memory multi-threaded programming is inherently more difficult than single-threaded programming. The main source of complexity is that, the threads of an application can in...
Jie Yu, Satish Narayanasamy