ICAART (International Conference on Agents and Artificial Intelligence) is a new AI conference (its first edition takes place in January 2009, in Porto), organized by INSTICC, together with AAAI, APPIA and ACM SIGART. The conference seems to be of a decent quality, if we consider the program comitee and the list of keynote speakers; also, the proceedings are indexed by INSPEC and DBLP, and a book containing the best papers will be published by Springer.
Usually, I am not very interested in AI conferences, so it would have been very improbable for me to take part at such a conference. However, I am interested in this conference because one of its special sessions is dedicated to Networks of Evolutionary Processors (NEPs, the topic of my PhD thesis). I was invited to contribute to this session, so I wrote a survey paper, together with Victor Mitrana, covering the most significant results obtained so far for NEPs, and other closely related models, in the computational and descriptional complexity area. Here is a short description of the talk I will give in Porto:
Accepting Networks of Evolutionary Processors: Complexity Aspects. Recent Results and New Challenges
Abstract: In this paper we survey some results reported so far, for the new computational model of Accepting Networks of Evolutionary Processors (ANEPs), in the area of computational and descriptional complexity. First we give the definitions of the computational model, and its variants, then we define several ANEP complexity classes, and, further, we show how some classical complexity classes, defined for Turing Machines, can be characterized in this framework. After this, we briefly show how ANEPs can be used to solve efficiently NP-complete problems. Finally, we discuss a list of open problems and further directions of research which appear interesting to us.
Usually, I am not very interested in AI conferences, so it would have been very improbable for me to take part at such a conference. However, I am interested in this conference because one of its special sessions is dedicated to Networks of Evolutionary Processors (NEPs, the topic of my PhD thesis). I was invited to contribute to this session, so I wrote a survey paper, together with Victor Mitrana, covering the most significant results obtained so far for NEPs, and other closely related models, in the computational and descriptional complexity area. Here is a short description of the talk I will give in Porto:
Accepting Networks of Evolutionary Processors: Complexity Aspects. Recent Results and New Challenges
Abstract: In this paper we survey some results reported so far, for the new computational model of Accepting Networks of Evolutionary Processors (ANEPs), in the area of computational and descriptional complexity. First we give the definitions of the computational model, and its variants, then we define several ANEP complexity classes, and, further, we show how some classical complexity classes, defined for Turing Machines, can be characterized in this framework. After this, we briefly show how ANEPs can be used to solve efficiently NP-complete problems. Finally, we discuss a list of open problems and further directions of research which appear interesting to us.
