L. Darrell Whitley

Orcid: 0000-0002-2752-6534

Affiliations:
  • Colorado State University, Department of Computer Science, Fort Collins, CO, USA


According to our database1, L. Darrell Whitley authored at least 241 papers between 1987 and 2024.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2019, "For technical and professional leadership in the field of genetic and evolutionary computation".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
NK Hybrid Genetic Algorithm for Clustering.
CoRR, 2024

Stochastic Subnetwork Annealing: A Regularization Technique for Fine Tuning Pruned Subnetworks.
CoRR, 2024

Reduction-Based MAX-3SAT with Low Nonlinearity and Lattices Under Recombination.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2024

2023
Challenges in Benchmarking Optimization Heuristics (Dagstuhl Seminar 23251).
Dagstuhl Reports, 2023

Randomly Initialized Subnetworks with Iterative Weight Recycling.
CoRR, 2023

Interpretable Diversity Analysis: Visualizing Feature Representations in Low-Cost Ensembles.
Proceedings of the International Joint Conference on Neural Networks, 2023

Synaptic Stripping: How Pruning Can Bring Dead Neurons Back to Life.
Proceedings of the International Joint Conference on Neural Networks, 2023

Scheduling Multi-Resource Satellites using Genetic Algorithms and Permutation Based Representations.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

Evolutionary Computation and Tunneling at the Edge of Quantum Computing.
Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

Sparse Mutation Decompositions: Fine Tuning Deep Neural Networks with Subspace Evolution.
Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

Genetic Algorithm with Linkage Learning.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

Partition Crossover can Linearize Local Optima Lattices of k-bounded Pseudo-Boolean Functions.
Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2023

2022
Dynastic Potential Crossover Operator.
Evol. Comput., 2022

Local optima organize into lattices under recombination: an example using the traveling salesman problem.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

Graybox optimization and next generation genetic algorithms.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

Iterated local search with perturbation based on variables interaction for pseudo-boolean optimization.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

Exploring the decision and objective space of SAT constrained multi-objective problems.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

Reducing the cost of partition crossover on large MAXSAT problems: the PX-preprocessor.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

Prune and Tune Ensembles: Low-Cost Ensemble Learning with Sparse Independent Subnetworks.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
ACM Transactions on Evolutionary Learning and Optimization Inaugural Issue Editorial.
ACM Trans. Evol. Learn. Optim., 2021

Models of Intervention: Helping Agents and Human Users Avoid Undesirable Outcomes.
Frontiers Artif. Intell., 2021

A Generator for Scalable SAT Constrained Multi-Objective Optimization Benchmark Problems.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2021

Quadratization of gray coded representations, long path problems and needle functions.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Theoretical foundations of evolutionary computation for beginners and veterans.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

A parallel ensemble genetic algorithm for the traveling salesman problem.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Partition crossover for continuous optimization: ePX.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

An efficient implementation of iterative partial transcription for the traveling salesman problem.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

2020
A New Generalized Partition Crossover for the Traveling Salesman Problem: Tunneling between Local Optima.
Evol. Comput., 2020

Approximation Speed-Up by Quadratization on LeadingOnes.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

On the Design of a Partition Crossover for the Quadratic Assignment Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

Understanding transforms of pseudo-boolean functions.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

Why many travelling salesman problem instances are easier than you think.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

2019
The massively parallel <i>mixing genetic algorithm</i> for the traveling salesman problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Quasi-Optimal Recombination Operator.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2019

A New Method for Identification of Recombining Components in the Generalized Partition Crossover.
Proceedings of the 8th Brazilian Conference on Intelligent Systems, 2019

2018
NK Hybrid Genetic Algorithm for Clustering.
IEEE Trans. Evol. Comput., 2018

High-fidelity discrete modeling of the HPA axis: a study of regulatory plasticity in biology.
BMC Syst. Biol., 2018

Exploration and Exploitation Without Mutation: Solving the Jump Function in \varTheta (n) Time.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

Optimal Neuron Selection and Generalization: NK Ensemble Neural Networks.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

Efficient Recombination in the Lin-Kernighan-Helsgaun Traveling Salesman Heuristic.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018


