8125 search results - page 1452 / 1625 » Parallelism and evolutionary algorithms |
141
click to vote
IWMM
1992
Springer
15 years 8 months ago
1992
Springer
Abstract. Automatic storage management is important in highly parallel programming environments where large numbers of objects and processes are being constantly created and discar...
130
click to vote
COCO
1989
Springer
15 years 8 months ago
1989
Springer
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
110
click to vote
CASES
2007
ACM
15 years 8 months ago
2007
ACM
This paper tackles the problem of providing correct information about program variable values in a software-pipelined loop through a non-transparent debugging approach. Since mode...
148
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
151
click to vote
ISMIR
2000
Springer
15 years 7 months ago
2000
Springer
We present an efficient prototype for music information retrieval. The prototype uses bitparallel algorithms for locating transposition invariant matches of monophonic query melod...