Wayne J. Pullan

According to our database, Wayne J. Pullan authored at least 33 papers between 1996 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

GPU Based Differential Evolution: New Insights and Comparative Study.

Dylan Matthew Janssen, Wayne Pullan, Alan Wee-Chung Liew

CoRR, 2024

2023

Evolutionary Computation Visualization: ECvis.

Dylan Matthew Janssen, Wayne Pullan, Alan Wee-Chung Liew

IEEE Access, 2023

2022

Graphics processing unit acceleration of the island model genetic algorithm using the CUDA programming platform.

Dylan Matthew Janssen, Wayne Pullan, Alan Wee-Chung Liew

Concurr. Comput. Pract. Exp., 2022

2021

Local search for the maximum k-plex problem.

Wayne Pullan

J. Heuristics, 2021

2020

Impact of additional hardware resources on a parallel genetic algorithm.

Glen Cancian, Wayne J. Pullan

Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

2017

A heuristic for the time constrained asymmetric linear sum assignment problem.

Peter Brown, Yuedong Yang, Yaoqi Zhou, Wayne J. Pullan

J. Comb. Optim., 2017

2016

Construction of optimal constant-dimension subspace codes.

Wayne J. Pullan, Xin-Wen Wu, Zihui Liu

J. Comb. Optim., 2016

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

Peter Brown, Wayne Pullan, Yuedong Yang, Yaoqi Zhou

Bioinform., 2016

2015

Heuristic identification of critical nodes in sparse real-world graphs.

Wayne J. Pullan

J. Heuristics, 2015

2011

Cooperating local search for the maximum clique problem.

Wayne Pullan, Franco Mascia, Mauro Brunato

J. Heuristics, 2011

Generic Parallel Genetic Algorithm Framework for Protein Optimisation.

Lukas Folkman, Wayne Pullan, Bela Stantic

Proceedings of the Algorithms and Architectures for Parallel Processing, 2011

2010

Unbiased geometry optimisation of Morse atomic clusters.

Wayne Pullan

Proceedings of the IEEE Congress on Evolutionary Computation, 2010

2009

Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers.

Wayne Pullan

Discret. Optim., 2009

A population based hybrid meta-heuristic for the uncapacitated facility location problem.

Wayne J. Pullan

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, 2009

2008

Approximating the maximum vertex/edge weighted clique using local search.

Wayne J. Pullan

J. Heuristics, 2008

Simple ingredients leading to very efficient heuristics for the maximum clique problem.

Andrea Grosso, Marco Locatelli, Wayne J. Pullan

J. Heuristics, 2008

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

Wayne J. Pullan

Evol. Comput., 2008

A population based hybrid metaheuristic for the p-median problem.

Wayne J. Pullan

Proceedings of the IEEE Congress on Evolutionary Computation, 2008

2007

Protein Structure Alignment Using Maximum Cliques and Local Search.

Wayne J. Pullan

Proceedings of the AI 2007: Advances in Artificial Intelligence, 2007

2006

Phased local search for the maximum clique problem.

Wayne J. Pullan

J. Comb. Optim., 2006

Dynamic Local Search for the Maximum Clique Problem.

Wayne J. Pullan, Holger H. Hoos

J. Artif. Intell. Res., 2006

2005

Matching Stochastic Algorithms to Objective Function Landscapes.

William Baritompa, Mirjam Dür, Eligius M. T. Hendrix, Lyle Noakes, Wayne J. Pullan, Graham R. Wood

J. Glob. Optim., 2005

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

Wayne J. Pullan

J. Comput. Chem., 2005

2004

Resolvent Clause Weighting Local Search.

Wayne J. Pullan, Liang Zhao

Proceedings of the Advances in Artificial Intelligence, 2004

2003

Adapting the genetic algorithm to the travelling salesman problem.

Wayne Pullan

Proceedings of the IEEE Congress on Evolutionary Computation, 2003

Estimating Problem Metrics for SAT Clause Weighting Local Search.

Wayne J. Pullan, Liang Zhao, John Thornton

Proceedings of the AI 2003: Advances in Artificial Intelligence, 2003

2002

Optimising multiple aspects of network survivability.

Wayne Pullan

Proceedings of the 2002 Congress on Evolutionary Computation, 2002

Towards Fewer Parameters for SAT Clause Weighting Algorithms.

John Thornton, Wayne J. Pullan, Justin Terry

Proceedings of the AI 2002: Advances in Artificial Intelligence, 2002

An Investigation of Variable Relationships in 3-SAT Problems.

Olena Kravchuk, Wayne J. Pullan, John Thornton, Abdul Sattar

Proceedings of the AI 2002: Advances in Artificial Intelligence, 2002

1998

Genetic Operators for a Two-dimensional Bonded Molecular Model.

Wayne J. Pullan

Comput. Chem., 1998

1997

Structure Prediction of Benzene Clusters Using a Genetic Algorithm.

Wayne J. Pullan

J. Chem. Inf. Comput. Sci., 1997

Energy minimization of mixed argon-xenon microclusters using a genetic algorithm.

Wayne J. Pullan

J. Comput. Chem., 1997

1996

A Direct Search Method Applied to a Molecular Structure Problem.

Wayne J. Pullan

Aust. Comput. J., 1996