A Model of Mental Imagery. - Bryant A. Julstrom; Robert J. Baron (Int. J. Man Mach. Stud., 1985)

A bound on the shift function in terms of the Busy Beaver function. - Bryant A. Julstrom (SIGACT News, 1992)

Slow sorting: a whimsical inquiry. - Bryant A. Julstrom (ACM SIGCSE Bull., 1992)

A Genetic Algorithm for the Rectilinear Steiner Problem. - Bryant A. Julstrom (ICGA, 1993)

Seeding the population: improved performance in a genetic algorithm for the rectilinear Steiner problem. - Bryant A. Julstrom (SAC, 1994)

What Have You Done for Me Lately? Adapting Operator Probabilities in a Steady-State Genetic Algorithm. - Bryant A. Julstrom (ICGA, 1995)

Very greedy crossover in a genetic algorithm for the traveling salesman problem. - Bryant A. Julstrom (SAC, 1995)

Representing rectilinear Steiner trees in genetic algorithms. - Bryant A. Julstrom (SAC, 1996)

Evolutionary discovery of DFA size and structure. - Bryant A. Julstrom (SAC, 1996)

A Note on Busy Beavers and Other Creatures. - Amir M. Ben-Amram; Bryant A. Julstrom; Uri Zwick (Math. Syst. Theory, 1996)

Design of vector quantization codebooks using a genetic algorithm. - Yiaowei Zheng; Bryant A. Julstrom; Weidong Cheng (ICEC, 1997)

Effects of Contest Length and Noise on Reciprocal Altruism, Cooperation, and Payoffs in the Iterated Prisoner's Dilemma. - Bryant A. Julstrom (ICGA, 1997)

Adaptive operator probabilities in a genetic algorithm that applies three operators. - Bryant A. Julstrom (SAC, 1997)

A weight-coded genetic algorithm for the minimum weight triangulation problem. - Kerry Capp; Bryant A. Julstrom (SAC, 1998)

Comparing decoding algorithms in a weight-coded GA for TSP. - Bryant A. Julstrom (SAC, 1998)

It's all the same to me: revisiting rank-based probabilities and tournaments. - Bryant A. Julstrom (CEC, 1999)

Coding TSP Tours as Permutations via an Insertion Heuristic. - Bryant A. Julstrom (SAC, 1999)

Simulating exponential normalization with weighted k-tournaments. - Bryant A. Julstrom; David H. Robinson (CEC, 2000)

A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. - Günther R. Raidl; Bryant A. Julstrom (SAC (1), 2000)

Encoding rectilinear Steiner trees as lists of edges. - Bryant A. Julstrom (SAC, 2001)

Weight-biased edge-crossover in evolutionary algorithms for wto graph problems. - Bryant A. Julstrom; Günther R. Raidl (SAC, 2001)

A scalable genetic algorithm for the rectilinear Steiner problem. - Bryant A. Julstrom (IEEE Congress on Evolutionary Computation, 2002)

Manipulating Valid Solutions in a Genetic Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. - Bryant A. Julstrom (GECCO Late Breaking Papers, 2002)

Two Genetic Algorithms for the Leaf-Constrained Minimum Spanning Tree Problem. - Bryant A. Julstrom (IC-AI, 2002)

A Genetic Algorithm and Two Hill-Climbers for the Minimum Routing Cost Spanning Tree Problem. - Bryant A. Julstrom (IC-AI, 2002)

Applying Local Search n a Genetic Algorithm for the 4-Cycle Problem. - Bryant A. Julstrom (IC-AI, 2002)

On Weight-Biased Mutation for Graph Problems. - Günther R. Raidl; Gabriele Kodydek; Bryant A. Julstrom (PPSN, 2002)

Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges. - Bryant A. Julstrom; Günther R. Raidl (SAC, 2002)

Evolutionary Algorithms for Two Problems from the Calculus of Variations. - Bryant A. Julstrom (GECCO, 2003)

A Spanning Tree-Based Genetic Algorithm for Some Instances of the Rectilinear Steiner Problem with Obstacles. - Rita M. Hare; Bryant A. Julstrom (SAC, 2003)

Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. - Günther R. Raidl; Bryant A. Julstrom (SAC, 2003)

A Genetic Algorithm for Restricted Cases of the Rectilinear Steiner Problem with Obstacles. - Rita M. Hare; Bryant A. Julstrom (VLSI, 2003)

