AISB convention 2017

  In the run up to AISB2017 convention, I've asked Joanna Bryson, from the organising team, to answer few questions about the convention and what comes with it. Mohammad Majid al-Rifaie (https://twitter.com/mohmaj) Tu...


Read More...

Harold Cohen

Harold Cohen, tireless computer art pioneer dies at 87   Harold Cohen at the Tate (1983) Aaron image in background   Harold Cohen died at 87 in his studio on 27th April 2016 in Encintias California, USA.The first time I hear...


Read More...

Dancing with Pixies?...

At TEDx Tottenham, London Mark Bishop (the former chair of the Society) demonstrates that if the ongoing EU flagship science project - the 1.6 billion dollar "Human Brain Project” - ultimately succeeds in understanding all as...


Read More...

Computerised Minds. ...

A video sponsored by the society discusses Searle's Chinese Room Argument (CRA) and the heated debates surrounding it. In this video, which is accessible to the general public and those with interest in AI, Olly's Philosophy Tube ...


Read More...

Connection Science

All individual members of The Society for the Study of Artificial Intelligence and Simulation of Behaviour have a personal subscription to the Taylor Francis journal Connection Science as part of their membership. How to Acce...


Read More...
01234

Notice

AISB event Bulletin Item

CALL FOR PARTICIPATION: 30th International Symposium on Theoretical Aspects of Computer Science, 27 Feb - 2 Mar 2013, Kiel, GERMANY

http://www.stacs2013.uni-kiel.de/

STACS 2013

The 30th International Symposium on Theoretical Computer Science (STACS) will 
be held from February 27 to March 2, 2013 (Wednesday through Saturday), on the 
premises of the Christian-Albrechts-Universitt zu Kiel. 
SCIENTIFIC PROGRAM
******************
The program, which is available at

   http://www.stacs2013/uni-kiel.de/ ,

is composed of 54 contributed and three invited talks as well as a tutorial.

INVITED TALKS AND TUTORIAL
**************************
- Kousha Etessami, University of Edinburgh
   The complexity of analyzing infinite-state Markov chains, Markov decision 
processes, and stochastic games
- Kurt Mehlhorn, MPI Saarbrcken and Saarland University
   Physarum can compute shortest paths
- Stphan Thomass, Ecole Normale Suprieure de Lyon
   Graph Coloring, Communication Complexity and the Stubborn Problem
- Dniel Marx, MTA SZTAKI, Hungarian Academy of Sciences (tutorial)
   Algorithmic Graph Structure Theory

REGISTRATION
************
Registration is through the conference website,

   http://www.stacs2013.uni-kiel.de/ .

INFORMATION
***********
For detailed information on STACS 2013, visit the conference website,

   http://www.stacs2013.uni-kiel.de/ .

IMPORTANT DATES
***************
Early registration deadline: Jan 14, 2013
Regular registration:        Jan 15 - Feb 14, 2013
Late registration:           Feb 15 - Mar 2, 2013
Symposium:                   Feb 27 - Mar 2, 2013

CONTACT INFORMATION
*******************
info@stacs2013.uni-kiel.de