Computer Science Open House Sunday, May 29 2p.m.-4p.m.

May 19th, 2011

In Honor of the 2011 Computer Science Graduates

join us on Sunday, May 29, 2:00-4:00 p.m. in King 223 for refreshments

to congratulate our Computer Science Major Graduates.

Brendan Chambers, Michael Craig, Kriti Godey, Sean Hanson, Jason Kimmel, Sam Lawton, Nitun Poddar, Thomas Ramfjord, Garrett Robinson, Kiron Roy, Daniel Spencer.

We wish all of them a bright and prosperous future!

Protected: Seniors: Please take the Senior Survey

May 13th, 2011

This content is password protected. To view it please enter your password below:

You Can Pick Your (Best) Friends

May 3rd, 2011

David Liben-Nowell

Prof. David Liben-Nowell, Carleton College

David Liben-Nowell, Associate Professor of Carleton College

” You Can Pick Your (Best) Friends”
FRIDAY May 6 4:30 King 221

In this talk, he will present some results from a recent collaboration with evolutionary psychologists and computer scientists on questions of how people choose friends and prioritize among those friends.  Specifically, he will describe analysis of large samples of MySpace profiles containing “Top Friends” lists, in which an individual selects a small subset of his or her friends and organizes them into a ranked order of that individual’s choice.  Different classes of behavioral hypotheses give rise to very different graph-theoretic structures in the best-friend network, and we can use these ranking data to provide supporting evidence for some of these theories.

2011 Honor Student Presentations

April 29th, 2011

Tuesday May 3 King 221
4:30 Jason Kimmel -Models of Viral Marketing in Social Networks

5:00 Brendan Chambers – Towards Automatically Captcha Solving Using Biologically Inspired Algorithms.

Wed May 4 King 221
4:30 Thomas Ramfjord – Introduction to Audio Watermarking.

5:00 Kriti Godey – Recommending Healthy and Palatable Meal Plans.

Class of 2012 Honors Proposals due April 29

April 7th, 2011

Junior CSCI majors with a minimum of an overall GPA of 3.5, who are interested in participating in the Honors program are requested to submit an Honors Proposal to Richard Salter,  Department Chair outlining your project.  The deadline for the submission is Friday, April 29, 2010.  If you have any questions regarding the guidelines please contact your advisor or visit the Computer Science Department in King 223.

Google Summer of Code Opportunity

April 2nd, 2011

Click here for details.

Application is due by 3PM, April 8.

2011 Denison Programming Contest

March 3rd, 2011

This past weekend 3 teams of Oberlin students competed at the 2011 Denison Spring Programming Contest.  18 teams of 3 students each from 9 nearby schools competed trying to solve 6 problems, in 4 hours, with only one computer per team!

Team Foo of Oberlin (Brendan Chambers, Thomas Ramfjord, Danny Spencer) and Team O(bees) (Veronica Colegrove, Emma Conner, Eston Schweickart) each solved 3 problems and Team Oberlin Oriented Programmers (Kaitlyn Price, Kiron Roy, Joaquin Ruales) solved 2.  Much fun was had by all!

2011 Denison Spring Contest

Coordination Strategies for Multi-agent Scheduling

March 1st, 2011

James Boerkoel, Univeristy of Michigan, will present his talk “Coordination Strategies for Multi-agent Scheduling.  Thursday March 3, 2011 4:30 p.m. in King 221 – Refreshments @ 4:00 p.m. in King 223 CSCI Office.

The Simple Temporal Problem (STP) is a popular representation for solving centralized scheduling and planning problems. When scheduling agents are associated with different users who need to coordinate some of their activities, however, considerations such as privacy, autonomy, and scalability suggest solving the joint STP in a more distributed manner. In this talk, I will introduce multi-agent STPs and discuss recent advances in STP algorithms that exploit loosely-coupled problem structure. Building off these advances, I will discuss our distributed approach for solving the multi-agent STP, which includes exchanging summaries of local agent problems and then choosing temporal decoupling points that allow agents to independently manage their local schedules.  I will discuss the advantages of our approach as well as future extensions and applications.