Mark Bishop on CITY ...
"During the last decade robots have begun to permeate everyday life (robotic lawn mowers; floor cleaners, autonomous cars etc); equally, closely related technologies are beginning to permeate the military– already US naval sh...
Read More...
ICO Alan Turing Lect...
 To celebrate the 100 year anniversary of the birth of the world renowned mathematician, code breaker, logician and computer scientist, the first ICO Alan Turing Lecture was held at the Museum of Science and Industry in Manchest...
Read More...
AISB Workshop: Senso...
Poster: http://aisb.org.uk/media/files/stw2012.pdf (media/files/stw2012.pdf) A day of discussion on the Sensorimotor account of Perception, Consciousness  and Robotics, its development and contemporary state. The first in a seri...
Read More...
Ms Pac-Man vs Ghosts...
This year's Ms Pac-man vs Ghosts Competition is now open for submissions. The competition allows you to develop AI controllers for the classical arcade game Ms Pac-Man. However, this year the competition takes a unique look at the...
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...
New AISB Website
Happy New Year! Welcome to the new AISB website. Over the coming weeks and months we will be making additional changes to the website, introducing some new content and so on. Please check back regularly to see what's new! During...
Read More...
AISB Website Beta
The AISB's new website is now gone beta. Some of the new features member's can look forward to enjoying will be better integration with the AISB LinkedIn group, frequent news updates, a new member's section and up-to-date AI med...
Read More...
AISB 2011 Convention
The AISB'11 Convention (http://www.aisb.org.uk/convention/aisb11/) was held from 4-7 April at York, organised by Dimitar Kazakov and George Tsoulas.
Read More...
Lighthill Debates
The Lighthill debates from 1973 are now available on YouTube. You need to a flashplayer enabled browser to view this YouTube video Â
Read More...
Alan Turing Year
2012 marks the centenary of Alan Turing's birth. Alan Turing Year (http://www.turingcentenary.eu/), seeks to bring together news of all the events and organisations which will be marking the occasion.
Read More...
Notice
AISB opportunities Bulletin Item
Two PhD student positions in parametrized complexity, Berlin, GERMANY
Department of Software Engineering and Theoretical Computer Science Technische Universität Berlin
Two PhD positions are available in the DFG-funded Junior Research Group "Efficient preprocessing for hard problems" led by Stefan Kratsch at TU Berlin. Successful candidates will perform research on parameterized complexity and kernelization, and related topics. The main focus of research is on rigorous study of polynomial-time preprocessing for hard combinatorial problems. Both positions are fulltime for an intended length of 3 to 4 years, with an initial contract period of 2 years. There are no teaching obligations. The positions are available immediately. Starting salary is roughly 1800 Euros net (includes mandatory health insurance; 3000 Euros gross). The junior research group is associated with the "Algorithms and complexity" group chaired by Prof. Rolf Niedermeier. (http://www.akt.tu-berlin.de/) The group currently consists of 9 further PhD students and postdocs and is hosting visiting professor Gerhard Woeginger from TU Eindhoven. Berlin offers a strong scientific landscape including three universities. Furthermore there are a DFG (German Research Foundation) research training group, called "Methods for Discrete Structures" (MDS) and the DFG research center MATHEON; these offer opportunities for joint research and support for PhD students (e.g., meetings, lecture series, summer schools). Besides sciences, Berlin offers a rich, multicultural living environment, that should cater to most interests and hobbies. Candidates must hold a master's degree (or equivalent) in computer science, mathematics or a related area and should have a very good knowledge about algorithms and complexity. Background in parameterized complexity and, e.g., algebra and probability theory as well as programming skills are beneficial. Good communication skills and solid English writing skills are mandatory. Knowledge of German is not required, but successful candidates will be encouraged to learn some basics. Interested applicants should send their application containing - cover and motivation letter (please include your favorite/strongest field(s) of theoretical computer science/mathematics) - curriculum vitae - copies of diplomas - summary of master/diploma thesis (English, about 3 pages) - names and email addresses of at least two referees, including the thesis advisor - (optionally) complete thesis and any other scientific publications by December 1, 2012 to Dr. Stefan Kratsch skratsch@mpi-inf.mpg.de www.mpi-inf.mpg.de/~skratsch Applications arriving by December 1 will receive full consideration, however, the search remains open until the positions are filled. Do not hesitate to contact skratsch@mpi-inf.mpg.de if you have any questions regarding the positions or your application. |



