2300 search results - page 209 / 460 » Maximally Concurrent Programs |
164
click to vote
CASCON
1997
15 years 7 months ago
1997
This paper describes the implementation of a reliable Get-Put interface written for a distributed memory environment. The asynchronous semantics of the Put as well as the split tr...
183
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
This paper describes the development of an evolutionary algorithm called Multipopulation Cooperative Coevolutionary Programming (MCCP) that extends Genetic Programming (GP) to sea...
174
click to vote
MEMOCODE
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
212
click to vote
FP
1992
15 years 10 months ago
1992
The interface with the outside world has always been one of the weakest points of functional languages. It is not easy to incorporate I/O without being allowed to do side-effects....
182
click to vote
SC
1995
ACM
15 years 10 months ago
1995
ACM
Given the large communication overheads characteristic of modern parallel machines, optimizations that eliminate, hide or parallelize communication may improve the performance of ...