Edge sets: an effective evolutionary coding of spanning trees. - Günther R. Raidl; Bryant A. Julstrom (IEEE Trans. Evol. Comput., 2003)

Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys. - Bryant A. Julstrom (GECCO (1), 2004)

Three Evolutionary Codings of Rectilinear Steiner Arborescences. - Bryant A. Julstrom; Athos Antoniades (GECCO (1), 2004)

How Are We Doing? Predicting Evolutionary Algorithm Performance. - Mark A. Renslow; Brenda Hinkemeyer; Bryant A. Julstrom (GECCO (2), 2004)

Editorial message: special track on evolutionary computation and optimization. - Bryant A. Julstrom (SAC, 2004)

Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem. - Bryant A. Julstrom; Athos Antoniades (SAC, 2004)

The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem. - Bryant A. Julstrom (GECCO, 2005)

Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem. - Bryant A. Julstrom (GECCO, 2005)

Evolving petri nets to represent metabolic pathways. - Jeremiah Nummela; Bryant A. Julstrom (GECCO, 2005)

Call me e-mail: arranging the keyboard with a permutation-coded genetic algorithm. - Jeffrey S. Goettl; Alexander W. Brugh; Bryant A. Julstrom (SAC, 2005)

Editorial message: special track on applications of evolutionary computation. - Bryant A. Julstrom (SAC, 2005)

Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming. - Jason Amunrud; Bryant A. Julstrom (GECCO, 2006)

The quadratic multiple knapsack problem and three heuristic approaches to it. - Amanda Hiley; Bryant A. Julstrom (GECCO, 2006)

A genetic algorithm for the longest common subsequence problem. - Brenda Hinkemeyer; Bryant A. Julstrom (GECCO, 2006)

An effective genetic algorithm for the minimum-label spanning tree problem. - Jeremiah Nummela; Bryant A. Julstrom (GECCO, 2006)

Starting from Scratch: Growing Longest Common Subsequences with Evolution. - Bryant A. Julstrom; Brenda Hinkemeyer (PPSN, 2006)

Editorial message: track on applications of evolutionary computation. - Bryant A. Julstrom (SAC, 2006)

An expert system for evaluating Siberian Huskies. - Brenda Hinkemeyer; Nicole Januszewski; Bryant A. Julstrom (Expert Syst. Appl., 2006)

Biased Mutation Operators for Subgraph-Selection Problems. - Günther R. Raidl; Gabriele Koller; Bryant A. Julstrom (IEEE Trans. Evol. Comput., 2006)

An evolutionary algorithm for some cases of the single-source constrained plant location problem. - Bryant A. Julstrom (GECCO, 2008)

Greedy heuristics and evolutionary algorithms for the bounded minimum-label spanning tree problem. - Arindam Khaled; Bryant A. Julstrom (GECCO, 2008)

Special track on Applications of Evolutionary Computation: editorial message. - Bryant A. Julstrom (SAC, 2008)

A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem. - Bryant A. Julstrom (Recent Advances in Evolutionary Computation for Combinatorial Optimization, 2008)

Evolving heuristically difficult instances of combinatorial problems. - Bryant A. Julstrom (GECCO, 2009)

Evolutionary codings and operators for the terminal assignment problem. - Bryant A. Julstrom (GECCO, 2009)

A data-based coding of candidate strings in the closest string problem. - Bryant A. Julstrom (GECCO (Companion), 2009)

String- and permutation-coded genetic algorithms for the static weapon-target assignment problem. - Bryant A. Julstrom (GECCO (Companion), 2009)

Greedy heuristics for the bounded diameter minimum spanning tree problem. - Bryant A. Julstrom (ACM J. Exp. Algorithmics, 2009)

Breaking ties with secondary fitness in a genetic algorithm for the bin packing problem. - Justin Benjamin; Bryant A. Julstrom (GECCO, 2010)

Clans and cooperation in the iterated prisoner's dilemma. - Bryant A. Julstrom (GECCO (Companion), 2012)

Naive and heuristic permutation-coded genetic algorithms for the quadratic knapsack problem. - Bryant A. Julstrom (GECCO (Companion), 2012)

Evolving instances of unconstrained binary quadratic programming that challenge a tabu search heuristic. - Michael Porta; Bryant A. Julstrom (GECCO (Companion), 2012)