Next generation genetic algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Enhancing partition crossover with articulation points analysis.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Tunneling between plateaus: improving on a state-of-the-art MAXSAT solver using partition crossover.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

A Fusion Mechanism for the Generalized Asymmetric Partition Crossover.
Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

2017
Subtle higher order mutants.
Inf. Softw. Technol., 2017

TSPmap, a tool making use of traveling salesperson problem solvers in the efficient and accurate construction of high-density genetic linkage maps.
BioData Min., 2017

Next generation genetic algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Improving an exact solver for the traveling salesman problem using partition crossover.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Building a better heuristic for the traveling salesman problem: combining edge assembly crossover and partition crossover.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Decomposing SAT Instances with Pseudo Backbones.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2017

Selecting Optimal Models Based on Efficiency and Robustness in Multi-valued Biological Networks.
Proceedings of the 17th IEEE International Conference on Bioinformatics and Bioengineering, 2017

2016
Gray Box Optimization for Mk Landscapes (NK Landscapes and MAX-kSAT).
Evol. Comput., 2016

Stochastic Local Search over Minterms on Structured SAT Instances.
Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Tunnelling Crossover Networks for the Asymmetric TSP.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016


Blind No More: Deterministic Partition Crossover and Deterministic Improving Moves.
Proceedings of the Genetic and Evolutionary Computation Conference, 2016

A New Evaluation Function for Clustering: The NK Internal Validation Criterion.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

Efficient Hill Climber for Constrained Pseudo-Boolean Optimization Problems.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2016

2015
Fitness Probability Distribution of Bit-Flip Mutation.
Evol. Comput., 2015

Optimal Neuron Selection: NK Echo State Networks for Reinforcement Learning.
CoRR, 2015

Blind No More: Constant TimeNon-Random Improving Moves and Exponentially Powerful Recombination.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Mk Landscapes, NK Landscapes, MAX-kSAT: A Proof that the Only Challenging Problems are Deceptive.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Tunnelling Crossover Networks.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Partition Crossover for Pseudo-Boolean Optimization.
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, January 17, 2015

The Multi-Funnel Structure of TSP Fitness Landscapes: A Visual Exploration.
Proceedings of the Artificial Evolution, 2015

2014
Single-Funnel and Multi-funnel Landscapes and Subthreshold-Seeking Behavior.
Proceedings of the Theory and Principled Methods for the Design of Metaheuristics, 2014

The component model for elementary landscapes and partial neighborhoods.
Theor. Comput. Sci., 2014

Exact computation of the expectation surfaces for uniform crossover along with bit-flip mutation.
Theor. Comput. Sci., 2014

HOMAJ: A Tool for Higher Order Mutation Testing in AspectJ and Java.
Proceedings of the Seventh IEEE International Conference on Software Testing, 2014

Blind no more: constant time non-random improving moves and exponentially powerful recombination.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Generalized asymmetric partition crossover (GAPX) for the asymmetric TSP.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Use of explicit memory in the dynamic traveling salesman problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Comparing search techniques for finding subtle higher order mutants.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Efficient identification of improving moves in a ball for pseudo-boolean problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Elementary Landscape Decomposition of the Hamiltonian Path Optimization Problem, .
Proceedings of the Evolutionary Computation in Combinatorial Optimisation, 2014

2013
Fitness Function Distributions over Generalized Search Neighborhoods in the <i>q</i>-ary Hypercube.
Evol. Comput., 2013

Theory of Evolutionary Algorithms (Dagstuhl Seminar 13271).
Dagstuhl Reports, 2013

Constructing subtle higher order mutants for Java and AspectJ programs.
Proceedings of the IEEE 24th International Symposium on Software Reliability Engineering, 2013

Elementary landscapes: theory and applications.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Hyperplane initialized local search for MAXSAT.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Second order partial derivatives for NK-landscapes.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Greedy or Not? Best Improving versus First Improving Stochastic Local Search for MAXSAT.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Genetic Algorithms - A Survey of Models and Methods.
Proceedings of the Handbook of Natural Computing, 2012

Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time.
Theor. Comput. Sci., 2012

Optimal security hardening on attack tree models of networks: a cost-benefit analysis.
Int. J. Inf. Sec., 2012

