Al-Rifaie on BBC

AISB Committee member and Research Fellow at Goldsmiths, University of London, Dr Mohammad Majid al-Rifaie was interviewed by the BBC (in Farsi) along with his colleague Mohammad Ali Javaheri Javid on the 6 November 2014. He was a...


Read More...

Rose wins the Loebne...

After 2 hours of judging at Bletchley Park, 'Rose' by Bruce Wilcox was declared the winner of the Loebner Prize 2014, held in conjunction with the AISB.  The event was well attended, film live by Sky News and the special guest jud...


Read More...

AISB Convention 2015

The AISB Convention is an annual conference covering the range of AI and Cognitive Science, organised by the Society for the Study of Artificial Intelligence and Simulation of Behaviour. The 2015 Convention will be held at the Uni...


Read More...

Yasemin Erden on BBC

AISB Committee member, and Philosophy Programme Director and Lecturer, Dr Yasemin J. Erden interviewed for the BBC on 29 October 2013. Speaking on the Today programme for BBC Radio 4, as well as the Business Report for BBC world N...


Read More...

Mark Bishop on BBC ...

Mark Bishop, Chair of the Study of Artificial Intelligence and the Simulation of Behaviour, appeared on Newsnight to discuss the ethics of ‘killer robots’. He was approached to give his view on a report raising questions on the et...


Read More...

AISB YouTube Channel

The AISB has launched a YouTube channel: http://www.youtube.com/user/AISBTube (http://www.youtube.com/user/AISBTube). The channel currently holds a number of videos from the AISB 2010 Convention. Videos include the AISB round t...


Read More...
012345

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.