91 search results - page 10 / 19 » A dynamic inequality generation scheme for polynomial progra... |
IWMM
2004
Springer
15 years 3 months ago
2004
Springer
We document the design and implementation of a “production” incremental garbage collector for GHC 6.2. It builds on our earlier work (Non-stop Haskell) that exploited GHC’s ...
107
click to vote
PKDD
2010
Springer
14 years 7 months ago
2010
Springer
As an alternative to vector representations, a recent trend in image classification suggests to integrate additional structural information in the description of images in order to...
122
click to vote
HPDC
1996
IEEE
15 years 1 months ago
1996
IEEE
Load balancing involves assigning to each processor, work proportional to its performance, minimizing the execution time of the program. Althoughstatic load balancing can solve ma...
RECOMB
1997
Springer
15 years 1 months ago
1997
Springer
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
78
Voted
LCPC
2000
Springer
15 years 1 months ago
2000
Springer
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...