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 opportunities Bulletin Item

Postdoctoral position in complexity theory, HUNGARY


Budapest (Hungary)

Postdoc positions are available at the Computer and Automation Research Institute (Hungarian 
Academy of Sciences), Budapest, Hungary, supported by the European Research Council (ERC) 
Starting Grant PARAMTIGHT: "Parameterized complexity and the search for tight complexity results" 
held by Dniel Marx. The goal of the project is to systematically push the boundaries of 
algorithmic and hardess results, mostly in the framework of parameterized complexity, with 
the aim of obtaining tight results that give an optimal understanding of the complexity of 
a problem.

The candidates should have a PhD degree in Computer Science or related area; research experience 
at postdoctoral level is of advantage. A successful candidate should have excellent knowledge of 
algorithms and/or complexity, preferably in the setting of parameterized complexity and
fixed-parameter tractability. Strong background in graph theory, combinatorics, constraint 
satisfaction, approximation, or kernelization is of advantage.

The earliest starting date is January 2012. The review of applicants will begin immediately and 
continue until the positions are filled. 

Applications received by 1 November 2012 will receive full consideration. 
Informal inquires by email are welcome.