2609 search results - page 204 / 522 » Optimizing for parallelism and data locality |
168
click to vote
CLOUD
2010
ACM
15 years 11 months ago
2010
ACM
Timely and cost-effective processing of large datasets has become a critical ingredient for the success of many academic, government, and industrial organizations. The combination...
159
click to vote
ICDCS
2002
IEEE
15 years 11 months ago
2002
IEEE
For many Internet applications, the ability to protect the identity of participants in a distributed applications is critical. For such applications, a number of anonymous communi...
154
click to vote
IISWC
2009
IEEE
16 years 22 days ago
2009
IEEE
Abstract—Dynamic runtimes can simplify parallel programming by automatically managing concurrency and locality without further burdening the programmer. Nevertheless, implementin...
136
Voted
PPSN
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. In order to escape from local optima, it is standard practice to periodically restart a genetic algorithm according to some restart criteria/policy. This paper addresses ...
160
Voted
PPSN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...