Differences

This shows you the differences between two versions of the page.

--- teaching:mfe:ia [2012/03/22 17:21]
mdorigo Added one project in robotics
+++ teaching:mfe:ia [2012/03/23 09:34]
stuetzle
@@ Line 127: / Line 127: @@
   * Contacts :
     * [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo (IRIDIA)]]
-    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]]
+    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]]
     * [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari (IRIDIA)]]
     * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]]
@@ Line 142: / Line 142: @@
   * Contacts :
     * [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo (IRIDIA)]]
-    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]]
+    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]]
     * [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari (IRIDIA)]]
     * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]]
@@ Line 158: / Line 158: @@
   * Contacts :
-    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]]
+    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]]
     * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]]
+===== Design of a graphical interface for an automatic configuration tool. =====
+Optimization algorithms have a number of parameters that strongly
+affect their efficiency. For many years the setting of these
+parameters was done by hand; a tedious task that requires a lot of
+human involvement. Nowadays, some tools are available to automatize this task by considering the setting of the parameters as a "meta"-optimization problem. One of these tools for automatic configuration (the irace package: http://iridia.ulb.ac.be/irace) has been developed at IRIDIA, and has been already applied successfully to many algorithms. The goal of this project is to design a graphical interface on top of the existing software, to help the user to set-up his particular tuning problem, to visualize information about the tuning process while it is on-going and when it has completed, and to integrate statistical tools for the analysis of the tuner results.
+The student will have to implement a Graphical front-end on top of the
+existing software implemented in R, using a cross-platform library
+such as Qt (http://qtinterfaces.r-forge.r-project.org/).  Some
+additions to the original software may be required, and the student
+will have to work in collaboration with the team of developers of
+irace at IRIDIA.
+  * Contacts :
+    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]]
+    * [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari (IRIDIA)]]
+    * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]]
+    * [[http://iridia.ulb.ac.be/~jdubois|Jérémie Dubois-Lacoste (IRIDIA)]]
@@ Line 174: / Line 196: @@
   * Contacts :
-    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]]
+    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]]
     * [[http://iridia.ulb.ac.be/~fmascia|Franco Mascia (IRIDIA)]]
@@ Line 190: / Line 212: @@
   * Contacts :
-    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]]
+    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]]
     * [[http://iridia.ulb.ac.be/~fmascia|Franco Mascia (IRIDIA)]]
+===== Analysis of Local Optima Networks for the Max-Clique problem. ======
+Stochastic Local Search algorithms search for optimal solutions in a large space of candidate solutions. Local Optima Networks (LON) are representations of search landscapes of combinatorial optimisation problems. In these networks, nodes are local optima of the problem, and edges are weighted transitions between the optima. These networks model in a more compact way the properties of the larger search spaces they represent.
+The goal of this project is to build LON of small instances of the Maximum Clique (MC) problem, and measure properties that could illustrate the differences between instance families.
+The MC problem is an NP-hard combinatorial optimisation problem that asks to find the biggest completely connected component of a graph. It has relevant applications in information retrieval, computer vision, social network analysis, computational biochemistry, bioinformatics and genomics.
+Required skills: good knowledge of C or C++ programming.
+  * Contacts :
+    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]]
+    * [[http://iridia.ulb.ac.be/~fmascia|Franco Mascia (IRIDIA)]]
@@ Line 451: / Line 491: @@
   * Contacts :
     * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]]
-    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]]
+    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]]
@@ Line 460: / Line 500: @@
   * Contacts :
     * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]]
-    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]]
+    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]]
     * [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo (IRIDIA)]]
@@ Line 470: / Line 510: @@
   * Contacts :
     * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]]
-    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]]
+    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]]
@@ Line 479: / Line 519: @@
   * Contacts :
     * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]]
-    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]]
+    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]]