| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Justin Benjamin, Bryant A. Julstrom |
Breaking ties with secondary fitness in a genetic algorithm for the bin packing problem.  |
GECCO  |
2010 |
DBLP DOI BibTeX RDF |
secondary fitness, tie breaking, genetic algorithm, bin packing, tournament selection |
| 1 | Bryant A. Julstrom |
Greedy heuristics for the bounded diameter minimum spanning tree problem. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bryant A. Julstrom |
String- and permutation-coded genetic algorithms for the static weapon-target assignment problem. |
GECCO (Companion) |
2009 |
DBLP DOI BibTeX RDF |
maximum marginal return, weapon-target assignment problem, representations, coding, permutations |
| 1 | Bryant A. Julstrom |
Evolutionary codings and operators for the terminal assignment problem. |
GECCO |
2009 |
DBLP DOI BibTeX RDF |
string coding, permutations, operators, terminal assignment problem |
| 1 | Bryant A. Julstrom |
A data-based coding of candidate strings in the closest string problem. |
GECCO (Companion) |
2009 |
DBLP DOI BibTeX RDF |
closest string problem, data-based coding, genetic algorithm |
| 1 | Bryant A. Julstrom |
Evolving heuristically difficult instances of combinatorial problems. |
GECCO |
2009 |
DBLP DOI BibTeX RDF |
evolving difficult instances, problem instances, quadratic knapsack problem, heuristics |
| 1 | Bryant A. Julstrom |
A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem. |
Recent Advances in Evolutionary Computation for Combinatorial Optimization |
2008 |
DBLP DOI BibTeX RDF |
Greedy Decoder, Warehouse Location, Plant Location, Heuristics, Facility Location, Permutation Coding |
| 1 | Bryant A. Julstrom |
An evolutionary algorithm for some cases of the single-source constrained plant location problem. |
GECCO |
2008 |
DBLP DOI BibTeX RDF |
plant location, warehouse location, evolutionary algorithm, facility location, capacitated, single-source, permutation coding |
| 1 | Arindam Khaled, Bryant A. Julstrom |
Greedy heuristics and evolutionary algorithms for the bounded minimum-label spanning tree problem. |
GECCO |
2008 |
DBLP DOI BibTeX RDF |
bounded labels, labeled spanning trees, genetic algorithms, local search, greedy heuristics |
| 1 | Bryant A. Julstrom |
Special track on Applications of Evolutionary Computation: editorial message. |
SAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Brenda Hinkemeyer, Nicole Januszewski, Bryant A. Julstrom |
An expert system for evaluating Siberian Huskies. |
Expert Syst. Appl. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Günther R. Raidl, Gabriele Koller, Bryant A. Julstrom |
Biased Mutation Operators for Subgraph-Selection Problems. |
IEEE Trans. Evolutionary Computation |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Bryant A. Julstrom, Brenda Hinkemeyer |
Starting from Scratch: Growing Longest Common Subsequences with Evolution. |
PPSN |
2006 |
DBLP DOI BibTeX RDF |
initially empty solutions, genetic algorithm, Longest common subsequence |
| 1 | Amanda Hiley, Bryant A. Julstrom |
The quadratic multiple knapsack problem and three heuristic approaches to it. |
GECCO |
2006 |
DBLP DOI BibTeX RDF |
quadratic multiple knapsack problem, genetic algorithm, knapsack problems, greedy heuristic, hill-climber |
| 1 | Brenda Hinkemeyer, Bryant A. Julstrom |
A genetic algorithm for the longest common subsequence problem. |
GECCO |
2006 |
DBLP DOI BibTeX RDF |
genetic algorithm, strings, longest common subsequence |
| 1 | Jason Amunrud, Bryant A. Julstrom |
Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming. |
GECCO |
2006 |
DBLP DOI BibTeX RDF |
binary quadratic programming, case injection, instance similarity, population seeding |
| 1 | Jeremiah Nummela, Bryant A. Julstrom |
An effective genetic algorithm for the minimum-label spanning tree problem. |
GECCO |
2006 |
DBLP DOI BibTeX RDF |
labeled spanning trees, spanning subgraphs, genetic algorithms, local search, greedy heuristics |
| 1 | Bryant A. Julstrom |
Editorial message: track on applications of evolutionary computation. |
SAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremiah Nummela, Bryant A. Julstrom |
Evolving petri nets to represent metabolic pathways. |
GECCO |
2005 |
DBLP DOI BibTeX RDF |
genetic algorithms, petri nets, metabolic pathways, evolutionary search |
| 1 | Bryant A. Julstrom |
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem. |
GECCO |
2005 |
DBLP DOI BibTeX RDF |
greedy operators, quadratic knapsack problem, genetic algorithms |
| 1 | Bryant A. Julstrom |
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem. |
GECCO |
2005 |
DBLP DOI BibTeX RDF |
blob code, edge-sets, routing cost, codings, spanning trees |
| 1 | Bryant A. Julstrom |
Editorial message: special track on applications of evolutionary computation. |
SAC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeffrey S. Goettl, Alexander W. Brugh, Bryant A. Julstrom |
Call me e-mail: arranging the keyboard with a permutation-coded genetic algorithm. |
SAC |
2005 |
DBLP DOI BibTeX RDF |
keyboard design, genetic algorithms, permutation coding |
| 1 | Mark A. Renslow, Brenda Hinkemeyer, Bryant A. Julstrom |
How Are We Doing? Predicting Evolutionary Algorithm Performance. |
GECCO |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Bryant A. Julstrom, Athos Antoniades |
Three Evolutionary Codings of Rectilinear Steiner Arborescences. |
GECCO |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Bryant A. Julstrom |
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys. |
GECCO |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Bryant A. Julstrom, Athos Antoniades |
Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem. |
SAC |
2004 |
DBLP DOI BibTeX RDF |
Rectilinear Steiner arborescence, perturbation coding, genetic algorithm, permutation coding |
| 1 | Bryant A. Julstrom |
Editorial message: special track on evolutionary computation and optimization. |
SAC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Günther R. Raidl, Bryant A. Julstrom |
Edge sets: an effective evolutionary coding of spanning trees. |
IEEE Trans. Evolutionary Computation |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Bryant A. Julstrom |
Evolutionary Algorithms for Two Problems from the Calculus of Variations. |
GECCO |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rita M. Hare, Bryant A. Julstrom |
A Genetic Algorithm for Restricted Cases of the Rectilinear Steiner Problem with Obstacles. |
VLSI |
2003 |
DBLP BibTeX RDF |
|
| 1 | Günther R. Raidl, Bryant A. Julstrom |
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. |
SAC |
2003 |
DBLP BibTeX RDF |
|
| 1 | Rita M. Hare, Bryant A. Julstrom |
A Spanning Tree-Based Genetic Algorithm for Some Instances of the Rectilinear Steiner Problem with Obstacles. |
SAC |
2003 |
DBLP BibTeX RDF |
|
| 1 | Günther R. Raidl, Gabriele Kodydek, Bryant A. Julstrom |
On Weight-Biased Mutation for Graph Problems. |
PPSN |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Bryant A. Julstrom |
Manipulating Valid Solutions in a Genetic Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. |
GECCO Late Breaking Papers |
2002 |
DBLP BibTeX RDF |
|
| 1 | Bryant A. Julstrom |
Two Genetic Algorithms for the Leaf-Constrained Minimum Spanning Tree Problem. |
IC-AI |
2002 |
DBLP BibTeX RDF |
|
| 1 | Bryant A. Julstrom |
A Genetic Algorithm and Two Hill-Climbers for the Minimum Routing Cost Spanning Tree Problem. |
IC-AI |
2002 |
DBLP BibTeX RDF |
|
| 1 | Bryant A. Julstrom |
Applying Local Search n a Genetic Algorithm for the 4-Cycle Problem. |
IC-AI |
2002 |
DBLP BibTeX RDF |
|
| 1 | Bryant A. Julstrom, Günther R. Raidl |
Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges. |
SAC |
2002 |
DBLP DOI BibTeX RDF |
random spanning trees, sets of edges, spanning trees, initialization |
| 1 | Bryant A. Julstrom, Günther R. Raidl |
Weight-biased edge-crossover in evolutionary algorithms for wto graph problems. |
SAC |
2001 |
DBLP DOI BibTeX RDF |
constrained minimum spanning trees, cost-based heuristics, traveling salesman problem, crossover, graph problems |
| 1 | Bryant A. Julstrom |
Encoding rectilinear Steiner trees as lists of edges. |
SAC |
2001 |
DBLP DOI BibTeX RDF |
Prüfer numbers, evolutionary codings, lists of edges, weighted codings, rectilinear Steiner trees |
| 1 | Günther R. Raidl, Bryant A. Julstrom |
A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. |
SAC |
2000 |
DBLP BibTeX RDF |
|
| 1 | Bryant A. Julstrom |
Coding TSP Tours as Permutations via an Insertion Heuristic. |
SAC |
1999 |
DBLP DOI BibTeX RDF |
insertion heuristics, traveling salesman problem, permutation coding |
| 1 | Kerry Capp, Bryant A. Julstrom |
A weight-coded genetic algorithm for the minimum weight triangulation problem. |
SAC |
1998 |
DBLP DOI BibTeX RDF |
the minimum weight triangulation problem, weighted codings, computational geometry, triangulations |
| 1 | Bryant A. Julstrom |
Comparing decoding algorithms in a weight-coded GA for TSP. |
SAC |
1998 |
DBLP DOI BibTeX RDF |
insertion heuristics, the traveling salesman problem, weighted codings, decoding algorithms |
| 1 | Bryant A. Julstrom |
Effects of Contest Length and Noise on Reciprocal Altruism, Cooperation, and Payoffs in the Iterated Prisoner's Dilemma. |
ICGA |
1997 |
DBLP BibTeX RDF |
|
| 1 | Bryant A. Julstrom |
Adaptive operator probabilities in a genetic algorithm that applies three operators. |
SAC |
1997 |
DBLP DOI BibTeX RDF |
adaptive operator probabilities, more than two operators, rectilinear Steiner problem |
| 1 | Amir M. Ben-Amram, Bryant A. Julstrom, Uri Zwick |
A Note on Busy Beavers and Other Creatures. |
Mathematical Systems Theory |
1996 |
DBLP BibTeX RDF |
|
| 1 | Bryant A. Julstrom |
Representing rectilinear Steiner trees in genetic algorithms. |
SAC |
1996 |
DBLP DOI BibTeX RDF |
genetic encodings, trees, spanning, rectilinear Steiner trees |
| 1 | Bryant A. Julstrom |
Evolutionary discovery of DFA size and structure. |
SAC |
1996 |
DBLP DOI BibTeX RDF |
genetic encoding, evaluation, DFAs, genetic operators |
| 1 | Bryant A. Julstrom |
What Have You Done for Me Lately? Adapting Operator Probabilities in a Steady-State Genetic Algorithm. |
ICGA |
1995 |
DBLP BibTeX RDF |
|
| 1 | Bryant A. Julstrom |
Very greedy crossover in a genetic algorithm for the traveling salesman problem. |
SAC |
1995 |
DBLP DOI BibTeX RDF |
genetic algorithms, traveling salesman problem, crossover operators |
| 1 | Bryant A. Julstrom |
Seeding the population: improved performance in a genetic algorithm for the rectilinear Steiner problem. |
SAC |
1994 |
DBLP DOI BibTeX RDF |
rectilinear Steiner problem, seeding the population, genetic algorithms, combinatorial optimization |
| 1 | Bryant A. Julstrom |
A Genetic Algorithm for the Rectilinear Steiner Problem. |
ICGA |
1993 |
DBLP BibTeX RDF |
|
| 1 | Bryant A. Julstrom, Robert J. Baron |
A Model of Mental Imagery. |
International Journal of Man-Machine Studies |
1985 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")