Bryant A. Julstrom

64 papers A 15B 3C 1Misc 22Journal 8Unranked 14

Year	Rank	Type	Title / Venue / Authors
2012	—	`conf`	Clans and cooperation in the iterated prisoner's dilemma. GECCO (Companion) Bryant A. Julstrom
2012	—	`conf`	Evolving instances of unconstrained binary quadratic programming that challenge a tabu search heuristic. GECCO (Companion) Michael Porta, Bryant A. Julstrom
2012	—	`conf`	Naive and heuristic permutation-coded genetic algorithms for the quadratic knapsack problem. GECCO (Companion) Bryant A. Julstrom
2010	A	`conf`	Breaking ties with secondary fitness in a genetic algorithm for the bin packing problem. GECCO Justin Benjamin, Bryant A. Julstrom
2009	—	`conf`	A data-based coding of candidate strings in the closest string problem. GECCO (Companion) Bryant A. Julstrom
2009	A	`conf`	Evolutionary codings and operators for the terminal assignment problem. GECCO Bryant A. Julstrom
2009	A	`conf`	Evolving heuristically difficult instances of combinatorial problems. GECCO Bryant A. Julstrom
2009	J	`jnl`	Greedy heuristics for the bounded diameter minimum spanning tree problem. ACM J. Exp. Algorithmics Bryant A. Julstrom
2009	—	`conf`	String- and permutation-coded genetic algorithms for the static weapon-target assignment problem. GECCO (Companion) Bryant A. Julstrom
2008	—	`ch.`	A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem. Recent Advances in Evolutionary Computation for Combinatorial Optimization Bryant A. Julstrom
2008	A	`conf`	An evolutionary algorithm for some cases of the single-source constrained plant location problem. GECCO Bryant A. Julstrom
2008	A	`conf`	Greedy heuristics and evolutionary algorithms for the bounded minimum-label spanning tree problem. GECCO Arindam Khaled, Bryant A. Julstrom
2008	Misc	`conf`	Special track on Applications of Evolutionary Computation: editorial message. SAC Bryant A. Julstrom
2006	A	`conf`	A genetic algorithm for the longest common subsequence problem. GECCO Brenda Hinkemeyer, Bryant A. Julstrom
2006	A	`conf`	An effective genetic algorithm for the minimum-label spanning tree problem. GECCO Jeremiah Nummela, Bryant A. Julstrom
2006	J	`jnl`	An expert system for evaluating Siberian Huskies. Expert Syst. Appl. Brenda Hinkemeyer, Nicole Januszewski, Bryant A. Julstrom
2006	J	`jnl`	Biased Mutation Operators for Subgraph-Selection Problems. IEEE Trans. Evol. Comput. Günther R. Raidl, Gabriele Koller, Bryant A. Julstrom
2006	Misc	`conf`	Editorial message: track on applications of evolutionary computation. SAC Bryant A. Julstrom
2006	A	`conf`	Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming. GECCO Jason Amunrud, Bryant A. Julstrom
2006	A	`conf`	Starting from Scratch: Growing Longest Common Subsequences with Evolution. PPSN Bryant A. Julstrom, Brenda Hinkemeyer
2006	A	`conf`	The quadratic multiple knapsack problem and three heuristic approaches to it. GECCO Amanda Hiley, Bryant A. Julstrom
2005	Misc	`conf`	Call me e-mail: arranging the keyboard with a permutation-coded genetic algorithm. SAC Jeffrey S. Goettl, Alexander W. Brugh, Bryant A. Julstrom
2005	Misc	`conf`	Editorial message: special track on applications of evolutionary computation. SAC Bryant A. Julstrom
2005	A	`conf`	Evolving petri nets to represent metabolic pathways. GECCO Jeremiah Nummela, Bryant A. Julstrom
2005	A	`conf`	Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem. GECCO Bryant A. Julstrom
2005	A	`conf`	The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem. GECCO Bryant A. Julstrom
2004	Misc	`conf`	Editorial message: special track on evolutionary computation and optimization. SAC Bryant A. Julstrom
2004	—	`conf`	Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys. GECCO (1) Bryant A. Julstrom
2004	—	`conf`	How Are We Doing? Predicting Evolutionary Algorithm Performance. GECCO (2) Mark A. Renslow, Brenda Hinkemeyer, Bryant A. Julstrom
2004	—	`conf`	Three Evolutionary Codings of Rectilinear Steiner Arborescences. GECCO (1) Bryant A. Julstrom, Athos Antoniades
2004	Misc	`conf`	Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem. SAC Bryant A. Julstrom, Athos Antoniades
2003	—	`conf`	A Genetic Algorithm for Restricted Cases of the Rectilinear Steiner Problem with Obstacles. VLSI Rita M. Hare, Bryant A. Julstrom
2003	Misc	`conf`	A Spanning Tree-Based Genetic Algorithm for Some Instances of the Rectilinear Steiner Problem with Obstacles. SAC Rita M. Hare, Bryant A. Julstrom
2003	J	`jnl`	Edge sets: an effective evolutionary coding of spanning trees. IEEE Trans. Evol. Comput. Günther R. Raidl, Bryant A. Julstrom
2003	A	`conf`	Evolutionary Algorithms for Two Problems from the Calculus of Variations. GECCO Bryant A. Julstrom
2003	Misc	`conf`	Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. SAC Günther R. Raidl, Bryant A. Julstrom
2002	Misc	`conf`	A Genetic Algorithm and Two Hill-Climbers for the Minimum Routing Cost Spanning Tree Problem. IC-AI Bryant A. Julstrom
2002	B	`conf`	A scalable genetic algorithm for the rectilinear Steiner problem. IEEE Congress on Evolutionary Computation Bryant A. Julstrom
2002	Misc	`conf`	Applying Local Search n a Genetic Algorithm for the 4-Cycle Problem. IC-AI Bryant A. Julstrom
2002	Misc	`conf`	Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges. SAC Bryant A. Julstrom, Günther R. Raidl
2002	—	`conf`	Manipulating Valid Solutions in a Genetic Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. GECCO Late Breaking Papers Bryant A. Julstrom
2002	A	`conf`	On Weight-Biased Mutation for Graph Problems. PPSN Günther R. Raidl, Gabriele Kodydek, Bryant A. Julstrom
2002	Misc	`conf`	Two Genetic Algorithms for the Leaf-Constrained Minimum Spanning Tree Problem. IC-AI Bryant A. Julstrom
2001	Misc	`conf`	Encoding rectilinear Steiner trees as lists of edges. SAC Bryant A. Julstrom
2001	Misc	`conf`	Weight-biased edge-crossover in evolutionary algorithms for wto graph problems. SAC Bryant A. Julstrom, Günther R. Raidl
2000	—	`conf`	A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. SAC (1) Günther R. Raidl, Bryant A. Julstrom
2000	B	`conf`	Simulating exponential normalization with weighted k-tournaments. CEC Bryant A. Julstrom, David H. Robinson
1999	Misc	`conf`	Coding TSP Tours as Permutations via an Insertion Heuristic. SAC Bryant A. Julstrom
1999	B	`conf`	It's all the same to me: revisiting rank-based probabilities and tournaments. CEC Bryant A. Julstrom
1998	Misc	`conf`	A weight-coded genetic algorithm for the minimum weight triangulation problem. SAC Kerry Capp, Bryant A. Julstrom
1998	Misc	`conf`	Comparing decoding algorithms in a weight-coded GA for TSP. SAC Bryant A. Julstrom
1997	Misc	`conf`	Adaptive operator probabilities in a genetic algorithm that applies three operators. SAC Bryant A. Julstrom
1997	C	`conf`	Design of vector quantization codebooks using a genetic algorithm. ICEC Yiaowei Zheng, Bryant A. Julstrom, Weidong Cheng
1997	—	`conf`	Effects of Contest Length and Noise on Reciprocal Altruism, Cooperation, and Payoffs in the Iterated Prisoner's Dilemma. ICGA Bryant A. Julstrom
1996	J	`jnl`	A Note on Busy Beavers and Other Creatures. Math. Syst. Theory Amir M. Ben-Amram, Bryant A. Julstrom, Uri Zwick
1996	Misc	`conf`	Evolutionary discovery of DFA size and structure. SAC Bryant A. Julstrom
1996	Misc	`conf`	Representing rectilinear Steiner trees in genetic algorithms. SAC Bryant A. Julstrom
1995	Misc	`conf`	Very greedy crossover in a genetic algorithm for the traveling salesman problem. SAC Bryant A. Julstrom
1995	—	`conf`	What Have You Done for Me Lately? Adapting Operator Probabilities in a Steady-State Genetic Algorithm. ICGA Bryant A. Julstrom
1994	Misc	`conf`	Seeding the population: improved performance in a genetic algorithm for the rectilinear Steiner problem. SAC Bryant A. Julstrom
1993	—	`conf`	A Genetic Algorithm for the Rectilinear Steiner Problem. ICGA Bryant A. Julstrom
1992	J	`jnl`	A bound on the shift function in terms of the Busy Beaver function. SIGACT News Bryant A. Julstrom
1992	J	`jnl`	Slow sorting: a whimsical inquiry. ACM SIGCSE Bull. Bryant A. Julstrom
1985	J	`jnl`	A Model of Mental Imagery. Int. J. Man Mach. Stud. Bryant A. Julstrom, Robert J. Baron