2474 search results - page 85 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
111
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
This paper empirically investigates parallel competent genetic algorithms (cGAs) [4]. cGAs, such as BOA [21], LINCGA [15], D5 -GA [28], can solve GA-difficult problems by automati...
117
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor architectures to multicore designs. Continued perform...
100
Voted
INFORMS
2008
15 years 2 months ago
2008
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
119
click to vote
NA
2010
15 years 1 months ago
2010
In the past decade or so, semi-definite programming (SDP) has emerged as a powerful tool capable of handling a remarkably wide range of problems. This article describes an innovat...
111
click to vote
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
In order for parallel logic programming systems to become popular, they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programm...