JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for EVOLUTIONARY-COMPUTING Archives


EVOLUTIONARY-COMPUTING Archives

EVOLUTIONARY-COMPUTING Archives


EVOLUTIONARY-COMPUTING@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

EVOLUTIONARY-COMPUTING Home

EVOLUTIONARY-COMPUTING Home

EVOLUTIONARY-COMPUTING  October 2017

EVOLUTIONARY-COMPUTING October 2017

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

Special Issue on Benchmarking of Computational Intelligence Algorithms in Computational Intelligence – An International Journal published by Wiley Periodicals, Inc.

From:

Markus Wagner <[log in to unmask]>

Reply-To:

Markus Wagner <[log in to unmask]>

Date:

Fri, 13 Oct 2017 22:32:11 +1030

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (167 lines)

Special Issue on Benchmarking of Computational Intelligence Algorithms
in Computational Intelligence – An International Journal published by
Wiley Periodicals, Inc.
http://iao.hfuu.edu.cn/bocia-ci-si

Computational Intelligence (CI) is a huge and expanding field which is
rapidly gaining importance, attracting more and more interests from
both academia and industry. It includes a wide and ever-growing
variety of optimization and machine learning algorithms, which, in
turn, are applied to an even wider and faster growing range of
different problem domains. For all of these domains and application
scenarios, we want to pick the best algorithms. Actually, we want to
do more, we want to improve upon the best algorithm. This requires a
deep understanding of the problem at hand, the performance of the
algorithms we have for that problem, the features that make instances
of the problem hard for these algorithms, and the parameter settings
for which the algorithms perform the best. Such knowledge can only be
obtained empirically, by collecting data from experiments, by
analyzing this data statistically, and by mining new information from
it. Benchmarking is the engine driving research in the fields of
optimization and machine learning for decades, while its potential has
not been fully explored. Benchmarking the algorithms of Computational
Intelligence is an application of Computational Intelligence itself!
This special issue of the EI/SCI-indexed Computational Intelligence
journal published by Wiley Periodicals Inc. solicits novel
contributions from this domain according to the topics of interest
listed below.


1. Topics of Interest

The topics of interest for this workshop include, but are not limited to:

 o mining of higher-level information from experimental results
 o modelling of algorithm behaviors and performance
 o visualizations of algorithm behaviors and performance 
 o statistics for performance comparison (robust statistics, PCA, ANOVA,
   statistical tests, ROC, …)  
 o evaluation of real-world goals such as algorithm robustness,
   reliability, and implementation issues 
 o theoretical results for algorithm performance comparison
 o comparison of theoretical and empirical results
 o new benchmark problems
 o automatic algorithm configuration
 o algorithm selection
 o the comparison of algorithms in "non-traditional" scenarios such as
   - multi- or many-objective domains   
   - parallel implementations, e.g., using GGPUs, MPI, CUDA, clusters, or
     running in clouds   
   - large-scale problems or problems where objective function evaluations
     are costly   
   - dynamic problems or where the objective functions involve randomized
     simulations or noise   
   - deep learning and big data setups
 o comparative surveys with new ideas on
   - dos and don'ts, i.e., best and worst practices, for algorithm
     performance comparison   
   - tools for experiment execution, result collection, and algorithm
     comparison   
   - benchmark sets for certain problem domains and their mutual advantages
     and weaknesses


2. Important Dates

Pre-Submission Deadline:          05  May       2018   
Paper Submission Deadline:        05  June      2018  
Expected Notification:            05  August    2018  
Resubmission (Revision):          05  October   2018  
Expected Notification (Revision): 05  November  2018  
Final Submission:                 05  December  2018  
Decision Notification:            05  February  2019  
Publication:                                    2019  


3. Submission Process:

The papers of this special issue will be processed according to the
journal’s special issue guidelines at
http://projects.cs.dal.ca/ci/Special-issue-instructions.html. This
requires a preliminary submission step, for which the papers should be
sent by the pre-submission deadline to [log in to unmask] with CC to
[log in to unmask], and [log in to unmask]


4. Guest Editors

Prof. Dr. Thomas Weise obtained the MSc in Computer Science in 2005 from
the Chemnitz University of Technology and his PhD from the University of
Kassel in 2009. He then joined the University of Science and Technology of
China (USTC) as PostDoc and subsequently became Associate Professor at the
USTC-Birmingham Joint Research Institute in Intelligent Computation and Its
Applications (UBRI) at USTC. In 2016, he joined Hefei University as Full
Professor to found the Institute of Applied Optimization at the Faculty of
Computer Science and Technology. Prof. Weise has more than seven years of
experience as a full time researcher in China, having contributed
significantly both to fundamental as well as applied research. He has more
than 80 scientific publications in international peer reviewed journals and
conferences. His book "Global Optimization Algorithms – Theory and
Application" has been cited more than 730 times. He has acted as reviewer,
editor, or programme committee member at 70 different venues.

