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 [2010/03/30 16:43] mlibanez add new projects |
teaching:mfe:ia [2011/03/08 17:24] stuetzle |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== MFE 2010-2011 : Intelligence Artificielle ====== | + | ====== MFE 2011-2012 : Intelligence Artificielle ====== |
| ===== Introduction ===== | ===== Introduction ===== | ||
| Line 153: | Line 153: | ||
| * [[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)]] | ||
| + | |||
| ===== Swarm robotics using the e-puck platform ===== | ===== Swarm robotics using the e-puck platform ===== | ||
| Line 234: | Line 250: | ||
| - | |||
| - | ===== Evolution of Cooperation ===== | ||
| - | |||
| - | Often the selfish and strong are believed to be favored by natural selection, even though cooperative and fair interactions thrive at all levels of organization in living systems. This project tackles this paradox in the context of Evolutionary Game Theory (EGT), having kin-selection, direct and indirect reciprocity as conceptual starting points. Contrary to what is usual, models will also take into account the intricate ties of modern social networks and its topological evolution. | ||
| - | |||
| - | In spite of its relevance, understanding the evolution of cooperation remains one of the most fundamental challenges to date, tackled by scientists from fields as diverse as anthropology, biology, sociology, ecology, economics, psychology, political science, mathematics, physics, etc., who often adopt EGT as a common mathematical framework. Hence, students who choose this proposal should be strongly interested in interdisciplinary research. | ||
| - | |||
| - | Required skills: The candidates should have good mathematical skills, be acquainted with C/C++ programming and have a working knowledge of the English language. | ||
| - | |||
| - | * Contact : [[http://iridia.ulb.ac.be/~fsantos|Francisco C. Santos (IRIDIA)]] | ||
| - | |||
| - | |||
| - | |||
| - | \\ | ||
| - | \\ | ||
| - | The project is in collaboration with [[http://www.ciul.ul.pt/~pacheco/|Jorge M. Pacheco (University of Lisbon)]], [[http://como.vub.ac.be/doku.php?id=members:sven_van_segbroeck|Sven Van Segbroeck (IRIDIA and COMO, VUB)]] and [[http://switch.vub.ac.be/~tlenaert/|Tom Lenaerts (SWITCH, VUB)]]. | ||