default search action
Robert B. Heckendorn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c34]Tami Alghamdi, Robert B. Heckendorn:
An Evolutionary Computation Based Model for Testing Transfer Learning Strategies. CEC 2021: 1380-1389 - [c33]Tami Alghamdi, Robert B. Heckendorn, Terence Soule:
Quantifying the Right Combination of Knowledge and Population Diversity for Transferred Populations. CSCI 2021: 127-133 - 2020
- [c32]Travis D. DeVault, Robert B. Heckendorn, Terence Soule:
Introducing counterexamples to a robotic agent using clicker training. GECCO Companion 2020: 1546-1553
2010 – 2019
- 2018
- [c31]Hasan M. Jamil, Xin Mou, Robert B. Heckendorn, Clinton L. Jeffery, Frederick T. Sheldon, Cassidy S. Hall, Nina M. Peterson:
Authoring Adaptive Digital Computational Thinking Lessons Using vTutor for Web-Based Learning. ICWL 2018: 125-131 - 2017
- [c30]Keith J. Drew, Robert B. Heckendorn, Ahmed Abdel-Rahim, Homaja Pydi Kumar Marisetty, Anton Stalick:
Evolving a real-time evacuation for urban disaster management. GECCO 2017: 1089-1096 - 2016
- [c29]Terence Soule, Barrie D. Robison, Robert B. Heckendorn:
Co-evolution of Sensor Morphology and Behavior. GECCO (Companion) 2016: 135-136 - [c28]Kodi C. A. Cumbo, Samantha Heck, Ian Tanimoto, Travis DeVault, Robert B. Heckendorn, Terence Soule:
Bee-Inspired Landmark Recognition in Robotic Navigation. GECCO (Companion) 2016: 1039-1042 - 2015
- [c27]Travis DeVault, Seth Forrest, Ian Tanimoto, Terence Soule, Robert B. Heckendorn:
Learning from Demonstration for Distributed, Encapsulated Evolution of Autonomous Outdoor Robots. GECCO (Companion) 2015: 1381-1382 - 2012
- [c26]Michael Solomon, Terence Soule, Robert B. Heckendorn:
A comparison of a communication strategies in cooperative learning. GECCO 2012: 153-160 - 2011
- [c25]Terence Soule, Robert B. Heckendorn:
Developmental scalable hierarchies for multi-agent swarms. GECCO (Companion) 2011: 207-208 - 2010
- [c24]Terence Soule, Robert B. Heckendorn:
A developmental algorithm for multi-agent swarms with scalable hierarchies. GECCO 2010: 647-648 - [c23]Terence Soule, Robert B. Heckendorn:
A developmental approach to evolving scalable hierarchies for multi-agent swarms. GECCO (Companion) 2010: 1769-1776
2000 – 2009
- 2009
- [c22]Terence Soule, Robert B. Heckendorn:
Environmental robustness in multi-agent teams. GECCO 2009: 177-184 - [c21]Joshua Rubini, Robert B. Heckendorn, Terence Soule:
Evolution of team composition in multi-agent systems. GECCO 2009: 1067-1074 - [c20]Timothy Meekhof, Terence Soule, Robert B. Heckendorn:
Improving Markov chain classification using string transformations and evolutionary search. GECCO 2009: 1259-1266 - 2008
- [j10]Shude Zhou, Robert B. Heckendorn, Zengqi Sun:
Detecting the epistatic structure of generalized embedded landscape. Genet. Program. Evolvable Mach. 9(2): 125-155 (2008) - [c19]Russell Thomason, Robert B. Heckendorn, Terence Soule:
Training Time and Team Composition Robustness in Evolved Multi-agent Systems. EuroGP 2008: 1-12 - 2007
- [j9]Armand Bankhead, Robert B. Heckendorn:
Using evolvable genetic cellular automata to model breast cancer. Genet. Program. Evolvable Mach. 8(4): 381-393 (2007) - [c18]Shude Zhou, Zengqi Sun, Robert B. Heckendorn:
Extended probe method for linkage discovery over high-cardinality alphabets. GECCO 2007: 1484-1491 - 2006
- [j8]Armand Bankhead, Nancy S. Magnuson, Robert B. Heckendorn:
Gene Knockout Experiments to Quantify a G2/M Genetic Network Simulation for Mammary Cancer Susceptibility. Silico Biol. 6(3): 181-192 (2006) - [c17]Timothy Meekhof, Gary W. Daughdrill, Robert B. Heckendorn:
String transformation-based Bayesian classification or proteins. GECCO 2006: 301-302 - [c16]Shude Zhou, Robert B. Heckendorn, Zengqi Sun:
Generalized Embedded Landscape and Its Decomposed Representation. SEAL 2006: 9-17 - 2005
- [c15]Jason Stevens, Robert B. Heckendorn, Terence Soule:
Exploiting disruption aversion to control code bloat. GECCO 2005: 1605-1612 - [c14]Timothy Meekhof, Robert B. Heckendorn:
Using evolutionary optimization to improve Markov-based classification with limited training data. GECCO 2005: 2211-2212 - 2004
- [j7]Robert B. Heckendorn, Alden H. Wright:
Efficient Linkage Discovery by Limited Probing. Evol. Comput. 12(4): 517-545 (2004) - [c13]Jian Shen, Robert B. Heckendorn:
Discrete Branch Length Representations for Genetic Algorithms in Phylogenetic Search. EvoWorkshops 2004: 94-103 - 2003
- [j6]Kosuke Imamura, Terence Soule, Robert B. Heckendorn, James A. Foster:
Behavioral Diversity and a Probabilistically Optimal GP Ensemble. Genet. Program. Evolvable Mach. 4(3): 235-253 (2003) - [j5]L. Darrell Whitley, Robert B. Heckendorn, Soraya Stevens:
Hyperplane ranking, nonlinearity and the simple genetic algorithm. Inf. Sci. 156(3-4): 123-145 (2003) - [c12]Robert B. Heckendorn, Alden H. Wright:
Efficient Linkage Discovery by Limited Probing. GECCO 2003: 1003-1014 - 2002
- [j4]Robert B. Heckendorn:
Building a Beowulf: Leveraging Research and Department Needs for Student Enrichment via Project Based Learning. Comput. Sci. Educ. 12(4): 255-273 (2002) - [j3]Robert B. Heckendorn:
Embedded Landscapes. Evol. Comput. 10(4): 345-369 (2002) - [j2]Terence Soule, Robert B. Heckendorn:
An Analysis of the Causes of Code Growth in Genetic Programming. Genet. Program. Evolvable Mach. 3(3): 283-309 (2002) - [c11]Kosuke Imamura, Robert B. Heckendorn, Terence Soule, James A. Foster:
N-Version Genetic Programming via Fault Masking. EuroGP 2002: 172-181 - [c10]Robert B. Heckendorn:
Partitioning, Epistasis, and Uncertainty. FOGA 2002: 27-44 - [c9]Kosuke Imamura, Robert B. Heckendorn, Terence Soule, James A. Foster:
Abstention Reduces Errors - decision Abstaining N-version Genetic Programming. GECCO 2002: 796-803 - 2000
- [c8]Robert B. Heckendorn:
Polynomial Time Summary Statistics for Two general Classes of Functions. GECCO 2000: 919-926
1990 – 1999
- 1999
- [j1]Robert B. Heckendorn, L. Darrell Whitley:
Predicting Epistasis from Mathematical Models. Evol. Comput. 7(1): 69-101 (1999) - [c7]Robert B. Heckendorn, Soraya B. Rana, L. Darrell Whitley:
Polynomial Time Summary Statistics for a Generalization of MAXSAT. GECCO 1999: 281-288 - 1998
- [c6]Soraya B. Rana, Robert B. Heckendorn, L. Darrell Whitley:
A Tractable Walsh Analysis of SAT and its Implications for Genetic Algorithms. AAAI/IAAI 1998: 392-397 - [c5]Robert B. Heckendorn, Soraya B. Rana, L. Darrell Whitley:
Test Function Generators as Embedded Landscapes. FOGA 1998: 183-198 - 1997
- [c4]L. Darrell Whitley, Soraya B. Rana, Robert B. Heckendorn:
Island Model genetic Algorithms and Linearly Separable Problems. Evolutionary Computing, AISB Workshop 1997: 109-125 - [c3]Robert B. Heckendorn:
Walsh Functions and Predicting Problem Complexity. ICANNGA 1997: 179-182 - [c2]Robert B. Heckendorn, L. Darrell Whitley:
A Walsh Analysis of NK-Landscapes. ICGA 1997: 41-48 - 1996
- [c1]Robert B. Heckendorn, L. Darrell Whitley, Soraya B. Rana:
Nonlinearity, Hyperplane Ranking and the Simple Genetic Algorithm. FOGA 1996: 181-201
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-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint