James A. Foster

DG Research Group Publications as of 2004 (to be updated soon)

This page is out of date. I'm working on a dynamic version. Patience, grasshopper

For a full list of publications, see my CV. Publications here are organized as:

bullet Refereed
bullet Short Refereed
bullet Book Chapters and Reviews
bullet Peer Reviewed
bullet Selected UI Technical Reports
bullet Theses and Dissertations
bullet Other manuscripts

Refereed

  1. 1. C. Shyu, Sheneman, L., and James A. Foster (2004) Evolutionary computation for multiple sequence alignment, Genetic Programming and Evolvable Machines, Kluwer, 5(2) pp 121-144.
  2. L. Sheneman and James A. Foster (2004) Evolving better multiple sequence alignments. Proc. Genetic and Evolutionary Computing Conference (GECCO), Springer Verlag, K. Deb et al., eds, Lecture Notes in Computer Science, Volume 3102, pp. 449-460.
  3. Harrison, M. and James A. Foster (2004) Co-evolving faults to improve the fault tolerance of sorting networks. Proc. European conference on genetic programming, Springer Verlag, Lecture Notes in Computer Science, M. Keijzer, U.M. O’Reilly, S. M. Lucas, E. Costa, and T. Soule, Eds, Volume 3003, pp 57-66.
  4. Harrison, M. and James A. Foster (2004) Improving the Survivability of a Simple Evolved Circuit through Co-evolution. Proc. NASA/DoD Conference on Evolvable Hardware, IEEE Press, R. Zebulum , D. Gwaltney, G. Horbny, D. Keymeulen, J. Lohn, A. Stoica, Eds, pp 123-129.
  5. Imamura, K., T. Soule, R. B. Heckendorn, J. A. Foster (2003) "Behavioral Diversity and a Probabilistically Optimal GP Ensemble," Genetic Programming and Evolvable Machines, Kluwer, 4:235-253.
  6. Shyu, C. and James A. Foster. Evolving consensus sequence for multiple sequence alignment with a genetic algorithm, Proc. Genetic and Evolutionary Computing Conference (GECCO), July 2003, Springer-Verlag, pp. 2298-2309
  7. Imamura, K., R. B. Heckendorn, T. Soule, J. A. Foster, N-version genetic programming via fault masking, Genetic Programming: Proc. 5th European Conference, EuroGP 2002, Lecture Notes in Computer Science, 2278, Springer-Verlag, 172-181, 2002.

  8. Meysenburg, M. M., D. Hoelting, D. McElvain, and J. A. Foster, How random generator quality impacts genetic algorithm performance, Proc. Int. Conf. On Genetic and Evol. Comp. (GECCO), Morgan Kaufmann, pp. 480-483, 2002.

  9. Imamura, K., J. A. Foster, Abstention reduces errors?decision abstaining N-version genetic programming, Proc. Int. Conf. On Genetic and Evol. Comp. (GECCO), Morgan Kaufmann, 796-803, 2002.

  10. Rylander, B., T. Soule, J. A. Foster, and J. Alves-Foss, Quantum evolutionary programming, Proc. Int. Conf. On Genetic and Evol. Comp. (GECCO), Morgan Kaufmann, pp. 1005-1011, Morgan Kaufmann, 2001.

  11. Imamura, K. and J. A. Foster, Fault-tolerant hardware through n-version genetic programming. Proc. 5th World Multiconference on Systemics, Cybernetics and Informatics (SCI 2001).

  12. Foster, J.A. Evolutionary computation, Nature Genetics Reviews, vol 2, pp. 428-436 June, 2001.

  13. Rylander, B., T. Soule and J. A. Foster, Computational complexity, genetic programming, and implications, Genetic Programming: Proc. 4th European Conference, EuroGP 2001, Lecture Notes in Computer Science, 2038, Springer-Verlag, 348-360, 2001.

  14. Rylander, B. and J. A. Foster, Computational complexity and genetic algorithms. Advances in Fuzzy Systems and Evolutionary Computation, Artificial Intelligence Series, Nikos E. Mastorakis, ed., World Scientific and Engineering Society Press, pp. 248-253, 2001.

  15. Rylander, B. and J. A. Foster, Genetic algorithms and hardness. Advances in Fuzzy Systems and Evolutionary Computation, Artificial Intelligence Series, Nikos E. Mastorakis, ed., World Scientific and Engineering Society Press, pp. 323-329, 2001.

  16. Hunter S. Snevily and James A. Foster. The 2-pebbling property and a conjecture of graham?s. Graphs and Combinatorics, 16, pp. 231?344, 2000.

  17. Kosuke Imamura, James A. Foster and Axel Krings. The test vector problem and limitations to evolving digital circuits. Proc. NASA/DoD Workshop on Evolvable Hardware (EH), IEEE Press, pp. 75?80, 2000.

  18. Jason Masner, John Cavalieri, James Frenzel, and James A. Foster. Size versus robustness in evolved sorting networks: is bigger better? Proc. NASA/DoD Workshop on Evolvable Hardware (EH), IEEE Press, pp. 81?90, 2000.

  19. Gerard Kian-Meng Goh and James A. Foster. Evolving Molecules for Drug Design Using Genetic Algorithms via Molecular Trees. Proc. Int. Conf. on Genetic and Evol. Comp. (GECCO), Morgan Kaufmann, pp. 27?33, 2000.

  20. Joe Dumoulin, Steve McGrew, Jim Frenzel and James A. Foster. Special purpose image convolution with evolvable hardware. Proc. Int. Workshop on Evolvable Image and Digital Signal Processing, Lecture notes in computer science no. 1803, Eds. Stefano Cagnoni, et al. Springer-Verlag, pp. 1?11, 2000.

  21. Jason Masner, John Cavalieri, James Frenzel, and James A. Foster. Representation and robustness for evolved sorting networks. Proc. NASA/DoD Workshop on Evolvable Hardware (EH), IEEE press, pp. 255?261, 1999,

  22. William B. Langdon, Terry Soule, Riccardo Poli and James A. Foster. The evolution of size and shape. Advances in Genetic Programming (AIGP), Lee Spector, William B. Langdon, Una-May O?Reilly, and Peter J. Angeline, eds. MIT Press, pp. 162?191, 1999.

  23. Ashley Morris, James A. Foster, and Frederick E. Petry. Providing support for multiple collection types in a fuzzy object oriented spatial data model. Proc. Int. Conf. North American Fuzzy Inf. Proc. Soc. (AFIPS), IEEE Press, 1999.

  24. John Determan and James A. Foster. Using chaos in genetic algorithms. Proc. Int. Congress on Evol. Comp. (CEC), IEEE press, pp. 2094?2101, 1999.

  25. Mark Meysenburg and James A. Foster. Random number generator and GA performance revisited. Proc. Int. Conf. on Genetic and Evol. Comp. (GECCO), Morgan Kaufmann, pp. 425?432, 1999.

  26. Mark Meysenburg and James A. Foster. Random number generator and GP performance. Proc. Int. Conf. on Genetic and Evol. Comp. (GECCO), Morgan Kaufmann, pp. 1121--1126, 1999.

  27. Terence Soule and James A. Foster. Limiting code growth in genetic programming. J. Evolutionary Computation, 6:4, 293?310, 1998.

  28. William F. Danielson III, James A. Foster, and Deborah Frincke. GABSyS: Using genetic algorithms to breed a combustion engine. Proc. Int. Conf. on Evolutionary Computing (CEC), IEEE Press, 1998.

  29. Jamie Marconi and James A. Foster. Finding cliques in Keller graphs with genetic algorithms. Proc. Int. Conf. on Evolutionary Computing (CEC), IEEE Press, 1998.

  30. Jacqueline Shoaf and James A. Foster. The efficient set GA for stock portfolios. Proc. Int. Conf. on Evolutionary Computing (CEC), IEEE Press, 1998.

  31. Terence Soule and James A. Foster. Removal bias: a new cause of code growth in tree based evolutionary programming. Proc. Int. Conf. on Evolutionary Computing (CEC), IEEE Press, 1998.

  32. Mark M. Meysenburg and James A. Foster. The effect of the quality of pseudo-random number generators on the performance of a simple genetic algorithm. Proc. Int. Conf. on Genetic Algorithms (ICGA), ed. B?ck, Morgan Kaufmann, pp. 276-282, 1997. (This is taken from Meysenburg's thesis)

  33. Terence Soule and James A. Foster. Genetic algorithm hardness measures applied to the maximum clique problem. Proc. Int. Conf. on Genetic Algorithms (ICGA), ed. B?ck, Morgan Kaufmann, pp. 81-88, 1997.

  34. Terence Soule and James A. Foster. Code size and depth flows in genetic programming. Proc. Int. Conf. on Genetic Programming (GP), Koza, Goldberg, Fogel, and Riolo (eds), Morgan Kaufmann, pp. 313-320, 1997.

  35. Jacqueline S. Shoaf and James A. Foster. A Genetic algorithm solution to the efficient set problem: a technique for portfolio selection based on the Markowitz model. Proc. of the 1996 Annual Meeting, Decision Sciences Institute. Vol. II, pages 571-573.

  36. Terence Soule, James A. Foster, and John Dickinson. Code growth in genetic programming. Proc. Genetic Programming (GP), Koza, Goldberg, Fogel, and Riolo ed.s, Morgan Kaufmann, pp. 215-223, 1996.

  37. Terence Soule, James A. Foster, and John Dickinson. Using genetic programming to approximate maximum cliques. Proc. Genetic Programming (GP), Koza, Goldberg, Fogel, and Riolo ed.s, Morgan Kaufmann, pp. 400-405, 1996.

  38. James Clough, James A. Foster, Michael Barnett, and Holly Wichman. Computer simulation of transposable element evolution: Random template and strict master models. J. Mol. Evol., 42:52-58, 1996.

  39. James A. Foster, Paul W. Oman, Karen Van Houten, and Weiguo Zhu. Using self-delimiting strings to represent trees. Congressus Numerantium, 107:5-22, July 1995.

  40. James A. Foster. Exploring the polynomial hierarchy with generic sets. J. Computing and Info., pages 166-183, July 1995. (Presented at Int. Conf. on Computing and Information.)

  41. James A. Foster, Michael Barnett, Karen Van Houten, and Luke Sheneman. (In-)Formal methods: Teaching program derivation via the Moore method. Computer Science Education, 6(1), pp. 67-91, 1995.

  42. Paul W. Oman, Karen Van Houten, and James A. Foster. Representing arbitrary trees as self-delimiting binary strings. Congressus Numerantium, 96:47-56, December 1993.

  43. James A. Foster. The generic oracle hypothesis is false. Info. Proc. Letters, 45:59-62, 26 February 1993.

Short Refereed

  1. C. Shyu, J.A. Foster, L.J. Forney. Electronic Polymerase Chain Reaction (EPCR) Search Algorithm. Proc. IEEE 1st Bioinformatics Conference, p. 338, 2002.

  2. C. Shyu, J.A. Foster, K. Liao, S.J. Bent, K. Sale, L.J. Forney, T. Soule. MiCA: Microbial Community Analysis, Proc. IEEE 1st Bioinformatics Conference, p. 341, 2002.

  3. Meysenburg, M. M., D. Hoelting, D. McElvain, and J. A. Foster, A genetic algorithm-specific test of random generator quality, Proc. Int. Conf. On Genetic and Evol. Comp. (GECCO), Morgan Kaufmann, 691, 2002.

  4. Imamura, K., J. A. Foster, Fault-tolerant computing with N-version genetic programming, Proc. Int. Conf. On Genetic and Evol. Comp. (GECCO), Morgan Kaufmann, 178, Morgan Kaufmann, 2001.

  5. Determan, J., and J. A. Foster, A genetic algorithm for expert system rule generation, Proc. Int. Conf. On Genetic and Evol. Comp. (GECCO), Morgan Kaufmann, 757, Morgan Kaufmann, 2001.

  6. Bart Rylander and James A. Foster. GA hard problems. Proc. Int. Conf. On Genetic and Evol. Comp. (GECCO), Morgan Kaufmann, p. 367, 2000.

  7. Bart Rylander, Terence Soule and James A. Foster. Quantum evolutionary computation. Proc. Int. Conf. On Genetic and Evol. Comp. (GECCO), Morgan Kaufmann, p. 373, 2000.

  8. Brad Harvey, Deborah Frincke, and James A. Foster. Toward byte code genetic programming. Proc. Int. Congress on Genetic and Evol. Comp. (CEC), p. 1234, 1999.

  9. James A. Foster, Paul Oman, and Karen Van Houten. A highly compact representation of tree structures (abstract). Proceedings of the Data Compression Conference, page 453, March 1993.

Books

  1. Foster, J.A., E. Lutton, J. Miller, C. Ryan, and A. G. B. Tettamanzi (eds.), Genetic programming: 5th European conference, EuroGP 2002, Springer Verlag, LNCS 2278, 2002.

Book Chapters and Reviews

  1. Foster, J.A. Discipulus: the first commercial genetic programming system, invited publication in J. Genetic Programming and Evolvable Hardware. 2:2, pp. 201?203, 2001.

  2. James A. Foster. Evolutionary Computing. To appear in Encyclopedia of Distributed Computing.*

  3. James A. Foster and Michael Barnett. Moore formal methods in the classroom: A how-to manual. In M. Hinchey and N. Dean, editors, Teaching and Learning Formal Methods. Academic Press, pp. 79-98, 1996.*

  4. James A. Foster. Real security. Critical Inquiry, 1(1), 1980. (Book review of Real Security by Richard Barnett.*)

Peer Reviewed

  1. . Shyu, C., J.A. Foster, K. Liao, S.J. Bent, K. Sale, L.J. Forney, T. Soule. Computational Methods for the Analysis of Microbial Community Structure and Composition. Proc. American Society of Microbiologists (ASM), p. 461, 2002.

  2. C. Shyu, J.A. Foster, K. Liao, S.J. Bent, K. Sale, L.J. Forney, T. Soule. Microbial Community Analysis (MiCA): Web-Based Computational Tools for the Analysis of Microbial Community Structure and Composition Based on Terminal Restriction Fragment Length Polymorphism (T-RFLP) of 16S rDNA genes. Proc. American Society of Microbiologists (ASM), p. 462, 2002.

  3. Lawrence W. Lass, D. C. Thill, B. Shafii, W. Price, and James A. Foster. Protected spatial data exchange from multiple data sources using the World Wide Web. In Proceedings of the 1998 meeting of the Weed Sciences Society of America, 1998.

  4. Brad Harvey, James A. Foster, Deborah Frincke. Byte code Genetic Programming. Late Breaking Papers at GP98, J. Koza, ed., pp. 59?63, 1998.

  5. James A. Foster. The generic oracle hypothesis fails. In Waldemar W. Koczkodaj, Peter E. Lauer, and Anestis A. Toptsis, editors, International Conference on Computing and Information, pages 75-78. IEEE, May 1992.*

  6. James A. Foster. Structure in complexity theory. Bulletin of the European Association for Theoretical Computer Science, 46:239-47, February 1992.*

  7. James A. Foster. Differential geometry on fractal manifolds. The Journal of Chaos and Graphics, 2(30), August 1987.*

  8. James A. Foster. The formal incomprehensibility of the creation stories in genesis. Illinois Libertarian, 1978.*

  9. James A. Foster. The greatness which was Greece. Inquiry, 1(1), 1979.*

Thesis and Dissertations

  1. Bart Rylander. Computational Complexity and the Genetic Algorithm. Thesis for Ph.D. in Computer Science, awarded 31 August, 2001.
  2. Brad Harvey. Byte Code genetic Programming and its Application to Data Mining. Thesis for M.S. in Computer Science, awarded 1999.
  3. Mark A. Pokorny. direct Encodings for Genetic Neural Network Design. Thesis for M.S. in Computer Science, awarded 1998.
  4. Jacqueline S. Shoaf. Indirect Solution Representation in Genetic Algorithms with an Application to the Efficient Set Problem. Thesis for M.S. in Computer Science, awarded 1998.
  5. Terence Soule. Code Growth in Genetic Programming. Thesis for Ph.D. in Computer Science, awarded 16 May 1998.
  6. Mark M. Meysenburg. The Effect of the Quality of Pseudo-Random Number Generators on the Performance of a Simple Genetic Algorithm. Thesis for M.S. in Computer Science, awarded 19 May, 1997. University of Idaho.
  7. Breeding a Two Stroke Engine. Thesis for M.S. in Computer Science, awarded 19 May, 1997. University of Idaho.

Selected UI Technical Reports

  1. Terence Soule, James A. Foster, and John Dickinson. Limiting program size in genetic programming. Technical Report LAL 96-2, University of Idaho, Moscow, ID 83844-1010, January 1996.

  2. Terence Soule, James A. Foster, and John Dickinson. Using genetic programming to find maximum cliques. Technical Report LAL 96-3, University of Idaho, Moscow, ID 83844-1010, January 1996.

  3. James A. Foster and Terence Soule. Using genetic algorithms to find maximum cliques. Technical Report LAL 95-12, University of Idaho, Moscow, ID 83844-1010, August 1995. Revised version published.

  4. James Clough, R. Wesley Ireland, Michael Barnett, and James A. Foster. Transposable element simulator: Technical documentation. Technical Report LAL 95-11, University of Idaho, Dept. of Computer Science, Moscow, ID 83844-1010, August 1995.

  5. James A. Foster. Genetic algorithm hardness and approximation complexity: A research agenda. Technical Report TR-LAL-95-04, University of Idaho, Department of Computer Science, Moscow, ID 83844-1010, May 1995.

  6. Hunter S. Snevily and James A. Foster. The 2-pebbling property and a conjecture of graham's. Technical Report LAL 95-03, University of Idaho, Moscow, ID 83844-1010, September 1995. Revised version published.

  7. James A. Foster and Steven Fenner. NPCVt ?c NPSVt if disjoint pairs of Co-NP sets are P-separable. Technical Report LAL 95-01, University of Idaho, Moscow, ID 83844-1010, January 1995.

  8. James A. Foster, Michael Barnett, Karen Van Houten, and Luke Sheneman. (In-)Formal methods: Teaching program derivation via the Moore method. Technical Report LAL 94-01, University of Idaho, Moscow, ID 83844-1010, September 1994. Revised version published.

  9. James A. Foster, Paul W. Oman, Karen Van Houten, and Weiguo Zhu. Using self delimiting strings to represent trees. Technical report CS 92-06, U. of Idaho, October 1992. Revised version published.

  10. James A. Foster. The generic oracle hypothesis is false. Technical Report TR 92-04, University of Idaho, Department of Computer Science; Moscow, Id 83855, January 1992. Revised version published.

  11. James A. Foster. A note on relativized counting classes. Technical Report TR 91-10, University of Idaho, October 1991.

  12. James A. Foster. Dense properties and generic witnesses for PH. Technical Report TR 91-09, University of Idaho, Department of Computer Science; Moscow, Id 83855, January 1991.

  13. James A. Foster. Introduction to predicate logic. Technical Report CS-JAF-89-1, Illinois Institute of Technology, 1989.

  14. James A. Foster. Models of space-bounded relativization. Technical Report CS-JAF-89-2, Illinois Institute of Technology, 1989.

Other manuscripts

  1. Brad Harvey, James A. Foster, Deborah Frincke Byte Code Genetic Programming. In Late Breaking Papers, Int. Conf. on Genetic Programming, 1998, pp. 59-63. J. Koza, ed.

Last Updated Sunday, 27-apr-08 21:18