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): 21 to 40 of 249
Issue DateTitleAuthor(s)
2008-01Tight bounds for blind search on the integersDietzfelbinger, Martin; Rowe, Jonathan E.; Wegener, Ingo; Woelfel, Philipp
2008-01Coevolution for classificationDumitrescu, D.; Preuss, Mike; Stoean, Catalin; Stoean, Ruxandra
2008-01Memetic algorithms with variable-depth search to overcome local optimaSudholt, Dirk
2008-01Theoretical analysis of diversity mechanisms for global explorationFriedrich, Tobias; Oliveto, Pietro S.; Sudholt, Dirk; Witt, Carsten
2007-12PG511 - CI in GamesDanielsiek, Holger; Eichhorn, Christian; Hein, Tobias; Kurtić, Edina; Neugebauer, Georg; Piatkowski, Nico; Puchowezki,Michael; Quadflieg, Jan; Schnelker, Sebastian; Stüer, Raphael; Thom, Andreas; Wessing, Simon
2007-12On the complexity of computing the hypervolume indicatorBeume, Nicola; Fonseca, Carlos M.; López-Ibáñez, Manuel; Paquete, Luís; Vahrenhold, Jan
2007-11Design and analysis of an asymmetric mutation operatorJansen, Thomas; Sudholt, Dirk
2007-07General lower bounds for randomized direct search with isotropic samplingJägersküpper, Jens
2007-06Gradient-based/evolutionary relay hybrid for computing Pareto front approximations maximizing the S-metricBeume, Nicola; Deutz, André; Emmerich, Michael
2007-06On improving approximate solutions by evolutionary algorithmsFriedrich, Tobias; Hebbinghaus, Nils; He, Jun; Neumann, Frank; Witt, Carsten
2007-05Comparing variants of MMAS ACO algorithms on pseudo-boolean functionsNeumann, Frank; Sudholt, Dirk; Witt, Carsten
2007-04Lower bounds for hit-and-run optimizationJägersküpper, Jens
2007-04A framework of quantum-inspired multi-objective evolutionary algorithms and its convergence propertiesLi, Zhiyong; Rudolph, Günter
2007-02Time-optimal large view visual servoing with dynamic sets of SIFTHoffmann, Frank; Kahn, Umar; Krettek, Johannes; Nierobisch, Thomas
2007-02Weighted moments of SIFT-features for decoupled visual servoing in 6DOFHoffmann, Frank; Kahn, Umar; Krettek, Johannes; Nierobisch, Thomas
2007-02Evolutionary algorithms and matroid optimization problemsReichel, Joachim; Skutella, Martin
2007-02Approximating covering problems by randomized search heuristics using multi-objective modelsFriedrich, Tobias; Hebbinghaus, Nils; He, Jun; Neumann, Frank; Witt, Carsten
2007-01On the influence of pheromone updates in ACO algorithmsDoerr, Benjamin; Neumann, Frank; Sudholt, Dirk; Witt, Carsten
2007-01ICSPEAKersting, Petra; Mehnen, Jörn; Rudolph, Günter; Tipura, Igor; Wagner, Tobias
2007-01Reporting on experiments in evolutionary computationPreuss, Mike
Collection's Items (Sorted by Submit Date in Descending order): 21 to 40 of 249