This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
teaching:mfe:ia [2011/03/08 17:08] stuetzle [Evolution of Cooperation] |
teaching:mfe:ia [2011/03/18 11:40] bersini [Etude et réalisation orientée objet d'une cellule minimale] |
||
|---|---|---|---|
| Line 15: | Line 15: | ||
| to the implementation of this library will be studied. The | to the implementation of this library will be studied. The | ||
| library will also be tested in terms of robustness and performance | library will also be tested in terms of robustness and performance | ||
| - | as compared with the previous existing solutions. | + | as compared with the previous existing solutions coming from other technological platforms (Java, PHP, ...). This memoire will be a follow up of a previous memoire. |
| Line 24: | Line 24: | ||
| Le MFE consistera en un développement orienté objet d'une | Le MFE consistera en un développement orienté objet d'une | ||
| cellule biologique minimale avec son métabolisme chimique interne, un génome | cellule biologique minimale avec son métabolisme chimique interne, un génome | ||
| - | élémentaire et sa membrane. Cette cellule devra être capable | + | é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 | de croître et de spontanément se dupliquer. Il fera suite | ||
| - | à un MFE déjà réalisé il y a deux ans. | + | à une succession de MFE déjà réalisés ces dernières années. |
| Line 152: | Line 152: | ||
| * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | ||
| * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]] | * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (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. | ||
| + | |||
| + | Required skills: good knowledge of C or C++ programming. | ||
| + | |||
| + | |||
| + | * Contacts : | ||
| + | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | ||
| + | * [[http://iridia.ulb.ac.be/~fmascia|Franco Mascia (IRIDIA)]] | ||
| + | |||
| /* | /* | ||