Genetic Algorithms Digest Monday, November 6, 2000 Volume 14 : Issue 16 - Do NOT send email or reply to gadistr@aic.nrl.navy.mil - Send submissions (articles) to GA-List@aic.nrl.navy.mil - Send administrative requests (subscribe, unsubscribe, change of address, etc.,) to GA-List-Request@aic.nrl.navy.mil ********************************************************************** You can access back issues, GA code, conference announcements, etc., either through the WWW at http://www.aic.nrl.navy.mil/galist/ or through anonymous ftp at ftp.aic.nrl.navy.mil [132.250.84.25] in /pub/galist. ********************************************************************** Today's Topics: - Administrivia - EC in Environmental and Water resources Engineering - Post-doc available - Genetic Algorithms for Stock Market Prediction Applications - GA-List archive database updated - handling constraints in a non-convex solution space - Call For Papers: EvoIASP2001 - ANNOUNCE: Drone 2.90.0 - CFP: AIME'01, Artificial Intelligence in Medicine - EuroGP2001 Conference and Workshops cfp - SBRN2000 - Registrations are open - Announcing ICML-2001, Call For Papers - Job Announcement - request for info - Ph.D program at UMC - GECCO-2001 Call For Papers, Announcement - 2 (new) Immediate Job Openings at Genetic Programming Inc. - CFP: BRAIN MACHINE, Workshop, 20-22 Dec 2000, Ankara - CFP: EvoCOP - Evonet Workshop on Combinatorial Optimization - METAHEURISTICS, OPTIMIZATION & APPLICATIONS - journal paper - Postdoctoral Fellowships in Complex Studies at the Santa Fe Institute - Announcing a new discussion list: EC2M - Reminder: Autonomous Agents 2001 - Metaheuristics research positions available at IRIDIA, Brussels - MARIE CURIE TRAINING SITE FELLOWSHIPS - Software release: Multiobjective evolutionary synthesis for robotics - paper request - ISAS 2001 - Evol. Comp. and Graph. Models - CFP: EvoSTIM Workshop 2001 - Two new CA rules for density-classification problem evolved by GEP - Congress on Evolutionary Computation, 2001 - Dissertation Announcement - Intelligent Agent Technology (IAT-2001): 2nd CFP - Call For Papers: EvoWorkshops2001 - On-Line Learning Classifier Systems Resources - JOB: Artificial Immune Systems - TARK VIII announcement - Java code for the TSP - Call For Papers: PDPTA + CISST + IC-AI + IC + METMBS - GECCO bibtex proceedings - Intelligent Agent Technology (IAT-2001): 2nd CFP - IPL Special Issue on EC: Deadline postponed - [CFP] Special Session @ CEC2001 - from Abrukov, PI of ONR - Successful application of GA - International Computer Science Conventions - ICML2000 Call for Workshop Proposals - Reminder CFP: Pacific Asia Data Mining Conference (PAKDD-2001) - CFP: EvoCOP - Evonet Workshop on Combinatorial Optimization - Deadline extension: NNA FSFS EC 2001 ------------------------------------------------------------------------------- CALENDAR OF GA-RELATED ACTIVITIES: (with GA-List issue reference) ANNIE2000 Artificial NN in Engineering, St. Louis, MO Nov 5-8, 00 (v14n4) ICSB2000 1st Int Conf on Systems Biology, Tokyo, Japan Nov 14-16, 00 (v14n15) SCCC2000 XX Int Conf Chilean CS Soc - WS Adv & Trends AI Nov 16-18, 00 (v14n12) SBRN2000 VI Braz Symp Neural Networks, Rio de Janeiro Nov 22-25, 00 (v14n12) ICARCV2000 6th Int Conf on Cont/Aut/Rob/Vis, Singapore Dec 6-8, 00 (v13n28) ISA2000 Int Congress on Intell Sys and Appl, Sydney, AU Dec 12-15, 00 (v14n5) KBCS2000 Int Conf on Knowl Based Comp Sys, Mumbai, India Dec 17-19, 00 (v14n9) Brain Machine Workshop, Ankara, Turkey Dec 20-22, 00 (v14n16) NNA2001 Neural Networks & Applications, Canary Is, Spain Feb 11-15, 01 (v14n16) FSFS2001 Fuzzy Sets & Fuzzy Systems, Canary Is, Spain Feb 11-15, 01 (v14n16) EC2001 Evolutionary Computation, Canary Is, Spain Feb 11-15, 01 (v14n16) EMO01 1st Int Con of Evol Multi-Criterion Opt, Zurich Mar 7-9, 01 (v14n4) SAC2001 16th ACM Symp on Applied Computing, Las Vegas Mar 11-14, 01 (v14n14) IWES01 3rd Int WS on Emergent Synthesis, Bled, Slovenia Mar 12-13, 01 (v14n15) CSMR2001 5th Eur Conf on Soft Maint and Reeng, Portugal Mar 14-16, 01 (v14n13) ISAS2001 Int Symp on Adaptive Systems, Havana, Cuba Mar 19-23, 01 (v14n16) ISI2001 Int Congress on Info Science Innovations, Dubai Mar 20-23, 01 (v13n25) PAKDD01 Pacific-Asia Conf on KD and Data Min, Hong Kong Apr 16-18, 01 (v14n15) EUROGP2001 4th Euro Conf on GP, Milan, Italy Apr 18-20, 01 (v14n15) EvoWorkshops2001 at the Euro Conf on GP, Milan, Italy Apr 18, 01 (v14n16) ICANNGA2001 5th Int Conf on Artif NN and GAs, Prague Apr 22-25, 01 (v14n11) CEC2001 Congress on EC, Seoul, Korea May 27-30, 01 (v14n15) Agents2001 5th Int Conf Autonomous Agents, Montreal May 28-Jun 1, 01 (v14n14) IC-AI2001 Int Conf on AI, Las Vegas, NV Jun 25-28, 01 (v14n16) ICML2001 18th Int Conf on Machine Learning, MA Jun 28-Jul 1, 01 (v14n16) AIME01 8th Euro Conf on AI in Medicine, Portugal Jul 1-4, 01 (v14n16) GECCO2001 Gen & Evolutionary Computation Conf, SF, CA Jul 7-11, 01 (v14n16) TARK VIII 8th Conf Theor Aspects of Ratnlty & Knowl, It Jul 8-10, 01 (v14n16) WSC5 5th Online World Conf on Soft Computing Sep 4-18, 01 (v14n14) IAT2001 2nd Asia Pac Conf on Intell Agent Tech, Japan Oct 23-26, 01 (v14n14) ICDM01 IEEE Int Conf on Data Mining, Silicon Valley, Nov 29-Dec 2, 01 (v14n14) Send announcements of other activities to GA-List@aic.nrl.navy.mil. ------------------------------ Date: Mon, 6 Nov 2000 From: GA Digest moderators Subject: Administrivia We are in the process of transferring GA Digest from its current home at the Naval Research Laboratory to a list server at George Mason University. We expect that the administration of the digest will be more efficient after the transfer because many of the tasks that are currently handled manually will become automated. In the meantime, a number of submissions have accumulated as we have not been able to send out a digest for several weeks. In the current issue, we have shortened all conference announcements to allow us to include the entire backlog of submissions. Please refer to the conference Web pages for more information. We apologize for the inconvenience and appreciate your patience as we make the transition to the new system. We will keep you updated on the status of the transfer over the next couple of weeks. Mitchell Potter and Annie Wu GA Digest Moderators ------------------------------ Date: Tue, 29 Aug 2000 14:03:41 -0400 From: Ranji Ranjithan Subject: EC in Environmental and Water resources Engineering Evolutionary Computation in Environmental and Water resources Engineering Environmental & Water Resources Institute (EWRI) 2001 World Water and Environmental Resources Congress Clarion Plaza Hotel, Orlando, Florida, USA, May 20-24, 2001 http://www.asce.org/conferences/wwercongress Session Code: s-eww7 Background Evolutionary computation (EC), an emerging computational paradigm, is continuing to enhance engineering analysis and design capabilities. Applications of EC-based procedures in Environmental and Water Resources Engineering (E&WRE) areas are rapidly growing. A new task committee on this topic is being formed within EWRI, an institute of the American Society of Civil Engineers (ASCE), with the primary goal of disseminating knowledge about EC methodologies and its applications in environmental and water resources engineering, as well as identifying guidelines for its appropriate use in practice. One of the tasks of this committee is focused on bringing together researchers and practitioners in this area to a common forum via technical sessions at conferences. This committee is seeking contributions of abstracts and papers for a series of sessions on EC in EWRE to be held during the next EWRI conference in May 2001. Scope The sessions will focus broadly on the EC-based methodologies and their applications in E&WRE. Papers describing EC-based methods, including genetic algorithms, evolutionary algorithms, evolutionary strategies, multiobjective evolutionary algorithms, genetic programming, discussed in the context of E&WRE, as well as those comparing these methods with other systems analytic approaches are encouraged. In addition, papers describing applications of these methods to realistic problems in E&WRE systems, including groundwater, water distribution, watershed management, air quality management, solid and hazardous waste management, reservoir management, global climate control, hydroinformatics, and storm water management are welcomed. Researchers and practitioners are invited to present and participate in these sessions. ------------------------------ Date: Tue, 29 Aug 2000 13:37:16 -0700 From: Din Chen Subject: Post-doc available Postdoctoral position (1-year) is available to study "Predicting Aquatic Ecosystem Quality using Artificial Neural Networks: Impact of Environmental characteristics on the Structure of Aquatic Communities (Algae, Benthic and Fish Fauna)". This project emphasize the role of community structure and the environmental characteristics to define the quality of aquatic ecosystems. The work focuses essentially on the use of modern modelling technique like artificial neural networks. Applicants must have PhD degree, and experience in artificial neural network modelling in community ecology, computer programming, advanced ecological statistics, ... Interested individuals should send a CV and the names and addresses (including postal and email addresses, fax and telephone numbers) of 2 or 3 referees to: Prof. Sovan LEK, CNRS - UMR 5576 CESAC - Bat. 4R3 Uuniv. Paul Sabatier 118 route de Narbonne 31062 Toulouse cedex France E-mail: lek@cict.fr Tel. : (33) 5 61 55 86 87 Fax : (33) 5 61 55 60 96 ------------------------------ Date: Thu, 31 Aug 2000 13:11:10 +1100 From: "Delasey, Matthew" Subject: Genetic Algorithms for Stock Market Prediction Applications Hi, I have just joined the mailing list. I am from Sydney Australia, am a University student and I have a big interest in the use of quantitative techniques for financial prediction applications. I have learnt how to apply neural networks and fuzzy logic to this area, but am very interested in learning about genetic algorithms and how I can use them. Especially for choosing inputs, optimising the weights of a neural net, and any other useful ideas I (or someone else can suggest) can think of. I would appreciate if someone could help get me started, either by suggesting books or whatever. I use c++ (minimal experience with it) so if anyone has general code or knows where to find it for this application I would appreciate your help. Thanks, Matthew Delasey delasem@cba.com.au m_and_dd@acay.com.au ------------------------------ Date: Tue, 5 Sep 2000 08:44:26 +0200 From: "Ariel Dolan" Subject: GA-List archive database updated The GA-List archive database http://arieldolan.com/maillists/mlmain_ga.asp has been updated (digests v14n13 - v14n15 were added). The general mailing lists database is at http://arieldolan.com/maillists/mlmain.html Ariel Ariel Dolan aridolan@netvision.net.il http://arieldolan.com : My Home Page http://aridolan.com : Artificial Life on the Web http://arieldolan.com/aldb : Alife Database Weblication http://arieldolan.com/ofiles/ga/gaa/gaa.html : Genetic Algorithm Toolkit ------------------------------ Date: Tue, 5 Sep 2000 16:08:44 +0200 (MET DST) From: Sebastien Gyger Subject: handling constraints in a non-convex solution space I use genetic algorithms to search for functions' optima. Constraints are linear and the solution space S is convex. Following chapter 7 of Z. Michalewicz, I am encoding constraints in the representation and developing specific genetic operators. In a second step I am now concerned with a solution space T that is not convex anymore. A typical example is : T = { (x1, x2, x3) such that x1+x2+x3 = 1; x1,2,3 in {0} union [l,u], l Subject: Call For Papers: EvoIASP2001 CALL FOR PAPERS EVOIASP2001 Third European Workshop on Evolutionary Computation in Image Analysis and Signal Processing Lake Como (Milan, Italy), April 20, 2001 EvoIASP is the first European event specifically dedicated to the applications of evolutionary computation (EC) to image analysis and signal processing (IASP) and gives European and non-European researchers in those fields, as well as people from industry, an opportunity to present their latest research and to discuss current developments and applications, besides fostering closer future interaction between members of the three scientific communities. The first editions of the Workshop were held in Goteborg, Sweden, in May 1999 and in Edinburgh, UK, in April 2000. EvoIASP2001 will be held on Lake Como, close to Milan, Italy. The workshop is sponsored by EvoNet, the Network of Excellence in Evolutionary Computing, and is one of the activities of EvoIASP, the EvoNet working group on Evolutionary Computation for Image Analysis and Signal Processing. It will be part of EvoWorkshops2001 and will be held in conjunction with EuroGP2001, the European Conference on Genetic Programming. Topics of interest include, but are not limited to: applications of evolutionary computation to real-life IASP problems, evolvable vision and signal processing hardware, evolutionary pattern recognition, hybrid architectures for machine vision and signal processing including evolutionary components, theoretical developments, comparisons between different evolutionary techniques and between evolutionary and non-evolutionary techniques in IASP applications, financial time series analysis by means of EC techniques. The workshop Proceedings will be published by Springer in the LNCS series. Important Dates: Submission deadline: 16 November 2000 Notification of acceptance: 20 December 2000 Camera ready papers for workshop: 25 January 2001 Workshop: 20 April 2001 For full details about submissions and updated news about the workshop please visit the workshop web page: http://www.ce.unipr.it/evoiasp2001 ------------------------------ Date: Tue, 12 Sep 2000 00:29:47 -0400 (EDT) From: "Theodore C. Belding" Subject: ANNOUNCE: Drone 2.90.0 I am happy to announce the release of Drone 2.90.0. This is a development release; see below for details. Drone 1.03 remains the stable version. WHAT IS DRONE? Drone is a system for automatically running simulation programs in batch mode, either on an arbitrary number of Internet hosts or on a single computer. It allows sweeps over arbitrary sets of parameters, as well as multiple runs for each parameter set, with a separate random seed for each run. It also includes a number of features to help with simulation record keeping, archiving, statistical validation, and replication. WHAT'S NEW Drone 2.90.0 is a complete redesign and reimplementation of Drone for Posix platforms; it is not backwards-compatible. It is designed from the ground up to be more robust, more extendible, more secure, and more efficient than previous versions. It consists of a client and a server communicating using a TCP/IP application protocol called the Drone Protocol (DroneP). DroneP is designed to be implementable on any platform, although the current implementation is for Posix platforms only. All of Drone 2.90.0 is written in ANSI/ISO C. It is fully customizable and scriptable using C, C++, Objective C, Perl, Tcl, Python, Guile, or any other language that can call C functions. REQUIREMENTS Drone 2.90.0 has only been tested on Red Hat Linux 6.x, but it should be easily portable to any other Posix system. (This allegedly includes Windows NT/2000 and MacOS X.) For quickstart instructions on installing the complete Drone system as root using a default set of configuration options, see the file QUICKSTART in the Drone distribution. CURRENT STABLE VERSION The current stable version of Drone is still 1.03. You should use that version if you would just like to try Drone. Drone 2.90.0 is a development release, intended for developers, not end users. The eventual stable release for users will be Drone 3.0.0. While it is usable and works under normal conditions, Drone 2.90.0 is not feature-complete and likely contains many bugs. You should only attempt to run this version if you are comfortable compiling, installing, and debugging software. It may corrupt your hard drive, clog your network, crash your machine, get you fired or expelled, ruin your love life, and give you the marthambles. You have been warned. Caveat utens! LICENSES The programs in the Drone system are licensed under the GNU General Public License (GPL). The libraries are licensed under the GNU Library General Public License (LGPL). AVAILABILITY The Drone home page is at . The Drone project homepage, current stable and development releases, mailing lists, bug tracking system, and source code repository are hosted at SourceForge . Drone 1.03 is at . You can download Drone 2.90.0 at . MAILING LISTS To receive announcements of future Drone releases, please subscribe to the drone-announce email list at . Future announcements will be sent to that list only; it is moderated and low-volume. You may also want to subscribe to the drone-users email list, for questions and discussion related to using Drone: . HACKERS WANTED Patches and bug reports are always welcome. In particular, the following projects are available: - Write your own custom Drone application or script in your language of choice using the libDrone API - Port or reimplement Drone for another platform, such as Windows or MacOS - Wrap the libDrone API in Objective C objects for use within Swarm The Drone CVS source code repository is available for anonymous read-only access through the Drone homepage . -- Ted Belding Ted.Belding@umich.edu University of Michigan Center for the Study of Complex Systems Homepage: http://www-personal.umich.edu/~streak/ PGP key: http://www-personal.umich.edu/~streak/pgp-key.html ------------------------------ Date: Wed, 13 Sep 2000 18:35:10 +0100 From: Pedro Barahona Subject: CFP: AIME'01, Artificial Intelligence in Medicine AIME'01 Eighth European Conference on Artificial Intelligence in Medicine FIRST ANNOUNCEMENT AND PRELIMINARY CALL FOR PAPERS 1- 4 July 2001, Cascais, Portugal The European Society for Artificial Intelligence in Medicine (AIME), established in 1986, aims at fostering fundamental and applied research in the application of Artificial Intelligence techniques to medical care and medical research, providing a forum for reporting significant results achieved at biennial conferences. This conference will be the next of a series of international conferences, held biennially over the last 14 years SCOPE Original contributions are sought regarding the development of theory, techniques, and applications of AI in Medicine, including the evaluation of health care programmes. Contributions to theory may include presentation or analysis of the properties of novel AI methodologies potentially useful to solve medical problems. Papers on techniques should describe the development or the extension of AI methods and their implementation, and discuss the assumptions and limitations of the proposed methods. Application papers should describe the implementation of AI systems to solve significant medical problems, and should present sufficient information to allow evaluation of the practical benefits of the system. The scope includes the following areas: · Knowledge acquisition and its representation, refinement, validation and maintenance · Machine learning and data mining · Decision support systems, including knowledge based systems, neural networks, belief networks, and statistical models · Uncertain, temporal, and case based reasoning · Planning and scheduling · Natural language generation and understanding · Computer vision, image and signal interpretation · Intelligent agents and information retrieval · Telemedicine and knowledge management in intranets and the Internet, including careflow systems · Cognitive modeling Important dates Proposals for tutorials 20 November 2000 Proposals for workshops 20 November 2000 Receipt of full papers 19 January 2001 Notification of acceptance 16 March 2001 Final camera-ready manuscripts 13 April 2001 For full details about submissions and updated news about the conference please visit the web page http://www.centria.fct.unl.pt/conferences/aime01. -- Pedro Barahona | Tel: +351- 21 294 8536 Departamento de Informática | 295 8330 ext.10728 Faculdade de Ciências e Tecnologia | Fax: +351- 21 294 8541 Universidade Nova de Lisboa | e-mail: pb@di.fct.unl.pt 2825-114 Caparica, PORTUGAL ------------------------------ Date: Wed, 13 Sep 2000 18:57:18 +0100 (IST) From: Conor Ryan Subject: EuroGP2001 Conference and Workshops cfp EuroGP 2001 18-20 April 2001 Lake Como (Milan), Italy EuroGP2001 -- 4th European Conference on Genetic Programming Workshop proposal deadline 14 September 2000 Paper submission deadline 16 November 2000 Genetic programming:(noun) 1. a means of automatically generating computer programs to perform certain tasks, in which the principles of Darwinian natural selection are used to drive adaptation and learning. 2. a robust and flexible automated procedure ideally suited for design, pattern recognition and control problems. EuroGP2001:(noun) 1. the largest European event entirely devoted to Genetic Programming. 2. an annual conference frequented by a lively and diverse population of researchers and practitioners. 3. a forum for intellectual exchange - a breeding ground, where ideas recombine and mutate, and where new developments are presented. 4. the next iteration of the GP meta-algorithm. GP applications areas:(phrase) 1. those areas of human activity in which theoretical research into genetic programming has been successfully applied, as for example: financial data mining, robotic and engineering control, signal and image processing, electronic circuit synthesis, bio-informatics, engineering design, music and art. 2. areas that broadly mirror the range of current scientific endeavour - from gene sequencing to satellite imaging and the design of control systems for humanoid robots. human competitive results:(phrase) 1. in the case of genetic programming, results that offer the best available solution, or are equivalent or superior to results produced by humans. 2. for genetic programming an informal benchmark used to establish the effectiveness and utility of the technique. topics of interest:(phrase) 1. fundamental issues within the field of genetic programming, as for example: scalability, code bloat, performance measures, automatic modularisation and code reuse. 2. new theoretical findings. 3. novel applications. previous events:(phrase) 1. EuroGP98 in Paris. 2. EuroGP99 in Goteburg. 3. EuroGP2000 in Edinburgh. www site http://evonet.dcs.napier.ac.uk/eurogp2001/ Important dates: Submission of papers 16 November 2000 Notification of acceptance 20 December 2000 Final copy due 25 January 2001 Conference+workshops 18-20 April 2001 Contacts: Programme co-chairs Julian Miller J.F.Miller@cs.bham.ac.uk Marco Tomassini mtomassi@iissun4.unil.ch Julian Miller School of Computer Science University of Birmingham Birmingham B15 2TT UK Tel: +44 (0)121 414 3710 Fax: +44 (0)121 414 4281 Email: j.miller@cs.bham.ac.uk Marco Tomassini University of Lausanne Science Faculty, Computer Science Institute Lausanne 1015 Switzerland Tel: +41 (0)21 693 2658 Fax: +41 (0)21 693 3705 mtomassi@iissun4.unil.ch ------------------------------ From: "Alexandre Evsukoff" Date: Wed, 13 Sep 2000 02:14:11 EST3EDT Subject: SBRN2000 - Registrations are open SBRN'2000 - VIth BRAZILIAN SYMPOSIUM ON NEURAL NETWORKS http://www.iltc.br/sbrn2000/ Rio de Janeiro, November 22-25, 2000 We would like to invite you to visit our webpage and make your early registration (http://www.iltc.br/sbrn2000/registration.html) after checking out our set of highly interesting tutorials (see preliminary program at http://www.iltc.br/sbrn2000/tutorials.html) Note the SPECIAL UNDERGRADUATE STUDENT registration fees valid only up to SEPTEMBER 30th! Your participation is essencial to the success of SBRN'2000. Please distribute this message to your colleagues. We are looking forward to meet you in Rio! Felipe M. G. França General Chair Carlos H. C. Ribeiro Program Chair ------------------------------ Date: Thu, 14 Sep 2000 23:53:39 -0400 From: Andrea Danyluk Subject: Announcing ICML-2001, Call For Papers ICML-2001 Williams College Williamstown, MA June 28 - July 1, 2001 The Eighteenth International Conference on Machine Learning (ICML-2001) will be held at Williams College, in the scenic Berkshires of western Massachusetts, from June 28 to July 1, 2001. The conference will bring together researchers to exchange ideas and report recent progress in the computational study of learning. The conference program will include workshops and tutorials on the first day, followed by three days of technical presentations, invited talks, and poster sessions. Submissions of papers are invited that describe empirical, theoretical, and cognitive-modeling research in all areas of machine learning. We welcome work describing research contributions arising from the application of machine learning techniques to real-world problems. Submissions that present interdisciplinary research involving machine learning are especially encouraged. The timetable for submission of papers is as follows: Abstracts due: January 22, 2001 Submissions due: January 29, 2001 Acceptance decisions mailed to authors: March 19, 2001 Camera-ready copies of accepted papers (conditional and unconditional) due: April 16, 2001 For more information on the conference and the location, visit the ICML-2001 home page: http://www.ecn.purdue.edu/ICML2001 ------------------------------ Date: Fri, 15 Sep 2000 08:55:59 -0600 (MDT) From: darrell whitley Subject: Job Announcement Colorado State University is pleased to announce that Michael Vose will be joining the Colorado State Artificial Intelligence Lab and the Department of Computer Science. The Colorado State AI Lab is made up of Darrell Whitley: Genetic and Evolutionary Computation, Machine Learning Charles Anderson: Reinforcement Learning, Neural Networks, Machine Learning Adele Howe: Planning, Agents, Evaluation, Scheduling Ross Beveridge: Computer Vision, Geometric Matching, Search Bruce Draper: Computer Vision, Reinforcement Learning, Machine Learning Michael Vose: Genetic Algorithms,Random Heuristics Search,Dynamical Systems The Computer Science Department also has 2 or 3 new faculty positions open. Salaries are highly competitive. We are looking in all areas. But we are particularly interested in databases, networks, bioinformatics, parallel algorithms and parallel optimization, systems and robotics. Persons working in these areas that also have interests in Evolutionary Computation or AI are also encouraged to apply. The Colorado State AI Lab does a good deal of collaborative research with several jointly funded research projects. Individuals can contact me directly for more information. The official Job Ad is attached. Darrell Whitley, Director, Colorado State AI Lab Chair, Computer Science Search Committee whitley@cs.colostate.edu ==== Tenure-Track Faculty Positions Colorado State University Department of Computer Science The Department of Computer Science at Colorado State University solicits applications for at least two tenure-track faculty positions, beginning Fall 2001. The appointments will be preferably made at the level of assistant professor, but appointment at a more senior level is also possible for candidates who can demonstrate a strong connection to ongoing department research. Applicants must have a Ph.D. in computer science, computer engineering, or a related field. Applicants will be expected to teach undergraduate and graduate courses, and they must demonstrate potential for excellence in research and teaching. The Computer Science Department has 700 undergraduate majors and 80 graduate students enrolled in Master's and doctoral programs. The department currently has 17 tenure-track faculty, with strong research programs in artificial intelligence, software engineering, and parallel and distributed computation. Computer facilities are excellent, and there are ample opportunities for research collaborations with local industry. Colorado State University, with an enrollment of 22,000 students, is located in Fort Collins, Colorado, an attractive community of over 100,000 people, at the base of the Front Range of the Rocky Mountains, 65 miles north of Denver. The northern Front Range offers a wide range of outdoor recreational activities. More information about the department and its research programs can be obtained from the department's home page at http://www.cs.colostate.edu. Applicants should send a curriculum vitae and letters from at least three professional references to: Faculty Search Committee, Computer Science Department, Colorado State University, Fort Collins, CO 80523. Please include a statement indicating how your background and interests match the expectations of the position(s) described above. The department's telephone number is 970-491-5862, and email inquiries should be directed to faculty-search@cs.colostate.edu. Screening of applications will begin November 1, 2000, and continue until the position is filled. Colorado State University is an EEO/AA employer. Office of Equal Opportunity: 101 Student Services. ------------------------------ Date: Wed, 13 Sep 2000 01:25:17 +0100 From: "Mohsen Jahangirian" Subject: request for info Hello everyone. I'm looking for any information on the GA randomization theory and running GA with different pseudo random numbers, particularly on the estimation of the no. of the GA runs required. I'd really appreciate any help provided by the members of the GA list. All the best Mohsen Jahangirian University of Manchester Institute of Science and Technology(UMIST) Dept. of Computation Tel. & Fax: 0161-223 7866 email: mohsen1@tesco.net ------------------------------ Date: Sun, 17 Sep 2000 19:55:01 -0500 From: Ron Sun Subject: Ph.D program at UMC The Ph.D program in CECS at University of Missouri-Columbia is accepting applications. Graduate assistantships and other forms of financial support for graduate students are available. Prospective graduate students interested in Artificial Intelligence, Cognitive Science, Connectionist Models (Neural Networks), Multi-Agent Systems, and other related areas are especially encouraged to apply. Students with earned Master's degrees are preferred. The department identifies graduate education and research as its primary missions. The department is conducting quality research in a number of areas: artificial intelligence, cognitive sceince, machine learning, multi-agent systems, neural networks and connectionist models, computer graphics and scientific visualization, computer vision, digital libraries, fuzzy logic, multimedia systems, parallel and distributed computing, and Web computing. To download application forms, use http://www.missouri.edu/~gradschl or http://web.missouri.edu/~regwww/admission/intl_admission/Application_Form/Application_index.html (for international students) ===== The CECS Department awards degrees at the Bachelor's, Master's and Ph.D's levels. The program is accredited by ABET. The CECS Department has a variety of computing equipment and laboratories available for instruction and research. These facilities are currently being enhanced, in conjunction with computing laboratories maintained by the college and by the campus. The computing facilities offer students a wealth of opportunity to access and utilize a wide range of equipment best suited for their research needs. All of the equipment is connected to departmental, college, campus, and global networks which provides ready access to the exploding world of information and computational resources. A wealth of library resources are available through the extensive collections of books and journals housed in the Engineering and Mathematical Sciences libraries as well as collections in the Main Library and Health Sciences Libraries at MU. The University of Missouri is a Research I university enrolling some 22,000 students. The University offers programs in many areas, ranging from sciences and engineering to psychology, neuroscience, education, biology, medicine, law, agriculture, and journalism. For more information, send e-mail to: gradsec@cecs.missouri.edu See the Web pages below: Prof. Ron Sun http://www.cecs.missouri.edu/~rsun CECS Department University of Missouri-Columbia fax: (573) 882 8318 201 Engineering Building West Columbia, MO 65211-2060 email: rsun@cecs.missouri.edu http://www.cecs.missouri.edu/~rsun http://www.cecs.missouri.edu/~rsun/journal.html ------------------------------ Date: Tue, 19 Sep 2000 00:53:19 -0400 From: "Erik D. Goodman" Subject: GECCO-2001 Call For Papers, Announcement CALL FOR PAPERS GECCO-2001 Genetic and Evolutionary Computation Conference (A recombination of the Sixth Annual Genetic Programming Conference (GP-2001) and the International Conference on Genetic Algorithms (ICGA-2001)) Co-Sponsored by AAAI (Am. Assoc. for Artificial Intelligence) July 7-11, 2001 (Saturday - Wednesday) San Francisco, California USA See the latest in YOUR favorite branch of Evolutionary Computation, AND explore developments in other, related tracks. The Genetic and Evolutionary Computation Conference (GECCO-2001) will present the latest high-quality results in the growing field of genetic and evolutionary computation. Topics include, but are not limited to, genetic algorithms (GA); genetic programming (GP); evolution strategies (ES); evolutionary programming (EP); evolvable hardware (EH); evolutionary robotics (ER); real-world applications (RWA); classifier systems (CS); DNA and molecular computing (DNA); artificial life, adaptive behavior and agents (AAA); ant colony optimization (ACO); optimal design of engineered structures; methodology, pedagogy, and philosophy (MPP); genetic scheduling and routing (GS); and other areas to be announced. CONFERENCE CHAIR: Erik Goodman (goodman@egr.msu.edu) ADDITIONAL INFORMATION For information concerning hotel reservations, travel discounts, student housing, student travel grants, graduate student workshop, proposals for workshops, proposals for additional tutorials, late-breaking papers, and other matters, visit www.isgec.org/GECCO-2001. For technical matters, email: Erik Goodman, GECCO-2001 Gen. Chair, goodman@egr.msu.edu. For administrative matters, email: gecco@aaai.org. Conference administered by the American Association for Artificial Intelligence, 445 Burgess Drive, Menlo Park, CA 94025 USA. Phone: 650-328-3123. Fax 650-321-4457. Conference operated by the International Society for Genetic and Evolutionary Computation, Inc., a not-for-profit corporation. HOW TO SUBMIT A PAPER TO THE GECCO CONFERENCE The deadline for ARRIVAL at the physical address below of the eight (8) paper copies of each submitted paper is WEDNESDAY, JANUARY 24, 2001. FOR THE LATEST INFORMATION, see the web site, www.isgec.org/GECCO-2001 -- Erik Goodman, General Chair, GECCO-2001 Genetic Algorithms Research and Applications Group (GARAGe) Michigan State University ------------------------------ Date: Tue, 19 Sep 2000 07:23:35 -0700 From: "John Koza" Subject: 2 (new) Immediate Job Openings at Genetic Programming Inc. Since our original posting in August, we filled one of our advertised positions, but another one became open. So we now have (as of September 18, 2000)... 2 IMMEDIATE OPENINGS (1 Research Programmer, 1 Systems Programmer) Genetic Programming Inc. is a small privately funded corporation using a beowulf cluster computer system consisting of 1,000 Pentium processors to do research in applying genetic programming to produce human-competitive results. Our group publishes and presents numerous research papers each year in various scientific conferences and journals. We are seeking 2 full-time programmers (1 Research Programmer and 1 Systems Programmer) who are proficient in Java or C. The RESEARCH PROGRAMMER position calls for at least a B.S. degree and at least two years experience in Java or C doing academic or corporate research programming. The successful candidate is expected to have expertise in some specific science or engineering domain with the aim of applying genetic programming to that domain. The possibilities are very open-ended and include, but are not limited to, analog circuit design, control, finite element analysis, shape optimization, operations research, mechanical design, signal processing, civil engineering, applied mathematics, chemical engineering, bioinformatics, computational biology, genomics, protein structure prediction, econometrics, etc. This position requires the ability to discuss and contribute ideas on how to approach new problems, suggest new problem areas to address, quickly learn about new problem domains, and to then write and run the necessary programs. The SYSTEMS PROGRAMMER position calls for at least a B.S. degree, two years experience as software developer in Java or C, and ability to maintain our software and our 1,000-Pentium system. Familiarity with linux, network programming, shell scripting, perl is a plus. The successful candidate will also be actively involved in our research programming. Experience with, or knowledge of, genetic programming, genetic algorithms, or evolutionary computation, machine learning, neural networks, artificial intelligence, artificial life, DNA computing, etc. is a plus, but not required. Please include all relevant information, date available, and several references. Since we desire to fill these positions immediately, the candidate must currently possess the legal ability to work in the United States. The significant time delays, uncertainty, and paperwork, involved in obtaining new visas for technical work in the US for persons outside the NAFTA area precludes starting that process at this time. For more information, visit http://www.genetic-programming.com John R. Koza Genetic Programming, Inc. P. O. Box K Los Altos, CA 94023-4011 USA koza@genetic-programming.com ------------------------------ Date: Wed, 20 Sep 2000 16:31:30 +0300 From: Ugur HALICI Subject: CFP: BRAIN MACHINE, Workshop, 20-22 Dec 2000, Ankara CALL FOR PAPERS BRAIN MACHINE WORKSHOP 20-22 December 2000, Ankara, Turkey Conference home page: http://heaven.eee.metu.edu.tr/~vision/brainmachine.html TOPICS: Intelligent systems * Neural networks * Brain signals and imaging * Natural/artificial vision *Speech processing, Machine learning * Language understanding * Sensation, perception, cognition * Computational models * Neuromotor control * Biologically inspired systems * Knowledge-based and expert systems * Case-based reasoning * Evolutionary systems * Fuzzy and neuro-fuzzy techniques * Intelligent agents * Collective Intelligence * Animats, humanoids * Emotions, creativity and machines * Other related topics CONTACT PERSON: Prof. Ugur HALICI, Computer Vision and Artificial Neural Networks Research Lab. Dept. of Electrical and Electronics Eng. Middle East Technical University, 06531, Ankara, Turkey Fax: (+90) 312 210 1261 Phone: (+90) 312 210 4558 (+90) 312 210 2333 e-mail: halici@metu.edu.tr http://heaven.eee.metu.edu.tr/~halici/ http://heaven.eee.metu.edu.tr/~vision/ ------------------------------ Date: Tue, 26 Sep 2000 11:44:22 +0200 From: Guenther Raidl Subject: CFP: EvoCOP - Evonet Workshop on Combinatorial Optimization EvoCOP2001 FIRST EUROPEAN WORKSHOP ON EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION Lake Como (Milan), April 18, 2001 Call for Papers http://www.ads.tuwien.ac.at/evocop2001 Evolutionary algorithms have often been shown to be effective for difficult combinatorial optimization problems appearing in various industrial, economical, and scientific domains. Prominent examples of such problems are transportation problems, traveling salesperson, satisfiability, packing, network design, or general mixed integer programming. EvoCOP is the first European event specifically dedicated to the application of evolutionary computation to combinatorial optimization problems and gives researchers in those fields an opportunity to present their latest research and to discuss current developments and applications, besides stimulating closer future interaction between members of this scientific community. The workshop is sponsored by EvoNet, the Network of Excellence in Evolutionary Computing, and will be held in conjunction with EuroGP2001, the European Conference on Genetic Programming (April 18-20), as part of EvoWorkshops2001, which will be held on the first day of EuroGP. Topics of interest include, but are not limited to: * Applications of evolutionary algorithms and related heuristics like simulated annealing or ant systems to combinatorial optimization problems * Representation techniques * Evolutionary operators * Constraint-handling techniques * Hybrid methods * Parallelization * Theoretical developments, search space analyses * Comparisons between different (also non-evolutionary) techniques EvoCOP Chairs: Jens Gottlieb SAP AG Neurottstr. 16 69190 Walldorf, Germany jens.gottlieb@sap.com phone: +49(6227)7-49356 fax: +49(6227)78-32766 Günther Raidl Institute of Computer Graphics and Algorithms Vienna University of Technology of Technology Favoritenstr. 9-11/186 1040 Vienna, Austria raidl@ads.tuwien.ac.at phone: +43(1)58801-18616 fax: +43(1)58801-18699 Timetable : Submission deadline: 16 November 2000 Notification of acceptance: 20 December 2000 Camera ready due: 25 January 2001 Workshop: 18 April 2001 Contacts: For any information please contact the EvoCOP chairs Jens Gottlieb and Günther Raidl Please visit also the EvoNet Web-site for the official EuroGP and EvoWorkshops2001 page. ------------------------------ Date: Tue, 26 Sep 2000 19:01:23 -0500 From: "Rego, Cesar" Subject: METAHEURISTICS, OPTIMIZATION & APPLICATIONS METAHEURISTICS, OPTIMIZATION & APPLICATIONS Papers Available - Feb 1999 to Sept 2000 THE HEARIN CENTER FOR ENTERPRISE SCIENCE http://hces.bus.olemiss.edu/ (Download or Request - under Research/Publications) Scatter Search and Path Relinking Authors: Fred Glover Date: February 1999 Report: HCES-01-99 Keywords: scatter search, path relinking, tabu search, evolutionary methods, parametric search An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem Authors: Vicente Campos, Fred Glover, Manuel Laguna, Rafael Marti Date: April 1999 Report: HCES-02-99 Keywords: scatter search, linear ordering problem Diversity Data Mining Authors: Gary Kochenberger and Fred Glover Date: August 1999 Report Number: HCES-03-99 Keywords: data mining, new models, tabu search Tabu Search and Finite Convergence. Authors: Fred Glover and Saïd Hanafi Date: September 1999 Report Number: HCES-04-99 Keywords: tabu search, convergence, new tree search variants Technical Note on the Paper "An Empirical Study of a New Metaheuristic for The Traveling Salesman Problem" Authors: César Rego Date: October 1999 Report Number: HCES-05-99 Keywords: traveling salesman, tabu search, jump search, ejection chains An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem Authors: Vicente Campos, Fred Glover, Manuel Laguna, and Rafael Martí Date: November 1999 Report Number: HCES-06-99 Keywords: scatter search, combinatorial optimization, linear ordering Looking Back at Edelman Finalist: Lessons Learned Over Time Authors: Deborah Kellogg and Gary Kochenberger Date: February 2000 Report Number: HCES-01-00 On the Selection Issue of the Rau Class of Sequential Problems Authors: Bahram Alidaee, Gary Kochenberger, and Mohammad Amini Date: February 2000 Report Number: HCES-02-00 Keywords: Sequencing problems, selection problems Reducing the Bandwidth of a Sparse Matrix with Tabu Search Authors: Rafael Martí, Manuel Laguna, Fred Glover and Vicente Campos Date: February 2000 Report Number: HCES-03-00 Keywords: Metaheuristics, tabu search, matrix bandwidth Resolution Search and Dynamic Branch and Bound Authors: Saïd Hanafi and Fred Glover Date: March 2000 Report Number: HCES-04-00 Keywords: dynamic branch-and-bound, resolution search, mixed integer programming Greedy Solutions of Selection and Ordering Problems Authors: Bahram Alidaee, Gary Kochenberger, and Mohammad Amini Date: April 2000 Report Number: HCES-05-00 Keywords: Analysis of algorithm: optimality of greedy algorithm, heuristic algorithms Fundamentals of Scatter Search and Path Relinking Authors: Fred Glover, Manuel Laguna, and Rafael Martí Date: May 2000 Report Number: HCES-06-00 Keywords: Evolutionary algorithms, scatter search Multilevel Cooperative Search: Application to the Circuit/Hypergraph Partitioning Problem Authors: Min Ouyang, Michel Toulouse, Krishnaiyan Thulasiraman, Fred Glover, and Jitender S. Deogun Date: July 2000 Report Number: HCES-07-00 Keywords: Cooperative search, hypergraph partitioning Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions Authors: Maria A. Osorio, Fred Glover, Peter Hammer Date: August 2000 Report Number: HCES-08-00 Keywords: Multidimensional Knapsack Problem, Surrogate Constraints, Duality, Constraint Pairing, Logic Cuts. One-Pass Heuristics for Large Scale Unconstrained Binary Quadratic Problems Authors: Fred Glover, Bahram Alidaee, César Rego, Gary Kochenberger Date: September 2000 Report Number: HCES-09-00 Keywords: Unconstrained Binary Quadratic Optimization, One-Pass Heuristics. Please send your comments to the Web Manager crego@bus.olemiss.edu - Cesar Rego Cesar Rego, Ph.D. Associate Professor of MIS/POM Researcher at the Hearin Center for Enterprise Science School of Business Administration University of Mississippi, MS 38677, USA. Home Page: http://www.bus.olemiss.edu/crego Hearin Center Web Page: http://hces.bus.olemiss.edu Office: (662) 915-5519 Fax: (662) 915-5087 ------------------------------ Date: Wed, 27 Sep 2000 14:49:10 -0400 (EDT) From: Diana Gordon Subject: journal paper The following article has just been published by JAIR and is available online. For additional related articles and a shorter summary of this journal paper, see http://www.aic.nrl.navy.mil/~gordon/safe_agents.html This article is about "safe" learning, where the type of learning assumed is evolutionary algorithms. Gordon, D.F. (2000) "Asimovian Adaptive Agents", Volume 13, pages 95-153. Available in PDF, PostScript and compressed PostScript. For quick access via your WWW browser, use this URL: http://www.jair.org/abstracts/gordon00a.html Abstract: The goal of this research is to develop agents that are adaptive and predictable and timely. At first blush, these three requirements seem contradictory. For example, adaptation risks introducing undesirable side effects, thereby making agents' behavior less predictable. Furthermore, although formal verification can assist in ensuring behavioral predictability, it is known to be time-consuming. Our solution to the challenge of satisfying all three requirements is the following. Agents have finite-state automaton plans, which are adapted online via evolutionary learning (perturbation) operators. To ensure that critical behavioral constraints are always satisfied, agents' plans are first formally verified. They are then reverified after every adaptation. If reverification concludes that constraints are violated, the plans are repaired. The main objective of this paper is to improve the efficiency of reverification after learning, so that agents have a sufficiently rapid response time. We present two solutions: positive results that certain learning operators are a priori guaranteed to preserve useful classes of behavioral assurance constraints (which implies that no reverification is needed for these operators), and efficient incremental reverification algorithms for those learning operators that have negative a priori results. The article is also available via anonymous FTP from either of the sites: Carnegie-Mellon University (USA): ftp://ftp.cs.cmu.edu/project/jair/volume13/gordon00a.ps The University of Genoa (Italy): ftp://ftp.mrg.dist.unige.it/pub/jair/pub/volume13/gordon00a.ps The compressed PostScript file is named gordon00a.ps.Z (284K) ------------------------------ Date: Thu, 28 Sep 2000 11:17:18 -0700 From: Virginia Greninger Subject: Postdoctoral Fellowships in Complex Studies at the Santa Fe Institute Postdoctoral Fellowships in Complex Studies at the Santa Fe Institute The Santa Fe Institute expects to have openings for a number of Postdoctoral Fellows beginning in September 2001. The Institute's interdisciplinary research program is devoted to the study of complex systems in a wide variety of fields, including biology (e.g., genomics, evolutionary biology, ecology, immunology), computer science (adaptive computation, novel forms of computation, simulation), physics (nonlinear systems, statistical physics, biophysics), mathematics, statistics, cognitive science, and the social sciences including anthropology, economics, and political science. Applications are also welcome from disciplines other than those listed here. Postdoctoral Fellows work either on existing research projects or on projects of their own choosing. Research at the Institute focuses primarily on mathematical and computational approaches, although applicants whose research will include an experimental or data-collection component in collaboration with offsite colleagues are also encouraged to apply. Candidates should have a Ph.D. (or expect to receive one before September 2001) in the mathematical, computational, physical, biological or social sciences, with an academic record of scientific excellence, a demonstrated ability for independent research, and a strong interest in interdisciplinary approaches and collaboration. TO APPLY Applicants should submit a curriculum vitae, list of publications, and statement of research interests. Arrange for three letters of recommendation to be sent to the address below. Non-U.S. applicants are eligible to apply. Successful foreign applicants will enter the U.S. on either a J or, less likely, an H visa. All application materials must be received by January 12, 2001. Send complete application package, by postal mail, to the address below. Include your e-mail address and/or fax number. Postdoctoral Committee Santa Fe Institute 1399 Hyde Park Road Santa Fe, NM 87501 Questions should be addressed to: ginny@santafe.edu SFI is an equal opportunity employer Ginny Greninger Santa Fe Institute Programs Office 1399 Hyde Park Road V: (505) 984-8800, Ext. 268 Santa Fe, NM 87501 Fax: (505) 982-0565 http://www.santafe.edu E-mail: ginny@santafe.edu ------------------------------ From: "Taylor, Tim" Subject: Announcing a new discussion list: EC2M Date: Fri, 29 Sep 2000 15:09:26 +0100 Dear colleagues, Following the recent growth of interest in the field of evolving controllers and morphologies for physically modelled (and also physically instantiated) creatures, and the success of the workshop on the subject at this year's ALIFE 7 conference, a new email discussion list has been set up to promote discussion and interaction between people working in this area. The list is called EC2M, standing for the Evolution of Creature Controllers and Morphologies. Information about the list, including instructions for subscribing to it, can be found at http://www.alife.org/mailman/listinfo.cgi/ec2m-list Thanks, Tim Taylor Artificial Life Research Associate, IC-CAVE (http://www.iccave.com) University of Abertay Dundee, Bell Street, Dundee DD1 1HG, Scotland mailto:tim.taylor@abertay.ac.uk tel. +44-(0)1382-308959 http://computing.tay.ac.uk/timtaylor/ fax. +44-(0)1382-308627 ------------------------------ Date: Fri, 29 Sep 2000 17:17:23 +0100 (BST) From: Simon Parsons Subject: Reminder: Autonomous Agents 2001 CALL FOR PAPERS Fifth International Conference on Autonomous Agents (Agents 2001) Montreal, Canada, Monday 28 May - Friday 1 June 2001 http://autonomousAgents.org Autonomous agents are software and robotic entities that are capable of independent action in open, unpredictable environments. Agents are also one of the most important and exciting areas of research and development in computer science today. Agents are currently being applied in domains as diverse as computer games and interactive cinema, information retrieval and filtering, user interface design, electronic commerce, autonomous vehicles and spacecraft, and industrial process control. The aim of the Agents 2001 conference is to bring together researchers and developers from industry and academia to report on the latest scientific and technical advances, discuss and debate the major issues, and showcase the latest systems. The conference welcomes submissions of original, high quality papers concerning autonomous agents in a variety of embodiments and playing a variety of roles in their environments. The Agents 2001 conference, like its predecessors, will focus primarily on systems that have been or are being implemented; theory papers are welcome provided that they clearly relate to such systems, for example by helping us to predict their behavior, explain, or understand them. The submission of pure, abstract theory papers is not encouraged: there are other, more appropriate forums for such work. Papers that address isolated agent capabilities (such as planning or learning) are similarly discouraged, unless they are placed in the overall context of autonomous agents. Evaluation of agents or multi-agent systems will be considered a desireable component of each submission. In addition to conventional conference papers, we strongly encourage the submission of papers that focus on implemented systems or software prototypes. These papers require a demonstration of the software prototype at the conference and should include a detailed project/system description specifying hw/sw features and requirements. A clear description of the application domain(s) and other implementational/system oriented attributes should be included in the paper. Accepted software prototype papers will be presented within a special track at the conference along with the implemented system. The papers will also be reviewed specifically for the special track. Exciting robot demos will also be presented as part of the Agents 2001 Robot Program, providing an exceptional opportunity to demonstrate state-of-the-art research, to share ideas and technology from the very broad research perspectives addressed by the Agents scientific community, and to increase awareness of the key challenges in designing autonomous robotic agents. We encourage teams from universities and other research laboratories to participate. Information about the Robot Program and associated travel assistance is found on the Autonomous Agents web page. Furthermore the conference will include internationally known invited speakers and an exhibits session. More generally, the conference will strive towards an informal atmosphere with plenty of time for presentations, questions, and discussions. Accepted papers and posters will be formally published in a Conference Proceedings. A limited number of student scholarships will be available. IMPORTANT DATES Conference Papers: October 9, 2000 Deadline for electronic title pages October 16, 2000 Deadline for paper submission December 20, 2000 Notification of acceptance Workshops: December 8, 2000 Submission of WS proposals January 12, 2001 Notification of acceptance March 16, 2001 Workshop proceedings due for printing Tutorials: December 8, 2000 Submission of tutorial proposals January 12, 2001 Notification of tutors March 16, 2001 Tutorial notes due for printing General Chair: Joerg P. Mueller (Germany) CONFERENCE THEMES Technical issues to be addressed include, but are not restricted to: action selection and planning adaptation and learning agent architectures agent-based software engineering agent communication languages artificial market systems and electronic commerce autonomous robots believability communication, collaboration, and interaction of humans and agents conversational agents coordinating multiple agents designing agent systems - methodologies & software engineering expert assistants evolution of agents human-like qualities of synthetic agents information agents instructability integration and coordination of multiple activities knowledge acquisition and management lessons learned from deployed agents lifelike qualities meta-modeling and meta-reasoning middle-agents (e.g., matchmakers, brokers, routers) mobile agents modeling the behavior of other agents models of emotion, motivation, or personality multi-agent teams multi-agent communication, coordination, and collaboration multi-agent simulation, verification, and validation network agents organization of agent societies privacy and agents real-time performance standards for agents synthetic agents system support for the implementation of agents user modeling ------------------------------ Date: Sat, 30 Sep 2000 12:33:33 +0200 From: Marco DORIGO Subject: Metaheuristics research positions available at IRIDIA, Brussels PhD student and postdoctoral research positions are available at IRIDIA, the artificial intelligence lab of the Universite' Libre de Bruxelles, Belgium. The research topic is the comparative study (both theoretical and experimental) of metaheuristics (e.g., evolutionary computation, tabu search, ant colony optimization, simulated annealing, iterated local search, etc.). Positions are restricted to young candidates (<=35 years) who are nationals (or resident since at least five years) of the European Union or of an associate state (a list of associate states is available at: http://www.cordis.lu/fp5/src/3rdcountries.htm) other than Belgium. The people we are looking for should either possess a PhD (postdoc positions) or a degree that allows them to embark in a doctoral program (doctoral student positions). In both cases, their area of competence should be in at least one of the following disciplines: Computer Science, Operations Research, Computational Intelligence. They should be experienced programmers in procedural or object oriented programming languages and should have knowledge of modern operating systems. Female researchers are explicitly encouraged to apply for the offered positions. We guarantee that the selection process, based solely on the research records, will give equal opportunities to female and male researchers. The interested candidate can get further information as follows: 1) PhD students: http://iridia.ulb.ac.be/~mdorigo/IRIDIA-PhD-Openings.html 2) Send a CV to Dr. Dorigo: mdorigo@ulb.ac.be Marco Dorigo, Ph.D. Chercheur Qualifie' du FNRS IRIDIA CP 194/6 Universite' Libre de Bruxelles Avenue Franklin Roosevelt 50 1050 Bruxelles Belgium mdorigo@ulb.ac.be http://iridia.ulb.ac.be/~mdorigo/ Tel +32-2-6503169 GSM +32-478-301233 Fax +32-2-6502715 Secretary +32-2-6502729 ------------------------------ Date: Sat, 30 Sep 2000 12:33:25 +0200 From: Marco DORIGO Subject: MARIE CURIE TRAINING SITE FELLOWSHIPS MARIE CURIE TRAINING SITE FELLOWSHIPS IN SOFT COMPUTING FOR OPTIMISATION AND CONTROL AT IRIDIA, UNIVERSITÉ LIBRE DE BRUXELLES DESCRIPTION OF THE RESEARCH TRAINING AREA The doctoral training proposed is in the field of soft computing techniques for optimisation and control. Soft computing differs from conventional computing in that it is tolerant of imprecision, uncertainty, partial truth, and approximation. The principal constituents of soft computing are fuzzy computing, evolutionary computation, neural computing, and probabilistic reasoning, with the latter subsuming belief networks and parts of machine learning. IRIDIA researchers are active in the above-cited soft computing disciplines, with the goal of using them to design novel techniques and algorithms that allow the efficient and robust solution of difficult real-world problems. We solicit therefore applications from doctoral students interested in any of the above-mentioned soft computing disciplines, and with a particular interest for the following areas: fuzzy control of dynamic processes, approximate knowledge representation, evolutionary robotics, reinforcement learning, ant algorithms, swarm intelligence, and learning methods for data analysis and prediction. EXPERIENCE REQUIRED Candidates should be embarked in doctoral studies in their home country in any of the following disciplines: artificial intelligence, computer science, operations research, electrical or electronic engineering, robotics. RECRUITMENT PLAN IRIDIA will award approximately 2 fellowships per year (for a total of 10 fellowships summing up to 72 man/month) over a 4 years period. Fellowships will last between 3 and 12 months and their amount is of 1200 EUR/month. Applicants should contact Dr. Dorigo, IRIDIA CP 194/6, ULB, Av. F. Roosevelt 50, 1050 Brussels, Belgium, mdorigo@ulb.ac.be, tel.+32-2-6502729 Positions are restricted to young doctoral students (<=35 years) who are nationals (or resident since at least five years) of the European Union or of an associate state (a list of associate states is available at: http://www.cordis.lu/fp5/src/3rdcountries.htm) other than Belgium. IRIDIA IS AN EQUAL OPPORTUNITY EMPLOYER. APPLICATIONS FROM WOMEN ARE STRONGLY ENCOURAGED. Marco Dorigo, Ph.D. Chercheur Qualifie' du FNRS IRIDIA CP 194/6 Universite' Libre de Bruxelles Avenue Franklin Roosevelt 50 1050 Bruxelles Belgium mdorigo@ulb.ac.be http://iridia.ulb.ac.be/~mdorigo/ Tel +32-2-6503169 GSM +32-478-301233 Fax +32-2-6502715 Secretary +32-2-6502729 ------------------------------ Date: Sun, 01 Oct 2000 18:29:25 -0400 From: Chris Leger Subject: Software release: Multiobjective evolutionary synthesis for robotics Darwin2K is a free, open-source toolkit for robot simulation and automated design. It features numerous simulation capabilities and an evolutionary algorithm capable of automatically synthesizing and optimizing robot designs to meet task-specific performance objectives. Simulation capabilities: - Kinematic simulation - Dynamic simulation (forward and inverse), including simulation closed kinematic chains, joint limits, and limited contact - Modular simulator architecture allows simulation components to be activated and configured at runtime. - Collision detection - Estimation of link deflection - Several robot control algorithms, including PID joint control, Jacobian (Singularity-Robust Inverse) control, and SRI with dynamics for free-flying manipulators - Robots can be built at runtime from parameterized modules, and new module types can be added. - Modules can use components from a database that includes motors and gearheads from Maxon, and harmonic drives from HD Systems - OpenGL and OpenInventor display drivers Automated synthesis: - Distributed evoluationary algorithm can synthesize and optimize robot kinematics (topology and dimensions), dynamics, components, and controller parameters with respect to multiple user-selected performance metrics - Robot performance is assessed through simulation - Scope of synthesizer can be restricted by partially specifying robot parameters and/or topology - Allows coarse-to-fine synthesis - Easily incorporate a-priori knowledge in designs - Simple interface for specifying multiple metrics and criteria The system has been tested under Irix 6.x and Linux; a Solaris port is forthcoming. System requirements: - X windows - OpenGL, MesaGL, or OpenInventor - xforms - perl >= 5 is strongly recommended Darwin2K source code, documentation, and screen shots can be found at http://darwin2k.sourceforge.net. If you are interested in helping out with Darwin2K development, please let me know! Chris Leger cleger@robotics.jpl.nasa.gov ------------------------------ Date: Wed, 04 Oct 2000 11:51:42 +0900 From: Mineo Morohashi Subject: paper request Hello, I am looking for the following paper: J.D.Schaffer, "Multiple objective optimization with vector evaluated genetic algorithms", The 1st ICGA, pp.93-100, 1985 If anybody can send a copy of it to me, I would really appreciate it. Thank you, Mineo Morohashi Mineo Morohashi [moro@symbio.jst.go.jp] ERATO Kitano Symbiotic Systems Project Systems Biology Group URL: http://www.symbio.jst.go.jp/~moro/ TEL: +81-3-5468-1661 FAX: +81-3-5468-1664 ------------------------------ Date: Wed, 4 Oct 2000 05:41:45 -0700 (PDT) From: Alberto Ochoa Subject: ISAS 2001 - Evol. Comp. and Graph. Models ISAS 2001 International Symposium on Adaptive Systems "Evolutionary Computation and Probabilistic Graphical Models" Hotel Palco and Havana Convention Center, March 19-23, 2001 ( http:://isas2001.tripod.com/symp ) To be hold in Havana in the period 19-23 March 2001 in the context of the International Conference CIMAF 2001. The major themes of the symposium are evolutionary computation or hybrid evolutionary approaches, and bayesian learning or learning in graphical models. This symposium follows the successful ISAS’99 (International Symposium on Adaptive Systems) held in Havana in the context of CIMAF’99 conference, and aims at exploring these two research activities and their roles and interactions in Adaptive Systems. - Scientific Programme Our main purpose is to bring together researchers, coming from different communities, who share the common feature of being involved in using the dependence structure of a complex statistical model in some aspect of evolutionary computation and other modern heuristic or soft-computing techniques. Cross-fertilization between graphical model research and different soft-computing approaches, such as genetic algorithms and other evolutionary algorithms, as well as neural network learning, reinforcement learning, decision tree learning, etc, will be strongly encouraged by the conference. However, the topics of interest to this conference include but are not limited to the following: - Genetic algorithms - Learning Bayesian Models from data. - Genetic programming - Mixture of Models. - Classifier systems, evolutionary learning. - Dynamic Bayesian Networks. - Evolutionary optimization. - Gaussian Graphical Models. - Constraint, global and multiobjective optimization - Model selection. - Evolutionary strategies - Monte Carlo methods. - Graphical Models and Evolutionary Computation. - Junction tree algorithms. - Graphical Models and Neural Networks. - Simulation in Graphical Models. - Reinforcement learning. - Theoretical Foundations of G. Models - Bayesian and Evolutionary Data Mining. - Stochastic algorithms - Other soft-computing heuristics. - Models with latent variables - Stochastic Dynamical Systems. - G. Models in Game Theory - Theoretical Foundations of EC - Symposium chair Dr. Alberto Ochoa Rodríguez, Cuba - Technical Chairs Heinz Muehlenbein, Germany Tom English, USA Pedro Larrañaga, Spain - Important dates: December 8, 2000 --> Deadline for submission of papers (<=8 pages) January 19, 2001 --> Notification of acceptance Febraury 1, 2001 --> Deadline for camera-ready copies of accepted papers and registration of at least one author March 19-23, 2001 --> Conference For further information please contact: ISAS 2001 URL: http:// isas2001.tripod.com/symp http://www.members.tripod.com/~isas2001/symp/ Dr. Alberto Ochoa Rodríguez Institute of Cybernetics, Mathematics and Physics (ICIMAF). Center of Mathematics and Theoretical Physics. Calle 15 No. 551 e/ C y D. CP. 10400. La Habana. Cuba. Fax: 537-333373 Phone: 537-327764 aa8ar@yahoo.com ochoa@cidet.icmf.inf.cu ------------------------------ Date: Wed, 4 Oct 2000 13:55:26 +0100 From: "Hart, Emma" Subject: CFP: EvoSTIM Workshop 2001 EvoSTIM2001 - Call for papers Second European Workshop on Scheduling and Timetabling Scheduling and Timetabling are amongst the most successful applications of evolutionary techniques. EvoSTIM2001 is the second European event specifically dedicated to the applications of evolutionary computation to scheduling and timetabling, following on from the successful EvoSTIM 2000 held in Edinburgh in April 2000. It gives European and non-European researchers in those fields an opportunity to present their latest research and discuss current developments and applications. It is also an opportunity to meet with other researchers and industrialists working in the same field. Topics of interest include, but are not limited to: - Case studies of applications of evolutionary techniques to real-life problems in scheduling and timetabling - Theoretical Developments, including benchmarking and other comparative studies - Hybrid methods and Novel Heuristics - Methods for fast and minimally disruptive rescheduling - Dynamic Scheduling - Distributed Scheduling - Scheduling in industrial environments including transport and distribution - Educational courses and exam timetabling - Employee and workforce scheduling - Organisation and resource scheduling EvoSTIM chair ------------- Emma Hart emmah@dcs.napier.ac.uk School of Computing Napier University 219 Colinton Road Edinburgh EH14 1DJ Scotland, UK Timetable Submission deadline: 16 November 2000 Notification of acceptance: 20 December 2000 Camera ready due: 25 January 2001 Workshop: 18 April 2001 Website : http://evonet.dcs.napier.ac.uk/eurogp2001/evoworkshops.html Web site designed and maintained by Chris Osborne at EvoNet. ------------------------------ Date: Sun, 8 Oct 2000 19:44:25 -0100 From: "Candida Ferreira" Subject: Two new CA rules for density-classification problem evolved by GEP Hi All, I applied Gene Expression Programming (GEP) to this difficult problem and discovered two new rules better than any human-written rule and better than the GP rule. Furthermore, for this difficult problem, GEP surpassed GP in more than four orders of magnitude. You can see the parameters used and several space-time diagrams for these rules at my site and the list of GEP papers already submitted: www.gene-expression-programming.com Candida Ferreira Candida Ferreira, PhD Assistant Professor of Biochemistry Department of Agricultural Sciences The Azores University Email: candidaf@gene-expression-programming.com http://www.gene-expression-programming.com ------------------------------ Date: Wed, 11 Oct 2000 01:12:07 +1100 (EST) From: Bob McKay Subject: Congress on Evolutionary Computation, 2001 The 2001 Congress on Evolutionary Computation (CEC2001) May 27-30, 2001 COEX Center, Seoul, Korea *** Paper submission deadline: December 1, 2000 *** The 2001 Congress on Evolutionary Computation will bring together researchers to exchange ideas and report recent progress in evolutionary computation and its application to real-world problems. CEC2001 is jointly sponsored by the IEEE Neural Networks Council, the Evolutionary Programming Society (EPS), and the Institution of Electrical Engineers (IEE). Building on its previous success in 1999 and 2000, CEC aims to be the most inclusive EC conference in the field. This is reflected in the considerable efforts put together by its organising committee, spanning groupings from around the globe. Please note the web pages on http://cec2001.kaist.ac.kr/ for details about submissions and other activities. The deadline for submitting regular papers is December 1, 2000. Looking forward to your participation. CEC2001 Publicity Chairs Takeshi Furuhashi (Japan and Far East) Bob Mckay (Australia and Pacific Rim) Robert Reynolds (Americas) Ali Zalzala (Europe and Mediterranean) ------------------------------ Date: Tue, 10 Oct 2000 19:19:16 -0400 (EDT) From: Sean Luke Subject: Dissertation Announcement My doctoral dissertation, entitled "Issues in Scaling Genetic Programming: Breeding Strategies, Tree Generation, and Code Bloat", is available online at: http://www.cs.gmu.edu/~sean/papers/ CHAPTER HEADINGS Introduction Evolutionary Computation Genetic Programming Issues in Evolutionary Computation and Genetic Programming Evolved Robot Soccer Edge Encoding: Evolving Sparse Graph Structures Comparing Mutation and Crossover Tree Generation Code Bloat: An Inside Look Conclusion A Code Bloat Bestiary (Appendix) ECJ: Evolutionary Computation in Java (Appendix) ABSTRACT Genetic Programming is an evolutionary computation technique which searches for those computer programs that best solve a given problem. As genetic programming is applied to increasingly difficult problems, its effectiveness is hampered by the tendency of candidate program solutions to grow in size independent of any corresponding increases in quality. This bloat in solutions slows the search process, interferes with genetic programming's searching, and ultimately consumes all available memory. The challenge for scaling up genetic programming is to find the best solutions possible before bloat puts a stop to evolution. This can be tackled either by finding better solutions more rapidly, or by taking measures to delay bloat as long as possible. This thesis discusses issues both in speeding the search process and in delaying bloat in order to scale genetic programming to tackle harder problems. It describes evolutionary computation and genetic programming, and details the application of genetic programming to cooperative robot soccer and to language induction. The thesis then compares genetic programming breeding strategies, showing the conditions under which each strategy produces better individuals with less bloating. It then analyzes the tree growth properties of the standard tree generation algorithms used, and proposes new, fast algorithms which give the user better control over tree size. Lastly, it presents evidence which directly contradicts existing bloat theories, and gives a more general theory of code growth, showing that the issue is more complicated than it first appears. Sean Luke sean@cs.gmu.edu http://www.cs.gmu.edu/~sean/ ------------------------------ From: iat01@kis.maebashi-it.ac.jp Date: Wed, 11 Oct 2000 13:26:21 +0900 Subject: Intelligent Agent Technology (IAT-2001): 2nd CFP Second CALL FOR PAPERS The Second Asia-Pacific Conference on Intelligent Agent Technology (IAT-2001) Maebashi TERRSA, Maebashi City, Japan October 23-26, 2001 Home Page: http://kis.maebashi-it.ac.jp/iat01 Paper Submission Deadline: March 20, 2001 IAT-2001 will be jointly held with The First Asia-Pacific Conference on Web Intelligence (WI-2001) The Asia-Pacific Conference on Intelligent Agent Technology (IAT) is a high-quality, high-impact biennial agent conference series. The second meeting in this conference series follows the success of IAT'99 held in Hong Kong in 1999 (http://www.comp.hkbu.edu.hk/IAT99). IAT-2001 will primarily focus on (1) the state-of-the-art in the development of intelligent agents and (2) the theoretical and computational foundations of intelligent agent technology. The aim of IAT-2001 is to bring together researchers and practitioners from diverse fields, such as computer science, information technology, business, education, human factors, systems engineering, and robotics to (1) examine the design principles and performance characteristics of various approaches in intelligent agent technology, and (2) increase the cross-fertilization of ideas on the development of autonomous agents and multiagent systems among different domains. By encouraging idea-sharing and discussions on the underlying logical, cognitive, physical, and biological foundations as well as the enabling technologies of intelligent agents, IAT-2001 is expected to stimulate the future development of new models, new methodologies, and new tools for building a variety of embodiments of agent-based systems. TOPICS The technical issues to be addressed include, but not limited to: * Applications: - data and knowledge intensive domains (e.g., large databases, Internet, digital libraries, distributed decision making, financial modeling and engineering, business information systems and process automation) - software and interface agents (e.g., personal assistant, translator, scheduler, information filter, tutor) - computational intelligence (e.g., pattern analysis and recognition, imaging, optimization, resource allocation, constraint satisfaction, planning) - agents in e-commerce and e-business - autonomous agents in science and engineering (e.g. aerospace, survey of the seabed and space) - physically embodied systems (e.g., autonomous robots and groups) - very-large, complex, integrated intelligent systems * Computational Architecture and Infrastructure: - computational architectures - ontology models - agent-level and multi-agent-level infrastructure - communication languages - multi-modal systems and interfaces - protocols - tools and standards - heterogeneity and interoperability - scalability * Learning and Adaptation: - soft-computing in multi-agent systems - uncertainty management in multi-agent systems - integrated exploration and exploitation - long-term reliability - neural networks - artificial life - behavioral selection - coordinating perception, thought, and action - behavioral self-organization - believable lifelike quality - classifier systems - evolution and learning in dynamic environments - adaptation and self-adaptation - emergent behavior - evolutionary computation * Data and Knowledge Engineering/Communication: - information filtering - data mining - heterogeneous data integration and management - human-agent interaction - knowledge discovery - knowledge sharing - knowledge aggregation - reasoning and planning - adaptation and evolution of knowledge networks - distributed knowledge systems * Distributed Intelligence: - dynamics of groups and populations - swarms - population evolution - coevolution - collective group behavior - coordination and cooperation - distributed intelligence - social integration - market-based computing * Formal Theories of Agents: - formal/computational modeling - chaotic and fractal dynamics - computational complexity - efficiency in distributed systems - taxonomy of agent environments - classification and characterization of complex behaviors - theories of perception, rationality, intention, emotion, coordination, action, and social behaviors IMPORTANT DATES March 20, 2001 Paper submission deadline May 20, 2001 Notification of paper acceptance mailed June 20, 2001 Camera-ready copies of accepted papers due July 2, 2001 Demo submission deadline August 3, 2001 Notification of demo acceptance mailed October 23-26, 2001 Conference technical sessions FURTHER INFORMATION Please send suggestions and inquiries regarding IAT-2001 to: Prof. Ning Zhong (IAT-2001) Department of Information Engineering Maebashi Institute of Technology 460-1, Kamisadori-Cho, Maebashi-City, 371-0816 Japan TEL&FAX: +81-27-265-7366 E-mail: zhong@maebashi-it.ac.jp ------------------------------ Date: Wed, 11 Oct 2000 13:35:18 +0200 From: Stefano Cagnoni Subject: Call For Papers: EvoWorkshops2001 CALL FOR PAPERS EVOWORKSHOPS2001 EvoCop2001 - First European Workshop on Evolutionary Computation in Combinatorial Optimization EvoFLIGHT2001 - Second European Workshop on Evolutionary Computation in Aerospace EvoIASP2001 - Third European Workshop on Evolutionary Computation in Image Analysis and Signal Processing EvoLEARN2001 - First European Workshop on Evolutionary Learning EvoSTIM2001 - Second European Workshop on Scheduling and Timetabling Lake Como (Milan, Italy), April 18, 2001 EvoWorkshops will take place on the first day of EuroGP2001 (http://evonet.dcs.napier.ac.uk/eurogp2001), the European Conference on Genetic Programming. Important Dates: Submission deadline: 16 November 2000 Notification of acceptance: 20 December 2000 Camera ready papers for workshop: 25 January 2001 Workshop: 18 April 2001 For full details about submissions and updated news about the workshops please visit the following web pages: http://evonet.dcs.napier.ac.uk/eurogp2001/evoworkshops.html http://evonet.dcs.napier.ac.uk/eurogp2001/ http://www.ce.unipr.it/evoiasp2001 For information about EvoWorkshops99 and EvoWorkshops2000 Proceedings: http://www.springer-ny.com/detail.tpl?ISBN=3540658378 http://www.springer-ny.com/detail.tpl?ISBN=3540673539 ------------------------------ Date: Wed, 11 Oct 2000 23:32:59 +0100 (BST) From: Tim Kovacs Subject: On-Line Learning Classifier Systems Resources I'd like to advertise three on-line LCS resources that have appeared relatively recently. 1. John Holmes has a mail alias with about 100 subscribers. This is a great way to reach the LCS community to ask questions, announce papers, introduce yourself, etc. Mail John Holmes to subscribe. 2. Alwyn Barry's LCS web has a great deal of information on LCS. See: http://www.csm.uwe.ac.uk/~ambarry/LCSWEB/ 3. The LCS Bibliography has nearly 600 references, many with abstracts. See: http://www.cs.bham.ac.uk/~tyk/lcs/ Contributions to the bibliography are much appreciated and can be sent to me at: T.Kovacs@cs.bham.ac.uk Regards, Tim T.Kovacs@cs.bham.ac.uk ------------------------------ Date: Mon, 16 Oct 2000 19:45:45 +0200 From: "M.A. Janssen" Subject: JOB: Artificial Immune Systems We are looking for a PhD student or post-doc for a project on applications of artificial immune systems The project on artificial immune systems and applications for ecosystem management is a three-year program funded by the European Commission, which will start its activities this winter. Possible applications are the modeling of institutional memory or the detection and management of biological invasions. The person we are looking for has either a PhD (postdoc position) or a degree that allows them to embark in a doctoral program (PhD student). In both cases, their area of competence should be in at least one of the following disciplines: Computer Science, Operations Research, Computational Intelligence, Theoretical Biology. They should be experienced programmers in procedural or object oriented programming languages and should have knowledge of modern operating systems. The right people will have a commitment to research and publication, and possess good communication and presentation skills. Candidates should send a CV to Dr Marco Janssen m.janssen@econ.vu.nl Phone +31 20 44 46092 Fax +31 20 44 46004 Free University Amsterdam Department of Spatial Economics De Boelelaan 1105 1081 HV Amsterdam The Netherlands Dr. Marco A. Janssen Afdeling Ruimtelijke Economie (Department of Spatial Economics) Vrije Universiteit De Boelelaan 1105 1081 HV Amsterdam Fax: 020-4446004 +31 20 4446004 Tel: 020-4446092/90 +31 20 4446092/90 homepage: http://www.econ.vu.nl/re/medewerkers/mjanssen/marco.htm ------------------------------ Date: Tue, 17 Oct 2000 13:50:02 -0400 (EDT) From: Joseph Halpern Subject: TARK VIII announcement CALL FOR PAPERS: TARK VIII Eighth conference on THEORETICAL ASPECTS OF RATIONALITY AND KNOWLEDGE July 8-10, 2001 The Certosa di Pontignano, University of Siena, Italy http://www.tark.org/ ABOUT THE CONFERENCE The bi-annual TARK conferences bring together researchers from a wide variety of fields, including Artificial Intelligence, Cryptography, Distributed Computing, Economics, Game Theory, Linguistics, Logic, Philosophy, and Psychology -- to further our understanding of interdisciplinary issues involving reasoning about rationality and knowledge. Topics of interest include semantic models for knowledge, belief and uncertainty, bounded rationality and resource-bounded reasoning, commonsense epistemic reasoning, logics of knowledge and action, formal analysis of games, applications of reasoning about knowledge and other mental states, belief revision, and the role of knowledge in general information flow. TARK has been influential in building interfaces between disciplines, and accelerating new research trends, both through the actual event and the circulation of its proceedings. The 2001 conference will again serve this important purpose by its mix of contributed and invited talks reflecting the state of the art. Recently, TARK and LOFT (the Conference on Logic and Foundations of Game and Decision Theory) have been coordinated, so that they are held in alternating years. The deadline for submission of abstracts is February 14, 2001. Authors will be notified of acceptance by April 14, 2001. Camera-ready copies of accepted papers are due by May 14, 2001. ADRESS FOR SUBMISSIONS TARK 2001, c/o Ms. Ingrid van Loon, Institute for Logic, Language and Computation, University of Amsterdam, Plantage Muidergracht 24,1018 TV AMSTERDAM, The Netherlands, tel. + 31.20.5256519, fax +31.20.5255206, email ingrid@wins.uva.nl ------------------------------ Date: Thu, 19 Oct 2000 10:47:14 +0100 From: Natalio Krasnogor Subject: Java code for the TSP Dear all, I wonder if any of you implemented, and want to share it!!, java code for 2-opt,3-opt,4-opt,lin-kernighan or other heuristics for the TSP? In return for your code I'll add it to the Memetic Algorithms Framework (MAFRA) repository with full acknowledgment of the author. For those of you interested in MAFRA, have a look at http://www.csm.uwe.ac.uk/~n2krasno/MAFRA/MAFRA.html Thanks. Nat NATALIO KRASNOGOR Intelligent Computer Systems Centre Research Assistant Faculty of Computer Studies and Mathematics Visiting Lecturer Frenchay Campus, Office 3p30 University of the West of England Tel.: +44 - 0117 - 3443357 Coldarbour Lane Bristol, BS16 1QY United Kingdom. URL: http://www.csm.uwe.ac.uk/~n2krasno e-mail: Natalio2.Krasnogor@uwe.ac.uk nkrasno@cs.sandia.gov nkrasnogor@hotmail.com ------------------------------ Date: Fri, 20 Oct 2000 14:12:53 -0400 (EDT) From: Hamid Arabnia Subject: Call For Papers: PDPTA + CISST + IC-AI + IC + METMBS C A L L F O R P A P E R S PDPTA + CISST + IC-AI + IC + METMBS + ... Monte Carlo Resort, Las Vegas, Nevada, USA June 25-28, 2001 (Submission Deadline: March 1, 2001) Dear Colleagues: I would be most grateful if you would distribute this announcement for the 2001 International MultiConference to your colleagues who might be interested. This will be a major international gathering in year 2001. It is anticipated that this international event will attract about 1500 participants. This MultiConference is composed of five (planned and more will likely be added) international conferences that will be held simultaneously (same dates and location). Attendees will have full access to all five+ conferences. You are invited to submit a draft paper of about 4 to 5 pages and/or a proposal to organize a technical session. All accepted papers will be published in the respective conference proceedings. THE NAMES OF TECHNICAL SESSION CHAIRS WILL APPEAR AS ASSOCIATE EDITORS ON THE COVER OF THE CONFERENCE PROCEEDINGS. (contact hra@cs.uga.edu if you would like to propose international workshops to be held simultaneously with the above conferences.) The five conferences are: (a link to each conference's URL will soon be available from http://www.ashland.edu/~iajwa/conferences/pdpta) 1. The 2001 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'2001: Las Vegas, Nevada, USA; June 25-28, 2001) 2. The 2001 International Conference on Imaging Science, Systems, and Technology (CISST'2001: Las Vegas, Nevada, USA; June 25-28, 2001) 3. The 2001 International Conference on Artificial Intelligence (IC-AI'2001: Las Vegas, Nevada, USA; June 25-28, 2001) 4. International Conference on Internet Computing 2001 (IC'2001: Las Vegas, Nevada, USA; June 25-28, 2001) 5. The 2001 International Conference on Mathematics and Engineering Techniques in Medicine and Biological Sciences (METMBS'2001: Las Vegas, Nevada, USA; June 25-28, 2001) CONFERENCES CONTACT (for all five conferences): (who may forward inquiries to respective chairs of conferences) Hamid R. Arabnia General Chair, 2001 International MultiConferences The University of Georgia Department of Computer Science 415 Graduate Studies Research Center Athens, Georgia 30602-7404, U.S.A. Tel: (706) 542-3480 Fax: (706) 542-2966 email: hra@cs.uga.edu IMPORTANT DATES: March 1, 2001 (Thursday): Draft papers (about 4 to 5 pages) due April 2, 2001 (Monday): Notification of acceptance May 1, 2001 (Tuesday): Camera-Ready papers & Prereg. due June 25 - 28, 2001: PDPTA'2001 + CISST'2001 + IC-AI'2001 + IC'2001 + METMBS'2001 Conferences Proposals to organize technical sessions should be submitted as soon as possible. All accepted papers are expected to be presented at the conference. (a link to each conferences' URL will soon be available from http://www.ashland.edu/~iajwa/conferences/pdpta) ------------------------------ Date: Sun, 22 Oct 2000 11:31:48 +0100 From: Bill LANGDON Subject: GECCO bibtex proceedings ftp://ftp.cs.bham.ac.uk/pub/authors/W.B.Langdon/biblio/ Now contains bibtex files for this years GECCO'2000 conference as well as last years and of course the GP bibliography. Hopefully more EC conference bibtex files will be added shortly. There is also a www search interface at http://liinwww.ira.uka.de/bibliography/Ai/gecco.html cec99.bib 329 Kb gecco00.bib 171 Kb gecco00lb.bib 39 Kb gecco00wks.bib 38 Kb gecco99.bib 317 Kb gecco99lb.bib 21 Kb gecco99wks.bib 63 Kb gp-bib-alpha.txt 816 Kb Plain Text gp-bib-num.txt 751 Kb Plain Text gp-bibliography.bib 2511 Kb gp-bibliography.html 2134 Kb Hypertext Markup Language gp-bibliography.ref 1607 Kb Refer format gp-html/ Directory ppsn2000.bib 45 Kb tools/ Directory Thank you Bill ps: Details of EuroGP'2001 at http://evonet.dcs.napier.ac.uk/eurogp2001/ GECCO'2001 at http://www.isgec.org/GECCO-2001 W. B. Langdon, Phone +44 20 7679 4436 Computer Science, Fax +44 20 7387 1397 University College, London, Gower Street, London, WC1E 6BT, UK http://www.cs.ucl.ac.uk/staff/W.Langdon ------------------------------ Date: Mon, 23 Oct 2000 23:25:26 +0900 From: iat01@kis.maebashi-it.ac.jp Subject: Intelligent Agent Technology (IAT-2001): 2nd CFP Second CALL FOR PAPERS The Second Asia-Pacific Conference on Intelligent Agent Technology (IAT-2001) Maebashi TERRSA, Maebashi City, Japan October 23-26, 2001 Home Page: http://kis.maebashi-it.ac.jp/iat01 Paper Submission Deadline: March 20, 2001 IAT-2001 will be jointly held with The First Asia-Pacific Conference on Web Intelligence (WI-2001) The Asia-Pacific Conference on Intelligent Agent Technology (IAT) is a high-quality, high-impact biennial agent conference series. The second meeting in this conference series follows the success of IAT'99 held in Hong Kong in 1999 (http://www.comp.hkbu.edu.hk/IAT99). IAT-2001 will primarily focus on (1) the state-of-the-art in the development of intelligent agents and (2) the theoretical and computational foundations of intelligent agent technology. The aim of IAT-2001 is to bring together researchers and practitioners from diverse fields, such as computer science, information technology, business, education, human factors, systems engineering, and robotics to (1) examine the design principles and performance characteristics of various approaches in intelligent agent technology, and (2) increase the cross-fertilization of ideas on the development of autonomous agents and multiagent systems among different domains. By encouraging idea-sharing and discussions on the underlying logical, cognitive, physical, and biological foundations as well as the enabling technologies of intelligent agents, IAT-2001 is expected to stimulate the future development of new models, new methodologies, and new tools for building a variety of embodiments of agent-based systems. TOPICS The technical issues to be addressed include, but not limited to: * Applications: - data and knowledge intensive domains (e.g., large databases, Internet, digital libraries, distributed decision making, financial modeling and engineering, business information systems and process automation) - software and interface agents (e.g., personal assistant, translator, scheduler, information filter, tutor) - computational intelligence (e.g., pattern analysis and recognition, imaging, optimization, resource allocation, constraint satisfaction, planning) - agents in e-commerce and e-business - autonomous agents in science and engineering (e.g. aerospace, survey of the seabed and space) - physically embodied systems (e.g., autonomous robots and groups) - very-large, complex, integrated intelligent systems * Computational Architecture and Infrastructure: - computational architectures - ontology models - agent-level and multi-agent-level infrastructure - communication languages - multi-modal systems and interfaces - protocols - tools and standards - heterogeneity and interoperability - scalability * Learning and Adaptation: - soft-computing in multi-agent systems - uncertainty management in multi-agent systems - integrated exploration and exploitation - long-term reliability - neural networks - artificial life - behavioral selection - coordinating perception, thought, and action - behavioral self-organization - believable lifelike quality - classifier systems - evolution and learning in dynamic environments - adaptation and self-adaptation - emergent behavior - evolutionary computation * Data and Knowledge Engineering/Communication: - information filtering - data mining - heterogeneous data integration and management - human-agent interaction - knowledge discovery - knowledge sharing - knowledge aggregation - reasoning and planning - adaptation and evolution of knowledge networks - distributed knowledge systems * Distributed Intelligence: - dynamics of groups and populations - swarms - population evolution - coevolution - collective group behavior - coordination and cooperation - distributed intelligence - social integration - market-based computing * Formal Theories of Agents: - formal/computational modeling - chaotic and fractal dynamics - computational complexity - efficiency in distributed systems - taxonomy of agent environments - classification and characterization of complex behaviors - theories of perception, rationality, intention, emotion, coordination, action, and social behaviors PAPER SUBMISSION & PUBLICATION ============================== High quality full-length papers in all IAT related areas are solicited. Papers exploring new directions are most welcome and will receive a careful and supportive review. All submitted papers will be reviewed on the basis of technical quality, relevance, significance, and clarity. Electronic submission is encouraged and preferred. Please send LaTex (MS-Words, or PDF) and PostScript versions of your paper, and an ASCII version of the cover page (in separate email), by March 20, 2001 to: iat01@maebashi-it.ac.jp Four (4) hardcopies of the paper by regular mail are also requested if electronic submission is not possible. Please send hardcopies of your paper by March 20, 2001 to: Prof. Ning Zhong (IAT-2001) Department of Information Engineering Maebashi Institute of Technology 460-1, Kamisadori-Cho, Maebashi-City, 371-0816 Japan TEL&FAX: +81-27-265-7366 E-mail: zhong@maebashi-it.ac.jp IMPORTANT DATES March 20, 2001 Paper submission deadline May 20, 2001 Notification of paper acceptance mailed June 20, 2001 Camera-ready copies of accepted papers due July 2, 2001 Demo submission deadline August 3, 2001 Notification of demo acceptance mailed October 23-26, 2001 Conference technical sessions FURTHER INFORMATION Please send suggestions and inquiries regarding IAT-2001 to: Prof. Ning Zhong (IAT-2001) Department of Information Engineering Maebashi Institute of Technology 460-1, Kamisadori-Cho, Maebashi-City, 371-0816 Japan TEL&FAX: +81-27-265-7366 E-mail: zhong@maebashi-it.ac.jp ------------------------------ Date: Tue, 24 Oct 2000 15:08:58 +0200 (CEST) From: Marc Schoenauer Subject: IPL Special Issue on EC: Deadline postponed The deadline for the Special Issue on Evolutionary Computation of the journal Information Processing Letter (A.E. Eiben and M. Schoenauer guest editors) is postponed until November 15. Please find all details at http://www.eeaax.polytechnique.fr/ipl_cfp.html ------------------------------ Date: Wed, 25 Oct 2000 21:05:21 +0200 From: Stefano Cagnoni Subject: [CFP] Special Session @ CEC2001 Greetings. I'm organizing the special session on Design Automation in the next Congress On Evolutionary Computation (CEC2001). In my intention, the session will cover "all" evolutionary computation techniques applied to VLSI CAD, including (but not limited to) automatic test pattern generation, Design for Testability, floorplanning, logic synthesis, hardware/software codesign, evolvable hardware and analog circuit design. You can find more details on CEC2001 homepage at http://cec2001.kaist.ac.kr/ I'd be honored if you'll decide to contribute to the session sending me your work, your opinions or just spamming this message to anyone you think appropriate. Please, feel free to forward this email to anyone you think appropriate, or send me his email and I'll contact him directly. Yours sincerely Giovanni Squillero Giovanni Squillero Politecnico di Torino - Dip. Automatica e Informatica Voice: +39-011564.7092 - Fax: +39-011564.7099 http://www.cad.polito.it/~squiller/ ------------------------------ Date: Thu, 26 Oct 2000 08:19:48 +0300 From: victor@chuvsu.ru (Victor S. Abrukov) Subject: from Abrukov, PI of ONR Dear Sir! Submitt me please if it possible the code Genesis (ftp.aic.nrl.navy.mil/pub/galist/). I would like also to have the something friendly software for a modeling of education quality control by neuro computer code. I will be very greatfu to you. Sincerely yours, Prof. Victor S. Abrukov [ Moderators' note: The Genesis code is available for download at www.aic.nrl.navy.mil/galist/src/ ] ------------------------------ Date: Fri, 27 Oct 2000 15:09:12 -0000 () From: Pal Karoly Ferenc Subject: Successful application of GA Some time ago there was a request to let the readers of this List know about successful applications of GA, i.e. if GA works better for some real problems than other algorithms. I quote from the preprint by Prof. A. P. Young: Computer Science in Physics, cond-mat/0010371 (http://xxx.lanl.gov/): > In three dimensions or higher calculating the ground state of spin glass is > NP for all boundary conditions. Most work has used "heuristic" algorithms, > which are not guaranteed to give the exact ground states, but which, when > used carefully, do seem to give the true ground state in most instances. > The most effective such approach seems to be the "genetic algorithm" > developed for spin glasses by Pal [21] and subsequently used by > Palassini and me [22,23] and Marinari and Parisi [24]. Reference 21 describing the algorithm in detail is: K. F. Pal: The ground state energy of the Edwards-Anderson Ising spin glass with a hybrid genetic algorithm, Physica A223 (1996) 283. K. F. Pal: The ground state of the cubic spin glass with short-range interactions of Gaussian distribution, Physica A233 (1996) 60. Besides the authors mentioned above, quite a few other authors applied the method successfully. Amongst them I should mention A. K. Hartmann, who improved the method by hybridizing the genetic algorithm with a search method more sophisticated than the one used originally. Although the algorithm was developed, tested and used for Ising spin glasses, I think some of the ideas applied there could well be used for other problems as well. Possibly it is worth a try. Best wishes to everyone Karoly Pal, e-mail: kfpal@hal.atomki.hu ------------------------------ From: "Nadine Gisler" Date: Fri, 27 Oct 2000 09:05:50 -0600 Subject: International Computer Science Conventions INTERNATIONAL COMPUTER SCIENCE CONVENTIONS Head Office: 5101C-50 Street, Wetaskiwin AB, T9A 1K1, Canada (Phone: +1-780-352-1912 / Fax: +1-780-352-1913) Email: or / Web-Site: http://www.icsc.ab.ca extended deadline: 1. CIMA'2001 Computational Intelligence, Methods and Applications http://www.icsc.ab.ca/cima2001.htm University of Wales in Bangor, U.K., June 19-22, 2001 including: - Fuzzy Logic and Applications FLA 2001 http://www.icsc.ab.ca/171-info.htm - Advances in Intelligent Data Analysis (AIDA 2001) http://www.icsc.ab.ca/172-info.htm - Advanced Computing in Bio Medicine (ACBM 2001) http://www.icsc.ab.ca/173-info.htm - Advanced Computing in the Financial Market (ACFM 2001) http://www.icsc.ab.ca/174-info.htm - Granular Computing Workshop (GcC 2001) http://www.icsc.ab.ca/175-info.htm Upon request we extended the submission deadline until November 30, 2000 (final papers and registration February 15, 2001) 2. SOCO 2001/ISFI 2001 Paisley, Scotland U.K., June 26 - 29, 2001 General Chair: Colin Fyfe, U.K. http://www.icsc.ab.ca/soco2001.htm submission deadline: November 30, 2000 final papers and registration: March 15, 2001 including: SOCO - Soft Computing Chair: Colin Fyfe, U.K. ISFI - Intelligent Systems for Industry Chair: Douglas Campbell, U.K. 3. THIRD WORLD MANUFACTURING CONGRESS (WMC'2001) http://www.icsc.ab.ca/wmc2001.htm and Distributed Intelligence in Technology, Economic and Social Applications (DI-TESA'2001) http://www.icsc.ab.ca/ditesa2001.htm September 24 - 27, 2001 Rochester Institute of Technology RIT New York, USA submission deadline: December 31, 2000 final papers and registration: April 30, 2001 ------------------------------ Date: Sun, 29 Oct 2000 17:40:15 -0500 From: Andrea Danyluk Subject: ICML2000 Call for Workshop Proposals Call for Workshop Proposals International Conference on Machine Learning (ICML-2001) The ICML-2001 Organizing Committee invites proposals for workshops to be held at the Eighteenth International Conference on Machine Learning (ICML-2001). ICML-2001 workshops will be held on the first day of the conference, June 28, at Williams College, the scenic site of all ICML-2001 events. Workshop proposals should be submitted as outlined below. ICML workshops provide organizers and participants with an opportunity to focus intensively on a specific topic within machine learning. Often, workshops concentrate on an emerging topic of technical interest (e.g., hierarchical reinforcement learning), a unique area of application for machine learning technologies (e.g., machine learning for genetics), or a community-wide issue that deserves specialized attention (e.g., machine learning and privacy). Proposals Workshop proposals should provide sufficient information to evaluate the quality and importance of the topic, the goals of the workshop, and the size of the interested community. Proposals should identify one or more chairs and several other individuals willing to serve on an organizing committee and assist with publicity and reviewing. Proposals should be 2-4 pages and contain at least the following information: - Description: What will the workshop be about? Why is the topic best addressed in an ICML workshop, as opposed to a workshop at another conference or papers in an ICML technical session? - Goals: What do you expect will come out of the workshop? How will the workshop change participants' understanding of the area? - Format: How will the workshop sessions be scheduled? How much time will be used for discussion, panel discussions, paper presentations, invited talks, or other methods for encouraging communication and consensus? Organizers are encouraged to focus on mechanisms other than traditional paper presentations and to differentiate themselves clearly from typical conference sessions. - Publicity: How do you intend to publicize the workshop? How will you reach the most interested and appropriate participants? - Potential participants: Who are potential participants in the workshop? - Organizers: Please include the name, postal address, phone number, e-mail address, and webpage of each chair and each member of the organizing committee. In addition, indicate the chairs' background in the workshop area. Important Dates Proposals due: Dec. 11, 2000 Notification: Dec. 18, 2000 Publicity material due: Jan. 15, 2001 Written materials due: Mar. 26, 2001 Notification to participants: Apr. 09, 2001 Working notes due: May. 14, 2001 Workshop held: Jun. 28, 2001 Proposals will be reviewed by the workshop chair and members of the organizing committee. Please submit three hard copies or an electronic copy (plain text or PostScript) to the workshop chair. Proposals should be submitted to: David Jensen Department of Computer Science 140 Governor's Drive University of Massachusetts Amherst, MA 01003 Tel: 413-545-9677 Fax: 413-545-1249 jensen@cs.umass.edu Additional Information For additional information, see the web site for the conference: http://www.ecn.purdue.edu/icml2001/ which will provide additional details as they become available. If you have questions about ICML-2001, please send electronic mail to icml2001@ecn.purdue.edu. ------------------------------ Date: Mon, 30 Oct 2000 20:33:36 +1100 (EST) From: Graham Williams Subject: Reminder CFP: Pacific Asia Data Mining Conference (PAKDD-2001) Just a reminder..... the deadline is fast approaching. Also, today is the deadline for TUTORIAL and WORKSHOP PROPOSALS. Submission Deadline 12 November The Fifth Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-01) Hong Kong, April 16 - 18, 2001 http://www.csis.hku.hk/pakdd01 The Fifth Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-01) will be an international forum for the sharing of original and innovative research results and practical applications and experiences among researchers and application developers from the many constituent areas of KDD, including artificial intelligence, databases, e-commerce, Internet computing, machine learning, high performance computing, statistics and visualization. This conference builds on the success of PAKDD-97 (Singapore), PAKDD-98 (Australia), PAKDD-99 (China) and PAKDD-00 (Japan) by bringing together participants from universities, industry and government. With the growing number of successful applications and systems development in KDD in enterprise computing and e-commerce the conference encourages submissions on practical experiences in applying KDD techniques to real-world applications. TOPICS We invite submissions in the areas of KDD research and application. Areas of interest include but are not limited to: Foundations and principles of data mining New application challenges and requirements Web based mining Data mining applications in e-commerce Resource discovery in the Internet Internet standards for data mining Data mining and data warehousing Data mining in multidimensional databases Data mining in heterogeneous databases Data mining support for data warehouse design Integration with data warehousing/OLAP Parallel and distributed mining Statistical methods in data mining Rule induction and decision trees Clustering and classification Exploratory data analysis Visual data mining and visualization Machine learning for data mining Knowledge representation and acquisition in KDD Performance and benchmarks of KDD systems Security and social impact of data mining IMPORTANT DATES Tutorial proposals : 30 October 2000 Workshop proposals : 30 October 2000 Submissions due date : 12 November 2000 Notification date : 24 December 2000 Demonstration proposals: 15 January 2001 Camera ready date : 23 January 2001 Conference date : 16-18 April 2001 ------------------------------ Date: Tue, 31 Oct 2000 18:39:55 +0100 From: Guenther Raidl Subject: CFP: EvoCOP - Evonet Workshop on Combinatorial Optimization EvoCOP2001 FIRST EUROPEAN WORKSHOP ON EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION Lake Como (Milan), April 18, 2001 Call for Papers http://www.ads.tuwien.ac.at/evocop2001 Evolutionary algorithms have often been shown to be effective for difficult combinatorial optimization problems appearing in various industrial, economical, and scientific domains. Prominent examples of such problems are transportation problems, traveling salesperson, satisfiability, packing, network design, or general mixed integer programming. EvoCOP is the first European event specifically dedicated to the application of evolutionary computation to combinatorial optimization problems and gives researchers in those fields an opportunity to present their latest research and to discuss current developments and applications, besides stimulating closer future interaction between members of this scientific community. The workshop is sponsored by EvoNet, the Network of Excellence in Evolutionary Computing, and will be held in conjunction with EuroGP2001, the European Conference on Genetic Programming (April 18-20), as part of EvoWorkshops2001, which will be held on the first day of EuroGP. Topics of interest include, but are not limited to: * Applications of evolutionary algorithms and related heuristics like simulated annealing or ant systems to combinatorial optimization problems * Representation techniques * Evolutionary operators * Constraint-handling techniques * Hybrid methods * Parallelization * Theoretical developments, search space analyses * Comparisons between different (also non-evolutionary) techniques Timetable : Submission deadline: 16 November 2000 Notification of acceptance: 20 December 2000 Camera ready due: 25 January 2001 Workshop: 18 April 2001 Contacts: For any information please contact the EvoCOP chairs Jens Gottlieb and Günther Raidl Please visit also the EvoNet Web-site for the official EuroGP and EvoWorkshops2001 page. Best regards, Guenther Raidl Guenther Raidl Institute of Computer Graphics and Algorithms Vienna University of Technology Favoritenstrasse 9-11/1861, 1040 Vienna, Austria, Europe email: raidl@ads.tuwien.ac.at | phone: +43(1)58801/18616 http://www.ads.tuwien.ac.at/ | fax: +43(1)58801/18699 ------------------------------ Date: Fri, 03 Nov 2000 22:04:48 +0200 From: "antonio.m@italymail.com" Subject: Deadline extension: NNA FSFS EC 2001 FINAL CALL FOR PAPERS in the following areas: Neural Networks and Applications Fuzzy Systems and Applications Genetic Algorithms and Applications Intelligent Control Intelligent Robotics Systems Intelligent Communication Systems Intelligent Industrial Applications Intelligent Data Bases IN THE WORLDSES CONFERENCES: NNA 2001 (Neural Netorks and Applications), FSFS 2001 (Fuzzy Sets and Fuzzy Systems) EC 2001(Evolutionary Computation), A unique triplet of soft computing conferences. Puerto De La Cruz, Tenerife, Canary Islands, (Spain), February 11-15, 2001. EXTENSION FOR THE DEADLINE FOR PAPER SUBMISSION: NOVEMBER 30, 2000 NNA'01 TOPICS: ============== Biological Neural Networks Artificial Neural Networks Mathematical Foundations of Neural Networks Virtual Environments Neural Networks (NN) for Signal Processing Connectionist Systems Learning Theory Architectures and Algorithms Neurodynamics and Attractor Networks Pattern Classification and Clustering Hybrid and Knowledge-Based Networks Artificial Life Implementation of (artificial) NN VLSI techniques for NN implementation Neural Control NN for Robotics NN for Optimization, Systems theory and Operational Research NN in Numerical Analysis problems NN Training using Fuzzy Logic NN Training using Evolutionary Computations Interaction between: Neural Networks - Fuzzy Logic - Genetic Algorithms NN and Non-linear Systems NN and Chaos and Fractals Modeling and Simulation Hybrid Intelligent systems Neural Networks for Electric Machines Neural Networks for Power Systems Neural Networks for Real-Time Systems Neural Networks in Information Systems Neural Networks in Decision Support Systems Neural Networks and Discrete Event Systems Neural Networks in Communications Neural Networks for Multimedia Neural Networks for Educational Software Neural Networks for Software Engineering NN for Adaptive Control NN for Aerospace, Oceanic and Vehicular Engineering Man-Machine Systems Cybernetics and Bio-Cybernetics Relevant Topics and Applications Parallel and Distributed Systems Special Topics Others. FSFS'01 TOPICS: ============== Fuzzy Logic Fuzzy Sets Fuzzy Topology and Fuzzy Functional Analysis Fuzzy Differential Geometry Fuzzy Differential Equations Fuzzy Algorithms Fuzzy Geometry Fuzzy Languages Fuzzy Control Fuzzy Signal Processing Fuzzy Subband Image Coding VLSI Fuzzy Systems Approximate Reasoning Fuzzy Logic and Possibility theory Fuzzy Expert Systems Fuzzy Systems theory Connectionist Systems Learning Theory Pattern Classification and Clustering Hybrid and Knowledge-Based Networks Artificial Life Fuzzy Systems in Robotics Fuzzy Systems for Operational Research NN Training using Fuzzy Logic Interaction between: Neural Networks - Fuzzy Logic - Genetic Algorithms Fuzzy Systems and Non-linear Systems Fuzzy Systems and Chaos and Fractals Modeling and Simulation Hybrid Intelligent systems Fuzzy Systems and Fuzzy Engineering for Electric Machines Fuzzy Systems and Fuzzy Engineering for Power Systems Fuzzy Systems and Fuzzy Engineering for Real-Time Systems Fuzzy Systems and Fuzzy Engineering for Information Systems Fuzzy Systems and Fuzzy Engineering for Decision Support Systems Fuzzy Systems and Fuzzy Engineering for Discrete Event Systems Fuzzy Systems and Fuzzy Engineering for Communications Fuzzy Systems and Fuzzy Engineering for Multimedia Fuzzy Systems and Fuzzy Engineering for Educational Software Fuzzy Systems and Fuzzy Engineering for Software Engineering Fuzzy Systems and Fuzzy Engineering for Adaptive Control Fuzzy Systems and Fuzzy Engineering for Aerospace, Oceanic and Vehicular Engineering Man-Machine Systems Cybernetics and Bio-Cybernetics Relevant Topics and Applications Parallel and Distributed Systems Special Topics Others. EC'01 TOPICS: ============= Genetic Algorithms (GA) Mathematical Foundations of GA Evolution Strategies Genetic Programming Evolutionary Programming Classifier Systems Cultural algorithms Simulated Evolution Artificial Life Learning Theory Pattern Classification and Clustering Evolutionary Computations (EC) in Knowledge Engineering Evolvable Hardware Molecular Computing EC in Control Theory EC in Signal Processing EC for Image Coding Approximate Reasoning EC in Robotics EC for Operational Research Neural Networks Training using EC Interaction between: Neural Networks - Fuzzy Logic - Evolutionary Computations EC and Non-linear Systems theory Modeling and Simulation Hybrid Intelligent systems EC for Electric Machines EC for Power Systems EC for Real-Time Systems EC for Information Systems EC for Decision Support Systems EC for Discrete Event Systems EC for Communications EC for Multimedia EC for Educational Software EC for Software Engineering EC for Adaptive Control EC for Aerospace, Oceanic and Vehicular Engineering Global Optimization Man-Machine Systems Cybernetics and Bio-Cybernetics Relevant Topics and Applications Parallel and Distributed Systems Special Topics Others. ------------------------------ Date: Sun, 5 Nov 2000 13:45:16 +1100 (EST) From: Congress on Evolutionary Computation Subject: CEC2001 Call for Tutorial Proposals The 2001 Congress on Evolutionary Computation (CEC2001) May 27-30, 2001 COEX Center, Seoul, Korea Further details can be found on http://cec2001.kaist.ac.kr or http://scai.snu.ac.kr/cec2001. Dear Colleague CEC2001 welcomes proposals for tutorials on all aspects of evolutionary computation, and its application to solving problems. Important Dates: January 15, 2001: Deadline for tutorial proposals February 15, 2001: Notification of tutorial acceptance March 15, 2001: Electronic version of tutorial notes due (PostScript, PDF, or MS Word) May 27, 2001: Tutorials and workshops at CEC2001 May 28-30, 2001: Technical sessions at CEC2001 Tutorial Requirements: Tutorials provide a means for senior researchers to present an overview of a field related to evolutionary computation. A tutorial should not be a technical presentation focusing on ones own work only. It should preferably handle a relatively large chunk of knowledge on a specific area, typically at an introductory level. For example, look at the tutorial program from CEC2000 on http://pcgipseca.cee.hw.ac.uk/cec2000. Proposals for tutorials should be one page in length and should contain the following information: 1. Title 2. Name and full contact information of the proposer(s). 3. A brief description (one or two paragraphs) of the topics. 4. Any resource requirements, e.g. computers, equipment set-up etc. 5. An optional label being either "novice" (e.g. Intro to GP) or "advanced" (e.g. Recent advances in parallel GAs). For specific details or to submit a proposal: contact the Tutorial Chairs, Paul Darwen (darwen@ieee.org) or Jong-Chen Chen (jcchen@mis4k.mis.yuntech.edu.tw). Looking forward to your participation. CEC2001 Publicity Chairs Takeshi Furuhashi (Japan and Far East) Bob Mckay (Australia and Pacific Rim) Robert Reynolds (Americas) Ali Zalzala (Europe and Mediterranean) ------------------------------ End of Genetic Algorithms Digest ******************************