Utility driven optimization of real time data broadcast schedules.
Appl. Soft Comput., 2012

An Empirical Evaluation of O(1) Steepest Descent for NK-Landscapes.
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012

Improving Lin-Kernighan-Helsgaun with Crossover on Clustered Instances of the TSP.
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012

Quasi-elementary Landscapes and Superpositions of Elementary Landscapes.
Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

Constant time steepest descent local search with lookahead for NK-landscapes and MAX-kSAT.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

Exact computation of the expectation curves for uniform crossover.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

2011
k-Anonymization in the Presence of Publisher Preferences.
IEEE Trans. Knowl. Data Eng., 2011

Elementary landscape decomposition of the frequency assignment problem.
Theor. Comput. Sci., 2011

Revisiting the big valley search space structure in the TSP.
J. Oper. Res. Soc., 2011

Exploring privacy versus data quality trade-offs in anonymization techniques using multi-objective optimization.
J. Comput. Secur., 2011

A Methodology to Find the Elementary Landscape Decomposition of Combinatorial Optimization Problems.
Evol. Comput., 2011

Evolutionary Hessian Learning: Forced Optimal Covariance Adaptive Learning (FOCAL)
CoRR, 2011

Exploiting Decomposability Using Recombination in Genetic Algorithms: An Exploratory Discussion.
Proceedings of the Search Based Software Engineering - Third International Symposium, 2011

Partial neighborhoods of the traveling salesman problem.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Approximating the distribution of fitness over hamming regions.
Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

A "No Free Lunch" Tutorial: Sharpened and Focused No Free Lunch.
Proceedings of the Theory of Randomized Search Heuristics: Foundations and Recent Developments., 2011

2010
Adaptive Appearance Model and Condensation Algorithm for Robust Face Tracking.
IEEE Trans. Syst. Man Cybern. Part A, 2010

Real time stochastic scheduling in broadcast systems with decentralized data storage.
Real Time Syst., 2010

Directed Plateau Search for MAX-k-SAT.
Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

On the Formation of Historically k-Anonymous Anonymity Sets in a Continuous LBS.
Proceedings of the Security and Privacy in Communication Networks, 2010

A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover.
Proceedings of the Parallel Problem Solving from Nature, 2010

Query m-Invariance: Preventing Query Disclosures in Continuous Location-Based Services.
Proceedings of the Eleventh International Conference on Mobile Data Management, 2010

Elementary landscapes of frequency assignment problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

On the Identification of Property Based Generalizations in Microdata Anonymization.
Proceedings of the Data and Applications Security and Privacy XXIV, 2010

10361 Abstracts Collection and Executive Summary - Theory of Evolutionary Algorithms.
Proceedings of the Theory of Evolutionary Algorithms, 05.09. - 10.09.2010, 2010

2009
A Theoretical Analysis of the k-Satisfiability Search Space.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2009

Estimating Bounds on Expected Plateau Size in MAXSAT Problems.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2009

Improved Robustness through Population Variance in Ant Colony Optimization.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2009

Elementary landscape analysis.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Partial neighborhoods of elementary landscapes.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Tunneling between optima: partition crossover for the traveling salesman problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

No free lunch: 1995-2008.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

A polynomial time computation of the exact correlation structure of k-satisfiability landscapes.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

A multi-objective approach to data sharing with privacy constraints and preference based objectives.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

On the comparison of microdata disclosure control algorithms.
Proceedings of the EDBT 2009, 2009

POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice.
Proceedings of the 18th ACM Conference on Information and Knowledge Management, 2009

2008
Resource Scheduling with Permutation Based Representations: Three Applications.
Proceedings of the Evolutionary Computation in Practice, 2008

The Impact of Global Structure on Search.
Proceedings of the Parallel Problem Solving from Nature, 2008

Optimizing Real-Time Ordered-Data Broadcasts in Pervasive Environments Using Evolution Strategy.
Proceedings of the Parallel Problem Solving from Nature, 2008

On the Optimal Selection of k in the k-Anonymity Problem.
Proceedings of the 24th International Conference on Data Engineering, 2008

Understanding elementary landscapes.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008

Focused no free lunch theorems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008

No free lunch.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008

