Differences

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

--- teaching:mfe:ia [2013/03/18 09:57]
bersini
+++ teaching:mfe:ia [2016/03/14 16:15]
mdorigo [Development of remote monitoring software for intelligent structures]
@@ Line 1: / Line 1: @@
-====== MFE 2012-2013 : Intelligence Artificielle ======
+====== MFE 2015-2016 : Intelligence Artificielle ======
 ===== Introduction =====
@@ Line 11: / Line 11: @@
 Ce mémoire se fera en collaboration avec l'équipe médicale du centre pour l'anorexie et la boulimie de l'hôpital Erasme. Il consistera en l'analyse informatisée des données récoltées lors d'entretiens avec le patient et sa famille au cours du traitement. Les données sont actuellement stockées dans dans une base de données SPSS.  Le mémoire consistera pour l'essentiel au traitement de ces données par des approches "Machine Learning" et "Data Mining" dans une perspective de Quality Management.
+  * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
+===== Développer un programme informatique permettant une analyse statistique en vue de  l'évaluation d'un module psychothérapeutique. =====
+Ce mémoire se fera en collaboration avec l'équipe médicale du centre pour l'anorexie et la boulimie de l'hôpital Erasme. Il consistera en l'analyse informatisée des données récoltées lors d'entretiens avec le patient et sa famille au cours du traitement. Les données sont actuellement stockées dans dans une base de données SPSS.  Le mémoire consistera pour l'essentiel au traitement de ces données par des approches "Machine Learning" et "Data Mining" dans une perspective de Quality Management.
+  * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
+===== Contribution au développement de la plateforme Big Data d'IRIDIA =====
+Dans de nombreux projets d'enseignement et d'industrie dans lesquels IRIDIA se trouvent impliqués, des demandes pressantes nous sont faites de formation et d'utilisation des outils Big Data (Map-Reduce, Cloudera, Hue, Hive, Pig, Elastic Search, HBase). Nous répondons tant bien que mal à ces demandes et tentons d'équiper notre cluster avec les logiciels demandés. Le mémoire consisterait en une étude comparative de l'existant en terme surtout logiciel et la mise en place d'un cours mettant en évidence les avantages de l'une ou l'autre solution en ce compris par rapport à des solutions plus conventionnels de type BD relationnelle.
+  * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
+===== Contribution à l'amélioration de la plateforme génomique In Silico DB =====
+Une nouvelle spin-off a vu le jour depuis un an à IRIDIA: In Silico DB (https://insilicodb.org/) mettant à disposition sous une forme aisément exploitable des centaines de milliers d'échantillons de données génomiques permettant un meilleur diagnostic des maladies d'origine génétique et une meilleure compréhension de la biologie moléculaire. L'équipe qui s'en occupe a un besoin pressant de développeurs informatiques permettant d'en améliorer l'interface. Des connaissances en programmation Web sont souhaitées. La migration du système de stockage sur un serveur Big Data est aussi un des objectifs actuellement poursuivis par l'équipe en place et permettra au mémorant de se familiariser avec ces nouvelles technologies.
   * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
@@ Line 18: / Line 36: @@
 Depuis quelques années, Microsoft met en avant un nouveau langage de programmation F# créé dans le sillage des langages dits déclaratifs ou fonctionnels. Il semblerait que ce langage soit idéal pour le traitement des données. Le MFE consistera en une étude expérimentale de ce langage et un comparatif avec les langages de programmation aujourd'hui les plus usités.
+ * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
+===== Etude de l'algorithme du Deep Learning =====
+Les réseaux de neurones multicouches sont redevenus très à la mode depuis que Google les utilise massivement pour le traitement automatique d'images et de vidéos. Nous avons à IRIDIA étudié et réalisé plusieurs algorithmes d'apprentissage de ces réseaux multicouches. Le mémoire consistera en une comparaison des algorithmes de deep learning tels ceux utilisés chez Google et les alternatives que nous proposons ici à IRIDIA depuis plusieurs années.
+ * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
 ===== Etude et réalisation orientée objet d'une cellule minimale =====
@@ Line 25: / Line 51: @@
 élémentaire et sa membrane. L'idée est de réaliser le logiciel minimal capable de simuler un organisme vivant. Cette cellule devra être capable
 de croître et de spontanément se dupliquer. Il fera suite
-à une succession de MFE déjà réalisés ces dernières années.
+à une succession de MFE déjà réalisés ces dernières années. Parmi les amélirations possibles sont en cours la parallélisation du programme suivant une technologie Big Data ou le recours aux processeurs GPU.
@@ Line 76: / Line 102: @@
 ===== Expérimentation des designs patterns pour la modélisation de systèmes biologiques complexes =====
-Tout bon informaticien se doit aujourd’hui de maîtriser ces recettes de conception OO que sont les designs patterns. Au-delà des langages de programmation ou de modélisation (UML), ils sont devenus le sujet d’étude et de développement le plus prisé de la communauté informatique. Leur maîtrise permet à ces mêmes informaticiens d’attaquer la simulation de procédés complexes avec plus de facilité. Le MFE consistera en la mise en pratique de ces designs patterns pour la modélisation de systèmes biologiques complexes comme le système immunitaire ou les mécanismes de régulations génétiques. Le travail devrait déboucher sur une adaptation de ces mêmes designs patterns au monde et aux problèmes de la biologie.
+Tout bon informaticien se doit aujourd’hui de maîtriser ces recettes de conception OO que sont les designs patterns. Au-delà des langages de programmation ou de modélisation (UML), ils sont devenus le sujet d’étude et de développement le plus prisé de la communauté informatique. Leur maîtrise permet à ces mêmes informaticiens d’attaquer la simulation de procédés complexes avec plus de facilité. Le MFE consistera en la mise en pratique de ces designs patterns pour la modélisation de systèmes biologiques complexes comme le système immunitaire ou les mécanismes de régulations génétiques. Le travail devrait déboucher sur une adaptation de ces mêmes designs patterns au monde et aux problèmes de la biologie. Ce mémoire se fera en collaboration avec l'institut de recherche de Microsoft à Cambridge qui a déjà supervisé les mémorants précédents.
   * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
@@ Line 94: / Line 120: @@
   * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
@@ Line 102: / Line 129: @@
   * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
-===== Mise au point d’un système automatique de génération d'équations différentielles au départ d’un diagramme d’état-transition =====
+===== Mise en place de solutions Big Data et Elastic Search pour les réseaux bibliométriques  =====
+Les publications scientifiques doivent se citer entres elles. Elles constituent donc un immense réseau de citations. Nous étudions à IRIDIA la nature de ce réseau et l'impact que peut avoit une publication scientifique en suivant dans le temps le nombre de nouvelles publications qui citent cette dernière. Comme ces réseaux sont de taille gigantesque (des millions de publications), des solutions technologiques harwarde et software de type Big Data et Elastic Search sont mises en place et expérimentées ici à IRIDIA. Le mémoire consistera en un développement et une expérimentation des ces possibles solutions.
+* Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
-Le diagramme d’état-transition représente le cycle de vie d’un objet, de sa naissance à sa disparition, en suivant les différents états par lesquels cet objet transite. Lorsqu'il s'agit d'objets biologiques, il est possible de ré-interpréter ce diagramme comme la transition d'une
-partie d'une population d'objets dans un certain d'état dans l'état qui
-suit. Dans ce cas, ce diagramme peut se traduire sous forme d'un système
-d'équations différentielles que l'on devra pouvoir générer automatiquement.
-  * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
-  *
 ===== Mise au point d’un langage de modélisation de systèmes biologiques inspiré des diagrammes de classe et d'état/transition UML =====
@@ Line 152: / Line 177: @@
     * [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo (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)]]
-===== Optimising Ant Colony Algorithms for Performance ======
-Ants have inspired a number of computational techniques and among the most successful is ant colony optimization (ACO). ACO is an optimization technique that can be applied to tackle a wide variety of computational problems that arise in computer science, telecommunications, and engineering.
-The goal of this project is to improve the performance of ACO algorithms by investigating and testing various implementation techniques: intrinsic functions (MMX/SSE floating-point operations), CPU cache effects, or GPU programming.
-Required skills: knowledge of C programming. Some knowledge about computer architecture.
-  * Contacts :
-    * [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo (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)]]
-===== Graphical Tools for analysing Multi-Objective Data. =====
-In multi-objective problems, not only one objective function must be minimised but several, often conflicting, objectives must be taken into account. The result is often a set of solutions modelling the trade-off between the objectives of the problem.
-The goal of this project is to develop graphical tools to interactively examine and compare the results of algorithms for multi-objective problems.
-Required skills: The candidate should be well acquainted with programming in object oriented languages.
-  * Contacts :
-    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]]
-    * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]]
@@ Line 204: / Line 198: @@
     * [[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/~lperez|Leslie Perez (IRIDIA)]]
-    * [[http://iridia.ulb.ac.be/~jdubois|Jérémie Dubois-Lacoste (IRIDIA)]]
-===== Stochastic local search algorithms for weighted maximum clique problems. ======
-The Maximum Clique 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.
-Among the possible generalisations of the problem there is the Vertex Weighted and Edge Weighted Maximum Clique which asks to find the clique of maximum weight. Being generalisations they are also NP-hard. The goal of the project is to devise heuristic algorithms or adapt existing algorithms of the Maximum Clique for weighted version.
+===== Feature Extraction and Automatic Algorithm Selection. ======
-Required skills: good knowledge of C or C++ programming.
+The performance of (Stochastic Local Search) algorithms for a given problem depends on the algorithm design and on the setting of the algorithm's parameter. Given a heterogeneous set of instances for a given problem a good algorithm design (or parameter configuration) for one instance is not necessary the best design for all instances. On the contrary a tuning of an algorithm on a specific family of similar instances may affect negatively its performance on other families of instances.
+The thesis will focus on devising automatic methods for extracting features from the instances, select the relevant features, and learning (in the framework of multi-class classification) the
+relationship, if there is one, between the instances features and the best algorithm for the instance. The results will be instrumental for algorithm selection or the creation of portfolios of complementary algorithms suitable for large sets of diverse instances for a given problem.
-  * Contacts :
-    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]]
-    * [[http://iridia.ulb.ac.be/~fmascia|Franco Mascia (IRIDIA)]]
+Required skills: good knowledge of C or C++ programming and of a scripting language (e.g., python); good knowledge of machine learning methods would also be helpful.
-===== Stochastic Local Search heuristics for solving NP-complete puzzles. ======
-This project is about single player games (puzzles) and the design of algorithms for tackling hard combinatorial optimisation problems.
-Example puzzles are: [[http://en.wikipedia.org/wiki/Light_Up|Light Up]], [[http://en.wikipedia.org/wiki/Mastermind_(board_game)|Mastermind]], [[http://en.wikipedia.org/wiki/Minesweeper_(video_game)|Minesweeper]], etc.
-The student will learn how to design and implement a Stochastic Local Search algorithm to solve NP-complete puzzles. The student will also learn how to analyse the performaces of the algorithm and perform statistically sound comparisons with the other algorithms available in literature.
-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)]]
+    * [[http://code.ulb.ac.be/iridia.people.php?id=1393|Alberto Franzin (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.
+===== Swarm construction: Development of remote monitoring software for intelligent structures =====
-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.
+S-blocks are dynamically reconfigurable blocks used for autonomous construction applications. When two or more S-blocks are assembled they are capable of communicating with each other over a near field communication (NFC) wireless interface. The goal of this master thesis is to develop software to monitor (and control) the blocks in an intelligent structure remotely over the auxiliary Zigbee-based wireless interface. As only one block in the structure is fitted with this wireless interface, it is required that the other blocks communicate with the PC, via routing messages through the block-to-block NFC interfaces. This will require the software on the S-Blocks to be enhanced to use preemptive task swapping, to allow multiple blocks to communicate with each other simultaneously.
+Required skills: The candidates should understand low level computer concepts such as: interrupts, timers, and registers, have some experience with C/C++ programming, and have a working knowledge of the English language.
-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)]]
-===== Formal verification of a swarm robotics behavior through statistical model checking =====
-The goal of this thesis is to apply statistical model
-checking to formally verify properties of a collective behavior of a
-robot swarm. Verifying that a system behaves as desired in all
-possible situations is necessary when autonomous robots are involved.
-This is particularly true in swarm robotics systems, where the
-interactions of large number of individuals can result in behaviors
-difficult to predict. Model checking is a common technique to formally
-prove properties of a system. However, its results are limited to
-small systems, because medium-sized or large systems are
-computationally impossible to analyze.
-This thesis is will explore the application of a novel model checking technique, called statistical model checking, to formally verify a swarm robotics system. A collective behavior will be firstly implemented in
-simulation and then analyzed through statistical model checking.
-Required skills: the candidates should be acquainted with C/C++
-programming and have a working knowledge of the English language.
-  * Contacts : [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]] and Manuele Brambilla (IRIDIA)
-===== UML for Swarm robotics: formal specification of a collective behavior =====
-Swarm robotics is an interesting approach to the
-coordination of hundreds of robots as it promotes the realization of
-systems which are scalable, robust and flexible. However, up to now,
-swarm robotics application has been quite limited, also due to the
-lack of an engineering approach to its development.
-In particular, formal specification has not been applied yet to swarm
-robotics systems.
-In this thesis, we will explore possible ways to formally specify
-swarm robotics systems. As a starting point we will consider UML and
-UML extensions like AUML and UML for multi-agent systems. If
-necessary, we will develop a specific extension for swarm robotics
-systems. Once the preliminary work is done we will consider an
-example, perform formal specification of a task and then implement the
-system in simulation.
-Required skills: the candidates should be acquainted with C/C++
-programming, have a good knowledge of formal specification and UML,
-and have a working knowledge of the English language.
-  * Contacts : [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]] and Manuele Brambilla (IRIDIA)
-===== A GUI for debugging the behavior of a robot swarm =====
-Debugging a robot swarm is a complex and difficult task.
-The desired behavior of the swarm is the result of the complex
-non-linear interactions of tens or hundreds of robots. When
-implementing a swarm robotics system, very often it is necessary to
-analyze individually the output of the execution of each robot, a very
-long and boring process. Since the goal of the developer is to obtain
-a specific collective behavior, it would be better to debug the system
-at the collective level and, only if necessary, at the individual
-level.
-In this thesis we will analyze a possible way to debug the collective
-behavior of a swarm of robots, using macroscopic and microscopic
-modeling. The goal is to develop a GUI that shows the state of the
-collective behavior of the system, and if the user requires it, the
-state of a single robot. We will start with a version of the debugging
-GUI that interface with the ARGoS simulator and eventually one that
-interfaces with the real robots.
-Required skills: the candidates should be acquainted with C/C++
-programming, GUI programming (QT/C++ or QT/Python or Java) and have a
-working knowledge of the English language.
-  * Contacts : [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]] and Manuele Brambilla (IRIDIA)
-===== A virtual machine for mobile code in a swarm of robots =====
-Mobile code is a technology whereby nodes in a network of
-computing nodes exchange code. In other words, code migrates from
-machine to machine like an agent navigating an environment. Mobile
-code is a promising technology for swarm robotics because it would
-enable a new, novel type of robot-to-robot interaction. The aim of this
-project is produce a simple, yet high-performance virtual machine to
-support code exchange in a swarm of robots. A simple experiment with
-the robots demonstrating the capabilities of the VM will be performed.
-Required Skills: Good knowledge of C
-  * Contact: [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]] and Carlo Pinciroli (IRIDIA)
-===== Swarmscope =====
-One the main problems in the development of swarm robotics
-systems is the difficulty of producing, analyzing and debugging code for
-large distributed systems. The aim of this project is to produce a set of
-innovative tools to aid the development of complex swarm robotics
-systems. The produced tools will involve new, creative visualization
-methods and media, novel human-robot swarm interaction and effective
-debugging tools.
-Required Skills: Good knowledge of C++ and Qt4
-  * Contact: [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]] and Carlo Pinciroli (IRIDIA)
-===== Self-organized visual coverage in a swarm of robots =====
-Systems composed of several inter-connected cameras are already a reality in our everyday lives. The prime application of such systems is video-surveillance, but the possibilities offered by multiple-camera systems can extend to other interesting scenarios, such as environment mapping, 3D shape-reconstruction and object recognition. In all these scenarios, the problem of finding the right
-position of a set of cameras in order to maximize the visual field, or the amount of information available, is not always a simple one. Furthermore, systems consisting of cameras in a fixed position present obvious issues of robustness and flexibility.
-Multi-robots systems can provide an interesting mean to overcome this issues. Robots navigating in the enviroment can change their position as a result of changes in the enviroment or in the overall system's objective. A centralized control solution for these systems is still not a desirable one, as it introduces a single point of failure and it can suffer from performance issues.
-The Swarm Robotics paradigm offers a valid approach to the design of a multiple camera system. In this project, we want to study the possibility to develop a control strategy that enables a swarm of robots to position themselves into an unknown environment, maximizing the area covered by their visual fields, while relying only on their image processing system and on local communication.
-Required skills: The candidate should be acquainted with C/C++ programming and have a
-working knowledge of the English language.
-  * Contact: [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]] and Alessandro Stranieri (IRIDIA)
-===== Automatic fitness function definition in evolutionary robotics =====
-Evolutionary robotics is a fascinating approach to the design of robot controllers that takes inspiration from natural evolution.
-In order to obtain a robot that is able to perform a desired task, the evolutionary robotics approach considers a population of robots that evolves in time. Each robot is characterized by a genotype that defines somehow its behavior. Each robot is evaluated according to a fitness function that measures the ability of the robot to perform the desired task. Robots with a low fitness are eliminated. Robots with a high fitness remain in the population and generate offsprings -- e.g., robots with a similar genotype obtained via mutation and/or cross-over. Through this process, generation by generation, the evolutionary robotics approach is able to obtain robots that present higher and higher fitness and that are therefore able to perform the desired task more and more effectively.
-One of the main open problems in evolutionary robotics is that the definition of an appropriate fitness function is a very complex, labor-intensive, and time-consuming activity that requires the attention of an expert researcher.
-The goal of this master thesis is to devise an automatic method to define a fitness function in order to obtain a robot that is able to perform a desired task. This automatic method will be based on machine learning and metaheuristic algorithms. In particular, it will draw ideas from the fields of reinforcement learning and of on-line adaptation of parameters in optimization algorithms.
-Required skills: The candidates should be acquainted with C/C++ programming and have a working knowledge of the English language.
-* Contact: [[http://iridia.ulb.ac.be/~mbiro|Mauro Birattari]], Marco Dorigo, Vito Trianni (IRIDIA)
+* Contact: [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo]] (IRIDIA)
-===== Evolution of Modular Controllers for Simulated and Real Robots =====
-The goal of this master thesis is investigating how modularity in a robot controller can influence the quality of the behaviours obtained through artificial evolution.
-Similarly to the nervous system that can be divided in central and peripheral, the project will study a modular architecture for neural network controllers. The peripheral modules encode the information coming from the sensory subsytems or going to the motor apparatus. The central system encodes the behavioural rules that map sensations to actions. The project will study methods to develop the peripheral modules by maximising the information transfer from the sensory input and to the motor output, on the basis of measures derived from Information Theory.
-The project will involve experimental activities with both simulated and real robots, and will investigate both individual and collective behaviours.
-Required skills: The candidates should be acquainted with C/C++ programming and have a working knowledge of the English language.
-* Contact: [[http://iridia.ulb.ac.be/~vtrianni|Vito Trianni]], Marco Dorigo (IRIDIA)
-===== Simulation et optimisation de trafic routier =====
-Mentis, spin-off du laboratoire IRIDIA, est une société de consultance
-spécialisée en Data Mining et en Text Mining.  Mentis cherche
-actuellement des mémorants pour lancer diverses études d’optimisation
-dans le domaine de la simulation de trafic routier.
-Dans le cadre d’un projet pour un de ses clients, Mentis travaille
-actuellement dans le domaine de la simulation de trafic routier.
-L’objectif du mémoire proposé consiste à lancer plusieurs études
-d’optimisation pour évaluer l’impact de différentes politiques
-routières sur le trafic.  Il sera demandé à l’étudiant de mettre en
-œuvre diverses techniques d’optimisation afin de déterminer les
-politiques routières optimales. Une grande partie du mémoire sera
-faite dans les bureaux de Mentis ainsi qu’en interaction directe avec
-le client.
-  * Contacts:
-    * [[psener@mentis-consulting.be|Pierre Sener (Mentis)]]
-    * [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
-    * [[http://iridia.ulb.ac.be/~stuetzle/|Thomas Stützle (IRIDIA)]]
@@ Line 509: / Line 310: @@
-===== Comparison of fast heuristics for the longest common subsequence problem =====
-The [[http://en.wikipedia.org/wiki/Longest_common_subsequence|longest common subsequence (LCS) problem]] has important applications in Computational Biology. Several heuristic methods have been proposed to obtain approximate solutions. These methods require different computation time and obtain solutions of varied quality. In this project, the student will learn several methods that have been proposed in the literature to tackle a difficult optimization problem, and compare them in terms of computation time and quality of the resulting solutions. The final goal is to propose appropriate combinations of existing methods that solve diverse instances of the LCS problem.
+===== Applications of a hybrid SLS algorithm framework =====
-  * Contacts :
+We have recently developed a software framework from which hybrid stochastic local search algorithms can be designed automatically. This framework has only been applied to a few problems. The goal of this project would be to extend this framework to other problems and compare its results with the methods proposed in the literature. The student will learn to solve combinatorial optimization problems with SLS algorithms, automatic configuration of optimization algorithms, and analysis and comparison of optimization algorithms.
-    * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]]
-    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]]
-===== Applications of the Multi-objective ACO framework =====
-We have recently developed a software framework of Ant Colony Optimization algorithms for multi-objective optimization problems. This framework has only been applied to a few problems. The goal of this project would be to extend this framework to other problems and compare its results with the methods proposed in the literature. The student will learn to solve multi-objective optimization problems with ACO algorithms, automatic configuration of optimization algorithms, and analysis and comparison of optimization algorithms for multi-objective problems.
   * Contacts :
-    * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]]
     * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]]
