6105 search results - page 101 / 1221 » A Parallel Algorithm for Bound-Smoothing |
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
145
click to vote
HPDC
1994
IEEE
15 years 5 months ago
1994
IEEE
Finding genes unequivocally in DNA sequences is one of the key goals of the Human Genome project. The human genome is a 9 billion character long DNA sequence and is estimated to c...
149
click to vote
SPAA
1997
ACM
15 years 5 months ago
1997
ACM
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
120
click to vote
ISPAN
2002
IEEE
15 years 6 months ago
2002
IEEE
One problem of propagating the globally fittest individual via neighbourhood evolving in both island model and cellular model of existing parallel genetic algorithms (PGA) is that...
109
click to vote
IPPS
2009
IEEE
15 years 8 months ago
2009
IEEE
This paper proposes a new Evolutionary Algorithm for the Dynamic Resource Constrained Project Scheduling Problem. This algorithm has new features that get around some problems lik...