1. Adelaide Research & Scholarship

Browsing "School of Computer Science" by Title

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 2517 to 2536 of 3138 < previous   next >
PreviewIssue DateTitleAuthor(s)
2022Run-of-mine stockyard recovery scheduling and optimisation for multiple reclaimersAssimi, H.; Koch, B.; Garcia, C.; Wagner, M.; Neumann, F.; Hong, J.; Bures, M.; Park, J.W.; Cerný, T.; ACM/SIGAPP Symposium on Applied Computing (SAC) (25 Apr 2022 - 29 Apr 2022 : virtual online)
2021Run-time monitoring of machine learning for robotic perception: a survey of emerging trendsRahman, Q.M.; Corke, P.; Dayoub, F.
2008Runtime analyses for using fairness in evolutionary multi-objective optimizationFriedrich, T.; Horoba, C.; Neumann, F.; Rudolph, G.; Jansen, T.; Lucas, S.M.; Poloni, C.; Beume, N.; Conference on Parallel Problem Solving from Nature (10th : 2008 : Dortmund, Germany)
2014Runtime analysis for maximizing population diversity in single-objective optimizationGao, W.; Neumann, F.; Igel, C.; 2014 Annual Conference on Genetic and Evolutionary Computation (GECCO'14) (12 Jul 2014 - 16 Jul 2014 : Vancouver, Canada)
2009Runtime analysis of a simple ant colony optimization algorithmNeumann, F.; Witt, C.
2019Runtime analysis of evolutionary algorithms for the depth restricted (1,2)-minimum spanning tree problemShi, F.; Neumann, F.; Wang, J.; Friedrich, T.; Doerr, C.; Arnold, D.V.; Foundations of Genetic Algorithms (FOGA) (27 Aug 2019 - 29 Aug 2019 : Potsdam, Germany)
2018Runtime analysis of evolutionary algorithms for the knapsack problem with favorably correlated weightsNeumann, F.; Sutton, A.; Auger, A.; Fonseca, C.; Lourenco, N.; Machado, P.; Paquete, L.; Whitley, D.; International Conference on Parallel Problem Solving from Nature (PPSN) (8 Sep 2018 - 12 Sep 2018 : Coimbra, Portugal)
2014Runtime analysis of evolutionary algorithms on randomly constructed high-density satisfiable 3-CNF formulasSutton, A.; Neumann, F.; BartzBeielstein, T.; Branke, J.; Filipic, B.; Smith, J.; 13th International Conference on Parallel Problem Solving from Nature (PPSN XIII) (13 Sep 2014 - 17 Sep 2014 : Ljubljana, Slovenia)
2020Runtime analysis of evolutionary algorithms with biased mutation for the multi-objective minimum spanning tree problemRoostapour, V.; Bossek, J.; Neumann, F.; Genetic and Evolutionary Computation Conference (GECCO) (8 Jul 2020 - 18 Jul 2020 : Cancun, Mexico)
2016Runtime analysis of evolutionary diversity maximization for OneMinMaxDoerr, B.; Gao, W.; Neumann, F.; Friedrich, T.; Neumann, F.; Sutton, A.M.; 2016 Genetic and Evolutionary Computation Conference (GECCO 2016) (20 Jul 2016 - 24 Jul 2016 : Denver, Colorado, USA)
2015Runtime analysis of evolutionary diversity optimization and the vertex cover problemGao, W.; Pourhassan, M.; Neumann, F.; Silva, S.; Esparcia-Alcázar, A.; Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation (GECCO Companion '15) (11 Jul 2015 - 15 Jul 2015 : Madrid, Spain)
2019Runtime analysis of evolutionary multi-objective algorithms optimising the degree and diameter of spanning treesGao, W.; Pourhassan, M.; Roostapour, V.; Neumann, F.; Deb, K.; Goodman, E.D.; Coello, C.A.C.; Klamroth, K.; Miettinen, K.; Mostaghim, S.; Reed, P.M.; 10th International Conference on Evolutionary Multi-Criterion Optimization (EMO) (10 Mar 2019 - 13 Mar 2019 : East Lansing, USA)
2019Runtime analysis of randomized search heuristics for dynamic graph coloringBossek, J.; Neumann, F.; Peng, P.; Sudholt, D.; LopezIbanez, M.; Genetic and Evolutionary Computation Conference (GECCO) (13 Jul 2019 - 17 Jul 2019 : Prague, Czech Republic)
2018Runtime analysis of randomized search heuristics for the dynamic weighted vertex cover problemShi, F.; Neumann, F.; Wang, J.; Aguirre, H.E.; Takadama, K.; Genetic and Evolutionary Computation Conference (GECCO) (15 Jul 2018 - 19 Jul 2018 : Kyoto, Japan)
2020Runtime analysis of RLS and (1+1) EA for the dynamic weighted vertex cover problemPourhassan, M.; Roostapour, V.; Neumann, F.
2022Runtime Analysis of Simple Evolutionary Algorithms for the Chance-Constrained Makespan Scheduling ProblemShi, F.; Yan, X.; Neumann, F.; Rudolph, G.; Kononova, A.V.; Aguirre, H.; Kerschke, P.; Ochoa, G.; Tusar, T.; International Conference on Parallel Problem Solving from Nature (PPSN) (10 Sep 2022 - 14 Sep 2022 : Dortmund, Germany)
2022Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear FunctionsNeumann, F.; Witt, C.; Rudolph, G.; Kononova, A.V.; Aguirre, H.; Kerschke, P.; Ochoa, G.; Tusar, T.; International Conference on Parallel Problem Solving from Nature (PPSN) (10 Sep 2022 - 14 Sep 2022 : Dortmund, Germany)
2019Runtime analysis of the (1+1) evolutionary algorithm for the chance-constrained knapsack problemNeumann, F.; Sutton, A.M.; Friedrich, T.; Doerr, C.; Arnold, D.V.; Foundations of Genetic Algorithms (FOGA) (27 Aug 2019 - 29 Aug 2019 : Potsdam, Germany)
2011Runtime analysis of the 1-ANT ant colony optimizerDoerr, B.; Neumann, F.; Sudholt, D.; Witt, C.
2007RWA of hypercube communications embedded on a family of optical double-loop networksChen, Y.; Shen, H.; John Asenstorfer,; IEEE International Conference on Networks (15th : 2007 : Adelaide, Australia)
Showing results 2517 to 2536 of 3138 < previous   next >