9842 search results - page 1381 / 1969 » The Complexity of the Matching-Cut Problem |
199
click to vote
EUROPAR
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Algorithmic skeletons correspond to a high-level programming model that takes advantage of nestable programming patterns to hide the complexity of parallel/distributed ap...
188
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
One of the most controversial yet enduring hypotheses about what genetic algorithms (GAs) are good for concerns the idea that GAs process building-blocks. More specifically, it ha...
238
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
One of the most critical issues that remains to be fully addressed in existing multimodal evolutionary algorithms is the difficulty in pre-specifying parameters used for estimatin...
207
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
183
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Genetic Programming (GP) is an automated computational programming methodology, inspired by the workings of natural evolution techniques. It has been applied to solve complex prob...