Sciweavers

399 search results - page 1 / 80
» Parallel evolutionary algorithms can achieve super-linear pe...
Sort
View
ISCI
1998
193views more  ISCI 1998»
13 years 4 months ago
A Parallel Implementation of Genetic Programming that Achieves Super-Linear Performance
: This paper describes the successful parallel implementation of genetic programming on a network of processing nodes using the transputer architecture. With this approach, researc...
David Andre, John R. Koza
IPL
2002
65views more  IPL 2002»
13 years 4 months ago
Parallel evolutionary algorithms can achieve super-linear performance
One of the main reasons for using parallel evolutionary algorithms (PEAs) is to obtain efficient algorithms with an execution time much lower than that of their sequential counter...
Enrique Alba
CP
2009
Springer
14 years 5 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
ICPADS
2005
IEEE
13 years 10 months ago
Exploiting Multi-level Parallelism for Homology Search using General Purpose Processors
New biological experimental techniques are continuing to generate large amounts of data using DNA, RNA, human genome and protein sequences. The quantity and quality of data from t...
Xiandong Meng, Vipin Chaudhary
ICPP
2006
IEEE
13 years 11 months ago
A Framework to Achieve Guaranteed QoS for Applications and High System Performance in Multi-Institutional Grid Computing
Providing QoS guarantees to the applications in a multi-institutional Grid is a challenging task. Although advance reservations (ARs) can provide QoS guarantees for the applicatio...
Umar Farooq, Shikharesh Majumdar, Eric W. Parsons