[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
SAC '02 - 2002 ACM SYMPOSIUM ON APPLIED COMPUTING - Call for
[Apologies for multiple copies]
CALL FOR PAPERS
SAC '02 - 2002 ACM SYMPOSIUM ON APPLIED COMPUTING
Special Track on
Artificial Intelligence and Computational Logic
http://lovelace.spsu.edu/chung/sacai02.htm
March 10 - 13, 2002
Madrid, Spain
SAC '02
Over the past sixteen years, the ACM Symposium on Applied Computing has
become a primary forum for applied computer scientists, computer
engineers, software engineers, and application developers from around
the world to interact and present their work. SAC 2002 is sponsored by
the ACM Special Interest Group on Applied Computing (SIGAPP). Authors
are invited to contribute original papers in all areas of experimental
computing and application development for the technical sessions. For
additional information, please check the SAC web page:
http://www.acm.org/conferences/sac/sac2002
ARTIFICIAL INTELLIGENCE AND COMPUTATIONAL LOGIC TRACK
A special track on Artificial Intelligence and Computational Logic will
be held at SAC '02. It will be a forum for engineers, researchers and
practitioners throughout the world to share technical ideas and
experiences relating to implementation and application of Artificial
Intelligence. Original papers, tutorial (half or full day), and panel
proposals are invited in all areas of Artificial Intelligence. Topics of
interest include, but are not limited to:
-Applications of Artificial Intelligence
-Artificial Intelligence
-Artificial Immune Systems
-Computational Logic
-Constraint Solving and Programming
-Image Analysis
-Image Segmentation and Classification
-Intelligent Embedded Systems
-Knowledge-based Systems
-Knowledge Representation
-Machine Learning
-Neural Networks
-Search Techniques
-Simulation of Swarm Intelligence
GUIDELINES FOR SUBMISSION
Original papers from the above-mentioned areas will be considered. This
includes three categories of submissions:
1) Original and unpublished research
2) Reports of innovative artificial intelligence applications in the
arts, sciences, engineering, business, government, education and
industry
3) Reports of successful technology transfer to new problem domains
Each category of submissions will be reviewed by peer groups appropriate
to that category. Accepted papers in all categories will be published in
the symposium proceedings. Expanded versions of selected papers from all
categories will be considered for publication in the ACM/SIGAPP
quarterly Applied Computing Review or one of the other participating
SIGs' publications. Submission guidelines must be strictly followed:
1) Submit four (4) copies of original manuscripts to one of the
following co-chairs:
S. Bistarelli
Dipartimento di Informatica
Corso Italia, 40
I 56100 Pisa
ITALY
Tel: +39-050-2212768
Fax: +39-050-2212726
Email: bista@di.unipi.it
http://www.di.unipi.it/~bista
C. C. HungComputer
Science Department
1100 South Marietta Parkway
Southern Polytechnic State Univ.
Marietta, GA 30060
USA
Tel: (770) 528-3574
Fax: (770) 528-5511
E-mail: chung@spsu.edu
A. Rosa
Systems and Robotics Institute
LaSEEB - ISR - IST
Av. Rovisco Pais, 1 - Torre Norte 6.21
1049-001 Lisboa
Portugal
Tel: +351-21-8418276/7
Fax: +351-21-8418291
E-mail:acrosa@isr.ist.utl.pt
http://laseeb.ist.utl.pt
2) An electronic submission via e-mail is also recommended. The
file format should be either PS or PDF.
3) The author(s) name(s)and address(es) must not appear in the body of
the paper, and self-reference should be in the third person. This is to
facilitate blind review.
4) The body of paper should not exceed 4,000 words (approximately 15
pages, double-spaced).
5) A separate cover sheet attached to each copy should show the title of
the paper, the author(s) name(s) and affiliation(s), and the address
(including e-mail, telephone, and FAX) to which correspondence should be
sent. A few key words should be provided.
IMPORTANT DATES
September 1, 2001: Paper and Tutorial Submissions Due
October 15, 2001: Author Notification
November 1, 2001: Camera-Ready Paper Due