1830 search results - page 320 / 366 » Optimizing Sorting with Genetic Algorithms |
124
Voted
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
As the Flexible Job Shop Scheduling Problem (or FJSP) is strongly NP-hard, using an evolutionary approach to find near-optimal solutions requires effective chromosome representatio...
114
Voted
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Low diversity in a genetic algorithm (GA) can cause the search to become stagnant upon reaching a local optimum. To some extent, non-stationary tasks avoid this problem, which woul...
107
click to vote
ICTAI
2000
IEEE
15 years 7 months ago
2000
IEEE
One reason why Case-Based Reasoning (CBR) has become popular is because it reduces development cost compared to rule-based expert systems. Still, the knowledge engineering effort ...
134
click to vote
DEXAW
1999
IEEE
15 years 7 months ago
1999
IEEE
Caching is a standard solution to the problem of insufcient bandwidth caused by the rapid increase of information circulation across the Internet. Cache consistency mechanisms are...
122
Voted
CIBCB
2007
IEEE
15 years 6 months ago
2007
IEEE
-- A large and reliable DNA codeword library is the key to the success of DNA based computing. Searching for the set of reliable DNA codewords is an NP-hard problem, which can take...