-    * [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo (IRIDIA)]]
+    * [[http://code.ulb.ac.be/iridia.people.php?id=1388|Federico Pagnozzi (IRIDIA)]]
-===== A graphical interface for the optimisation of Water Distribution Networks =====
-The [[http://iridia.ulb.ac.be/~manuel/doc/cec2005-presentation.pdf|optimization of the operations of Water Distribution Networks]] may save important amounts of energy and its associated costs, and, therefore, it is an important problem in practice. There are [[http://www.epa.gov/nrmrl/wswrd/dw/epanet.html|graphical tools and simulators]] available. In addition, several optimization methods based on [[http://iridia.ulb.ac.be/~manuel/doc/cec2005.pdf|evolutionary algorithms]] and [[http://dx.doi.org/10.1061/(ASCE)0733-9496(2008)134:4(337)|ant colony optimization]] have been proposed in the literature. The goal of this project is to integrate the optimization algorithms into a graphical environment that can be used by water engineers and operators. No knowledge about water distribution networks is necessary. The optimisation algorithms and toolkit libraries for handling water distribution networks will be available to the student.
-  * Contacts :
-    * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]]
-    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]]
-===== Automatic fine-tuning of an evolutionary multi-objective framework =====
-The goal of this project is to explore the possibilities of using automatic configuration tools for fine-tuning an existing [[http://paradiseo.gforge.inria.fr/index.php?n=Paradiseo.MOEO|evolutionary multi-objective framework]]. The student will learn about automatic configuration tools, evolutionary algorithms for multi-objective optimization problems and analysis and comparison of multi-objective algorithms.
-  * Contacts :
-    * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]]
-    * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]]