Lic-seminar "Approximation and Online Algorithms with Applications in Robotics and Computational Biology"
Date: October 29, 2004 (Friday) at 13:15
By Mia Persson
Abstract: The main contribution of this thesis is in the area of approximation and online algorithn design. Approximation and online algorithms are fundamental tools used to deal with computationally hard problems and problems with the input is gradually disclosed over time. We study optimization problems with applications in computational biology and robotics.
The first problem is an approximate clustering problem, which occurs naturally in the area of charactering DNA clone libraries.
The second probem is a classical online exploration problem, which occurs when a robot explores its environment but does not possess a map of the environment.
The third problem is an online data distribution problem, where robots distrubute a set of data among a set of participants.
Room: E:1406
Last modified Dec 9, 2011 12:59 pm
0805