2474 search results - page 247 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
184
click to vote
CPM
2000
Springer
15 years 11 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
228
click to vote
ICALP
2005
Springer
16 years 18 hour ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
197
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—The article describes a course on system design (structural approach) which involves the following: issues of systems engineering; structural models; basic technological problem...
192
click to vote
KES
1999
Springer
15 years 10 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
158
click to vote
EGC
2005
Springer
16 years 1 days ago
2005
Springer
Genetic algorithms (GAs) are stochastic search methods that have been successfully applied in many search, optimization, and machine learning problems. Their parallel counterpart (...