share record
persistent URL:
Bryant A. Julstrom , Athos Antoniades : Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem. SAC 2004 : 980-984 2003 share record
persistent URL:
Günther R. Raidl , Bryant A. Julstrom : Edge sets: an effective evolutionary coding of spanning trees. IEEE Trans. Evol. Comput. 7 (3 ) : 225-239 (2003 )share record
persistent URL:
Bryant A. Julstrom : Evolutionary Algorithms for Two Problems from the Calculus of Variations. GECCO 2003 : 2402-2403 share record
persistent URL:
Rita M. Hare , Bryant A. Julstrom : A Spanning Tree-Based Genetic Algorithm for Some Instances of the Rectilinear Steiner Problem with Obstacles. SAC 2003 : 725-729 share record
persistent URL:
Günther R. Raidl , Bryant A. Julstrom : Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. SAC 2003 : 747-752 share record
persistent URL:
Rita M. Hare , Bryant A. Julstrom : A Genetic Algorithm for Restricted Cases of the Rectilinear Steiner Problem with Obstacles. VLSI 2003 : 292-297 2002 share record
persistent URL:
Bryant A. Julstrom : A scalable genetic algorithm for the rectilinear Steiner problem. IEEE Congress on Evolutionary Computation 2002 : 1169-1173 share record
persistent URL:
Bryant A. Julstrom : Manipulating Valid Solutions in a Genetic Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. GECCO Late Breaking Papers 2002 : 247-254 share record
persistent URL:
Bryant A. Julstrom : Two Genetic Algorithms for the Leaf-Constrained Minimum Spanning Tree Problem. IC-AI 2002 : 853-859 share record
persistent URL:
Bryant A. Julstrom : A Genetic Algorithm and Two Hill-Climbers for the Minimum Routing Cost Spanning Tree Problem. IC-AI 2002 : 934-940 share record
persistent URL:
Bryant A. Julstrom : Applying Local Search n a Genetic Algorithm for the 4-Cycle Problem. IC-AI 2002 : 941- share record
persistent URL:
Günther R. Raidl , Gabriele Kodydek , Bryant A. Julstrom : On Weight-Biased Mutation for Graph Problems. PPSN 2002 : 204-213 share record
persistent URL:
Bryant A. Julstrom , Günther R. Raidl : Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges. SAC 2002 : 547-552 2001 share record
persistent URL:
Bryant A. Julstrom : Encoding rectilinear Steiner trees as lists of edges. SAC 2001 : 356-360 share record
persistent URL:
Bryant A. Julstrom , Günther R. Raidl : Weight-biased edge-crossover in evolutionary algorithms for wto graph problems. SAC 2001 : 321-326 2000 share record
persistent URL:
Bryant A. Julstrom , David H. Robinson : Simulating exponential normalization with weighted k-tournaments. CEC 2000 : 227-231 share record
persistent URL:
Günther R. Raidl , Bryant A. Julstrom : A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. SAC (1) 2000 : 440-445 1999 share record
persistent URL:
Bryant A. Julstrom : It's all the same to me: revisiting rank-based probabilities and tournaments. CEC 1999 : 1501-1505 share record
persistent URL:
Bryant A. Julstrom : Coding TSP Tours as Permutations via an Insertion Heuristic. SAC 1999 : 297-301 1998 share record
persistent URL:
Kerry Capp , Bryant A. Julstrom : A weight-coded genetic algorithm for the minimum weight triangulation problem. SAC 1998 : 327-331 share record
persistent URL:
Bryant A. Julstrom : Comparing decoding algorithms in a weight-coded GA for TSP. SAC 1998 : 313-317 1997 share record
persistent URL:
Bryant A. Julstrom : Effects of Contest Length and Noise on Reciprocal Altruism, Cooperation, and Payoffs in the Iterated Prisoner's Dilemma. ICGA 1997 : 386-392 share record
persistent URL:
Bryant A. Julstrom : Adaptive operator probabilities in a genetic algorithm that applies three operators. SAC 1997 : 233-238 1996 export record
dblp key:
journals/mst/Ben-AmramJZ96 share record
persistent URL:
Amir M. Ben-Amram , Bryant A. Julstrom , Uri Zwick : A Note on Busy Beavers and Other Creatures. Math. Syst. Theory 29 (4 ) : 375-386 (1996 )share record
persistent URL:
Bryant A. Julstrom : Representing rectilinear Steiner trees in genetic algorithms. SAC 1996 : 245-250 share record
persistent URL:
Bryant A. Julstrom : Evolutionary discovery of DFA size and structure. SAC 1996 : 263-268 1995 share record
persistent URL:
Bryant A. Julstrom : What Have You Done for Me Lately? Adapting Operator Probabilities in a Steady-State Genetic Algorithm. ICGA 1995 : 81-87 share record
persistent URL:
Bryant A. Julstrom : Very greedy crossover in a genetic algorithm for the traveling salesman problem. SAC 1995 : 324-328 1994 share record
persistent URL:
Bryant A. Julstrom : Seeding the population: improved performance in a genetic algorithm for the rectilinear Steiner problem. SAC 1994 : 222-226 1993 share record
persistent URL:
Bryant A. Julstrom : A Genetic Algorithm for the Rectilinear Steiner Problem. ICGA 1993 : 474-480