Travelled to:1 × Cyprus
1 × Spain
4 × USA
Collaborated with:∅ G.R.Raidl A.Antoniades R.M.Hare K.Capp J.S.Goettl A.W.Brugh
Talks about:algorithm (13) problem (8) genet (8) tree (6) evolutionari (5) rectilinear (5) steiner (5) weight (5) code (5) span (4)
Person: Bryant A. Julstrom
DBLP: Julstrom:Bryant_A=
Contributed to:
200520042003200220012000199919981997199619951994Wrote 16 papers:
- SAC-2005-GoettlBJ #algorithm #email #search-based
- Call me e-mail: arranging the keyboard with a permutation-coded genetic algorithm (JSG, AWB, BAJ), pp. 947–951.
- SAC-2004-JulstromA #algorithm #hybrid #problem
- Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem (BAJ, AA), pp. 980–984.
- SAC-2003-HareJ #algorithm #problem #search-based
- A Spanning Tree-Based Genetic Algorithm for Some Instances of the Rectilinear Steiner Problem with Obstacles (RMH, BAJ), pp. 725–729.
- SAC-2003-RaidlJ #algorithm #bound #heuristic #problem
- Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem (GRR, BAJ), pp. 747–752.
- SAC-2002-JulstromR #algorithm #robust #set
- Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges (BAJ, GRR), pp. 547–552.
- SAC-2001-Julstrom #encoding
- Encoding rectilinear Steiner trees as lists of edges (BAJ), pp. 356–360.
- SAC-2001-JulstromR #algorithm #graph #problem
- Weight-biased edge-crossover in evolutionary algorithms for wto graph problems (BAJ, GRR), pp. 321–326.
- SAC-2000-RaidlJ #algorithm #problem #search-based
- A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem (GRR, BAJ), pp. 440–445.
- SAC-1999-Julstrom #heuristic #permutation
- Coding TSP Tours as Permutations via an Insertion Heuristic (BAJ), pp. 297–301.
- SAC-1998-CappJ #algorithm #problem #search-based
- A weight-coded genetic algorithm for the minimum weight triangulation problem (KC, BAJ), pp. 327–331.
- SAC-1998-Julstrom #algorithm
- Comparing decoding algorithms in a weight-coded GA for TSP (BAJ), pp. 313–317.
- SAC-1997-Julstrom #adaptation #algorithm #search-based
- Adaptive operator probabilities in a genetic algorithm that applies three operators (BAJ), pp. 233–238.
- SAC-1996-Julstom #algorithm #representation #search-based
- Representing rectilinear Steiner trees in genetic algorithms (BAJ), pp. 245–250.
- SAC-1996-Julstom96a #automaton
- Evolutionary discovery of DFA size and structure (BAJ), pp. 263–268.
- SAC-1995-Julstrom #algorithm #problem #search-based
- Very greedy crossover in a genetic algorithm for the traveling salesman problem (BAJ), pp. 324–328.
- SAC-1994-Julstrom #algorithm #performance #problem #search-based
- Seeding the population: improved performance in a genetic algorithm for the rectilinear Steiner problem (BAJ), pp. 222–226.