Bryant A. Julstrom

Affiliations:
  • St. Cloud State University, St. Cloud, MN, USA


According to our database1, Bryant A. Julstrom authored at least 63 papers between 1985 and 2012.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2012
Evolving instances of unconstrained binary quadratic programming that challenge a tabu search heuristic.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

Naive and heuristic permutation-coded genetic algorithms for the quadratic knapsack problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

Clans and cooperation in the iterated prisoner's dilemma.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

2010
Breaking ties with secondary fitness in a genetic algorithm for the bin packing problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

2009
Greedy heuristics for the bounded diameter minimum spanning tree problem.
ACM J. Exp. Algorithmics, 2009

String- and permutation-coded genetic algorithms for the static weapon-target assignment problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

A data-based coding of candidate strings in the closest string problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Evolutionary codings and operators for the terminal assignment problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Evolving heuristically difficult instances of combinatorial problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

2008
A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem.
Proceedings of the Recent Advances in Evolutionary Computation for Combinatorial Optimization, 2008

Special track on Applications of Evolutionary Computation: editorial message.
Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

Greedy heuristics and evolutionary algorithms for the bounded minimum-label spanning tree problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008

An evolutionary algorithm for some cases of the single-source constrained plant location problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008

2006
Biased Mutation Operators for Subgraph-Selection Problems.
IEEE Trans. Evol. Comput., 2006

An expert system for evaluating Siberian Huskies.
Expert Syst. Appl., 2006

Editorial message: track on applications of evolutionary computation.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

Starting from Scratch: Growing Longest Common Subsequences with Evolution.
Proceedings of the Parallel Problem Solving from Nature, 2006

An effective genetic algorithm for the minimum-label spanning tree problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006

A genetic algorithm for the longest common subsequence problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006

The quadratic multiple knapsack problem and three heuristic approaches to it.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006

Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006

2005
Editorial message: special track on applications of evolutionary computation.
Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

Call me e-mail: arranging the keyboard with a permutation-coded genetic algorithm.
Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

Evolving petri nets to represent metabolic pathways.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005

Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005

The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005

2004
Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem.
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

Editorial message: special track on evolutionary computation and optimization.
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

How Are We Doing? Predicting Evolutionary Algorithm Performance.
Proceedings of the Genetic and Evolutionary Computation, 2004

Three Evolutionary Codings of Rectilinear Steiner Arborescences.
Proceedings of the Genetic and Evolutionary Computation, 2004

Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys.
Proceedings of the Genetic and Evolutionary Computation, 2004

2003
Edge sets: an effective evolutionary coding of spanning trees.
IEEE Trans. Evol. Comput., 2003

A Genetic Algorithm for Restricted Cases of the Rectilinear Steiner Problem with Obstacles.
Proceedings of the International Conference on VLSI, 2003

Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem.
Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003

A Spanning Tree-Based Genetic Algorithm for Some Instances of the Rectilinear Steiner Problem with Obstacles.
Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003

Evolutionary Algorithms for Two Problems from the Calculus of Variations.
Proceedings of the Genetic and Evolutionary Computation, 2003

2002
Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges.
Proceedings of the 2002 ACM Symposium on Applied Computing (SAC), 2002

On Weight-Biased Mutation for Graph Problems.
Proceedings of the Parallel Problem Solving from Nature, 2002

Applying Local Search n a Genetic Algorithm for the 4-Cycle Problem.
Proceedings of the International Conference on Artificial Intelligence, 2002

A Genetic Algorithm and Two Hill-Climbers for the Minimum Routing Cost Spanning Tree Problem.
Proceedings of the International Conference on Artificial Intelligence, 2002

Two Genetic Algorithms for the Leaf-Constrained Minimum Spanning Tree Problem.
Proceedings of the International Conference on Artificial Intelligence, 2002

Manipulating Valid Solutions in a Genetic Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem.
Proceedings of the Late Breaking papers at the Genetic and Evolutionary Computation Conference (GECCO-2002), 2002

A scalable genetic algorithm for the rectilinear Steiner problem.
Proceedings of the 2002 Congress on Evolutionary Computation, 2002

2001
Weight-biased edge-crossover in evolutionary algorithms for wto graph problems.
Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001

Encoding rectilinear Steiner trees as lists of edges.
Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001

2000
A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem.
Proceedings of the Applied Computing 2000, 2000

Simulating exponential normalization with weighted k-tournaments.
Proceedings of the 2000 Congress on Evolutionary Computation, 2000

1999
Coding TSP Tours as Permutations via an Insertion Heuristic.
Proceedings of the 1999 ACM Symposium on Applied Computing, 1999

It's all the same to me: revisiting rank-based probabilities and tournaments.
Proceedings of the 1999 Congress on Evolutionary Computation, 1999

1998
Comparing decoding algorithms in a weight-coded GA for TSP.
Proceedings of the 1998 ACM symposium on Applied Computing, 1998

A weight-coded genetic algorithm for the minimum weight triangulation problem.
Proceedings of the 1998 ACM symposium on Applied Computing, 1998

1997
Adaptive operator probabilities in a genetic algorithm that applies three operators.
Proceedings of the 1997 ACM symposium on Applied Computing, 1997

Effects of Contest Length and Noise on Reciprocal Altruism, Cooperation, and Payoffs in the Iterated Prisoner's Dilemma.
Proceedings of the 7th International Conference on Genetic Algorithms, 1997

1996
A Note on Busy Beavers and Other Creatures.
Math. Syst. Theory, 1996

Evolutionary discovery of DFA size and structure.
Proceedings of the 1996 ACM Symposium on Applied Computing, 1996

Representing rectilinear Steiner trees in genetic algorithms.
Proceedings of the 1996 ACM Symposium on Applied Computing, 1996

1995
Very greedy crossover in a genetic algorithm for the traveling salesman problem.
Proceedings of the 1995 ACM symposium on applied computing, 1995

What Have You Done for Me Lately? Adapting Operator Probabilities in a Steady-State Genetic Algorithm.
Proceedings of the 6th International Conference on Genetic Algorithms, 1995

1994
Seeding the population: improved performance in a genetic algorithm for the rectilinear Steiner problem.
Proceedings of the 1994 ACM Symposium on Applied Computing, 1994

1993
A Genetic Algorithm for the Rectilinear Steiner Problem.
Proceedings of the 5th International Conference on Genetic Algorithms, 1993

1992
Slow sorting: a whimsical inquiry.
ACM SIGCSE Bull., 1992

A bound on the shift function in terms of the Busy Beaver function.
SIGACT News, 1992

1985
A Model of Mental Imagery.
Int. J. Man Mach. Stud., 1985


  Loading...