399 search results - page 46 / 80 » Parallel evolutionary algorithms can achieve super-linear pe... |
188
click to vote
CCGRID
2008
IEEE
15 years 8 months ago
2008
IEEE
This paper examines the job exchange between parallel compute sites in a decentralized Grid scenario. Here, the local scheduling system remains untouched and continues normal oper...
168
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...
169
click to vote
GECCO
2009
Springer
16 years 14 days ago
2009
Springer
The need for a stopping criterion in MOEA’s is a repeatedly mentioned matter in the domain of MOOP’s, even though it is usually left aside as secondary, while stopping criteri...
179
click to vote
ALGORITHMICA
2002
15 years 5 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
157
click to vote
IWCC
1999
IEEE
15 years 10 months ago
1999
IEEE
In this paper, we present techniques and algorithms to improve the performance of various communication patterns on message-passing platforms where, for reasons of safety, user-le...