Prof. Dr. Bin Li received the B.S. degree from Hefei University of
Technology, Hefei, China, in 1992, the M.Sc. degree from Institute of
Plasma Physics, China Academy of Science, Hefei, China, in 1995, and the
Ph.D. degree from University of Science and Technology of China (USTC),
China in 2001. He is currently a professor with the School of Information
Science and Technology, USTC, Hefei, China. He has authored and co-authored
more than 40 refereed publications. His major research interests include
evolutionary computation, memetic algorithms, pattern recognition, and
real-world applications. Dr. Li is the Founding Chair of IEEE CIS Hefei
Chapter, Counselor of IEEE USTC Student Branch, senior member of Chinese
Institute of Electronics (CIE), member of the Technical Committee of
Electronic Circuits and Systems Section of CIE.

Dr. Markus Wagner is a Senior Lecturer at the School of Computer Science,
University of Adelaide, Australia. He has done his PhD studies at the Max
Planck Institute for Informatics in Saarbrücken, Germany and at the
University of Adelaide, Australia. His research topics range from
mathematical runtime analysis of heuristic optimization algorithms and
theory-guided algorithm design to applications of heuristic methods to
renewable energy production, professional team cycling and software
engineering. So far, he has been a program committee member 30 times, and
he has written over 70 articles with over 70 different co-authors. He has
chaired several education-related committees within the IEEE CIS, is Co-
Chair of ACALCI 2017 and General Chair of ACALCI 2018.

Prof. Dr. Xingyi Zhang received the B.Sc. from Fuyang Normal College in
2003, and the M.Sc. in 2006 and Ph.D. in 2009 both from Huazhong University
of Science and Technology. Currently, he is a professor in the School of
Computer Science and Technology, Anhui University. His main research
interests include unconventional models and algorithms of computation,
multi-objective evolutionary optimization and membrane computing. He is the
chair of 2017 Data Driven Optimization of Complex Systems and Applications
and 2015 Asian Conference on Membrane Computing. He also serves as
Editorial Board Member of Complex & Intelligent Systems and International
Journal of Bio-inspired Computing.

Prof. Dr. Jörg Lässig leads the Enterprise Application Development Group of
the University of Applied Sciences Zittau/Görlitz in Germany since 2011. He
holds degrees in Computer Science, Computational Physics, and received a
Ph.D. in Computer Science for his research on efficient algorithms and
models for the generation and control of cooperation networks at Chemnitz
University of Technology (Germany), which he finished in 2009. Prof. Lässig
has PostDocs at the Università della Svizzera italiana, Institute of
Computational Sciences (Lugano, Switzerland) and the International Computer
Science Institute Berkeley (California, USA). His research directions
include sustainable IT services, energy efficiency benchmarking, regional
carbon footprints and energy informatics.


5. Related Event: BOCIA

International Workshop on Benchmarking of Computational Intelligence
Algorithms (BOCIA) at the Tenth International Conference on Advanced
Computational Intelligence (ICACI 2018), March 29-31, 2018 in Xiamen,
China, http://iao.hfuu.edu.cn/bocia18

All accepted papers in this workshop will be included in the
Proceedings of the IEEE ICACI 2018 published by IEEE Press and indexed
by EI. Authors of selected papers will be invited to submit extended
versions of these papers to the Special Issue on Benchmarking of
Computational Intelligence Algorithms appearing in the Computational
Intelligence journal by Wiley Periodicals Inc., indexed by EI and SCI
(see the last page of this CfP, http://iao.hfuu.edu.cn/bocia-ci-si,
and http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8640).

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
December 2006
November 2006
October 2006
September 2006
August 2006
July 2006
June 2006
May 2006
April 2006
March 2006
February 2006
January 2006
December 2005
November 2005
October 2005
September 2005
August 2005
July 2005
June 2005
May 2005
April 2005
March 2005
February 2005
January 2005
December 2004
November 2004
October 2004
September 2004
August 2004
July 2004
June 2004
May 2004
April 2004
March 2004
February 2004
January 2004
December 2003
November 2003
October 2003
September 2003
August 2003
July 2003
June 2003
May 2003
April 2003
March 2003
February 2003
January 2003
December 2002
November 2002
October 2002
September 2002
August 2002
July 2002
June 2002
May 2002
April 2002
March 2002
February 2002
January 2002
December 2001
November 2001
October 2001
September 2001
August 2001
July 2001
June 2001
May 2001
April 2001
March 2001
February 2001
January 2001
December 2000
November 2000
October 2000
September 2000
August 2000
July 2000
June 2000
May 2000
April 2000
March 2000
February 2000
January 2000
December 1999
November 1999
October 1999
September 1999
August 1999
July 1999
June 1999
May 1999
April 1999
March 1999
February 1999
January 1999
December 1998
November 1998
October 1998
September 1998


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager