95 Publications (Page 2 of 4)
2020
The automated design of local optimizers for memetic algorithms employing supportive coevolution
Kamrath, N.R.⋅Pope, A.S. and Tauritz, D.R.
(pp. 1889-1897)
2019
Automated design of random dynamic graph models
Pope, A.S.⋅Tauritz, D.R. and Rawlings, C.
(pp. 1504-1512)
 
Automated design of random dynamic graph models for enterprise computer network applications
Pope, A.S.⋅Tauritz, D.R. and Rawlings, C.
(pp. 352-353)
 
Automated design of tailored link prediction heuristics for applications in enterprise network security
Pope, A.S.⋅Tauritz, D.R. and Turcotte, M.
(pp. 1634-1642)
 
Comparing terminal sets for evolving CMA-ES mean-update selection
Richter, S.N.⋅Schoen, M.G. and Tauritz, D.R.
(pp. 326-327)
 
Empirical evidence of the effectiveness of primitive granularity control for hyper-heuristics
Harter, A.⋅Tauritz, D.R.⋅Pope, A.S. and Rawlings, C.
(pp. 1478-1486)
 
Evolving bipartite authentication graph partitions
Pope, A.⋅Tauritz, D. and Kent, A.
IEEE Transactions on Dependable and Secure Computing, vol. 16, pp. 58-71. | Journal Article
 
Evolving mean-update selection methods for CMA-ES
Richter, S.N.⋅Schoen, M.G. and Tauritz, D.R.
(pp. 1513-1517)
 
Hyper-heuristics Tutorial
Tauritz, D.R. and Woodward, J.
(pp. 770-805)
 
Nested monte carlo search expression discovery for the automated design of fuzzy ART category choice functions
Illetskova, M.⋅Elnabarawy, I.⋅Da Silva, L.E.B.⋅Tauritz, D.R. and Wunsch, D.C.
(pp. 171-172)
2018
Automated design of network security metrics
Pope, A.S.⋅Tauritz, D.R.⋅Morning, R. and Kent, A.D.
(pp. 1680-1687)
 
Evolution of network enumeration strategies in emulated computer networks
Harris, S.⋅Gausmann, A.⋅Tauritz, D.⋅Michalak, E.⋅Reinbolt, H.⋅Rawlings, C.⋅Schoonover, K.⋅Herman, J. and Pope, A.S.
(pp. 1640-1647)
 
Galaxy: A network emulation framework for cybersecurity
Schoonover, K.⋅Michalak, E.⋅Harris, S.⋅Gausmann, A.⋅Reinbolt, H.⋅Tauritz, D.R.⋅Rawlings, C. and Pope, A.S.
 
Hyper-heuristics tutorial
Tauritz, D.R. and Woodward, J.
(pp. 685-719)
 
Improving performance of CDCL SAT solvers by automated design of variable selection heuristics
Illetskova, M.⋅Bertels, A.R.⋅Tuggle, J.M.⋅Harter, A.⋅Richter, S.⋅Tauritz, D.R.⋅Mulder, S.⋅Bueno, D.⋅Leger, M. and Siever, W.M.
(pp. 1-8)
 
The automated design of probabilistic selection methods for evolutionary algorithms
Richter, S.N. and Tauritz, D.R.
(pp. 1545-1552)
2017
Asynchronous parallel cartesian genetic programming
Harter, A.⋅Tauritz, D.R. and Siever, W.M.
(pp. 1820-1824)
 
Evolutionary computation for the automated design of category functions for fuzzy art: An initial exploration
Elnabarawy, I.⋅Tauritz, D.R. and Wunsch, D.C.
(pp. 1133-1140)
 
Evolving Multi-level Graph Partitioning Algorithms
Pope, A.S.⋅Tauritz, D.R. and Kent, A.D.
 
Evolving random graph generators: A case for increased algorithmic primitive granularity
Pope, A.S.⋅Tauritz, D.R. and Kent, A.D.
 
Hyper-heuristics tutorial
Tauritz, D.R. and Woodward, J.
(pp. 510-544)
 
PLADD: Deterring Attacks on Cyber Systems and Moving Target Defense.
2016
A new scheduling problem motivated by moving-target cyberdefense.
 
ECADA 2016 chairs’ welcome
López-Ibáez, M.⋅Tauritz, D. and Woodward, J.
(pp. 1339)
 
Hyper-heuristics
Tauritz, D.R. and Woodward, J.
(pp. 273-304)