Unterschiede

Hier werden die Unterschiede zwischen zwei Versionen gezeigt.

Link zu dieser Vergleichsansicht

Beide Seiten der vorigen Revision Vorhergehende Überarbeitung
en:lehre:ws1819:seminar_geometric_distance_problems [2018/10/06 18:06]
langetepe
en:lehre:ws1819:seminar_geometric_distance_problems [2018/10/16 10:13] (aktuell)
langetepe
Zeile 10: Zeile 10:
 **Facts** **Facts**
  
-The kick-off meeting for the seminar will take place on (TBA) at (TBA).   +The kick-off meeting for the seminar will take place on Tuesday October 23rd  ​at 15:00 room 2.007.   
-Presentations have to be done in two blocks, ​see the dates below. ​ The task is as follows:+Presentations have to be done in two blocks, dates see below. ​ The task is as follows:
  
   * Studying a scientific paper (Topics below)   * Studying a scientific paper (Topics below)
Zeile 23: Zeile 23:
 |Advisor|[[:​en:​staff:​rolfklein|Prof. Dr. Rolf Klein]]| |Advisor|[[:​en:​staff:​rolfklein|Prof. Dr. Rolf Klein]]|
 |Advisor|[[:​en:​staff:​elmarlangetepe|PD Dr. Elmar Langetepe]]| |Advisor|[[:​en:​staff:​elmarlangetepe|PD Dr. Elmar Langetepe]]|
-|Advisor|[[:​staff:​hermanhaverkort|Dr. Herman Haverkort]]|+
  
 |Dates| TBA Two blocks at the end of the semester| |Dates| TBA Two blocks at the end of the semester|
Zeile 38: Zeile 38:
 ** Topics of this semester **  ** Topics of this semester ** 
  
-TBA+Some examples that will be roughly presented at the kick-off meeting ​
  
-<​html><​!-- ​ + 
-[[http://​www.i1.informatik.uni-bonn.de/​lib/​exe/​fetch.php?​media=lehre:​ws1718:​seminar-geomdist:​1VCDimL1.pdf| 1. VC Dimension of Visibility Polygons (Part I)]]\\ +[[http://​www.i1.informatik.uni-bonn.de/​lib/​exe/​fetch.php?​media=lehre:​ws1718:​seminar-geomdist:​2SearchTreesManyGoals.pdf| 1. Searching in Trees for one of many goals]]\\ 
-[[http://​www.i1.informatik.uni-bonn.de/​lib/​exe/​fetch.php?​media=lehre:​ws1718:​seminar-geomdist:​2SearchTreesManyGoals.pdf| 2. Searching in Trees for one of many goals]]\\ +[[http://​www.i1.informatik.uni-bonn.de/​lib/​exe/​fetch.php?​media=lehre:​ws1718:​seminar-geomdist:​4FireFightHardTrees.pdf| ​2. Fire-Fighting in Trees is hard]]\\ 
-[[http://​www.i1.informatik.uni-bonn.de/​lib/​exe/​fetch.php?​media=lehre:​ws1718:​seminar-geomdist:​3TwoWatchman.pdf| 3. Two Watchman in a polygon]]\\ +[[http://​www.i1.informatik.uni-bonn.de/​lib/​exe/​fetch.php?​media=lehre:​ws1718:​seminar-geomdist:​6OnlineGraphExploration.pdf| ​3. Online Graph Exploration]]\\ 
-[[http://​www.i1.informatik.uni-bonn.de/​lib/​exe/​fetch.php?​media=lehre:​ws1718:​seminar-geomdist:​4FireFightHardTrees.pdf| ​4. Fire-Fighting in Trees is hard]]\\ +[[http://​www.i1.informatik.uni-bonn.de/​lib/​exe/​fetch.php?​media=lehre:​ws1718:​seminar-geomdist:​8EvolutionaryTheory.pdf | 4
-[[http://​www.i1.informatik.uni-bonn.de/​lib/​exe/​fetch.php?​media=lehre:​ws1718:​seminar-geomdist:​5LostInForest.pdf| 5. Get out of the forest]]\\ +
-[[http://​www.i1.informatik.uni-bonn.de/​lib/​exe/​fetch.php?​media=lehre:​ws1718:​seminar-geomdist:​6OnlineGraphExploration.pdf| ​6. Online Graph Exploration]]\\ +
-7. VC Dimension of Visibility Polygons (Part II/cannot be downloaded)\\ +
-[[http://​www.i1.informatik.uni-bonn.de/​lib/​exe/​fetch.php?​media=lehre:​ws1718:​seminar-geomdist:​8EvolutionaryTheory.pdf | 8+
 Evolutionary Algorithms and Theory]]\\ Evolutionary Algorithms and Theory]]\\
---></​html>​+5. VC Dimension for visibility (different aspects) [cannot be downloaded] 
  
en/lehre/ws1819/seminar_geometric_distance_problems.txt · Zuletzt geändert: 2018/10/16 10:13 von langetepe

Benutzer-Werkzeuge