Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBryant A. Julstrom
Person information
- affiliation: St. Cloud State University, St. Cloud, MN, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[c54]Michael Porta, Bryant A. Julstrom:
Evolving instances of unconstrained binary quadratic programming that challenge a tabu search heuristic. GECCO (Companion) 2012: 639-640- [c53]Bryant A. Julstrom:
Clans and cooperation in the iterated prisoner's dilemma. GECCO (Companion) 2012: 1463-1464 - [c52]Bryant A. Julstrom:
Naive and heuristic permutation-coded genetic algorithms for the quadratic knapsack problem. GECCO (Companion) 2012: 1465-1466 - 2010
- [c51]Justin Benjamin, Bryant A. Julstrom:
Breaking ties with secondary fitness in a genetic algorithm for the bin packing problem. GECCO 2010: 657-664
2000 – 2009
- 2009
- [j8]Bryant A. Julstrom:
Greedy heuristics for the bounded diameter minimum spanning tree problem. ACM J. Exp. Algorithmics 14 (2009) - [c50]Bryant A. Julstrom:
Evolving heuristically difficult instances of combinatorial problems. GECCO 2009: 279-286 - [c49]Bryant A. Julstrom:
Evolutionary codings and operators for the terminal assignment problem. GECCO 2009: 1805-1806 - [c48]Bryant A. Julstrom:
A data-based coding of candidate strings in the closest string problem. GECCO (Companion) 2009: 2053-2058 - [c47]Bryant A. Julstrom:
String- and permutation-coded genetic algorithms for the static weapon-target assignment problem. GECCO (Companion) 2009: 2553-2558 - 2008
- [c46]Bryant A. Julstrom:
An evolutionary algorithm for some cases of the single-source constrained plant location problem. GECCO 2008: 607-608 - [c45]Arindam Khaled, Bryant A. Julstrom:
Greedy heuristics and evolutionary algorithms for the bounded minimum-label spanning tree problem. GECCO 2008: 611-612 - [c44]Bryant A. Julstrom:
Special track on Applications of Evolutionary Computation: editorial message. SAC 2008: 1766 - [p1]Bryant A. Julstrom:
A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 295-307 - 2006
- [j7]Brenda Hinkemeyer, Nicole Januszewski, Bryant A. Julstrom:
An expert system for evaluating Siberian Huskies. Expert Syst. Appl. 30(2): 282-289 (2006) - [j6]Günther R. Raidl, Gabriele Koller, Bryant A. Julstrom:
Biased Mutation Operators for Subgraph-Selection Problems. IEEE Trans. Evol. Comput. 10(2): 145-156 (2006) - [c43]Amanda Hiley, Bryant A. Julstrom:
The quadratic multiple knapsack problem and three heuristic approaches to it. GECCO 2006: 547-552 - [c42]Jeremiah Nummela, Bryant A. Julstrom:
An effective genetic algorithm for the minimum-label spanning tree problem. GECCO 2006: 553-558 - [c41]Brenda Hinkemeyer, Bryant A. Julstrom:
A genetic algorithm for the longest common subsequence problem. GECCO 2006: 609-610 - [c40]Jason Amunrud, Bryant A. Julstrom:
Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming. GECCO 2006: 1395-1396 - [c39]Bryant A. Julstrom, Brenda Hinkemeyer:
Starting from Scratch: Growing Longest Common Subsequences with Evolution. PPSN 2006: 930-938 - [c38]Bryant A. Julstrom:
Editorial message: track on applications of evolutionary computation. SAC 2006: 939 - 2005
- [c37]Bryant A. Julstrom:
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem. GECCO 2005: 585-590 - [c36]Bryant A. Julstrom:
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem. GECCO 2005: 607-614 - [c35]Jeremiah Nummela, Bryant A. Julstrom:
Evolving petri nets to represent metabolic pathways. GECCO 2005: 2133-2139 - [c34]Bryant A. Julstrom:
Editorial message: special track on applications of evolutionary computation. SAC 2005: 905-906 - [c33]Jeffrey S. Goettl, Alexander W. Brugh, Bryant A. Julstrom:
Call me e-mail: arranging the keyboard with a permutation-coded genetic algorithm. SAC 2005: 947-951 - 2004
- [c32]Mark A. Renslow, Brenda Hinkemeyer, Bryant A. Julstrom:
How Are We Doing? Predicting Evolutionary Algorithm Performance. GECCO (2) 2004: 82-89 - [c31]Bryant A. Julstrom:
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys. GECCO (1) 2004: 1272-1281 - [c30]Bryant A. Julstrom, Athos Antoniades:
Three Evolutionary Codings of Rectilinear Steiner Arborescences. GECCO (1) 2004: 1282-1291 - [c29]Bryant A. Julstrom:
Editorial message: special track on evolutionary computation and optimization. SAC 2004: 973-974 - [c28]Bryant A. Julstrom, Athos Antoniades:
Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem. SAC 2004: 980-984 - 2003
- [j5]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) - [c27]Bryant A. Julstrom:
Evolutionary Algorithms for Two Problems from the Calculus of Variations. GECCO 2003: 2402-2403 - [c26]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 - [c25]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 - [c24]Rita M. Hare, Bryant A. Julstrom:
A Genetic Algorithm for Restricted Cases of the Rectilinear Steiner Problem with Obstacles. VLSI 2003: 292-297 - 2002
- [c23]Bryant A. Julstrom:
A scalable genetic algorithm for the rectilinear Steiner problem. IEEE Congress on Evolutionary Computation 2002: 1169-1173 - [c22]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 - [c21]Bryant A. Julstrom:
Two Genetic Algorithms for the Leaf-Constrained Minimum Spanning Tree Problem. IC-AI 2002: 853-859 - [c20]Bryant A. Julstrom:
A Genetic Algorithm and Two Hill-Climbers for the Minimum Routing Cost Spanning Tree Problem. IC-AI 2002: 934-940 - [c19]Bryant A. Julstrom:
Applying Local Search n a Genetic Algorithm for the 4-Cycle Problem. IC-AI 2002: 941- - [c18]Günther R. Raidl, Gabriele Kodydek, Bryant A. Julstrom:
On Weight-Biased Mutation for Graph Problems. PPSN 2002: 204-213 - [c17]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
- [c16]Bryant A. Julstrom, Günther R. Raidl:
Weight-biased edge-crossover in evolutionary algorithms for wto graph problems. SAC 2001: 321-326 - [c15]Bryant A. Julstrom:
Encoding rectilinear Steiner trees as lists of edges. SAC 2001: 356-360 - 2000
- [c14]Bryant A. Julstrom, David H. Robinson:
Simulating exponential normalization with weighted k-tournaments. CEC 2000: 227-231 - [c13]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
1990 – 1999
- 1999
- [c12]Bryant A. Julstrom:
It's all the same to me: revisiting rank-based probabilities and tournaments. CEC 1999: 1501-1505 - [c11]Bryant A. Julstrom:
Coding TSP Tours as Permutations via an Insertion Heuristic. SAC 1999: 297-301 - 1998
- [c10]Bryant A. Julstrom:
Comparing decoding algorithms in a weight-coded GA for TSP. SAC 1998: 313-317 - [c9]Kerry Capp, Bryant A. Julstrom:
A weight-coded genetic algorithm for the minimum weight triangulation problem. SAC 1998: 327-331 - 1997
- [c8]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 - [c7]Bryant A. Julstrom:
Adaptive operator probabilities in a genetic algorithm that applies three operators. SAC 1997: 233-238 - 1996
- [j4]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) - [c6]Bryant A. Julstrom:
Representing rectilinear Steiner trees in genetic algorithms. SAC 1996: 245-250 - [c5]Bryant A. Julstrom:
Evolutionary discovery of DFA size and structure. SAC 1996: 263-268 - 1995
- [c4]Bryant A. Julstrom:
What Have You Done for Me Lately? Adapting Operator Probabilities in a Steady-State Genetic Algorithm. ICGA 1995: 81-87 - [c3]Bryant A. Julstrom:
Very greedy crossover in a genetic algorithm for the traveling salesman problem. SAC 1995: 324-328 - 1994
- [c2]Bryant A. Julstrom:
Seeding the population: improved performance in a genetic algorithm for the rectilinear Steiner problem. SAC 1994: 222-226 - 1993
- [c1]Bryant A. Julstrom:
A Genetic Algorithm for the Rectilinear Steiner Problem. ICGA 1993: 474-480 - 1992
- [j3]Bryant A. Julstrom:
A bound on the shift function in terms of the Busy Beaver function. SIGACT News 23(3): 100-106 (1992) - [j2]Bryant A. Julstrom:
Slow sorting: a whimsical inquiry. ACM SIGCSE Bull. 24(3): 11-13 (1992)
1980 – 1989
- 1985
- [j1]Bryant A. Julstrom, Robert J. Baron:
A Model of Mental Imagery. Int. J. Man Mach. Stud. 23(3): 313-334 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
