B. Julstrom

发表

Edge sets: an effective evolutionary coding of spanning trees

Bryant A. Julstrom, Günther R. Raidl, G. Raidl, 2003, IEEE Trans. Evol. Comput..

Prüfer numbers: a poor representation of spanning trees for evolutionary search

G. Raidl, B. Julstrom, Franz Rothlauf, 2001 .

A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem

G. Raidl, B. Julstrom, 2003 .

It's all the same to me: revisiting rank-based probabilities and tournaments

B. Julstrom, 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

Simulating exponential normalization with weighted k-tournaments

D. H. Robinson, B. Julstrom, B. A. Julstrom, 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

What Have You Done for Me Lately? Adapting Operator Probabilities in a Steady-State Genetic Algorithm

Bryant A. Julstrom, B. Julstrom, 1995, ICGA.

A Web-Based Evolutionary Algorithm Demonstration using the Traveling Salesman Problem

B. Julstrom, Richard Mowe, 2001 .

Three Evolutionary Codings of Rectilinear Steiner Arborescences

Bryant A. Julstrom, Athos Antoniades, A. Antoniades, 2004, GECCO.

Evolving petri nets to represent metabolic pathways

Bryant A. Julstrom, Jeremiah Nummela, B. Julstrom, 2005, GECCO '05.

Clans and cooperation in the iterated prisoner's dilemma

Bryant A. Julstrom, B. Julstrom, 2012, GECCO '12.

Evolving heuristically difficult instances of combinatorial problems

Bryant A. Julstrom, B. Julstrom, 2009, GECCO.

A Hybrid Evolutionary Algorithm for the Rectilinear Steiner Problem

Bryant A. Julstrom, B. Julstrom, 2003 .

A Model of Mental Imagery

Bryant A. Julstrom, Robert J. Baron, R. Baron, 1985, Int. J. Man Mach. Stud..

An expert system for evaluating Siberian Huskies

Bryant A. Julstrom, Brenda Hinkemeyer, Nicole Januszewski, 2006, Expert Syst. Appl..

Weight-biased edge-crossover in evolutionary algorithms for two graph problems

Bryant A. Julstrom, Günther R. Raidl, G. Raidl, 2001, SAC.

Very greedy crossover in a genetic algorithm for the traveling salesman problem

Bryant A. Julstrom, B. Julstrom, 1995, SAC '95.

Comparing decoding algorithms in a weight-coded GA for TSP

Bryant A. Julstrom, B. Julstrom, 1998, SAC '98.

The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem

Bryant A. Julstrom, B. Julstrom, 2005, GECCO '05.

Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys

Bryant A. Julstrom, B. Julstrom, 2004, GECCO.

Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem

Bryant A. Julstrom, Günther R. Raidl, G. Raidl, 2003, SAC '03.

Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges

Bryant A. Julstrom, Günther R. Raidl, G. Raidl, 2002, SAC '02.

Seeding the population: improved performance in a genetic algorithm for the rectilinear Steiner problem

Bryant A. Julstrom, B. Julstrom, 1993, SAC '94.

Codings and operators in two genetic algorithms for the leaf-constrained minimum spanning tree problem

Bryant A. Julstrom, B. Julstrom, 2004 .

A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem

Bryant A. Julstrom, Günther R. Raidl, G. Raidl, 2000, SAC '00.

Slow sorting: a whimsical inquiry

Bryant A. Julstrom, B. Julstrom, 1992, SGCS.

The quadratic multiple knapsack problem and three heuristic approaches to it

Bryant A. Julstrom, Amanda Hiley, B. Julstrom, 2006, GECCO.

A data-based coding of candidate strings in the closest string problem

Bryant A. Julstrom, B. Julstrom, 2009, GECCO '09.

String- and permutation-coded genetic algorithms for the static weapon-target assignment problem

Bryant A. Julstrom, B. Julstrom, 2009, GECCO '09.

Adaptive operator probabilities in a genetic algorithm that applies three operators

Bryant A. Julstrom, B. Julstrom, 1997, SAC '97.

Biased mutation operators for subgraph-selection problems

Bryant A. Julstrom, Günther R. Raidl, Gabriele Koller, 2006, IEEE Transactions on Evolutionary Computation.

On Weight-Biased Mutation for Graph Problems

Bryant A. Julstrom, Günther R. Raidl, Gabriele Kodydek, 2002, PPSN.

Starting from Scratch: Growing Longest Common Subsequences with Evolution

Bryant A. Julstrom, Brenda Hinkemeyer, B. Julstrom, 2006, PPSN.

Design of vector quantization codebooks using a genetic algorithm

B. Julstrom, B. A. Julstrom, Yiaowei Zheng, 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).