default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWayne J. Pullan
Person information
- affiliation: Griffith University, Gold Coast, QLD, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j20]Dylan Matthew Janssen, Wayne Pullan, Alan Wee-Chung Liew
:
Evolutionary Computation Visualization: ECvis. IEEE Access 11: 16474-16482 (2023)- 2022
- [j19]Dylan Matthew Janssen, Wayne Pullan, Alan Wee-Chung Liew:
Graphics processing unit acceleration of the island model genetic algorithm using the CUDA programming platform. Concurr. Comput. Pract. Exp. 34(2) (2022) - 2021
- [j18]Wayne Pullan:
Local search for the maximum k-plex problem. J. Heuristics 27(3): 303-324 (2021) - 2017
- [j17]Peter Brown, Yuedong Yang, Yaoqi Zhou, Wayne J. Pullan:
A heuristic for the time constrained asymmetric linear sum assignment problem. J. Comb. Optim. 33(2): 551-566 (2017) - 2016
- [j16]Peter Brown, Wayne Pullan, Yuedong Yang, Yaoqi Zhou:
Fast and accurate non-sequential protein structure alignment using a new asymmetric linear sum assignment heuristic. Bioinform. 32(3): 370-377 (2016) - [j15]Wayne J. Pullan, Xin-Wen Wu, Zihui Liu:
Construction of optimal constant-dimension subspace codes. J. Comb. Optim. 31(4): 1709-1719 (2016) - 2015
- [j14]Wayne J. Pullan:
Heuristic identification of critical nodes in sparse real-world graphs. J. Heuristics 21(5): 577-598 (2015) - 2011
- [j13]Wayne Pullan, Franco Mascia, Mauro Brunato:
Cooperating local search for the maximum clique problem. J. Heuristics 17(2): 181-199 (2011) - 2009
- [j12]Wayne Pullan:
Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers. Discret. Optim. 6(2): 214-219 (2009) - 2008
- [j11]Wayne J. Pullan:
A Memetic Genetic Algorithm for the Vertex p-center Problem. Evol. Comput. 16(3): 417-436 (2008) - [j10]Wayne J. Pullan:
Approximating the maximum vertex/edge weighted clique using local search. J. Heuristics 14(2): 117-134 (2008) - [j9]Andrea Grosso, Marco Locatelli, Wayne J. Pullan:
Simple ingredients leading to very efficient heuristics for the maximum clique problem. J. Heuristics 14(6): 587-612 (2008) - 2006
- [j8]Wayne J. Pullan, Holger H. Hoos:
Dynamic Local Search for the Maximum Clique Problem. J. Artif. Intell. Res. 25: 159-185 (2006) - [j7]Wayne J. Pullan:
Phased local search for the maximum clique problem. J. Comb. Optim. 12(3): 303-323 (2006) - 2005
- [j6]Wayne J. Pullan:
An unbiased population-based search for the geometry optimization of Lennard-Jones clusters: 2 leq N leq 372. J. Comput. Chem. 26(9): 899-906 (2005) - [j5]William Baritompa, Mirjam Dür, Eligius M. T. Hendrix, Lyle Noakes, Wayne J. Pullan, Graham R. Wood:
Matching Stochastic Algorithms to Objective Function Landscapes. J. Glob. Optim. 31(4): 579-598 (2005) - 1998
- [j4]Wayne J. Pullan:
Genetic Operators for a Two-dimensional Bonded Molecular Model. Comput. Chem. 22(4): 331-338 (1998) - 1997
- [j3]Wayne J. Pullan:
Energy minimization of mixed argon-xenon microclusters using a genetic algorithm. J. Comput. Chem. 18(8): 1096-1111 (1997) - [j2]Wayne J. Pullan:
Structure Prediction of Benzene Clusters Using a Genetic Algorithm. J. Chem. Inf. Comput. Sci. 37(6): 1189-1193 (1997) - 1996
- [j1]Wayne J. Pullan:
A Direct Search Method Applied to a Molecular Structure Problem. Aust. Comput. J. 28(4): 113-120 (1996)
Conference and Workshop Papers
- 2020
- [c12]Glen Cancian, Wayne J. Pullan:
Impact of additional hardware resources on a parallel genetic algorithm. GECCO Companion 2020: 209-210 - 2011
- [c11]Lukas Folkman, Wayne Pullan, Bela Stantic:
Generic Parallel Genetic Algorithm Framework for Protein Optimisation. ICA3PP (2) 2011: 64-73 - 2010
- [c10]Wayne Pullan:
Unbiased geometry optimisation of Morse atomic clusters. IEEE Congress on Evolutionary Computation 2010: 1-7 - 2009
- [c9]Wayne J. Pullan:
A population based hybrid meta-heuristic for the uncapacitated facility location problem. GEC Summit 2009: 475-482 - 2008
- [c8]Wayne J. Pullan:
A population based hybrid metaheuristic for the p-median problem. IEEE Congress on Evolutionary Computation 2008: 75-82 - 2007
- [c7]Wayne J. Pullan:
Protein Structure Alignment Using Maximum Cliques and Local Search. Australian Conference on Artificial Intelligence 2007: 776-780 - 2004
- [c6]Wayne J. Pullan, Liang Zhao:
Resolvent Clause Weighting Local Search. Canadian AI 2004: 233-247 - 2003
- [c5]Wayne J. Pullan, Liang Zhao, John Thornton:
Estimating Problem Metrics for SAT Clause Weighting Local Search. Australian Conference on Artificial Intelligence 2003: 137-149 - [c4]Wayne Pullan:
Adapting the genetic algorithm to the travelling salesman problem. IEEE Congress on Evolutionary Computation 2003: 1029-1035 - 2002
- [c3]John Thornton, Wayne J. Pullan, Justin Terry:
Towards Fewer Parameters for SAT Clause Weighting Algorithms. Australian Joint Conference on Artificial Intelligence 2002: 569-578 - [c2]Olena Kravchuk, Wayne J. Pullan, John Thornton, Abdul Sattar:
An Investigation of Variable Relationships in 3-SAT Problems. Australian Joint Conference on Artificial Intelligence 2002: 579-590 - [c1]Wayne Pullan:
Optimising multiple aspects of network survivability. IEEE Congress on Evolutionary Computation 2002: 115-120
Informal and Other Publications
- 2024
- [i2]Dylan Matthew Janssen, Wayne Pullan, Alan Wee-Chung Liew:
GPU Based Differential Evolution: New Insights and Comparative Study. CoRR abs/2405.16551 (2024) - 2011
- [i1]Holger H. Hoos, Wayne J. Pullan:
Dynamic Local Search for the Maximum Clique Problem. CoRR abs/1109.5717 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
