2474 search results - page 32 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
124
click to vote
CCGRID
2007
IEEE
15 years 8 months ago
2007
IEEE
In the past, efficient parallel algorithms have always been developed specifically for the successive generations of parallel systems (vector machines, shared-memory machines, d...
116
click to vote
STACS
2005
Springer
15 years 7 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
131
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Abstract. Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Al...
112
click to vote
PACT
1999
Springer
15 years 6 months ago
1999
Springer
We introduce a new model for objects which can move around on a cellular grid. The model consists of two phases, the movement phase and the con ict resolution phase. In the movemen...
126
click to vote
JNW
2006
15 years 1 months ago
2006
With the standardization of IEEE 802.11, there has been an explosive growth of wireless local area networks (WLAN). Recently, this cost effective technology is being developed aggr...