Evolution strategy based optimization of on-demand dependent data broadcast scheduling.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008

Security Provisioning in Pervasive Environments Using Multi-objective Optimization.
Proceedings of the Computer Security, 2008

Optimizing on-demand data broadcast scheduling in pervasive environments.
Proceedings of the EDBT 2008, 2008

2007
A note on the variance of rank-based selection strategies for genetic algorithms and genetic programming.
Genet. Program. Evolvable Mach., 2007

No free lunch.
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

Differential evolution and non-separability: using selective pressure to focus search.
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

Optimal security hardening using multi-objective optimization on attack tree models of networks.
Proceedings of the 2007 ACM Conference on Computer and Communications Security, 2007

Using Adaptive Priority Weighting to Direct Search in Probabilistic Scheduling.
Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, 2007

2006
Subthreshold-seeking local search.
Theor. Comput. Sci., 2006

AFSCN scheduling: How the problem and solution have evolved.
Math. Comput. Model., 2006

Understanding Algorithm Performance on an Oversubscribed Scheduling Application.
J. Artif. Intell. Res., 2006

Deconstructing Nowicki and Smutnicki's <i>i</i>-TSAB tabu search algorithm for the job-shop scheduling problem.
Comput. Oper. Res., 2006

Comparing the Niches of CMA-ES, CHC and Pattern Search Using Diverse Benchmarks.
Proceedings of the Parallel Problem Solving from Nature, 2006

Searching for Balance: Understanding Self-adaptation on Ridge Functions.
Proceedings of the Parallel Problem Solving from Nature, 2006

Alternative evolutionary algorithms for evolving programs: evolution strategies and steady state GP.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006

PSO and multi-funnel landscapes: how cooperation might limit exploration.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006

A crossover operator for the <i>k-</i> anonymity problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006

The dispersion metric and the CMA evolution strategy.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006

Spacetrack: Trading off Quality and Utilization in Oversubscribed Schedules.
Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems.
Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

2005
Linking Search Space Structure, Run-Time Dynamics, and Problem Difficulty: A Step Toward Demystifying Tabu Search.
J. Artif. Intell. Res., 2005

Alternative implementations of the Griewangk function.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005

Unbiased tournament selection.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005

Evolving cooperative strategies for UAV teams.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005

Measuring mobility and the performance of global search algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005

Gray, Binary and Real Valued Encodings: Quad Search and Locality Proofs.
Proceedings of the Foundations of Genetic Algorithms, 8th International Workshop, 2005

Dynamic power minimization during combinational circuit testing as a traveling salesman problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2005

2004
Scheduling Space-Ground Communications for the Air Force Satellite Control Network.
J. Sched., 2004

Properties of Gray and Binary Representations.
Evol. Comput., 2004

Ruffled by Ridges: How Evolutionary Algorithms Can Fail.
Proceedings of the Genetic and Evolutionary Computation, 2004

Subthreshold-Seeking Behavior and Robust Local Search.
Proceedings of the Genetic and Evolutionary Computation, 2004

Comparing Search Algorithms for the Temperature Inversion Problem.
Proceedings of the Genetic and Evolutionary Computation, 2004

Trading Places: How to Schedule More in a Multi-Resource Oversubscribed Scheduling Problem.
Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), 2004

Leap Before You Look: An Effective Strategy in an Oversubscribed Scheduling Problem.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003
Hyperplane ranking, nonlinearity and the simple genetic algorithm.
Inf. Sci., 2003

Problem difficulty for tabu search in job-shop scheduling.
Artif. Intell., 2003

Quad Search and Hybrid Genetic Algorithms.
Proceedings of the Genetic and Evolutionary Computation, 2003

2002
Augmented geophysical data interpretation through automated velocity picking in semblance velocity images.
Mach. Vis. Appl., 2002

Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance.
INFORMS J. Comput., 2002

Satellite Range Scheduling: A Comparison of Genetic, Heuristic and Local Search.
Proceedings of the Parallel Problem Solving from Nature, 2002

2001
An overview of evolutionary algorithms: practical issues and common pitfalls.
Inf. Softw. Technol., 2001

2000
Functions as Permutations: Regarding No Free Lunch, Walsh Analysis and Summary Statistics.
Proceedings of the Parallel Problem Solving from Nature, 2000

