TWO Calls for Papers: Black-Box Discrete Optimization Benchmarking (BB-DOB) Workshops at GECCO and PPSN 2018
Two BB-DOB workshops will take place in 2018, i.e., the first edition as BB-DOB@GECCO and the second edition as [log in to unmask] Both are independent events of the same series. Here we provide both calls for papers together.
A. Black-Box Discrete Optimization Benchmarking (BB-DOB@GECCO)
Workshop @ 2018 Genetic and Evolutionary Computation Conference (GECCO 2018)
July 15-19, 2018 in Kyoto, Japan, deadline 2018-03-27
http://iao.hfuu.edu.cn/bbdob-gecco18
see "Call for Papers A"
B. Black-Box Discrete Optimization Benchmarking (BB-DOB@PPSN)
Workshop @ 15th International Conference on Parallel Problem Solving from Nature
September 8-9, 2018 in Coimbra, Portugal, deadline 2018-03-26
http://iao.hfuu.edu.cn/bbdob-ppsn18
see "Call for Papers B"
Call for Papers A: Black-Box Discrete Optimization Benchmarking (BB-DOB@GECCO)
Workshop @ 2018 Genetic and Evolutionary Computation Conference (GECCO 2018)
July 15-19, 2018 in Kyoto, Japan
http://iao.hfuu.edu.cn/bbdob-gecco18
The Black-Box Discrete Optimization Benchmarking Workshop (BB-DOB@GECCO), a part of the Genetic and Evolutionary Computation Conference (GECCO) 2018, is cordially inviting the submission of original and unpublished research papers.
Quantifying and comparing the performance of optimization algorithms is one important aspect of research in search and optimization. The Black-Box- Optimization Benchmarking (BBOB) methodology introduced by the long- standing and successful BBOB-GECCO workshops series has become a well- established standard for benchmarking continuous optimization algorithms. The aim of this workshop is to develop a similar standard methodology for the benchmarking of black-box optimization algorithms for discrete and combinatorial domains. We want to produce:
(1) a well-motivated benchmark function testbed,
(2) a standardized experimental set-up,
(3) rules for measuring and the generation of data output, and
(4) standardized post-processing and presentations for the results in graphs and tables.
A.1. Topics of Interest
This first installment of the new BB-DOB workshop series focuses on a debate regarding which functions should be included in the benchmarking testbed. These benchmark functions should capture the difficulties of combinatorial optimization problems in practice, but at the same time be comprehensible so that the resulting algorithm behaviors can be understood or interpreted. In this way, the mutual advantages and disadvantages of algorithms can be analyzed in depth. Gaining such insights is vital for the design of improved algorithms. The sought benchmark functions should ideally be scalable with the problem size and non-trivial in the black-box optimization sense, i.e., allow for shifting the optimum to any point. This workshop wants to provide a common forum to bring together experts on benchmarking of optimization algorithms. Interested participants are encouraged to submit papers related to black-box optimization benchmarking of discrete optimizers in the widest sense. In particular if they suggest,
(1) function classes that should be included in the function collection and motivate the reasons for inclusion,
(2) benchmark function properties that allow to capture difficulties which occur in real-world applications (e.g., deception, separability, etc.)
(3) which classes of standard combinatorial optimization problems should be included and how to select significant instances,
(4) which classes of toy problems should be included and motivate why
(5) issues concerning any other aspect of benchmarking methodology for discrete optimizers such as design of experiments, performance measures, presentation methods, etc.
All accepted papers in this workshop will be included in the Companion Material Proceedings of the Genetic and Evolutionary Computation Conference 2018 published by ACM 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.
This workshop is organized as part of the ImAppNIO Cost Action 15140.
For more information please contact Pietro S. Oliveto at [log in to unmask]
Disclaimer: Two BB-DOB workshops will take place in 2018, i.e., the first edition as BB-DOB@GECCO and the second edition as [log in to unmask] Both are independent events of the same series.
A.2. Important Dates
Paper Submission Opens: 27 February 2018
Paper Submission Deadline: 27 March 2018
Notification of Acceptance: 11 April 2018
Camera-Ready Copy Due: 24 April 2018
Conference Presentation: 15-19 July 2018
A.3. Instructions for Authors
Detailed instructions regarding how to submit papers and the paper format are given at the conference website http://gecco-2018.sigevo.org/index.html/Papers+Submission+Instructions. Some general things to consider are:
- Submitted papers should be ANONYMIZED, i.e., cannot contain any element that may reveal the identity of their authors, in order to facilitate a double-blind review process.
- The maximum paper length is eight pages.
- The paper format is the ACM SIG format.
- The paper size is US Letter (8-1/2x11 inches).
- Papers must be submitted in pdf format.
- The papers must include a correct ACM copyright statement.
- If the paper is accepted, also all sources (LaTeX, Word, all graphics, etc.) need to be submitted alongside the final version.
A.4. Chairs
o Pietro S. Oliveto, University of Sheffield, UK
o Markus Wagner, University of Adelaide, Australia
o Thomas Weise, Hefei University, Hefei, China
o Borys Wróbel, Adam Mickiewicz University, Poland
o Aleš Zamuda, University of Maribor, Slovenia
A.5. International Program Committee
o Abhishek Awasthi, University of Applied Sciences Zittau/Görlitz, Görlitz, Germany
o Christian Blum, Artificial Intelligence Research Institute, Bellaterra, Spain
o Josu Ceberio Uribe, University of the Basque Country, Bilbao, Spain
o Wenxiang Chen, Colorado State University, Fort Collins, CO, USA
o Raymond Chiong, The University of Newcastle, Callaghan, Australia
o Carola Doerr, Université Pierre et Marie Curie - Paris 6, Paris, France
o Mohamed El Yafrani, Mohammed V University of Rabat, Rabat, Morocco
o Thomas Jansen, Aberystwyth University, UK
o Michael Kolonko, TU Clausthal, Clausthal-Zellerfeld, Germany
o William La Cava, University of Pennsylvania, Philadelphia, PA, USA
o Algirdas Lančinkas, Vilnius University, Lithuania
o Jörg Lässig, University of Applied Sciences Zittau/Görlitz, Görlitz, Germany
o Bin Li, University of Science and Technology of China, Hefei, China
o Jinlong Li, University of Science and Technology of China, Hefei, China
o Pu Li, Technische Universität Ilmenau, Ilmenau, Germany
o Zhen Liu, Hefei University, Hefei, China
o Manuel López-Ibáñez, University of Manchester, Manchester, UK
o Yi Mei, Victoria University of Wellington, Wellington, New Zealand
o Martin Middendorf, Leipzig University, Leipzig, Germany
o Frank Neumann, University of Adelaide, Australia
o Miguel Nicolau, University College Dublin, Ireland
o Pietro S. Oliveto, University of Sheffield, UK
o Qi Qi, University of Science and Technology of China, Hefei, China
o Ofer Shir, Tel-Hai College, Israel
o Danilo Sipoli Sanches, Federal University of Technology – Paraná, Cornélio Procópio, Brazil
o Kate Smith-Miles, The University of Melbourne, Melbourne, VIC, Australia
o Thomas Stützle, Université Libre de Bruxelles (ULB), IRIDIA, Belgium
o Markus Ullrich, University of Applied Sciences Zittau/Görlitz, Görlitz, Germany
o Ryan J. Urbanowicz, University of Pennsylvania, Philadelphia, PA, USA
o Sébastien Verel, Université du Littoral Côte d'Opale, France
o Markus Wagner, University of Adelaide, Australia
o Thomas Weise, Hefei University, Hefei, China
o Carsten Witt, Technical University of Denmark, Denmark
o Borys Wróbel, Adam Mickiewicz University, Poland
o Zijun Wu, Hefei University, Hefei, China
o Yang Yu, Nanjing University, Nanjing, China
o Aleš Zamuda, University of Maribor, Slovenia
o Xingyi Zhang, Anhui University, Hefei, China
A.6. Chair Biographies
Pietro S. Oliveto is a Senior Lecturer and an EPSRC Early Career Fellow at the University of Sheffield, UK. He received the Laurea degree in computer science from the University of Catania, Italy in 2005 and the PhD degree from the University of Birmingham, UK in 2009. He has been EPSRC PhD+ Fellow (2009-2010) and EPSRC Postdoctoral Fellow (2010-2013) at Birmingham and Vice-Chancellor's Fellow at Sheffield (2013-2016). His main research interest is the performance analysis of bio-inspired computation techniques including evolutionary algorithms, genetic programming, artificial immune systems and hyperheuristics. He has won best paper awards at GECCO 2008, ICARIS 2011, and GECCO 2014. He is part of the Steering Committee of the annual workshop on Theory of Randomized Search Heuristics (ThRaSH), Associate Editor of the IEEE Transactions on Evolutionary Computation, Chair of the IEEE CIS Task Force on Theoretical Foundations of Bio-inspired Computation, Leader of the ImAppNIO Cost Action Working Group on Benchmarking and member of the EPSRC Peer Review College. Dr. Oliveto has given tutorials on the runtime complexity analysis of EAs regularly at CEC, GECCO, WCCI, SSCI and PPSN since 2012.
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.
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 is member of the Editorial Board of the Applied Soft Computing journal and has acted as reviewer, editor, or program committee member at 70 different venues.
Borys Wróbel's background is biology and computer science, and he works at the intersection between the two fields. His current research interest are computational properties of biologically-inspired models of computation (artificial gene regulatory networks and spiking neural networks), which involves building artificial life software platforms that use high performance computing and neuromorphic hardware. Borys graduated from the University of Gdansk (Poland) in 1997, was a Fulbright Visiting Researcher in the Salk Institute for Biological Studies in San Diego, CA, and later FEBS and EMBO Fellow at the Hebrew University of Jerusalem (Israel), Marie Curie Postdoctoral Fellow at the University of Valencia, and Sciex Fellow in the Insitute of Neuroinformatics at the University of Zurich and ETHZ (Switzerland). He is a member of the Global Young Academy, Intelligent Systems Applications Technical Committee of the Institute of Electrical and Electronics Engineers Computational Intelligence Society (since 2012), and Association for Computing Machinery Special Interest Group for Genetic and Evolutionary Computation.
Aleš Zamuda is an Assistant Professor and Researcher at University of Maribor (UM), Slovenia. He received Ph.D. (2012), M.Sc. (2008), and B.Sc. (2006) degrees in computer science from UM. He is management committee (MC) member for Slovenia at European Cooperation in Science (COST), actions CA15140 (ImAppNIO - Improving Applicability of Nature-Inspired Optimisation by Joining Theory and Practice) and IC1406 (cHiPSet - High-Performance Modelling and Simulation for Big Data Applications). He is IEEE Senior Member, IEEE Young Professionals Chair for Slovenia Section, IEEE CIS member, ACM SIGEVO member, ImAppNIO Benchmarks working group vice-chair, and editorial board member (associate editor) for Swarm and Evolutionary Computation (2017 IF=3.893). His areas of computer science applications include ecosystems, evolutionary algorithms, multicriterion optimization, artificial life, and computer animation; currently yielding h-index 16, 38 publications, and 742 citations on Scopus. He won IEEE R8 SPC 2007 award, IEEE CEC 2009 ECiDUE, 2016 Danubuius Young Scientist Award, and 1% top reviewer at 2017 Publons Peer Review Awards, including reviews for 40 journals and 65 conferences.
A.7. Hosting Event
The Genetic and Evolutionary Computation Conference (GECCO) 2018
July 15-19, 2018, in Kyoto, Japan
http://gecco-2018.sigevo.org/
The Genetic and Evolutionary Computation Conference (GECCO 2018) will present the latest high-quality results in genetic and evolutionary computation. Topics include genetic algorithms, genetic programming, evolution strategies, evolutionary programming, memetic algorithms, hyper- heuristics, real-world applications, evolutionary machine learning, evolvable hardware, artificial life, adaptive behavior, ant colony optimization, swarm intelligence, biological applications, evolutionary robotics, coevolution, artificial immune systems, and more.
The GECCO 2018 Program Committee invites the submission of technical papers describing your best work in genetic and evolutionary computation. Full papers of at most 8 pages are aimed to present original new work that meets the high-quality standards of GECCO. Accepted full papers appear in the ACM digital library as part of the MAIN PROCEEDINGS of GECCO. For full papers, a separate abstract needs to be submitted first by January 30, 2018. Full papers are due by the non-extensible deadline of February 6, 2018.
Each paper submitted to GECCO will be rigorously evaluated in a double- blind review process. Evaluation is done on a per-track basis, ensuring high interest and high expertise of the reviewers. Review criteria include the significance of the work, technical soundness, novelty, clarity, writing quality, relevance, and sufficiency of information to permit replication, if applicable.
Besides the traditional GECCO full papers, poster-only papers of at most 2 pages can be submitted. These are aimed to present original and new work that has not yet reached the stage of the more mature, complete research results that are typically published in full papers at GECCO. The review of poster-only papers follows the same double-blind process described above. However, accepted poster-only papers appear in the ACM digital library as part of the COMPANION PROCEEDINGS of GECCO. Poster-only papers are due by the non-extensible deadline of February 6, 2018, and no abstract needs to be submitted first.
If an author has more than one paper to present at the conference, there are NO additional registration fees. The author registers one time (pays for 1 registration) and presents as many papers as have been accepted. If a paper has more than one author, and more than one author will attend the conference, then each author in attendance must pay for a separate registration.
http://gecco-2018.sigevo.org/
Call for Papers B: Black-Box Discrete Optimization Benchmarking (BB-DOB@PPSN)
Workshop @ 15th International Conference on Parallel Problem Solving from Nature
September 8-9, 2018 in Coimbra, Portugal
http://iao.hfuu.edu.cn/bbdob-ppsn18
The Black-Box Discrete Optimization Benchmarking Workshop (BB-DOB@PPSN), a part of the Fifteenth International Conference on Parallel Problem Solving from Nature (PPSN XV), is cordially inviting the submission of original and unpublished research papers.
Quantifying and comparing the performance of optimization algorithms is one important aspect of research in search and optimization. The Black-Box- Optimization Benchmarking (BBOB) methodology introduced by the long- standing and successful BBOB-GECCO workshops series has become a well- established standard for benchmarking continuous optimization algorithms. The aim of this workshop is to develop a similar standard methodology for the benchmarking of black-box optimization algorithms for discrete and combinatorial domains. We want to produce:
(1) a well-motivated benchmark function testbed,
(2) a standardized experimental set-up,
(3) rules for measuring and the generation of data output, and
(4) standardized post-processing and presentations for the results in graphs and tables.
B.1. Topics of Interest
This second installment of the new BB-DOB workshop series focuses on a debate regarding which functions should be included in the benchmarking testbed. These benchmark functions should capture the difficulties of combinatorial optimization problems in practice, but at the same time be comprehensible so that the resulting algorithm behaviors can be understood or interpreted. In this way, the mutual advantages and disadvantages of algorithms can be analyzed in depth. Gaining such insights is vital for the design of improved algorithms. The sought benchmark functions should ideally be scalable with the problem size and non-trivial in the black-box optimization sense, i.e., allow for shifting the optimum to any point. This workshop wants to provide a common forum to bring together experts on benchmarking of optimization algorithms. Interested participants are encouraged to submit papers related to black-box optimization benchmarking of discrete optimizers in the widest sense. In particular if they suggest,
(1) function classes that should be included in the function collection and motivate the reasons for inclusion,
(2) benchmark function properties that allow to capture difficulties which occur in real-world applications (e.g., deception, separability, etc.)
(3) which classes of standard combinatorial optimization problems should be included and how to select significant instances,
(4) which classes of toy problems should be included and motivate why
(5) issues concerning any other aspect of benchmarking methodology for discrete optimizers such as design of experiments, performance measures, presentation methods, etc.
The accepted papers in this workshop will NOT be included in the Proceedings of the Fifteenth International Conference on Parallel Problem Solving from Nature. 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.
This workshop is organized as part of the ImAppNIO Cost Action 15140.
For more information please contact Pietro S. Oliveto at [log in to unmask]
Disclaimer: Two BB-DOB workshops will take place in 2018, i.e., the first edition as BB-DOB@GECCO and the second edition as [log in to unmask] Both are independent events of the same series.
B.2. Important Dates
Paper Submission Deadline: 26 March 2018
Notification of Acceptance: 14 May 2018
Camera-Ready Copy Due: 4 June 2018
Conference Presentation: 8-9 September 2018
B.3. Instructions for Authors
Detailed instructions regarding how to submit papers and the paper format are given at the conference website http://ppsn2018.dei.uc.pt. The page limit is 10 pages, and papers must be submitted in Springer LNCS style through the conference homepage.
B.4. Chairs
o Pietro S. Oliveto, University of Sheffield, UK
o Markus Wagner, University of Adelaide, Australia
o Thomas Weise, Hefei University, Hefei, China
o Borys Wróbel, Adam Mickiewicz University, Poland
o Aleš Zamuda, University of Maribor, Slovenia
B.5. International Program Committee
o Abhishek Awasthi, University of Applied Sciences Zittau/Görlitz, Görlitz, Germany
o Christian Blum, Artificial Intelligence Research Institute, Bellaterra, Spain
o Josu Ceberio Uribe, University of the Basque Country, Bilbao, Spain
o Wenxiang Chen, Colorado State University, Fort Collins, CO, USA
o Raymond Chiong, The University of Newcastle, Callaghan, Australia
o Carola Doerr, Université Pierre et Marie Curie - Paris 6, Paris, France
o Mohamed El Yafrani, Mohammed V University of Rabat, Rabat, Morocco
o Thomas Jansen, Aberystwyth University, UK
o Michael Kolonko, TU Clausthal, Clausthal-Zellerfeld, Germany
o William La Cava, University of Pennsylvania, Philadelphia, PA, USA
o Algirdas Lančinkas, Vilnius University, Lithuania
o Jörg Lässig, University of Applied Sciences Zittau/Görlitz, Görlitz, Germany
o Bin Li, University of Science and Technology of China, Hefei, China
o Jinlong Li, University of Science and Technology of China, Hefei, China
o Pu Li, Technische Universität Ilmenau, Ilmenau, Germany
o Zhen Liu, Hefei University, Hefei, China
o Manuel López-Ibáñez, University of Manchester, Manchester, UK
o Yi Mei, Victoria University of Wellington, Wellington, New Zealand
o Martin Middendorf, Leipzig University, Leipzig, Germany
o Frank Neumann, University of Adelaide, Australia
o Miguel Nicolau, University College Dublin, Ireland
o Pietro S. Oliveto, University of Sheffield, UK
o Luis Paquete, University of Coimbra, Portugal
o Qi Qi, University of Science and Technology of China, Hefei, China
o Ofer Shir, Tel-Hai College, Israel
o Danilo Sipoli Sanches, Federal University of Technology – Paraná, Cornélio Procópio, Brazil
o Kate Smith-Miles, The University of Melbourne, Melbourne, VIC, Australia
o Thomas Stützle, Université Libre de Bruxelles (ULB), IRIDIA, Belgium
o Markus Ullrich, University of Applied Sciences Zittau/Görlitz, Görlitz, Germany
o Ryan J. Urbanowicz, University of Pennsylvania, Philadelphia, PA, USA
o Markus Wagner, University of Adelaide, Australia
o Thomas Weise, Hefei University, Hefei, China
o Carsten Witt, Technical University of Denmark, Denmark
o Borys Wróbel, Adam Mickiewicz University, Poland
o Zijun Wu, Hefei University, Hefei, China
o Yang Yu, Nanjing University, Nanjing, China
o Aleš Zamuda, University of Maribor, Slovenia
o Xingyi Zhang, Anhui University, Hefei, China
B.6. Chair Biographies
Pietro S. Oliveto is a Senior Lecturer and an EPSRC Early Career Fellow at the University of Sheffield, UK. He received the Laurea degree in computer science from the University of Catania, Italy in 2005 and the PhD degree from the University of Birmingham, UK in 2009. He has been EPSRC PhD+ Fellow (2009-2010) and EPSRC Postdoctoral Fellow (2010-2013) at Birmingham and Vice-Chancellor's Fellow at Sheffield (2013-2016). His main research interest is the performance analysis of bio-inspired computation techniques including evolutionary algorithms, genetic programming, artificial immune systems and hyperheuristics. He has won best paper awards at GECCO 2008, ICARIS 2011, and GECCO 2014. He is part of the Steering Committee of the annual workshop on Theory of Randomized Search Heuristics (ThRaSH), Associate Editor of the IEEE Transactions on Evolutionary Computation, Chair of the IEEE CIS Task Force on Theoretical Foundations of Bio-inspired Computation, Leader of the ImAppNIO Cost Action Working Group on Benchmarking and member of the EPSRC Peer Review College. Dr. Oliveto has given tutorials on the runtime complexity analysis of EAs regularly at CEC, GECCO, WCCI, SSCI and PPSN since 2012.
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.
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 is member of the Editorial Board of the Applied Soft Computing journal and has acted as reviewer, editor, or program committee member at 70 different venues.
Borys Wróbel's background is biology and computer science, and he works at the intersection between the two fields. His current research interest are computational properties of biologically-inspired models of computation (artificial gene regulatory networks and spiking neural networks), which involves building artificial life software platforms that use high performance computing and neuromorphic hardware. Borys graduated from the University of Gdansk (Poland) in 1997, was a Fulbright Visiting Researcher in the Salk Institute for Biological Studies in San Diego, CA, and later FEBS and EMBO Fellow at the Hebrew University of Jerusalem (Israel), Marie Curie Postdoctoral Fellow at the University of Valencia, and Sciex Fellow in the Insitute of Neuroinformatics at the University of Zurich and ETHZ (Switzerland). He is a member of the Global Young Academy, Intelligent Systems Applications Technical Committee of the Institute of Electrical and Electronics Engineers Computational Intelligence Society (since 2012), and Association for Computing Machinery Special Interest Group for Genetic and Evolutionary Computation.
Aleš Zamuda is an Assistant Professor and Researcher at University of Maribor (UM), Slovenia. He received Ph.D. (2012), M.Sc. (2008), and B.Sc. (2006) degrees in computer science from UM. He is management committee (MC) member for Slovenia at European Cooperation in Science (COST), actions CA15140 (ImAppNIO - Improving Applicability of Nature-Inspired Optimisation by Joining Theory and Practice) and IC1406 (cHiPSet - High-Performance Modelling and Simulation for Big Data Applications). He is IEEE Senior Member, IEEE Young Professionals Chair for Slovenia Section, IEEE CIS member, ACM SIGEVO member, ImAppNIO Benchmarks working group vice-chair, and editorial board member (associate editor) for Swarm and Evolutionary Computation (2017 IF=3.893). His areas of computer science applications include ecosystems, evolutionary algorithms, multicriterion optimization, artificial life, and computer animation; currently yielding h-index 16, 38 publications, and 742 citations on Scopus. He won IEEE R8 SPC 2007 award, IEEE CEC 2009 ECiDUE, 2016 Danubuius Young Scientist Award, and 1% top reviewer at 2017 Publons Peer Review Awards, including reviews for 40 journals and 65 conferences.
B.7. Hosting Event
Fifteenth International Conference on Parallel Problem Solving from Nature
(PPSN XV), September 8-12, 2018, in Coimbra, Portugal
http://ppsn2018.dei.uc.pt/
The Fifteenth International Conference on Parallel Problem Solving from Nature (PPSN XV) will be held in Coimbra, Portugal on 8-12 September 2018. The conference will take place at the Campus of the University of Coimbra, recognized by UNESCO as world heritage site, due to its relevance in the dissemination of knowledge throughout the fields of arts, sciences, law, architecture, urban planning and landscape. The venue includes a set of buildings and rooms of historical relevance, thus giving the participants the opportunity to visit the different areas of the university and experience the feeling of studying and working in Coimbra.
This biennial meeting brings together researchers and practitioners in the field of Natural Computing. Natural Computing is the study of computational systems which use ideas and get inspiration from natural systems, including biological, ecological, physical, chemical, and social systems. It is a fast-growing interdisciplinary field in which a range of techniques and methods are studied for dealing with large, complex, and dynamic problems with various sources of potential uncertainties.
PPSN XV will be a showcase of a wide range of topics in Natural Computing including, but not restricted to: Evolutionary Computation, Neural Computation, Molecular Computation, Quantum Computation, Artificial Life, Swarm Intelligence, Artificial Ant Systems, Artificial Immune Systems, Self-Organizing Systems, Emergent Behaviors, and Applications to Real-World Problems. PPSN XV will also feature workshops and tutorials covering advanced and fundamental topics in the field of Natural Computing.
Following the PPSN tradition, all accepted papers will be presented during poster sessions and will be included in the proceedings, to be published in the Series Lecture Notes in Computer Science (LNCS) by Springer. Prospective authors are invited to contribute their high-quality original results in the field of Natural Computing.
http://ppsn2018.dei.uc.pt/
|
