Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Daniel P. Kennedy
Yuyuan Chang
Barbara Aquilani
Dae-Jin Jung
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Lindsay MacDonald
Chen Ma
Home
/
Author
/
FRANK NEUMANN
Author Info
Open Visualization
Name
Affiliation
Papers
FRANK NEUMANN
School of Computer Science, University of Adelaide, Adelaide, SA, Australia
21
Collaborators
Citations
PageRank
32
113
9.85
Referers
Referees
References
200
371
237
Search Limit
100
371
Publications (21 rows)
Collaborators (32 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Evolutionary computation for digital art.
0
0.34
2018
A Feature-Based Prediction Model of Algorithm Selection for Constrained Continuous Optimisation.
0
0.34
2016
Feature-based algorithm selection for constrained continuous optimisation.
1
0.34
2016
Optimising Spatial and Tonal Data for PDE-based Inpainting
1
0.35
2015
A Feature-Based Analysis on the Impact of Set of Constraints for \varepsilon -Constrained Differential Evolution.
0
0.34
2015
A Feature-based analysis on the impact of linear constraints for ε-constrained differential evolution
0
0.34
2014
Computational Intelligence for Software Engineering (NII Shonan Meeting 2014-13).
0
0.34
2014
Ant colony optimisation and the traveling salesperson problem: hardness, features and parameter settings
2
0.38
2013
A feature-based comparison of local search and the christofides algorithm for the travelling salesperson problem
12
0.61
2013
Experimental supplements to the computational complexity analysis of genetic programming for problems modelling isolated program semantics
5
0.46
2012
An Adaptive Data Structure For Evolutionary Multi-Objective Algorithms With Unbounded Archives
1
0.35
2012
Parsimony pressure versus multi-objective optimization for variable length representations
7
0.51
2012
A parameterized runtime analysis of simple evolutionary algorithms for makespan scheduling
13
0.62
2012
Local search and the traveling salesman problem: a feature-based characterization of problem hardness
10
0.62
2012
A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem
16
0.75
2012
Approximation-guided evolutionary multi-objective optimization
34
1.12
2011
PAC learning and genetic programming
6
0.49
2011
Computational complexity and evolutionary computation
1
0.37
2011
Foundations of evolutionary multi-objective optimization
0
0.34
2011
Computational Complexity Results for Genetic Programming and the Sorting Problem
0
0.34
2011
Evolving Pacing Strategies for Team Pursuit Track Cycling
4
0.51
2011
1