Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Bryant A. Julstrom
St. Cloud State University, St. Cloud, MN, USA
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 63 matches
- 2012
- Bryant A. Julstrom:
Clans and cooperation in the iterated prisoner's dilemma. GECCO (Companion) 2012: 1463-1464 - Bryant A. Julstrom:
Naive and heuristic permutation-coded genetic algorithms for the quadratic knapsack problem. GECCO (Companion) 2012: 1465-1466 - Michael Porta, Bryant A. Julstrom:
Evolving instances of unconstrained binary quadratic programming that challenge a tabu search heuristic. GECCO (Companion) 2012: 639-640 - 2010
- Justin Benjamin, Bryant A. Julstrom:
Breaking ties with secondary fitness in a genetic algorithm for the bin packing problem. GECCO 2010: 657-664 - 2009
- Bryant A. Julstrom:
Greedy heuristics for the bounded diameter minimum spanning tree problem. ACM J. Exp. Algorithmics 14 (2009) - Bryant A. Julstrom:
Evolving heuristically difficult instances of combinatorial problems. GECCO 2009: 279-286 - Bryant A. Julstrom:
Evolutionary codings and operators for the terminal assignment problem. GECCO 2009: 1805-1806 - Bryant A. Julstrom:
A data-based coding of candidate strings in the closest string problem. GECCO (Companion) 2009: 2053-2058 - Bryant A. Julstrom:
String- and permutation-coded genetic algorithms for the static weapon-target assignment problem. GECCO (Companion) 2009: 2553-2558 - 2008
- Bryant A. Julstrom:
An evolutionary algorithm for some cases of the single-source constrained plant location problem. GECCO 2008: 607-608 - Arindam Khaled, Bryant A. Julstrom:
Greedy heuristics and evolutionary algorithms for the bounded minimum-label spanning tree problem. GECCO 2008: 611-612 - Bryant A. Julstrom:
Special track on Applications of Evolutionary Computation: editorial message. SAC 2008: 1766 - 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
- Brenda Hinkemeyer, Nicole Januszewski, Bryant A. Julstrom:
An expert system for evaluating Siberian Huskies. Expert Syst. Appl. 30(2): 282-289 (2006) - 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) - 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 - Amanda Hiley, Bryant A. Julstrom:
The quadratic multiple knapsack problem and three heuristic approaches to it. GECCO 2006: 547-552 - Brenda Hinkemeyer, Bryant A. Julstrom:
A genetic algorithm for the longest common subsequence problem. GECCO 2006: 609-610 - Jeremiah Nummela, Bryant A. Julstrom:
An effective genetic algorithm for the minimum-label spanning tree problem. GECCO 2006: 553-558 - Bryant A. Julstrom, Brenda Hinkemeyer:
Starting from Scratch: Growing Longest Common Subsequences with Evolution. PPSN 2006: 930-938 - Bryant A. Julstrom:
Editorial message: track on applications of evolutionary computation. SAC 2006: 939 - 2005
- 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 - Bryant A. Julstrom:
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem. GECCO 2005: 607-614 - Jeremiah Nummela, Bryant A. Julstrom:
Evolving petri nets to represent metabolic pathways. GECCO 2005: 2133-2139 - 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 - Bryant A. Julstrom:
Editorial message: special track on applications of evolutionary computation. SAC 2005: 905-906 - 2004
- Bryant A. Julstrom:
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys. GECCO (1) 2004: 1272-1281 - Bryant A. Julstrom, Athos Antoniades:
Three Evolutionary Codings of Rectilinear Steiner Arborescences. GECCO (1) 2004: 1282-1291 - Mark A. Renslow, Brenda Hinkemeyer, Bryant A. Julstrom:
How Are We Doing? Predicting Evolutionary Algorithm Performance. GECCO (2) 2004: 82-89 - Bryant A. Julstrom:
Editorial message: special track on evolutionary computation and optimization. SAC 2004: 973-974
skipping 33 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-04-23 03:02 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint