From DRLWiki
The Robotics Journal Club meets regularly to hear presentations or discuss papers that are of interest to the robotics research community at CSAIL. Everybody is welcome to join the club.
Contact: Daniela Rus or Mac Schwager (schwager at mit dot edu)
Mailing List: robotics-journal-club at csail dot mit dot edu subscribe
Contents for This Page |
Current Schedule
Summer 2008: This summer we are meeting intermittently on Wednesdays at noon in room 32-397.
Wednesday, July 23, 12:00pm
Presenter: Paulina Varshavskaya
Paper:
A. Sproewitz, R. Moeckel, J. Maye, A. J. Ijspeert - Learning to Move in Modular Robots Using Central Pattern Generators and Online Optimization
Pdf
Wednesday, July 2, 12:00pm
Presenter: Mac Schwager
Paper:
K. M. Lynch, I. B. Schwartz, P. Yang, R. A. Freeman - Decentralized Environmental Modeling by Mobile Sensor Networks
Wednesday, June 25, 12:00pm
Presenter: Iuliu Vasilescu
Paper:
J. R. Solberg, K. M. Lynch, M. A. MacIver - Active Electrolocation for Underwater Target Localization
Friday, June 6, 12:00pm
Presenter:
Prof. Catherine McCartin
Institute of Information Sciences and Technology
Massey University
Title:
Parameterized Algorithms
Abstract:
The field of parameterized complexity theory and parameterized computation has developed rapidly over the past twenty years as a robust approach to dealing with hard computational problems arising from applications in diverse areas of science and industry. The parameterized paradigm augments classical complexity theory and computation, providing, on the one hand, systematic and practical algorithm design techniques for hard problems, and, on the other hand, more finely-grained complexity analysis and stronger computational lower bounds for natural computational problems.
The theory is based on the simple observation that many hard computational problems have certain aspects of their input, or expected solution, that vary only within a moderate range, at least for instances that are of practical importance. By exploiting such small associated parameters, many classically intractable problems can be efficiently solved.
This talk will concentrate on the distinctive algorithmic techniques that have emerged in the field, in particular those that lead to practical and useful algorithms for classically intractable problems.