3379 search results - page 319 / 676 » Parallel cross-entropy optimization |
129
Voted
PDPTA
2003
15 years 5 months ago
2003
In this paper, we present three parallel flexible approximate string matching methods on a parallel architecture with heterogeneous workstations to gain supercomputer power at lo...
154
click to vote
SOSP
1989
ACM
15 years 4 months ago
1989
ACM
Shared-memory multiprocessors are frequently used in a timesharing style with multiple parallel applications executing at the same time. In such an environment, where the machine ...
128
Voted
SIAMDM
2002
15 years 3 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
122
click to vote
ICAC
2009
IEEE
15 years 10 months ago
2009
IEEE
We apply the concept of “games with a purpose” to NPcomplete mapping and scheduling problems in distributed systems and report our experiences. The particular context is a sch...
124
click to vote
IISWC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Dynamic runtimes can simplify parallel programming by automatically managing concurrency and locality without further burdening the programmer. Nevertheless, implementin...