Monte Carlo Methods In Artificial Intelligence
March 19-23, Oregon State University - Corvallis, Oregon

Spring Break with Artificial Intelligence

students

Ever wondered about how smart computers can be?

If you are curious about how to make computers smarter and want to stimulate your own brain during the spring break, we have just the right thing for you.

graph

One of the recent advances in Artificial Intelligence are Monte-Carlo algorithms, which are based on repeated random search. They are used to solve a variety of simulation, search, and optimization problems and are methods of choice for games such as computer Go, Solitaire, and Battleship. They are widely used in a number of applications including robot planning, scheduling, and air traffic control and are even applicable to conservation and sustainability. They are naturally parallel, simple to implement, and appear to perform better or comparably to other more complicated approaches. There are many open problems including some fundamental ones such as why and when they work well.

National Science Foundation and Oregon State University are sponsoring an all-expenses paid short course on Monte Carlo algorithms for second and third year undergraduates at US colleges and universities. Students are expected to have some prior experience in programming, but do not need any previous experience in artificial intelligence. Students from groups historically under-represented in computer science (including women and minorities) are particularly encouraged to apply. The course runs from March 19-23 in the beautiful town of Corvallis. We will provide accommodation, airfare, computers, high quality interactions, and technical presentations.

Applications must be received by December 20th, 2011.   Apply here

robot stratagus