1310 search results - page 29 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
EUROGP
2007
Springer
14 years 2 months ago
2007
Springer
The ability of Genetic Programming to scale to problems of increasing difficulty operates on the premise that it is possible to capture regularities that exist in a problem environ...
SAC
1997
ACM
14 years 27 days ago
1997
ACM
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Visualization of multidimensional data by means of Multidimensional Scaling (MDS) is a popular technique of exploratory data analysis widely usable, e.g. in analysis of bio-medica...
PDPTA
1996
13 years 10 months ago
1996
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The observation and modeling of natural Complex Systems (CSs) like the human nervous system, the evolution or the weather, allows the definition of special abilities and models re...