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.

Browse
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): 61 to 80 of 249
Issue DateTitleAuthor(s)
2006-01-19T15:33:23ZSimulated Annealing Beats Metropolis in Combinatorial OptimizationWegener, Ingo
2006-01-19T15:33:10ZConstraint Programming versus LogikKöpcke, Hanna; Schröder, Andreas
2006-01-19T15:32:51ZA Predator-Prey Approach for Pareto-OptimizationMehnen, Jörn; Michelitsch, Thomas; Schmitt, Karlheinz
2006-01-19T15:32:38ZKEA - a software package for development, analysis and application of multiple objective evolutionary algorithmsBartz-Beielstein, Thomas; Mehnen, J.; Naujoks, B.; Schmitt, K.; Zibold, D.
2006-01-19T15:32:20ZRuntime Analysis of the (1+1) ES Minimizing Simple Quadratic Forms Using the 1/5-RuleJägersküpper, Jens
2006-01-19T15:32:06ZUsing Gene Duplication and Gene Deletion in Evolution StrategiesSchmitt, Karlheinz
2006-01-19T15:31:50ZMultikriterielle evolutionäre Aufstellungsoptimierung von Chemie-Anlagen unter Beachtung gewichteter DesignregelnGeisbe, Thorsten; Mierswa, Ingo
2006-01-19T15:31:34ZpMOHypEA: Parallel Evolutionary Multiobjective Optimization using HypergraphsKohlen, Torsten; Mehnen, Jörn; Michelitsch, Thomas; Schmitt, Karlheinz
2006-01-19T15:31:22ZScheduling Algorithm Development based on Complex Owner Defined ObjectivesBeume, Nicola; Emmerich, Michael; Ernemann, Carsten; Schönemann, Lutz; Schwiegelshohn, Uwe
2006-01-19T15:31:09ZUser Group-based Workload Analysis and ModellingErnemann, Carsten; Song, Baiyi; Yahyapour, Ramin
2006-01-19T15:30:54ZMinimum Spanning Trees Made Easier Via Multi-Objective OptimizationNeumann, Frank; Wegener, Ingo
2006-01-19T15:30:39ZOn the Impact of Objective Function Transformations on Evolutionary and Black-Box AlgorithmsStorch, Tobias
2006-01-19T15:30:23ZEfficient Case Based Feature Construction for Heterogeneous Learning TasksMierswa, Ingo; Wurst, Michael
2006-01-19T15:30:08ZDesign and Analysis of an Asymmetric Mutation OperatorJansen, Thomas; Sudholt, Dirk
2006-01-19T15:29:55ZCrossover is Provably Essential for the Ising Model on TreesSudholt, Dirk
2006-01-19T15:29:40ZRuntime Analysis of a (μ +1) ES for the Sphere FunctionJägersküpper, Jens; Witt, Carsten
2006-01-19T15:29:23ZOn the Complexity of Overcoming Gaps When Using Elitist Selection and Isotropic MutationsJägersküpper, Jens
2006-01-19T15:29:01ZAnalysis of a simple (1+1) ES for the Class of Positive Definite Quadratic Forms with Bounded Condition NumberJägersküpper, Jens
2006-01-19T15:07:01ZRuntime Analysis of a Simple Ant Colony Optimization AlgorithmNeumann, Frank; Witt, Carsten
2004-10-21On the Choice of Offspring Population Size in Evolutionary AlgorithmsDe Jong, Kenneth A.; Jansen, Thomas; Wegener, Ingo
Collection's Items (Sorted by Submit Date in Descending order): 61 to 80 of 249