A Comparison of Genetic Algorithms for the Static Job Shop Scheduling Problem.
Proceedings of the Parallel Problem Solving from Nature, 2000

A Comparison of Genetic Algorithms for the Dynamic Job Shop Scheduling Problem.
Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '00), 2000

A Hybrid Genetic Algorithm for the Quadratic Assignment Problem.
Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '00), 2000

Local Search and High Precision Gray Codes: Convergence Results and Neighborhoods.
Proceedings of the Sixth Workshop on Foundations of Genetic Algorithms, 2000

Dynamic Representations and Escaping Local Optima: Improving Genetic Algorithms and Local Search.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
Predicting Epistasis from Mathematical Models.
Evol. Comput., 1999

Polynomial Time Summary Statistics for a Generalization of MAXSAT.
Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), 1999

Genetic Approach to Feature Selection for Ensemble Creation.
Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), 1999

Fast and accurate feature selection using hybrid genetic strategies.
Proceedings of the 1999 Congress on Evolutionary Computation, 1999

Algorithm Performance and Problem Structure for Flow-shop Scheduling.
Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999

1998
Comparing heuristic search methods and genetic algorithms for warehouse scheduling.
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998

The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt.
Proceedings of the Parallel Problem Solving from Nature, 1998

Genetic Algorithm Behavior in the MAXSAT Domain.
Proceedings of the Parallel Problem Solving from Nature, 1998

A Formal Language for Permutation Recombination Operators.
Proceedings of the Fifth Workshop on Foundations of Genetic Algorithms, 1998

Test Function Generators as Embedded Landscapes.
Proceedings of the Fifth Workshop on Foundations of Genetic Algorithms, 1998

A Tractable Walsh Analysis of SAT and its Implications for Genetic Algorithms.
Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1997
Messy Genetic Algorithms for Subset Feature Selection.
Proceedings of the 7th International Conference on Genetic Algorithms, 1997

Bit Representations with a Twist.
Proceedings of the 7th International Conference on Genetic Algorithms, 1997

A Walsh Analysis of NK-Landscapes.
Proceedings of the 7th International Conference on Genetic Algorithms, 1997

Island Model genetic Algorithms and Linearly Separable Problems.
Proceedings of the Evolutionary Computing, 1997

Representation, Search and Genetic Algorithms.
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

1996
Evaluating Evolutionary Algorithms.
Artif. Intell., 1996

Searching in the Presence of Noise.
Proceedings of the Parallel Problem Solving from Nature, 1996

Nonlinearity, Hyperplane Ranking and the Simple Genetic Algorithm.
Proceedings of the 4th Workshop on Foundations of Genetic Algorithms. San Diego, 1996

Comparing Heuristic, Evolutionary and Local Search Approaches to Scheduling.
Proceedings of the Third International Conference on Artificial Intelligence Planning Systems, 1996

1995
Test driving three 1995 genetic algorithms: New test functions and geometric matching.
J. Heuristics, 1995

Building Better Test Functions.
Proceedings of the 6th International Conference on Genetic Algorithms, 1995

Hyperplane Ranking in Simple Genetic Algorithms.
Proceedings of the 6th International Conference on Genetic Algorithms, 1995

Cellular Encoding Applied to Neurocontrol.
Proceedings of the 6th International Conference on Genetic Algorithms, 1995

A Programming Language for Artificial Development.
Proceedings of the Fourth Annual Conference on Evolutionary Programming, 1995

1994
Changing Representations During Search: A Comparative Study of Delta Coding.
Evol. Comput., 1994

A Machine-Independent Analysis of Parallel Genetic Algorithms.
Complex Syst., 1994

Cellular genetic algorithms as function optimizers: locality effects.
Proceedings of the 1994 ACM Symposium on Applied Computing, 1994

A note on the performance of genetic algorithms on zero-one knapsack problems.
Proceedings of the 1994 ACM Symposium on Applied Computing, 1994

Lamarckian Evolution, The Baldwin Effect and Function Optimization.
Proceedings of the Parallel Problem Solving from Nature, 1994

Advanced Correlation Analysis of Operators for the Traveling Salesman Problem.
Proceedings of the Parallel Problem Solving from Nature, 1994

