Sonderforschungsbereich (SFB) 531 : [249]

The field of Computational Intelligence (CI) covers all sorts of techniques for subsymbolic (numerical) knowledge processing, such as the well known Fuzzy Logic (FL), Neural Networks (NN), and Evolutionary Algorithms (EA) as well as other approaches with lesser dissemination. Although CI techniques are widely in use, there still exists a large gap between theory and application. To close this gap the Collaborative Research Center (SFB) 531 has been founded at the University of Dortmund in 1997 as an interdisciplinary research institute. It is financially supported by the Deutsche Forschungsgemeinschaft (DFG). The scientific goals of the SFB are the investigation and improvement of the foundations, applications, as well as combinations of CI methods.

Subscribe to this collection to receive daily e-mail notification of new additions RSS Feed RSS Feed RSS Feed
Collection's Items (Sorted by Submit Date in Descending order): 1 to 20 of 249
Issue DateTitleAuthor(s)
2009-06-02T07:25:55ZCapabilities of EMOA to detect and preserve equivalent Pareto subsetsNaujoks, Boris; Preuss, Mike; Rudolph, Günter
2008Fast distance computation between cylinders for the design of mold temperature control systemsBiermann, Dirk; Joliet, Raffael; Michelitsch, Thomas
2008-12Analysis of a simple evolutionary algorithm for the multiobjective shortest path problemHoroba, Christian
2008-12Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithmsHoroba, Christian; Neumann, Frank
2008-12SPOT Sequential Parameter Optimization ToolboxBartz-Beielstein, Thomas; Lasarczyk, Christian; Preuß, Mike
2008-12Intelligent group movement and selection in realtime strategy gamesBeume, Nicola; Danielsiek, Holger; Hein, Tobias; Naujoks, Boris; Piatkowski, Nico; Preuss, Mike; Stüer, Raphael; Thom, Andreas; Wessing, Simon
2008-12Analysis of a memetic algorithm for global optimization in chemical process synthesisEngell, Sebastian; Sand, Guido; Urselmann, Maren
2008-08On the size of weights in randomized search heuristicsReichel, Joachim; Skutella, Martin
2008-08PG511 - CI in GamesDanielsiek, Holger; Eichhorn, Christian; Hein, Tobias; Kurtić, Edina; Neugebauer, Georg; Piatkowski, Nico; Quadflieg, Jan; Schnelker, Sebastian; Stüer, Raphael; Thom, Andreas; Wessing, Simon
2008-07Runtime analyses for using fairness in evolutionary multi-objective optimizationFriedrich, Tobias; Horoba, Christian; Neumann, Frank
2008-06A mix of Markov-chain and drift analysisJägersküpper, Jens
2008-06Approximating minimum multicuts by evolutionary multi-objective algorithmsNeumann, Frank; Reichel, Joachim
2008-05Benefits and drawbacks for the use of e-dominance in evolutionary multi-objective optimizationHoroba, Christian; Neumann, Frank
2008-04Simplified drift analysis for proving lower bounds in evolutionary computationOliveto, Pietro S.; Witt, Carsten
2008-04A hybrid Markov chain modeling architecture for workload on parallel computersKrampe, Anne; Lepping, Joachim; Sieben, Wiebke
2008-04An empirical investigation of simplified step-size adapatation in evolution strategies with a view to theoryJägersküpper, Jens; Preuss, Mike
2008-04Self-stablizing cuts in synchronous networksSauerwald, Thomas; Sudholt, Dirk
2008-03Rigorous analyses for the combination of ant colony optimization and local searchNeumann, Frank; Sudholt, Dirk; Witt, Carsten
2008-02Computing minimum cuts by randomized search heuristicsNeumann, Frank; Reichel, Joachim; Skutella, Martin
2008-02Runtime analysis of binary PSOSudholt, Dirk; Witt, Carsten
Collection's Items (Sorted by Submit Date in Descending order): 1 to 20 of 249