Wayne J. Pullan

Orcid: 0000-0001-7413-4077

Affiliations:
  • Griffith University, Gold Coast, QLD, Australia


According to our database1, Wayne J. Pullan authored at least 32 papers between 1996 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Evolutionary Computation Visualization: ECvis.
IEEE Access, 2023

2022
Graphics processing unit acceleration of the island model genetic algorithm using the CUDA programming platform.
Concurr. Comput. Pract. Exp., 2022

2021
Local search for the maximum k-plex problem.
J. Heuristics, 2021

2020
Impact of additional hardware resources on a parallel genetic algorithm.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

2017
A heuristic for the time constrained asymmetric linear sum assignment problem.
J. Comb. Optim., 2017

2016
Construction of optimal constant-dimension subspace codes.
J. Comb. Optim., 2016

Fast and accurate non-sequential protein structure alignment using a new asymmetric linear sum assignment heuristic.
Bioinform., 2016

2015
Heuristic identification of critical nodes in sparse real-world graphs.
J. Heuristics, 2015

2011
Cooperating local search for the maximum clique problem.
J. Heuristics, 2011

Generic Parallel Genetic Algorithm Framework for Protein Optimisation.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2011

2010
Unbiased geometry optimisation of Morse atomic clusters.
Proceedings of the IEEE Congress on Evolutionary Computation, 2010

2009
Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers.
Discret. Optim., 2009

A population based hybrid meta-heuristic for the uncapacitated facility location problem.
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, 2009

2008
Approximating the maximum vertex/edge weighted clique using local search.
J. Heuristics, 2008

Simple ingredients leading to very efficient heuristics for the maximum clique problem.
J. Heuristics, 2008

A Memetic Genetic Algorithm for the Vertex <i>p</i>-center Problem.
Evol. Comput., 2008

A population based hybrid metaheuristic for the p-median problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2008

2007
Protein Structure Alignment Using Maximum Cliques and Local Search.
Proceedings of the AI 2007: Advances in Artificial Intelligence, 2007

2006
Phased local search for the maximum clique problem.
J. Comb. Optim., 2006

Dynamic Local Search for the Maximum Clique Problem.
J. Artif. Intell. Res., 2006

2005
Matching Stochastic Algorithms to Objective Function Landscapes.
J. Glob. Optim., 2005

An unbiased population-based search for the geometry optimization of Lennard-Jones clusters: 2 leq N leq 372.
J. Comput. Chem., 2005

2004
Resolvent Clause Weighting Local Search.
Proceedings of the Advances in Artificial Intelligence, 2004

2003
Adapting the genetic algorithm to the travelling salesman problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2003

Estimating Problem Metrics for SAT Clause Weighting Local Search.
Proceedings of the AI 2003: Advances in Artificial Intelligence, 2003

2002
Optimising multiple aspects of network survivability.
Proceedings of the 2002 Congress on Evolutionary Computation, 2002

Towards Fewer Parameters for SAT Clause Weighting Algorithms.
Proceedings of the AI 2002: Advances in Artificial Intelligence, 2002

An Investigation of Variable Relationships in 3-SAT Problems.
Proceedings of the AI 2002: Advances in Artificial Intelligence, 2002

1998
Genetic Operators for a Two-dimensional Bonded Molecular Model.
Comput. Chem., 1998

1997
Structure Prediction of Benzene Clusters Using a Genetic Algorithm.
J. Chem. Inf. Comput. Sci., 1997

Energy minimization of mixed argon-xenon microclusters using a genetic algorithm.
J. Comput. Chem., 1997

1996
A Direct Search Method Applied to a Molecular Structure Problem.
Aust. Comput. J., 1996


  Loading...