Staged Hybrid Genetic Search for Seismic Data Imaging.
Proceedings of the First IEEE Conference on Evolutionary Computation, 1994

Transforming the Search Space with Gray Coding.
Proceedings of the First IEEE Conference on Evolutionary Computation, 1994

Initial Performance Comparisons for the Delta Coding Algorithm.
Proceedings of the First IEEE Conference on Evolutionary Computation, 1994

Modeling Simple Genetic Algorithms for Permutation Problems.
Proceedings of the Third Workshop on Foundations of Genetic Algorithms. Estes Park, Colorado, USA, July 31, 1994

1993
Genetic Reinforcement Learning for Neurocontrol Problems.
Mach. Learn., 1993

Adding Learning to the Cellular Development of Neural Networks: Evolution and the Baldwin Effect.
Evol. Comput., 1993

Cellular Genetic Algorithms.
Proceedings of the 5th International Conference on Genetic Algorithms, 1993

Serial and Parallel Genetic Algorithms as Function Optimizers.
Proceedings of the 5th International Conference on Genetic Algorithms, 1993

1992
Prediction of Software Reliability Using Connectionist Models.
IEEE Trans. Software Eng., 1992

Using Neural Networks in Reliability Prediction.
IEEE Softw., 1992

Tracking Primary Hyperplane Competitors During Genetic Search.
Ann. Math. Artif. Intell., 1992

Deception, Dominance and Implicit Parallelism in Genetic Search.
Ann. Math. Artif. Intell., 1992

Genetic Operators, the Fitness Landscape and the Traveling Salesman Problem.
Proceedings of the Parallel Problem Solving from Nature 2, 1992

Dataflow Parallelism in Genetic Algorithms.
Proceedings of the Parallel Problem Solving from Nature 2, 1992

An Executable Model of a Simple Genetic Algorithm.
Proceedings of the Second Workshop on Foundations of Genetic Algorithms. Vail, 1992

Remapping Hyperspace During Genetic Search: Canonical Delta Folding.
Proceedings of the Second Workshop on Foundations of Genetic Algorithms. Vail, 1992

1991
Prediction of software reliability using neural networks.
Proceedings of the Second International Symposium on Software Reliability Engineering, 1991

Delta Coding: An Iterative Search Strategy for Genetic Algorithms.
Proceedings of the 4th International Conference on Genetic Algorithms, 1991

Genetic Reinforcement Learning with Multilayer Neural Networks.
Proceedings of the 4th International Conference on Genetic Algorithms, 1991

A Comparison of Genetic Sequencing Operators.
Proceedings of the 4th International Conference on Genetic Algorithms, 1991

The Only Challenging Problems Are Deceptive: Global Search by Solving Order-1 Hyperplanes.
Proceedings of the 4th International Conference on Genetic Algorithms, 1991

1990
Genetic algorithms and neural networks: optimizing connections and connectivity.
Parallel Comput., 1990

GENITOR II: a distributed genetic algorithm.
J. Exp. Theor. Artif. Intell., 1990

Optimization Using Distributed Genetic Algorithms.
Proceedings of the Parallel Problem Solving from Nature, 1st Workshop, 1990

Motivation and framework for using genetic algorithms for microcode compaction.
Proceedings of the 23rd Annual Workshop and Symposium on Microprogramming and Microarchitecture, 1990

Fundamental Principles of Deception in Genetic Search.
Proceedings of the First Workshop on Foundations of Genetic Algorithms. Bloomington Campus, 1990

Genetic algorithm solutions for the traveling salesman problem.
Proceedings of the 28th Annual Southeast Regional Conference, 1990

1989
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator.
Proceedings of the 3rd International Conference on Genetic Algorithms, 1989

Optimizing Neural Networks Using FasterMore Accurate Genetic Search.
Proceedings of the 3rd International Conference on Genetic Algorithms, 1989

The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best.
Proceedings of the 3rd International Conference on Genetic Algorithms, 1989

1987
Using Reproductive Evaluation to Improve Genetic Search and Heuristic Discovery.
Proceedings of the 2nd International Conference on Genetic Algorithms, 1987


  Loading...