Workshop Chair: 
Cezary Z. Janikow - UMSL 

ProgramCommittee: 
David Andre 
- Berkeley 
Thomas Bäck 
- ICD (Germany) and Leiden Univ. (NL) 
Catalin Buiu 
- Politech. Bucharest 
Anna Buczak 
- AlliedSingal, Inc. 
Hugh Cartwright 
- Oxford Univ. 
Dipankar Dasgupta 
- Univ. of Memphis 
Kenneth DeJong 
- GMU & NRL 
David Fogel 
- Natural Selection 
David Goldberg 
- Univ. of Illinois 
Thomas Haynes 
- Wichita Sate 
Christian Jacob 
- Univ. of Erlangen (Germany)
Robert E. Keller
- Dortmund Univ.
John Koza 
- Stanford 
Bill Langdon 
- Univ. of Birmingham 
Michael Lee 
- INSEAD (France) and Berkeley 
Sushil Louis 
- UNR 
Zbigniew Michalewicz 
- UNCC 
Alan Schultz 
- NRL 
Daniel St. Clair 
- UMR 
Franciszek Seredynski 
- Polish Acad. Sci. 
Ron Shonkwiler 
- GATECH 
Astro Teller 
- CMU 
Michael Vose 
- UT 

JCIS Coordinator: 
Xiliang Gu - DUKE 

General JCIS Chair: 
Paul P. Wang - DUKE 
FEA'98 - Second International Workshop on 
FRONTIERS IN EVOLUTIONARY ALGORITHMS

Research Triangle Park, North Carolina 
October 24-28, 1998 

This conference is a part of theFourth Joint Conference on Information Systems (http://www.ee.duke.edu/JCIS98), which includes seven related conferences/workshops, with the following plenary speakers: 
 

James Anderson Panos J. Antsaklis John Baillieul David Fogel
Walter Freeman Stephen Grossberg Yu Chi Ho Thomas S. Huang
George J. Klir Teuvo Kohonen John Koza Richard G. Palmer
Zdzislaw Pawlak Azriel Rosenfeld Julius T. Tou I. Burhan Turksen
Paul J. Werbos A.K.C. Wong Lotfi A. Zadeh Hans J. Zimmerman

The main focus of FEA'98 is on applications of evolutionary algorithms, especially in new areas or utilizing new ideas, and on theoretical developments aimed at practical applications. This workshop will include plenary presentations (joint with JCIS), regular sessions as well as contributory invited sessions.

  • Evolutionary algorithms 
    • genetic algorithms 
    • genetic programming 
    • evolutionary programming
    • evolution strategies
  • Application areas
    • fuzzy rules and fuzzy controllers
    • machine learning
    • neural networks
    • parameter optimization
    • scheduling
    • other current or innovative application areas
  • Frontiers in design, analysis, applications
    • new representations
    • new operators 
    • new application areas 
    • self-tuning and self-adaptation 
    • constraints lgorithm analysis 
    • parallelization 
    • hybrid algorithms and designs .
For regular sessions, submit a 4-page extended summary (3 copies). For contributory sessions, submit your proposed topic and the number of anticipated participants you wish to invite (about 3-5 per session). All accepted summaries will appear in the Proceedings. Long papers may also be submitted (at the conference) for review to Information Sciences, an International Journal (Elsevier) and/or special-edition books. Send submissions/proposals/inquiries to:  Deadline for both summaries and session proposals is June 1, 1998. Paper acceptance notifications will be sent by Aug. 1, 1998. Summaries should not exceed 4 pages of 10pt, double-column, single-spaced text, including tables/figures. There is a charge of $100/page for additional pages to be published in the Proceedings. All authors, from regular submissions as well as those invited by session organizers, will be required to deposit $160 by Aug. 23, 1998, to secure publication (credited toward registration). Final versions due Sept. 10, 1998. Information Sciences LaTeX style (http://www.cs.umsl.edu/Faculty/janikow/FEA/ins.sty)and guide(http://www.cs.umsl.edu/Faculty/janikow/FEA/insguide.tex) files are available. Consult http://www.cs.umsl.edu/Faculty/janikow/FEA or http://www.ee.duke.edu/JCIS98 for more info.