The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bryant A. Julstrom: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jason Amunrud, Bryant A. Julstrom
    Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming. [Citation Graph (0, 0)][DBLP]
    GECCO, 2006, pp:1395-1396 [Conf]
  2. Amanda Hiley, Bryant A. Julstrom
    The quadratic multiple knapsack problem and three heuristic approaches to it. [Citation Graph (0, 0)][DBLP]
    GECCO, 2006, pp:547-552 [Conf]
  3. Brenda Hinkemeyer, Bryant A. Julstrom
    A genetic algorithm for the longest common subsequence problem. [Citation Graph (0, 0)][DBLP]
    GECCO, 2006, pp:609-610 [Conf]
  4. Bryant A. Julstrom
    Manipulating Valid Solutions in a Genetic Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    GECCO Late Breaking Papers, 2002, pp:247-254 [Conf]
  5. Bryant A. Julstrom
    Evolutionary Algorithms for Two Problems from the Calculus of Variations. [Citation Graph (0, 0)][DBLP]
    GECCO, 2003, pp:2402-2403 [Conf]
  6. Bryant A. Julstrom
    Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys. [Citation Graph (0, 0)][DBLP]
    GECCO (1), 2004, pp:1272-1281 [Conf]
  7. Bryant A. Julstrom
    The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem. [Citation Graph (0, 0)][DBLP]
    GECCO, 2005, pp:585-590 [Conf]
  8. Bryant A. Julstrom
    Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem. [Citation Graph (0, 0)][DBLP]
    GECCO, 2005, pp:607-614 [Conf]
  9. Bryant A. Julstrom, Athos Antoniades
    Three Evolutionary Codings of Rectilinear Steiner Arborescences. [Citation Graph (0, 0)][DBLP]
    GECCO (1), 2004, pp:1282-1291 [Conf]
  10. Jeremiah Nummela, Bryant A. Julstrom
    Evolving petri nets to represent metabolic pathways. [Citation Graph (0, 0)][DBLP]
    GECCO, 2005, pp:2133-2139 [Conf]
  11. Jeremiah Nummela, Bryant A. Julstrom
    An effective genetic algorithm for the minimum-label spanning tree problem. [Citation Graph (0, 0)][DBLP]
    GECCO, 2006, pp:553-558 [Conf]
  12. Mark A. Renslow, Brenda Hinkemeyer, Bryant A. Julstrom
    How Are We Doing? Predicting Evolutionary Algorithm Performance. [Citation Graph (0, 0)][DBLP]
    GECCO (2), 2004, pp:82-89 [Conf]
  13. Bryant A. Julstrom
    Two Genetic Algorithms for the Leaf-Constrained Minimum Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    IC-AI, 2002, pp:853-859 [Conf]
  14. Bryant A. Julstrom
    A Genetic Algorithm and Two Hill-Climbers for the Minimum Routing Cost Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    IC-AI, 2002, pp:934-940 [Conf]
  15. Bryant A. Julstrom
    Applying Local Search n a Genetic Algorithm for the 4-Cycle Problem. [Citation Graph (0, 0)][DBLP]
    IC-AI, 2002, pp:941-0 [Conf]
  16. Bryant A. Julstrom
    A Genetic Algorithm for the Rectilinear Steiner Problem. [Citation Graph (0, 0)][DBLP]
    ICGA, 1993, pp:474-480 [Conf]
  17. Bryant A. Julstrom
    What Have You Done for Me Lately? Adapting Operator Probabilities in a Steady-State Genetic Algorithm. [Citation Graph (0, 0)][DBLP]
    ICGA, 1995, pp:81-87 [Conf]
  18. Bryant A. Julstrom
    Effects of Contest Length and Noise on Reciprocal Altruism, Cooperation, and Payoffs in the Iterated Prisoner's Dilemma. [Citation Graph (0, 0)][DBLP]
    ICGA, 1997, pp:386-392 [Conf]
  19. Bryant A. Julstrom, Brenda Hinkemeyer
    Starting from Scratch: Growing Longest Common Subsequences with Evolution. [Citation Graph (0, 0)][DBLP]
    PPSN, 2006, pp:930-938 [Conf]
  20. Günther R. Raidl, Gabriele Kodydek, Bryant A. Julstrom
    On Weight-Biased Mutation for Graph Problems. [Citation Graph (0, 0)][DBLP]
    PPSN, 2002, pp:204-213 [Conf]
  21. Kerry Capp, Bryant A. Julstrom
    A weight-coded genetic algorithm for the minimum weight triangulation problem. [Citation Graph (0, 0)][DBLP]
    SAC, 1998, pp:327-331 [Conf]
  22. Jeffrey S. Goettl, Alexander W. Brugh, Bryant A. Julstrom
    Call me e-mail: arranging the keyboard with a permutation-coded genetic algorithm. [Citation Graph (0, 0)][DBLP]
    SAC, 2005, pp:947-951 [Conf]
  23. Rita M. Hare, Bryant A. Julstrom
    A Spanning Tree-Based Genetic Algorithm for Some Instances of the Rectilinear Steiner Problem with Obstacles. [Citation Graph (0, 0)][DBLP]
    SAC, 2003, pp:725-729 [Conf]
  24. Bryant A. Julstrom
    Representing rectilinear Steiner trees in genetic algorithms. [Citation Graph (0, 0)][DBLP]
    SAC, 1996, pp:245-250 [Conf]
  25. Bryant A. Julstrom
    Evolutionary discovery of DFA size and structure. [Citation Graph (0, 0)][DBLP]
    SAC, 1996, pp:263-268 [Conf]
  26. Bryant A. Julstrom
    Encoding rectilinear Steiner trees as lists of edges. [Citation Graph (0, 0)][DBLP]
    SAC, 2001, pp:356-360 [Conf]
  27. Bryant A. Julstrom
    Editorial message: special track on evolutionary computation and optimization. [Citation Graph (0, 0)][DBLP]
    SAC, 2004, pp:973-974 [Conf]
  28. Bryant A. Julstrom
    Editorial message: special track on applications of evolutionary computation. [Citation Graph (0, 0)][DBLP]
    SAC, 2005, pp:905-906 [Conf]
  29. Bryant A. Julstrom
    Editorial message: track on applications of evolutionary computation. [Citation Graph (0, 0)][DBLP]
    SAC, 2006, pp:939- [Conf]
  30. Bryant A. Julstrom
    Seeding the population: improved performance in a genetic algorithm for the rectilinear Steiner problem. [Citation Graph (0, 0)][DBLP]
    SAC, 1994, pp:222-226 [Conf]
  31. Bryant A. Julstrom
    Very greedy crossover in a genetic algorithm for the traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    SAC, 1995, pp:324-328 [Conf]
  32. Bryant A. Julstrom
    Adaptive operator probabilities in a genetic algorithm that applies three operators. [Citation Graph (0, 0)][DBLP]
    SAC, 1997, pp:233-238 [Conf]
  33. Bryant A. Julstrom
    Comparing decoding algorithms in a weight-coded GA for TSP. [Citation Graph (0, 0)][DBLP]
    SAC, 1998, pp:313-317 [Conf]
  34. Bryant A. Julstrom
    Coding TSP Tours as Permutations via an Insertion Heuristic. [Citation Graph (0, 0)][DBLP]
    SAC, 1999, pp:297-301 [Conf]
  35. Bryant A. Julstrom, Athos Antoniades
    Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem. [Citation Graph (0, 0)][DBLP]
    SAC, 2004, pp:980-984 [Conf]
  36. Bryant A. Julstrom, Günther R. Raidl
    Weight-biased edge-crossover in evolutionary algorithms for wto graph problems. [Citation Graph (0, 0)][DBLP]
    SAC, 2001, pp:321-326 [Conf]
  37. Bryant A. Julstrom, Günther R. Raidl
    Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges. [Citation Graph (0, 0)][DBLP]
    SAC, 2002, pp:547-552 [Conf]
  38. Günther R. Raidl, Bryant A. Julstrom
    A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    SAC (1), 2000, pp:440-445 [Conf]
  39. Günther R. Raidl, Bryant A. Julstrom
    Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    SAC, 2003, pp:747-752 [Conf]
  40. Rita M. Hare, Bryant A. Julstrom
    A Genetic Algorithm for Restricted Cases of the Rectilinear Steiner Problem with Obstacles. [Citation Graph (0, 0)][DBLP]
    VLSI, 2003, pp:292-297 [Conf]
  41. Brenda Hinkemeyer, Nicole Januszewski, Bryant A. Julstrom
    An expert system for evaluating Siberian Huskies. [Citation Graph (0, 0)][DBLP]
    Expert Syst. Appl., 2006, v:30, n:2, pp:282-289 [Journal]
  42. Bryant A. Julstrom, Robert J. Baron
    A Model of Mental Imagery. [Citation Graph (0, 0)][DBLP]
    International Journal of Man-Machine Studies, 1985, v:23, n:3, pp:313-334 [Journal]
  43. Amir M. Ben-Amram, Bryant A. Julstrom, Uri Zwick
    A Note on Busy Beavers and Other Creatures. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:4, pp:375-386 [Journal]
  44. Günther R. Raidl, Bryant A. Julstrom
    Edge sets: an effective evolutionary coding of spanning trees. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Evolutionary Computation, 2003, v:7, n:3, pp:225-239 [Journal]
  45. Günther R. Raidl, Gabriele Koller, Bryant A. Julstrom
    Biased Mutation Operators for Subgraph-Selection Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Evolutionary Computation, 2006, v:10, n:2, pp:145-156 [Journal]

  46. An evolutionary algorithm for some cases of the single-source constrained plant location problem. [Citation Graph (, )][DBLP]


  47. Greedy heuristics and evolutionary algorithms for the bounded minimum-label spanning tree problem. [Citation Graph (, )][DBLP]


  48. Evolving heuristically difficult instances of combinatorial problems. [Citation Graph (, )][DBLP]


  49. Evolutionary codings and operators for the terminal assignment problem. [Citation Graph (, )][DBLP]


  50. A data-based coding of candidate strings in the closest string problem. [Citation Graph (, )][DBLP]


  51. String- and permutation-coded genetic algorithms for the static weapon-target assignment problem. [Citation Graph (, )][DBLP]


  52. Breaking ties with secondary fitness in a genetic algorithm for the bin packing problem. [Citation Graph (, )][DBLP]


  53. Special track on Applications of Evolutionary Computation: editorial message. [Citation Graph (, )][DBLP]


Search in 0.033secs, Finished in 0.036secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002