448 search results - page 25 / 90 » Dynamic Algorithms for the Dyck Languages |
EGH
2005
Springer
15 years 3 months ago
2005
Springer
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
INLG
2010
Springer
14 years 7 months ago
2010
Springer
In this paper we present a reference generation model based on Reference Domain Theory which gives a dynamic account of reference. This reference model assumes that each referring...
POPL
1998
ACM
15 years 1 months ago
1998
ACM
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
108
click to vote
PPOPP
1991
ACM
15 years 1 months ago
1991
ACM
This paper presents Jade, a language which allows a programmer to easily express dynamic coarse-grain parallelism. Starting with a sequential program, a programmer augments those ...
SFP
2000
14 years 11 months ago
2000
: We describe an algorithm approximatingthe following question: Given two types t1 and t2, are there instances (t1) and (t2) denoting a common element? By answering this question w...