334 search results - page 15 / 67 » A New Parallel Algorithm for Generalized LR Parsing |
86
Voted
PPDP
2005
Springer
15 years 5 months ago
2005
Springer
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
103
click to vote
CLUSTER
2003
IEEE
15 years 5 months ago
2003
IEEE
— The efforts to construct a national scale Grid computing environment have brought unprecedented computing capacity and complicacy. Exploiting this complex infrastructure requir...
91
Voted
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
118
click to vote
PLDI
2012
ACM
13 years 2 months ago
2012
ACM
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...
100
Voted
EGC
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we propose a new approach for scheduling data parallel applications on the Grid using irregular array distributions. We implement the scheduler as a new case study fo...