<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://iridia.ulb.ac.be/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=ML%C3%83%C2%B3pez-Ib%C3%83%C2%A1%C3%83%C2%B1ez</id>
	<title>IridiaWiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://iridia.ulb.ac.be/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=ML%C3%83%C2%B3pez-Ib%C3%83%C2%A1%C3%83%C2%B1ez"/>
	<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/wiki/Special:Contributions/ML%C3%83%C2%B3pez-Ib%C3%83%C2%A1%C3%83%C2%B1ez"/>
	<updated>2026-05-09T11:18:37Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.35.4</generator>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6920</id>
		<title>Optimization Group Meetings</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6920"/>
		<updated>2014-10-07T16:27:17Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: /* History of Literature Sessions */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;You can subscribe to an [http://en.wikipedia.org/wiki/ICalendar iCalendar] of these meetings at http://iridia.ulb.ac.be/Calendars/publish.php/_NUC_Optimization.ics&lt;br /&gt;
&lt;br /&gt;
==Breakfast Meetings==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
Breakfast meetings are informal meetings where there is a general discussion or someone presents their work. And additional goal is to have breakfast together.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, and a short summary of what you are going to talk about.&lt;br /&gt;
# Add a new entry to the table below.&lt;br /&gt;
# Bring breakfast.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Breakfast Meetings ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;200&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Summary&lt;br /&gt;
|-&lt;br /&gt;
|2014-04-10&lt;br /&gt;
|G. Sena DAÅž&lt;br /&gt;
| Developing a Solution Algorithm for the Multi-objective Gate Assignment Problems&lt;br /&gt;
|-&lt;br /&gt;
|2013-09-12&lt;br /&gt;
|Leslie Perez&lt;br /&gt;
| Tuning and irace&lt;br /&gt;
|-&lt;br /&gt;
|2011-03-10&lt;br /&gt;
|Stefanie Kritzinger&lt;br /&gt;
| A Unified Framework for Routing Problems with Fixed Fleet Size&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-21&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
| Off-line vs. On-line Tuning: A Study on MAX-MIN Ant System for the TSP&lt;br /&gt;
|-&lt;br /&gt;
|2010-10-19&lt;br /&gt;
|Stefano Benedettini&lt;br /&gt;
| Experiments on Boolean Network Design by Local Search Algorithms.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-20&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
| The social learning strategies tournament, organized as part of the [http://www.intercult.su.se/cultaptation/ cultaptation project], and its results were described. No ideas about algorithm portfolios were discussed.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-??&lt;br /&gt;
|Renaud Lenne&lt;br /&gt;
| ???&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-04-29&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|The maximum clique problem, state of the art and ACO [http://dx.doi.org/10.1016/j.cor.2009.02.013] [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.80.2036&amp;amp;rep=rep1&amp;amp;type=pdf] [http://www710.univ-lyon1.fr/~csolnon/publications/rr-mai04.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-18&lt;br /&gt;
|Sabrina Oliveira&lt;br /&gt;
|Achieved results from the application of the Population Based Ant Colony Optimisation algorithm to TSP.&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-11&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|An overview of Container Loading Problems. &lt;br /&gt;
|-&lt;br /&gt;
| 2010-01-21&lt;br /&gt;
|Yuan, Zhi (Eric)&lt;br /&gt;
| Rice cooker vs. the idea of tuning. &lt;br /&gt;
|-&lt;br /&gt;
|2010-01-07&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|General discussion about the optimization group. &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Literature Sessions==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
The goal of the Literature Sessions is to examine and discuss&lt;br /&gt;
particularly interesting papers from the research literature. For each&lt;br /&gt;
session, one paper will be selected, there will be a short&lt;br /&gt;
presentation (10-15 minutes) about the contents, and a discussion will&lt;br /&gt;
ensue. Sessions will last around 40-45 minutes. Attendants should read&lt;br /&gt;
the paper before the session in order to have a productive discussion. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, a reference to the paper and the URL where it can be obtained. Also, attach the paper in PDF.&lt;br /&gt;
# Add a new entry to the table below. Use YYY-MM-DD (year-month-day) format for the date. Please add a complete bibliographic reference (you may find it in the homepages of the authors) and a hyperlink to a PDF (links to http://dx.doi.org are preferred).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Literature Sessions ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;180&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Paper discussed&lt;br /&gt;
|-&lt;br /&gt;
|2014-10-07&lt;br /&gt;
| Leslie Perez&lt;br /&gt;
|Martin Zaefferer, JÃ¶rg Stork, Martina Friese, Andreas Fischbach, Boris Naujoks, and Thomas Bartz-Beielstein. 2014. Efficient global optimization for combinatorial problems. In Proceedings of the 2014 conference on Genetic and evolutionary computation (GECCO), 2014. http://doi.acm.org/10.1145/2576768.2598282&lt;br /&gt;
&lt;br /&gt;
Martin Zaefferer, JÃ¶rg Stork, Thomas Bartz-Beielstein: Distance Measures for Permutations in Combinatorial Efficient Global Optimization. PPSN 2014. http://doi.acm.org/10.1145/2576768.2598260&lt;br /&gt;
|-&lt;br /&gt;
|2014-02-20&lt;br /&gt;
| Thomas Stutzle&lt;br /&gt;
|A unified solution framework for multi-attribute vehicle routing problems.&lt;br /&gt;
Thibaut Vidal, Teodor Gabriel Crainic, Michel Gendreau, and Christian Prins.&lt;br /&gt;
http://dx.doi.org/10.1016/j.ejor.2013.09.045 &lt;br /&gt;
|-&lt;br /&gt;
|2013-10-03&lt;br /&gt;
|Leonardo Bezerra&lt;br /&gt;
|Robust Benchmark Set Selection for Boolean Constraint Solvers. Holger Hoos, Benjamin Kaufmann, Torsten Schaub and Marius Schneider - Proceedings of the 7th International Conference on Learning and Intelligent Optimization (LION 7), to appear, 2013. http://www.cs.ubc.ca/~hoos/Publ/HooEtAl13-preprint.pdf&lt;br /&gt;
&lt;br /&gt;
Quantifying Homogeneity of Instance Sets for Algorithm Configuration. Marius Schneider and Holger H. Hoos - Proceedings of the 6th International Conference on Learning and Intelligent Optimization (LION 6), pp. 190-204, 2012. http://www.cs.ubc.ca/~hoos/Publ/SchHoo12.pdf &lt;br /&gt;
|-&lt;br /&gt;
|2013-09-12&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|Automated Parameter Tuning Framework for Heterogeneous and Large Instances: Case study in Quadratic Assignment Problem Lindawati, Zhi Yuan, Hoong Chuin Lau &amp;amp; Feida Zhu. http://lion.disi.unitn.it/intelligent-optimization//LION7/Lindawati-Yuan-Lau-Zhu_Automated%20Parameter%20Tuning.pdf&lt;br /&gt;
|-&lt;br /&gt;
|2013-04-11&lt;br /&gt;
|Leslie Perez&lt;br /&gt;
| C. AnsÃ³tegui, M. Sellmann, and K. Tierney, â€œA Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms,â€ in Principles and Practice of Constraint Programming - CP 2009, I. P. Gent, Ed. Springer Berlin Heidelberg, 2009, pp. 142â€“157. http://itu.dk/people/kevt/papers/gga-cp2009.pdf &lt;br /&gt;
|-&lt;br /&gt;
|2012-10-18&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
| Yuri Malitsky, Meinolf Sellmann: Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. CPAIOR 2012: 244-259 &lt;br /&gt;
http://dx.doi.org/10.1007/978-3-642-29828-8_16&lt;br /&gt;
|-&lt;br /&gt;
|2012-10-12&lt;br /&gt;
| Tianjun Liao&lt;br /&gt;
|Bernd Bischl, Olaf Mersmann, Heike Trautmann, and Mike PreuÃŸ. 2012. Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference (GECCO 2012), Terence Soule (Ed.). ACM, New York, NY, USA, 313-320. DOI:[http://doi.acm.org/10.1145/2330163.2330209 10.1145/2330163.2330209]&lt;br /&gt;
&lt;br /&gt;
Olaf Mersmann, Bernd Bischl, Heike Trautmann, Mike Preuss, Claus Weihs, and GÃ¼nter Rudolph. 2011. Exploratory landscape analysis. In&lt;br /&gt;
Proceedings of the 13th annual conference on Genetic and evolutionary computation (GECCO 2011), Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 829-836. DOI:[http://doi.acm.org/10.1145/2001576.2001690 10.1145/2001576.2001690]&lt;br /&gt;
|-&lt;br /&gt;
|2012-04-19&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|E.K. Burke, M.R. Hyde, and G. Kendall. Grammatical Evolution of Local Search Heuristics. IEEE Transactions on Evolutionary Computation, 99, 2011. doi: 10.1109/TEVC.2011.2160401 [http://www.cs.nott.ac.uk/~mvh/papers/mvh-draft-ieeetec2011.pdf PDF] &lt;br /&gt;
|-&lt;br /&gt;
|2012-04-03&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|On the automatic discovery of variants of the NEH procedure for flow   shop scheduling using genetic programming. J A VÃ¡zquez-RodrÃ­guez and G Ochoa.Journal of the Operational Research Society (2011) 62, 381â€“396.   doi:[http://dx.doi.org/10.1057/jors.2010.132  10.1057/jors.2010.132]&lt;br /&gt;
|-&lt;br /&gt;
|2011-12-08&lt;br /&gt;
|Zhi Yuan&lt;br /&gt;
|Frank Hutter, Holger Hoos, and Kevin Leyton-Brown. Sequential Model-Based Optimization for General Algorithm Configuration. In Proceedings of Learning and Intelligent Optimization (LION 5), 2011. PDF: [http://www.cs.ubc.ca/~hutter/papers/11-LION5-SMAC.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2011-11-24&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|Ender Ã–zcan and Andrew J. Parkes. 2011. Policy matrix evolution for  generation of heuristics. In Proceedings of the 13th annual  conference on Genetic and evolutionary computation (GECCO 2011),  Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 2011-2018. DOI: [http://dx.doi.org/10.1145/2001576.2001846 10.1145/2001576.2001846]&lt;br /&gt;
|-&lt;br /&gt;
|2011-02-04&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
|HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms. By Christopher Nell, Chris Fawcett, Holger H. Hoos, and Kevin Leyton-Brown. [http://hal.cs.ubc.ca/pubs/NelEtAl11.pdf PDF]&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-17&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
|A. LaTorre, S. Muelas, and J.-M. PeÃ±a. A MOS-based dynamic memetic  differential evolution algorithm for continuous optimization: a  scalability test. Soft Computing. Special issue on Scalability of Evolutionary Algorithms and other Metaheuristics for Large Scale  Continuous Optimization Problems. DOI [http://dx.doi.org/10.1007/s00500-010-0646-3 10.1007/s00500-010-0646-3]&lt;br /&gt;
|-&lt;br /&gt;
|2010-11-10&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|A Rigorous Analysis of the Harmony Search Algorithm--How the Research Community can be misled by a &amp;quot;novel&amp;quot; Methodology. Dennis Weyland. International Journal of Applied Metaheuristic Computing, volume 1-2, April-June 2010, pages 50-60.  DOI: [http://dx.doi.org/10.4018/jamc.2010040104 10.4018/jamc.2010040104]&lt;br /&gt;
&lt;br /&gt;
Survival of the Fittest Algorithm or the Novelest Algorithm?: The Existence Reason of the Harmony Search Algorithm. Zong Woo Geem.&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-09-23&lt;br /&gt;
|Gianpiero Francesca&lt;br /&gt;
|Wenyin Gong, Ãlvaro Fialho and Zhihua Cai. Adaptive Strategy Selection in Differential Evolution. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 409-416. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/68/PDF/AOS-DE.pdf]&lt;br /&gt;
&lt;br /&gt;
Ãlvaro Fialho, Marc Schoenauer and Michele Sebag. Toward Comparison-based Adaptive Operator Selection. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 767-774. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/64/PDF/banditGECCO10.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-06-03&lt;br /&gt;
|Tianjun Liao &lt;br /&gt;
|Population-Based Algorithm Portfolios for Numerical Optimization. Peng, F. Tang, K.Chen, G.Yao, X. IEEE Transactions on Evolutionary Computation. DOI: [http://dx.doi.org/10.1109/TEVC.2010.2040183 10.1109/TEVC.2010.2040183] &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-07&lt;br /&gt;
|Zhi (Eric) Yuan&lt;br /&gt;
|Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. L. Xu, H.H. Hoos, K. Leyton-Brown. To appear at the Conference of the Association for the Advancement of Artificial Intelligence (AAAI-10), 2010. [http://ws.cs.ubc.ca/~kevinlb/pub.php?u=2010-AAAI-Hydra.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-04&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|A. Schaerf and L. Di Gaspero. [[:Image:ElPaCo_presentation.pdf|Slides of the tutorial  &amp;quot;An Overview of Local Search Software Tools&amp;quot;]] given at &amp;quot;Learning and Intelligent OptimizatioN (LION 2007)&amp;quot;, December 8-12, 2007, Trento, Italy.&lt;br /&gt;
&lt;br /&gt;
L. Di Gaspero and A. Schaerf. EASY LOCAL++: An object-oriented framework for ï¬‚exible design of local search algorithms. Software â€” Practice &amp;amp; Experience, 33(8):733â€“765, July 2003. [http://www.diegm.uniud.it/satt/papers/DiSc03.pdf]&lt;br /&gt;
&lt;br /&gt;
S. Cahon, N. Melab and T. El Ghazali. ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. Journal of Heuristics, 10(3):357-380, November 2004. [http://dx.doi.org/10.1023/B:HEUR.0000026900.92269.ec]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-19&lt;br /&gt;
|Sabrina M. de Oliveira&lt;br /&gt;
|A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Session on Real Parameter Optimization. S. Garcia, D. Molina, M. Lozano, F. Herrera - Journal of Heuristics, Volume 15, pp. 617-644, 2009. [http://sci2s.ugr.es/programacion/workshop/GarciaMolinaLozanoHerrera-JH2008.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-04&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|Analyzing Bandit-based Adaptive Operator Selection Mechanisms. Ãlvaro Fialho, Luis Da Costa, Marc Schoenauer and MichÃ©le Sebag. &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-01-14&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|SATzilla: Portfolio-based Algorithm Selection for SAT. L. Xu, F. Hutter, H. H. Hoos, K. Leyton-Brown - Journal of Artificial Intelligence Research, Volume 32, pp. 565-606, 2008. [http://www.jair.org/media/2490/live-2490-3923-jair.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2009-12-11&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|SATenstein: Automatically Building Local Search SAT Solvers From Components. Ashiqur R. KhudaBukhsh, Lin Xu, Holger H. Hoos and Kevin Leyton-Brown - Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 517-524, 2009. [http://www.cs.ubc.ca/labs/beta/Projects/SATenstein/SATenstein_ijcai.pdf]&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Other Previous Meetings==&lt;br /&gt;
&lt;br /&gt;
See [[Previous Optimization meetings | Minutes and agendas from previous meetings]].&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=ProceedingsRepository&amp;diff=6873</id>
		<title>ProceedingsRepository</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=ProceedingsRepository&amp;diff=6873"/>
		<updated>2014-09-13T17:45:53Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;div class=&amp;quot;page-warning&amp;quot;&amp;gt;&lt;br /&gt;
[[Image:icon_warning.png|40px]] The proceedings moved out to the web server! However, keep copies of the proceedings that you care about somewhere safe. &lt;br /&gt;
&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
IRIDIA has a proceedings repository that contains digital copies of proceedings.&lt;br /&gt;
&lt;br /&gt;
=== Access ===&lt;br /&gt;
&lt;br /&gt;
They are two ways to get access to the proceedings.&lt;br /&gt;
&lt;br /&gt;
==== Directly on the web server ====&lt;br /&gt;
To get access you need to ask the password to the [[Lab_responsibilities#Servers.2C_infrastructures.2C_and_assets|webserver's administrator]].&lt;br /&gt;
&lt;br /&gt;
Then login on iridia &lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
ssh proceedings@iridia&lt;br /&gt;
&lt;br /&gt;
cd ~/disabled_html&lt;br /&gt;
&lt;br /&gt;
ls&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== From your browser ====&lt;br /&gt;
Just go to [http://iridia.ulb.ac.be/~proceedings http://iridia.ulb.ac.be/~proceedings]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;page-warning&amp;quot;&amp;gt;&lt;br /&gt;
[[Image:icon_warning.png|40px]] Web browser access is currently broken, you'll need to use ssh into the webserver. If you know how to fix this, please contact the web server responsible.&lt;br /&gt;
&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Adding new proceedings ===&lt;br /&gt;
&lt;br /&gt;
Let's say you want to add the directory /media/cdrom for the conference GECCO 2010.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
scp -o PubkeyAuthentication=no -r /media/cdrom proceedings@iridia.ulb.ac.be:/home/proceedings/disabled_html/2010-gecco&lt;br /&gt;
&lt;br /&gt;
ssh proceedings@iridia ./update_permissions&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=ProceedingsRepository&amp;diff=6872</id>
		<title>ProceedingsRepository</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=ProceedingsRepository&amp;diff=6872"/>
		<updated>2014-09-13T17:44:08Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;div class=&amp;quot;page-warning&amp;quot;&amp;gt;&lt;br /&gt;
[[Image:icon_warning.png|40px]] The proceedings moved out to the web server! However, keep copies of the proceedings that you care about somewhere safe. &lt;br /&gt;
&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
IRIDIA has a proceedings repository that contains digital copies of proceedings.&lt;br /&gt;
&lt;br /&gt;
=== Access ===&lt;br /&gt;
&lt;br /&gt;
They are two ways to get access to the proceedings.&lt;br /&gt;
&lt;br /&gt;
==== Directly on the web server ====&lt;br /&gt;
To get access you need to ask the password to the [[Lab_responsibilities#Servers.2C_infrastructures.2C_and_assets|webserver's administrator]].&lt;br /&gt;
&lt;br /&gt;
Then login on iridia &lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
ssh proceedings@iridia&lt;br /&gt;
&lt;br /&gt;
cd ~/public_html&lt;br /&gt;
&lt;br /&gt;
ls&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== From your browser ====&lt;br /&gt;
Just go to [http://iridia.ulb.ac.be/~proceedings http://iridia.ulb.ac.be/~proceedings]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;page-warning&amp;quot;&amp;gt;&lt;br /&gt;
[[Image:icon_warning.png|40px]] Web browser access is currently broken, you'll need to use ssh into the webserver. If you know how to fix this, please contact the web server responsible.&lt;br /&gt;
&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Adding new proceedings ===&lt;br /&gt;
&lt;br /&gt;
Let's say you want to add the directory /media/cdrom for the conference GECCO 2010.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
scp -o PubkeyAuthentication=no -r /media/cdrom proceedings@iridia.ulb.ac.be:/home/proceedings/public_html/2010-gecco&lt;br /&gt;
&lt;br /&gt;
ssh proceedings@iridia ./update_permissions&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Lab_responsibilities&amp;diff=6857</id>
		<title>Lab responsibilities</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Lab_responsibilities&amp;diff=6857"/>
		<updated>2014-08-18T13:07:02Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: linkify&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;MD = Marco Dorigo, TS = Thomas StÃ¼tzle, MB = Mauro Birattari&lt;br /&gt;
=Servers, infrastructures, and assets=&lt;br /&gt;
{| border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
!Task&lt;br /&gt;
!Responsible&lt;br /&gt;
!Supervisor&lt;br /&gt;
!Comment&lt;br /&gt;
|-&lt;br /&gt;
| IRIDIA server maintenance&lt;br /&gt;
| Gaetan&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| [[Development_Server | Development server maintenance]]&lt;br /&gt;
| Lorenzo, Manuel&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| [[Backup_Server | Backup server maintenance]]&lt;br /&gt;
| Roman, ??? &lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| [http://majorana.ulb.ac.be Cluster] maintenance&lt;br /&gt;
| JÃ©rÃ©mie&lt;br /&gt;
| TS &lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Proceedings repository&lt;br /&gt;
| Leonardo&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Wireless network&lt;br /&gt;
| Nithin, Roman&lt;br /&gt;
| TS&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Printers, scanner, fax&lt;br /&gt;
| Nithin&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Workshop&lt;br /&gt;
| TBD&lt;br /&gt;
| TBD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| [[Laser_Cutter | Laser Cutter]]&lt;br /&gt;
| Anthony&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| CAD Workstation&lt;br /&gt;
| Anthony&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| 3D Printer&lt;br /&gt;
| Dhananjay, Anthony&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| [[Photo_Video | Photo-Video]]&lt;br /&gt;
| Gabriele&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Management Coffee Room&lt;br /&gt;
| TBD&lt;br /&gt;
| TBD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Reading material in Coffee Room&lt;br /&gt;
| TBD&lt;br /&gt;
| TBD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Mac OS X support and Muriel's Mac&lt;br /&gt;
| Andreagiovanni&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=Web sites, wiki pages, and mailing lists=&lt;br /&gt;
{| border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
!Task&lt;br /&gt;
!Responsible&lt;br /&gt;
!Supervisor&lt;br /&gt;
!Comment&lt;br /&gt;
|-&lt;br /&gt;
| Web pages (CoDE/IRIDIA)   &lt;br /&gt;
| Dhananjay, Leslie&lt;br /&gt;
| TS&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Databases&lt;br /&gt;
| Andreagiovanni&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Maintenance websites of completed projects&lt;br /&gt;
| Carlo&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
|Swarmanoid wiki-page&lt;br /&gt;
| Vito&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| ACO website maintenance&lt;br /&gt;
| Leonardo, Leslie&lt;br /&gt;
| TS &lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| IRIDIA mailing lists&lt;br /&gt;
| Leslie, Leslie&lt;br /&gt;
| TS&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| ACO mailing list&lt;br /&gt;
| Leslie, Leonardo&lt;br /&gt;
| TS &lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Robotics mailing list&lt;br /&gt;
| Lorenzo&lt;br /&gt;
| MB &lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Wiki support  &lt;br /&gt;
| Gianpiero, Sabrina&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=Organization of conferences and events=&lt;br /&gt;
{| border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
!Task&lt;br /&gt;
!Responsible&lt;br /&gt;
!Supervisor&lt;br /&gt;
!Comment&lt;br /&gt;
|-&lt;br /&gt;
| ANTS 2012&lt;br /&gt;
| Andreagiovanni&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=Support to new members and visitors=&lt;br /&gt;
{| border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
!Task&lt;br /&gt;
!Responsible&lt;br /&gt;
!Supervisor&lt;br /&gt;
!Comment&lt;br /&gt;
|-&lt;br /&gt;
| Assistance to visitors and new members&lt;br /&gt;
| Franco&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Assistance to applicants &lt;br /&gt;
| Gabriele&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=Seminars and meetings=&lt;br /&gt;
{| border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
!Task&lt;br /&gt;
!Responsible&lt;br /&gt;
!Supervisor&lt;br /&gt;
!Comment&lt;br /&gt;
|-&lt;br /&gt;
| [[IRIDIA Seminars | IRIDIA Seminars ]]&lt;br /&gt;
| Leslie, Dhananjay&lt;br /&gt;
| MB&lt;br /&gt;
| Write to seminars-owner@iridia.ulb.ac.be&lt;br /&gt;
|-&lt;br /&gt;
| [[IRIDIA Seminars | Seminar Room Booking ]]   &lt;br /&gt;
| Leslie, Dhananjay&lt;br /&gt;
| TS&lt;br /&gt;
| Write to seminars-owner@iridia.ulb.ac.be&lt;br /&gt;
|-&lt;br /&gt;
| Seminars (Technicals)&lt;br /&gt;
| Sabrina&lt;br /&gt;
| TS&lt;br /&gt;
| Set up seminar room&lt;br /&gt;
|-&lt;br /&gt;
| Seminars (Punctuality)&lt;br /&gt;
| Manuel&lt;br /&gt;
| TS&lt;br /&gt;
| Make sure seminars start on time&lt;br /&gt;
|-&lt;br /&gt;
| Admin meeting&lt;br /&gt;
| TBD&lt;br /&gt;
| TBD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Robotics meeting&lt;br /&gt;
| Anthony&lt;br /&gt;
| MD &lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| [[Optimization Group Meetings | Optimization meetings ]]&lt;br /&gt;
| Manuel&lt;br /&gt;
| TS &lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=Library, technical reports, and supplementary pages=&lt;br /&gt;
{| border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
!Task&lt;br /&gt;
!Responsible&lt;br /&gt;
!Supervisor&lt;br /&gt;
!Comment&lt;br /&gt;
|-&lt;br /&gt;
| [[IRIDIA_Technical_reports|IRIDIA Technical Reports]]&lt;br /&gt;
| Gabriele, Leonardo&lt;br /&gt;
| MB&lt;br /&gt;
| Write to techrep@iridia.ulb.ac.be&lt;br /&gt;
|-&lt;br /&gt;
| Techrep covers (for non-latex users)&lt;br /&gt;
| Sabrina&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| [[Iridia_Supplementary_Information_Instructions_page|Supplementary pages]]&lt;br /&gt;
| Lorenzo&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=Robotics: hardware and software=&lt;br /&gt;
{| border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
!Task&lt;br /&gt;
!Responsible&lt;br /&gt;
!Supervisors&lt;br /&gt;
!Comment&lt;br /&gt;
|-&lt;br /&gt;
| Swarmanoid simulator&lt;br /&gt;
| Carlo, Lorenzo&lt;br /&gt;
| MB &lt;br /&gt;
| N/A&lt;br /&gt;
|- &lt;br /&gt;
| E-puck hardware / Argos&lt;br /&gt;
| Gianpiero, Manuele&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Foot-bot hardware&lt;br /&gt;
| Nithin&lt;br /&gt;
| MB &lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Eye-bot and Hand-bot hardware&lt;br /&gt;
| Nithin&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Robotics Lab&lt;br /&gt;
| Nithin&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| [[Tracking System]]&lt;br /&gt;
| Gianpiero, Andreagiovanni&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|- &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=Didactics=&lt;br /&gt;
{| border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
!Task&lt;br /&gt;
!Responsible&lt;br /&gt;
!Supervisors&lt;br /&gt;
!Comment&lt;br /&gt;
|-&lt;br /&gt;
| Supervision of Master students&lt;br /&gt;
| As needed&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Supervision TRAN-H-201&lt;br /&gt;
| Roman, Gaetan(Jun 2012)&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Admin PROJ-H-402&lt;br /&gt;
| Roman&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| INFO-H-414: ACO&lt;br /&gt;
| Sabrina&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| INFO-H-414: PSO&lt;br /&gt;
| TBD&lt;br /&gt;
| TBD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| INFO-H-414: Swarm Robotics&lt;br /&gt;
| Carlo, Manuele&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| iThenticate - SI&lt;br /&gt;
| Gabriele&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Dorigo's Web pages&lt;br /&gt;
| Andreagiovanni&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6799</id>
		<title>Optimization Group Meetings</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6799"/>
		<updated>2014-04-10T15:34:28Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: /* History of Breakfast Meetings */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;You can subscribe to an [http://en.wikipedia.org/wiki/ICalendar iCalendar] of these meetings at http://iridia.ulb.ac.be/Calendars/publish.php/_NUC_Optimization.ics&lt;br /&gt;
&lt;br /&gt;
==Breakfast Meetings==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
Breakfast meetings are informal meetings where there is a general discussion or someone presents their work. And additional goal is to have breakfast together.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, and a short summary of what you are going to talk about.&lt;br /&gt;
# Add a new entry to the table below.&lt;br /&gt;
# Bring breakfast.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Breakfast Meetings ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;200&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Summary&lt;br /&gt;
|-&lt;br /&gt;
|2014-04-10&lt;br /&gt;
|G. Sena DAÅž&lt;br /&gt;
| Developing a Solution Algorithm for the Multi-objective Gate Assignment Problems&lt;br /&gt;
|-&lt;br /&gt;
|2013-09-12&lt;br /&gt;
|Leslie Perez&lt;br /&gt;
| Tuning and irace&lt;br /&gt;
|-&lt;br /&gt;
|2011-03-10&lt;br /&gt;
|Stefanie Kritzinger&lt;br /&gt;
| A Unified Framework for Routing Problems with Fixed Fleet Size&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-21&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
| Off-line vs. On-line Tuning: A Study on MAX-MIN Ant System for the TSP&lt;br /&gt;
|-&lt;br /&gt;
|2010-10-19&lt;br /&gt;
|Stefano Benedettini&lt;br /&gt;
| Experiments on Boolean Network Design by Local Search Algorithms.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-20&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
| The social learning strategies tournament, organized as part of the [http://www.intercult.su.se/cultaptation/ cultaptation project], and its results were described. No ideas about algorithm portfolios were discussed.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-??&lt;br /&gt;
|Renaud Lenne&lt;br /&gt;
| ???&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-04-29&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|The maximum clique problem, state of the art and ACO [http://dx.doi.org/10.1016/j.cor.2009.02.013] [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.80.2036&amp;amp;rep=rep1&amp;amp;type=pdf] [http://www710.univ-lyon1.fr/~csolnon/publications/rr-mai04.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-18&lt;br /&gt;
|Sabrina Oliveira&lt;br /&gt;
|Achieved results from the application of the Population Based Ant Colony Optimisation algorithm to TSP.&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-11&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|An overview of Container Loading Problems. &lt;br /&gt;
|-&lt;br /&gt;
| 2010-01-21&lt;br /&gt;
|Yuan, Zhi (Eric)&lt;br /&gt;
| Rice cooker vs. the idea of tuning. &lt;br /&gt;
|-&lt;br /&gt;
|2010-01-07&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|General discussion about the optimization group. &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Literature Sessions==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
The goal of the Literature Sessions is to examine and discuss&lt;br /&gt;
particularly interesting papers from the research literature. For each&lt;br /&gt;
session, one paper will be selected, there will be a short&lt;br /&gt;
presentation (10-15 minutes) about the contents, and a discussion will&lt;br /&gt;
ensue. Sessions will last around 40-45 minutes. Attendants should read&lt;br /&gt;
the paper before the session in order to have a productive discussion. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, a reference to the paper and the URL where it can be obtained. Also, attach the paper in PDF.&lt;br /&gt;
# Add a new entry to the table below. Use YYY-MM-DD (year-month-day) format for the date. Please add a complete bibliographic reference (you may find it in the homepages of the authors) and a hyperlink to a PDF (links to http://dx.doi.org are preferred).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Literature Sessions ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;180&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Paper discussed&lt;br /&gt;
|-&lt;br /&gt;
|2014-02-20&lt;br /&gt;
| Thomas Stutzle&lt;br /&gt;
|A unified solution framework for multi-attribute vehicle routing problems.&lt;br /&gt;
Thibaut Vidal, Teodor Gabriel Crainic, Michel Gendreau, and Christian Prins.&lt;br /&gt;
http://dx.doi.org/10.1016/j.ejor.2013.09.045 &lt;br /&gt;
|-&lt;br /&gt;
|2013-10-03&lt;br /&gt;
|Leonardo Bezerra&lt;br /&gt;
|Robust Benchmark Set Selection for Boolean Constraint Solvers. Holger Hoos, Benjamin Kaufmann, Torsten Schaub and Marius Schneider - Proceedings of the 7th International Conference on Learning and Intelligent Optimization (LION 7), to appear, 2013. http://www.cs.ubc.ca/~hoos/Publ/HooEtAl13-preprint.pdf&lt;br /&gt;
&lt;br /&gt;
Quantifying Homogeneity of Instance Sets for Algorithm Configuration. Marius Schneider and Holger H. Hoos - Proceedings of the 6th International Conference on Learning and Intelligent Optimization (LION 6), pp. 190-204, 2012. http://www.cs.ubc.ca/~hoos/Publ/SchHoo12.pdf &lt;br /&gt;
|-&lt;br /&gt;
|2013-09-12&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|Automated Parameter Tuning Framework for Heterogeneous and Large Instances: Case study in Quadratic Assignment Problem Lindawati, Zhi Yuan, Hoong Chuin Lau &amp;amp; Feida Zhu. http://lion.disi.unitn.it/intelligent-optimization//LION7/Lindawati-Yuan-Lau-Zhu_Automated%20Parameter%20Tuning.pdf&lt;br /&gt;
|-&lt;br /&gt;
|2013-04-11&lt;br /&gt;
|Leslie Perez&lt;br /&gt;
| C. AnsÃ³tegui, M. Sellmann, and K. Tierney, â€œA Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms,â€ in Principles and Practice of Constraint Programming - CP 2009, I. P. Gent, Ed. Springer Berlin Heidelberg, 2009, pp. 142â€“157. http://itu.dk/people/kevt/papers/gga-cp2009.pdf &lt;br /&gt;
|-&lt;br /&gt;
|2012-10-18&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
| Yuri Malitsky, Meinolf Sellmann: Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. CPAIOR 2012: 244-259 &lt;br /&gt;
http://dx.doi.org/10.1007/978-3-642-29828-8_16&lt;br /&gt;
|-&lt;br /&gt;
|2012-10-12&lt;br /&gt;
| Tianjun Liao&lt;br /&gt;
|Bernd Bischl, Olaf Mersmann, Heike Trautmann, and Mike PreuÃŸ. 2012. Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference (GECCO 2012), Terence Soule (Ed.). ACM, New York, NY, USA, 313-320. DOI:[http://doi.acm.org/10.1145/2330163.2330209 10.1145/2330163.2330209]&lt;br /&gt;
&lt;br /&gt;
Olaf Mersmann, Bernd Bischl, Heike Trautmann, Mike Preuss, Claus Weihs, and GÃ¼nter Rudolph. 2011. Exploratory landscape analysis. In&lt;br /&gt;
Proceedings of the 13th annual conference on Genetic and evolutionary computation (GECCO 2011), Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 829-836. DOI:[http://doi.acm.org/10.1145/2001576.2001690 10.1145/2001576.2001690]&lt;br /&gt;
|-&lt;br /&gt;
|2012-04-19&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|E.K. Burke, M.R. Hyde, and G. Kendall. Grammatical Evolution of Local Search Heuristics. IEEE Transactions on Evolutionary Computation, 99, 2011. doi: 10.1109/TEVC.2011.2160401 [http://www.cs.nott.ac.uk/~mvh/papers/mvh-draft-ieeetec2011.pdf PDF] &lt;br /&gt;
|-&lt;br /&gt;
|2012-04-03&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|On the automatic discovery of variants of the NEH procedure for flow   shop scheduling using genetic programming. J A VÃ¡zquez-RodrÃ­guez and G Ochoa.Journal of the Operational Research Society (2011) 62, 381â€“396.   doi:[http://dx.doi.org/10.1057/jors.2010.132  10.1057/jors.2010.132]&lt;br /&gt;
|-&lt;br /&gt;
|2011-12-08&lt;br /&gt;
|Zhi Yuan&lt;br /&gt;
|Frank Hutter, Holger Hoos, and Kevin Leyton-Brown. Sequential Model-Based Optimization for General Algorithm Configuration. In Proceedings of Learning and Intelligent Optimization (LION 5), 2011. PDF: [http://www.cs.ubc.ca/~hutter/papers/11-LION5-SMAC.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2011-11-24&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|Ender Ã–zcan and Andrew J. Parkes. 2011. Policy matrix evolution for  generation of heuristics. In Proceedings of the 13th annual  conference on Genetic and evolutionary computation (GECCO 2011),  Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 2011-2018. DOI: [http://dx.doi.org/10.1145/2001576.2001846 10.1145/2001576.2001846]&lt;br /&gt;
|-&lt;br /&gt;
|2011-02-04&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
|HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms. By Christopher Nell, Chris Fawcett, Holger H. Hoos, and Kevin Leyton-Brown. [http://hal.cs.ubc.ca/pubs/NelEtAl11.pdf PDF]&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-17&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
|A. LaTorre, S. Muelas, and J.-M. PeÃ±a. A MOS-based dynamic memetic  differential evolution algorithm for continuous optimization: a  scalability test. Soft Computing. Special issue on Scalability of Evolutionary Algorithms and other Metaheuristics for Large Scale  Continuous Optimization Problems. DOI [http://dx.doi.org/10.1007/s00500-010-0646-3 10.1007/s00500-010-0646-3]&lt;br /&gt;
|-&lt;br /&gt;
|2010-11-10&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|A Rigorous Analysis of the Harmony Search Algorithm--How the Research Community can be misled by a &amp;quot;novel&amp;quot; Methodology. Dennis Weyland. International Journal of Applied Metaheuristic Computing, volume 1-2, April-June 2010, pages 50-60.  DOI: [http://dx.doi.org/10.4018/jamc.2010040104 10.4018/jamc.2010040104]&lt;br /&gt;
&lt;br /&gt;
Survival of the Fittest Algorithm or the Novelest Algorithm?: The Existence Reason of the Harmony Search Algorithm. Zong Woo Geem.&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-09-23&lt;br /&gt;
|Gianpiero Francesca&lt;br /&gt;
|Wenyin Gong, Ãlvaro Fialho and Zhihua Cai. Adaptive Strategy Selection in Differential Evolution. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 409-416. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/68/PDF/AOS-DE.pdf]&lt;br /&gt;
&lt;br /&gt;
Ãlvaro Fialho, Marc Schoenauer and Michele Sebag. Toward Comparison-based Adaptive Operator Selection. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 767-774. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/64/PDF/banditGECCO10.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-06-03&lt;br /&gt;
|Tianjun Liao &lt;br /&gt;
|Population-Based Algorithm Portfolios for Numerical Optimization. Peng, F. Tang, K.Chen, G.Yao, X. IEEE Transactions on Evolutionary Computation. DOI: [http://dx.doi.org/10.1109/TEVC.2010.2040183 10.1109/TEVC.2010.2040183] &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-07&lt;br /&gt;
|Zhi (Eric) Yuan&lt;br /&gt;
|Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. L. Xu, H.H. Hoos, K. Leyton-Brown. To appear at the Conference of the Association for the Advancement of Artificial Intelligence (AAAI-10), 2010. [http://ws.cs.ubc.ca/~kevinlb/pub.php?u=2010-AAAI-Hydra.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-04&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|A. Schaerf and L. Di Gaspero. [[:Image:ElPaCo_presentation.pdf|Slides of the tutorial  &amp;quot;An Overview of Local Search Software Tools&amp;quot;]] given at &amp;quot;Learning and Intelligent OptimizatioN (LION 2007)&amp;quot;, December 8-12, 2007, Trento, Italy.&lt;br /&gt;
&lt;br /&gt;
L. Di Gaspero and A. Schaerf. EASY LOCAL++: An object-oriented framework for ï¬‚exible design of local search algorithms. Software â€” Practice &amp;amp; Experience, 33(8):733â€“765, July 2003. [http://www.diegm.uniud.it/satt/papers/DiSc03.pdf]&lt;br /&gt;
&lt;br /&gt;
S. Cahon, N. Melab and T. El Ghazali. ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. Journal of Heuristics, 10(3):357-380, November 2004. [http://dx.doi.org/10.1023/B:HEUR.0000026900.92269.ec]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-19&lt;br /&gt;
|Sabrina M. de Oliveira&lt;br /&gt;
|A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Session on Real Parameter Optimization. S. Garcia, D. Molina, M. Lozano, F. Herrera - Journal of Heuristics, Volume 15, pp. 617-644, 2009. [http://sci2s.ugr.es/programacion/workshop/GarciaMolinaLozanoHerrera-JH2008.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-04&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|Analyzing Bandit-based Adaptive Operator Selection Mechanisms. Ãlvaro Fialho, Luis Da Costa, Marc Schoenauer and MichÃ©le Sebag. &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-01-14&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|SATzilla: Portfolio-based Algorithm Selection for SAT. L. Xu, F. Hutter, H. H. Hoos, K. Leyton-Brown - Journal of Artificial Intelligence Research, Volume 32, pp. 565-606, 2008. [http://www.jair.org/media/2490/live-2490-3923-jair.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2009-12-11&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|SATenstein: Automatically Building Local Search SAT Solvers From Components. Ashiqur R. KhudaBukhsh, Lin Xu, Holger H. Hoos and Kevin Leyton-Brown - Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 517-524, 2009. [http://www.cs.ubc.ca/labs/beta/Projects/SATenstein/SATenstein_ijcai.pdf]&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Other Previous Meetings==&lt;br /&gt;
&lt;br /&gt;
See [[Previous Optimization meetings | Minutes and agendas from previous meetings]].&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6752</id>
		<title>Optimization Group Meetings</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6752"/>
		<updated>2014-02-20T18:47:26Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: /* History of Literature Sessions */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;You can subscribe to an [http://en.wikipedia.org/wiki/ICalendar iCalendar] of these meetings at http://iridia.ulb.ac.be/Calendars/publish.php/_NUC_Optimization.ics&lt;br /&gt;
&lt;br /&gt;
==Breakfast Meetings==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
Breakfast meetings are informal meetings where there is a general discussion or someone presents their work. And additional goal is to have breakfast together.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, and a short summary of what you are going to talk about.&lt;br /&gt;
# Add a new entry to the table below.&lt;br /&gt;
# Bring breakfast.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Breakfast Meetings ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;200&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Summary&lt;br /&gt;
|-&lt;br /&gt;
|2013-09-12&lt;br /&gt;
|Leslie Perez&lt;br /&gt;
| Tuning and irace&lt;br /&gt;
|-&lt;br /&gt;
|2011-03-10&lt;br /&gt;
|Stefanie Kritzinger&lt;br /&gt;
| A Unified Framework for Routing Problems with Fixed Fleet Size&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-21&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
| Off-line vs. On-line Tuning: A Study on MAX-MIN Ant System for the TSP&lt;br /&gt;
|-&lt;br /&gt;
|2010-10-19&lt;br /&gt;
|Stefano Benedettini&lt;br /&gt;
| Experiments on Boolean Network Design by Local Search Algorithms.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-20&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
| The social learning strategies tournament, organized as part of the [http://www.intercult.su.se/cultaptation/ cultaptation project], and its results were described. No ideas about algorithm portfolios were discussed.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-??&lt;br /&gt;
|Renaud Lenne&lt;br /&gt;
| ???&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-04-29&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|The maximum clique problem, state of the art and ACO [http://dx.doi.org/10.1016/j.cor.2009.02.013] [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.80.2036&amp;amp;rep=rep1&amp;amp;type=pdf] [http://www710.univ-lyon1.fr/~csolnon/publications/rr-mai04.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-18&lt;br /&gt;
|Sabrina Oliveira&lt;br /&gt;
|Achieved results from the application of the Population Based Ant Colony Optimisation algorithm to TSP.&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-11&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|An overview of Container Loading Problems. &lt;br /&gt;
|-&lt;br /&gt;
| 2010-01-21&lt;br /&gt;
|Yuan, Zhi (Eric)&lt;br /&gt;
| Rice cooker vs. the idea of tuning. &lt;br /&gt;
|-&lt;br /&gt;
|2010-01-07&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|General discussion about the optimization group. &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Literature Sessions==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
The goal of the Literature Sessions is to examine and discuss&lt;br /&gt;
particularly interesting papers from the research literature. For each&lt;br /&gt;
session, one paper will be selected, there will be a short&lt;br /&gt;
presentation (10-15 minutes) about the contents, and a discussion will&lt;br /&gt;
ensue. Sessions will last around 40-45 minutes. Attendants should read&lt;br /&gt;
the paper before the session in order to have a productive discussion. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, a reference to the paper and the URL where it can be obtained. Also, attach the paper in PDF.&lt;br /&gt;
# Add a new entry to the table below. Use YYY-MM-DD (year-month-day) format for the date. Please add a complete bibliographic reference (you may find it in the homepages of the authors) and a hyperlink to a PDF (links to http://dx.doi.org are preferred).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Literature Sessions ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;180&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Paper discussed&lt;br /&gt;
|-&lt;br /&gt;
|2014-02-20&lt;br /&gt;
| Thomas Stutzle&lt;br /&gt;
|A unified solution framework for multi-attribute vehicle routing problems.&lt;br /&gt;
Thibaut Vidal, Teodor Gabriel Crainic, Michel Gendreau, and Christian Prins.&lt;br /&gt;
http://dx.doi.org/10.1016/j.ejor.2013.09.045 &lt;br /&gt;
|-&lt;br /&gt;
|2013-10-03&lt;br /&gt;
|Leonardo Bezerra&lt;br /&gt;
|Robust Benchmark Set Selection for Boolean Constraint Solvers. Holger Hoos, Benjamin Kaufmann, Torsten Schaub and Marius Schneider - Proceedings of the 7th International Conference on Learning and Intelligent Optimization (LION 7), to appear, 2013. http://www.cs.ubc.ca/~hoos/Publ/HooEtAl13-preprint.pdf&lt;br /&gt;
&lt;br /&gt;
Quantifying Homogeneity of Instance Sets for Algorithm Configuration. Marius Schneider and Holger H. Hoos - Proceedings of the 6th International Conference on Learning and Intelligent Optimization (LION 6), pp. 190-204, 2012. http://www.cs.ubc.ca/~hoos/Publ/SchHoo12.pdf &lt;br /&gt;
|-&lt;br /&gt;
|2013-09-12&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|Automated Parameter Tuning Framework for Heterogeneous and Large Instances: Case study in Quadratic Assignment Problem Lindawati, Zhi Yuan, Hoong Chuin Lau &amp;amp; Feida Zhu. http://lion.disi.unitn.it/intelligent-optimization//LION7/Lindawati-Yuan-Lau-Zhu_Automated%20Parameter%20Tuning.pdf&lt;br /&gt;
|-&lt;br /&gt;
|2013-04-11&lt;br /&gt;
|Leslie Perez&lt;br /&gt;
| C. AnsÃ³tegui, M. Sellmann, and K. Tierney, â€œA Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms,â€ in Principles and Practice of Constraint Programming - CP 2009, I. P. Gent, Ed. Springer Berlin Heidelberg, 2009, pp. 142â€“157. http://itu.dk/people/kevt/papers/gga-cp2009.pdf &lt;br /&gt;
|-&lt;br /&gt;
|2012-10-18&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
| Yuri Malitsky, Meinolf Sellmann: Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. CPAIOR 2012: 244-259 &lt;br /&gt;
http://dx.doi.org/10.1007/978-3-642-29828-8_16&lt;br /&gt;
|-&lt;br /&gt;
|2012-10-12&lt;br /&gt;
| Tianjun Liao&lt;br /&gt;
|Bernd Bischl, Olaf Mersmann, Heike Trautmann, and Mike PreuÃŸ. 2012. Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference (GECCO 2012), Terence Soule (Ed.). ACM, New York, NY, USA, 313-320. DOI:[http://doi.acm.org/10.1145/2330163.2330209 10.1145/2330163.2330209]&lt;br /&gt;
&lt;br /&gt;
Olaf Mersmann, Bernd Bischl, Heike Trautmann, Mike Preuss, Claus Weihs, and GÃ¼nter Rudolph. 2011. Exploratory landscape analysis. In&lt;br /&gt;
Proceedings of the 13th annual conference on Genetic and evolutionary computation (GECCO 2011), Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 829-836. DOI:[http://doi.acm.org/10.1145/2001576.2001690 10.1145/2001576.2001690]&lt;br /&gt;
|-&lt;br /&gt;
|2012-04-19&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|E.K. Burke, M.R. Hyde, and G. Kendall. Grammatical Evolution of Local Search Heuristics. IEEE Transactions on Evolutionary Computation, 99, 2011. doi: 10.1109/TEVC.2011.2160401 [http://www.cs.nott.ac.uk/~mvh/papers/mvh-draft-ieeetec2011.pdf PDF] &lt;br /&gt;
|-&lt;br /&gt;
|2012-04-03&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|On the automatic discovery of variants of the NEH procedure for flow   shop scheduling using genetic programming. J A VÃ¡zquez-RodrÃ­guez and G Ochoa.Journal of the Operational Research Society (2011) 62, 381â€“396.   doi:[http://dx.doi.org/10.1057/jors.2010.132  10.1057/jors.2010.132]&lt;br /&gt;
|-&lt;br /&gt;
|2011-12-08&lt;br /&gt;
|Zhi Yuan&lt;br /&gt;
|Frank Hutter, Holger Hoos, and Kevin Leyton-Brown. Sequential Model-Based Optimization for General Algorithm Configuration. In Proceedings of Learning and Intelligent Optimization (LION 5), 2011. PDF: [http://www.cs.ubc.ca/~hutter/papers/11-LION5-SMAC.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2011-11-24&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|Ender Ã–zcan and Andrew J. Parkes. 2011. Policy matrix evolution for  generation of heuristics. In Proceedings of the 13th annual  conference on Genetic and evolutionary computation (GECCO 2011),  Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 2011-2018. DOI: [http://dx.doi.org/10.1145/2001576.2001846 10.1145/2001576.2001846]&lt;br /&gt;
|-&lt;br /&gt;
|2011-02-04&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
|HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms. By Christopher Nell, Chris Fawcett, Holger H. Hoos, and Kevin Leyton-Brown. [http://hal.cs.ubc.ca/pubs/NelEtAl11.pdf PDF]&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-17&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
|A. LaTorre, S. Muelas, and J.-M. PeÃ±a. A MOS-based dynamic memetic  differential evolution algorithm for continuous optimization: a  scalability test. Soft Computing. Special issue on Scalability of Evolutionary Algorithms and other Metaheuristics for Large Scale  Continuous Optimization Problems. DOI [http://dx.doi.org/10.1007/s00500-010-0646-3 10.1007/s00500-010-0646-3]&lt;br /&gt;
|-&lt;br /&gt;
|2010-11-10&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|A Rigorous Analysis of the Harmony Search Algorithm--How the Research Community can be misled by a &amp;quot;novel&amp;quot; Methodology. Dennis Weyland. International Journal of Applied Metaheuristic Computing, volume 1-2, April-June 2010, pages 50-60.  DOI: [http://dx.doi.org/10.4018/jamc.2010040104 10.4018/jamc.2010040104]&lt;br /&gt;
&lt;br /&gt;
Survival of the Fittest Algorithm or the Novelest Algorithm?: The Existence Reason of the Harmony Search Algorithm. Zong Woo Geem.&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-09-23&lt;br /&gt;
|Gianpiero Francesca&lt;br /&gt;
|Wenyin Gong, Ãlvaro Fialho and Zhihua Cai. Adaptive Strategy Selection in Differential Evolution. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 409-416. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/68/PDF/AOS-DE.pdf]&lt;br /&gt;
&lt;br /&gt;
Ãlvaro Fialho, Marc Schoenauer and Michele Sebag. Toward Comparison-based Adaptive Operator Selection. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 767-774. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/64/PDF/banditGECCO10.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-06-03&lt;br /&gt;
|Tianjun Liao &lt;br /&gt;
|Population-Based Algorithm Portfolios for Numerical Optimization. Peng, F. Tang, K.Chen, G.Yao, X. IEEE Transactions on Evolutionary Computation. DOI: [http://dx.doi.org/10.1109/TEVC.2010.2040183 10.1109/TEVC.2010.2040183] &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-07&lt;br /&gt;
|Zhi (Eric) Yuan&lt;br /&gt;
|Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. L. Xu, H.H. Hoos, K. Leyton-Brown. To appear at the Conference of the Association for the Advancement of Artificial Intelligence (AAAI-10), 2010. [http://ws.cs.ubc.ca/~kevinlb/pub.php?u=2010-AAAI-Hydra.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-04&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|A. Schaerf and L. Di Gaspero. [[:Image:ElPaCo_presentation.pdf|Slides of the tutorial  &amp;quot;An Overview of Local Search Software Tools&amp;quot;]] given at &amp;quot;Learning and Intelligent OptimizatioN (LION 2007)&amp;quot;, December 8-12, 2007, Trento, Italy.&lt;br /&gt;
&lt;br /&gt;
L. Di Gaspero and A. Schaerf. EASY LOCAL++: An object-oriented framework for ï¬‚exible design of local search algorithms. Software â€” Practice &amp;amp; Experience, 33(8):733â€“765, July 2003. [http://www.diegm.uniud.it/satt/papers/DiSc03.pdf]&lt;br /&gt;
&lt;br /&gt;
S. Cahon, N. Melab and T. El Ghazali. ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. Journal of Heuristics, 10(3):357-380, November 2004. [http://dx.doi.org/10.1023/B:HEUR.0000026900.92269.ec]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-19&lt;br /&gt;
|Sabrina M. de Oliveira&lt;br /&gt;
|A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Session on Real Parameter Optimization. S. Garcia, D. Molina, M. Lozano, F. Herrera - Journal of Heuristics, Volume 15, pp. 617-644, 2009. [http://sci2s.ugr.es/programacion/workshop/GarciaMolinaLozanoHerrera-JH2008.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-04&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|Analyzing Bandit-based Adaptive Operator Selection Mechanisms. Ãlvaro Fialho, Luis Da Costa, Marc Schoenauer and MichÃ©le Sebag. &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-01-14&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|SATzilla: Portfolio-based Algorithm Selection for SAT. L. Xu, F. Hutter, H. H. Hoos, K. Leyton-Brown - Journal of Artificial Intelligence Research, Volume 32, pp. 565-606, 2008. [http://www.jair.org/media/2490/live-2490-3923-jair.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2009-12-11&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|SATenstein: Automatically Building Local Search SAT Solvers From Components. Ashiqur R. KhudaBukhsh, Lin Xu, Holger H. Hoos and Kevin Leyton-Brown - Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 517-524, 2009. [http://www.cs.ubc.ca/labs/beta/Projects/SATenstein/SATenstein_ijcai.pdf]&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Other Previous Meetings==&lt;br /&gt;
&lt;br /&gt;
See [[Previous Optimization meetings | Minutes and agendas from previous meetings]].&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6450</id>
		<title>Optimization Group Meetings</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6450"/>
		<updated>2013-10-03T12:41:06Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: /* History of Literature Sessions */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;You can subscribe to an [http://en.wikipedia.org/wiki/ICalendar iCalendar] of these meetings at http://iridia.ulb.ac.be/Calendars/publish.php/_NUC_Optimization.ics&lt;br /&gt;
&lt;br /&gt;
==Breakfast Meetings==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
Breakfast meetings are informal meetings where there is a general discussion or someone presents their work. And additional goal is to have breakfast together.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, and a short summary of what you are going to talk about.&lt;br /&gt;
# Add a new entry to the table below.&lt;br /&gt;
# Bring breakfast.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Breakfast Meetings ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;200&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Summary&lt;br /&gt;
|-&lt;br /&gt;
|2013-09-12&lt;br /&gt;
|Leslie Perez&lt;br /&gt;
| Tuning and irace&lt;br /&gt;
|-&lt;br /&gt;
|2011-03-10&lt;br /&gt;
|Stefanie Kritzinger&lt;br /&gt;
| A Unified Framework for Routing Problems with Fixed Fleet Size&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-21&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
| Off-line vs. On-line Tuning: A Study on MAX-MIN Ant System for the TSP&lt;br /&gt;
|-&lt;br /&gt;
|2010-10-19&lt;br /&gt;
|Stefano Benedettini&lt;br /&gt;
| Experiments on Boolean Network Design by Local Search Algorithms.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-20&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
| The social learning strategies tournament, organized as part of the [http://www.intercult.su.se/cultaptation/ cultaptation project], and its results were described. No ideas about algorithm portfolios were discussed.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-??&lt;br /&gt;
|Renaud Lenne&lt;br /&gt;
| ???&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-04-29&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|The maximum clique problem, state of the art and ACO [http://dx.doi.org/10.1016/j.cor.2009.02.013] [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.80.2036&amp;amp;rep=rep1&amp;amp;type=pdf] [http://www710.univ-lyon1.fr/~csolnon/publications/rr-mai04.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-18&lt;br /&gt;
|Sabrina Oliveira&lt;br /&gt;
|Achieved results from the application of the Population Based Ant Colony Optimisation algorithm to TSP.&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-11&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|An overview of Container Loading Problems. &lt;br /&gt;
|-&lt;br /&gt;
| 2010-01-21&lt;br /&gt;
|Yuan, Zhi (Eric)&lt;br /&gt;
| Rice cooker vs. the idea of tuning. &lt;br /&gt;
|-&lt;br /&gt;
|2010-01-07&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|General discussion about the optimization group. &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Literature Sessions==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
The goal of the Literature Sessions is to examine and discuss&lt;br /&gt;
particularly interesting papers from the research literature. For each&lt;br /&gt;
session, one paper will be selected, there will be a short&lt;br /&gt;
presentation (10-15 minutes) about the contents, and a discussion will&lt;br /&gt;
ensue. Sessions will last around 40-45 minutes. Attendants should read&lt;br /&gt;
the paper before the session in order to have a productive discussion. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, a reference to the paper and the URL where it can be obtained. Also, attach the paper in PDF.&lt;br /&gt;
# Add a new entry to the table below. Use YYY-MM-DD (year-month-day) format for the date. Please add a complete bibliographic reference (you may find it in the homepages of the authors) and a hyperlink to a PDF (links to http://dx.doi.org are preferred).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Literature Sessions ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;180&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Paper discussed&lt;br /&gt;
|-&lt;br /&gt;
|2013-10-03&lt;br /&gt;
|Leonardo Bezerra&lt;br /&gt;
|Robust Benchmark Set Selection for Boolean Constraint Solvers. Holger Hoos, Benjamin Kaufmann, Torsten Schaub and Marius Schneider - Proceedings of the 7th International Conference on Learning and Intelligent Optimization (LION 7), to appear, 2013. http://www.cs.ubc.ca/~hoos/Publ/HooEtAl13-preprint.pdf&lt;br /&gt;
&lt;br /&gt;
Quantifying Homogeneity of Instance Sets for Algorithm Configuration. Marius Schneider and Holger H. Hoos - Proceedings of the 6th International Conference on Learning and Intelligent Optimization (LION 6), pp. 190-204, 2012. http://www.cs.ubc.ca/~hoos/Publ/SchHoo12.pdf &lt;br /&gt;
|-&lt;br /&gt;
|2013-09-12&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|Automated Parameter Tuning Framework for Heterogeneous and Large Instances: Case study in Quadratic Assignment Problem Lindawati, Zhi Yuan, Hoong Chuin Lau &amp;amp; Feida Zhu. http://lion.disi.unitn.it/intelligent-optimization//LION7/Lindawati-Yuan-Lau-Zhu_Automated%20Parameter%20Tuning.pdf&lt;br /&gt;
|-&lt;br /&gt;
|2013-04-11&lt;br /&gt;
|Leslie Perez&lt;br /&gt;
| C. AnsÃ³tegui, M. Sellmann, and K. Tierney, â€œA Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms,â€ in Principles and Practice of Constraint Programming - CP 2009, I. P. Gent, Ed. Springer Berlin Heidelberg, 2009, pp. 142â€“157. http://itu.dk/people/kevt/papers/gga-cp2009.pdf &lt;br /&gt;
|-&lt;br /&gt;
|2012-10-18&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
| Yuri Malitsky, Meinolf Sellmann: Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. CPAIOR 2012: 244-259 &lt;br /&gt;
http://dx.doi.org/10.1007/978-3-642-29828-8_16&lt;br /&gt;
|-&lt;br /&gt;
|2012-10-12&lt;br /&gt;
| Tianjun Liao&lt;br /&gt;
|Bernd Bischl, Olaf Mersmann, Heike Trautmann, and Mike PreuÃŸ. 2012. Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference (GECCO 2012), Terence Soule (Ed.). ACM, New York, NY, USA, 313-320. DOI:[http://doi.acm.org/10.1145/2330163.2330209 10.1145/2330163.2330209]&lt;br /&gt;
&lt;br /&gt;
Olaf Mersmann, Bernd Bischl, Heike Trautmann, Mike Preuss, Claus Weihs, and GÃ¼nter Rudolph. 2011. Exploratory landscape analysis. In&lt;br /&gt;
Proceedings of the 13th annual conference on Genetic and evolutionary computation (GECCO 2011), Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 829-836. DOI:[http://doi.acm.org/10.1145/2001576.2001690 10.1145/2001576.2001690]&lt;br /&gt;
|-&lt;br /&gt;
|2012-04-19&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|E.K. Burke, M.R. Hyde, and G. Kendall. Grammatical Evolution of Local Search Heuristics. IEEE Transactions on Evolutionary Computation, 99, 2011. doi: 10.1109/TEVC.2011.2160401 [http://www.cs.nott.ac.uk/~mvh/papers/mvh-draft-ieeetec2011.pdf PDF] &lt;br /&gt;
|-&lt;br /&gt;
|2012-04-03&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|On the automatic discovery of variants of the NEH procedure for flow   shop scheduling using genetic programming. J A VÃ¡zquez-RodrÃ­guez and G Ochoa.Journal of the Operational Research Society (2011) 62, 381â€“396.   doi:[http://dx.doi.org/10.1057/jors.2010.132  10.1057/jors.2010.132]&lt;br /&gt;
|-&lt;br /&gt;
|2011-12-08&lt;br /&gt;
|Zhi Yuan&lt;br /&gt;
|Frank Hutter, Holger Hoos, and Kevin Leyton-Brown. Sequential Model-Based Optimization for General Algorithm Configuration. In Proceedings of Learning and Intelligent Optimization (LION 5), 2011. PDF: [http://www.cs.ubc.ca/~hutter/papers/11-LION5-SMAC.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2011-11-24&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|Ender Ã–zcan and Andrew J. Parkes. 2011. Policy matrix evolution for  generation of heuristics. In Proceedings of the 13th annual  conference on Genetic and evolutionary computation (GECCO 2011),  Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 2011-2018. DOI: [http://dx.doi.org/10.1145/2001576.2001846 10.1145/2001576.2001846]&lt;br /&gt;
|-&lt;br /&gt;
|2011-02-04&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
|HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms. By Christopher Nell, Chris Fawcett, Holger H. Hoos, and Kevin Leyton-Brown. [http://hal.cs.ubc.ca/pubs/NelEtAl11.pdf PDF]&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-17&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
|A. LaTorre, S. Muelas, and J.-M. PeÃ±a. A MOS-based dynamic memetic  differential evolution algorithm for continuous optimization: a  scalability test. Soft Computing. Special issue on Scalability of Evolutionary Algorithms and other Metaheuristics for Large Scale  Continuous Optimization Problems. DOI [http://dx.doi.org/10.1007/s00500-010-0646-3 10.1007/s00500-010-0646-3]&lt;br /&gt;
|-&lt;br /&gt;
|2010-11-10&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|A Rigorous Analysis of the Harmony Search Algorithm--How the Research Community can be misled by a &amp;quot;novel&amp;quot; Methodology. Dennis Weyland. International Journal of Applied Metaheuristic Computing, volume 1-2, April-June 2010, pages 50-60.  DOI: [http://dx.doi.org/10.4018/jamc.2010040104 10.4018/jamc.2010040104]&lt;br /&gt;
&lt;br /&gt;
Survival of the Fittest Algorithm or the Novelest Algorithm?: The Existence Reason of the Harmony Search Algorithm. Zong Woo Geem.&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-09-23&lt;br /&gt;
|Gianpiero Francesca&lt;br /&gt;
|Wenyin Gong, Ãlvaro Fialho and Zhihua Cai. Adaptive Strategy Selection in Differential Evolution. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 409-416. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/68/PDF/AOS-DE.pdf]&lt;br /&gt;
&lt;br /&gt;
Ãlvaro Fialho, Marc Schoenauer and Michele Sebag. Toward Comparison-based Adaptive Operator Selection. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 767-774. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/64/PDF/banditGECCO10.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-06-03&lt;br /&gt;
|Tianjun Liao &lt;br /&gt;
|Population-Based Algorithm Portfolios for Numerical Optimization. Peng, F. Tang, K.Chen, G.Yao, X. IEEE Transactions on Evolutionary Computation. DOI: [http://dx.doi.org/10.1109/TEVC.2010.2040183 10.1109/TEVC.2010.2040183] &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-07&lt;br /&gt;
|Zhi (Eric) Yuan&lt;br /&gt;
|Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. L. Xu, H.H. Hoos, K. Leyton-Brown. To appear at the Conference of the Association for the Advancement of Artificial Intelligence (AAAI-10), 2010. [http://ws.cs.ubc.ca/~kevinlb/pub.php?u=2010-AAAI-Hydra.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-04&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|A. Schaerf and L. Di Gaspero. [[:Image:ElPaCo_presentation.pdf|Slides of the tutorial  &amp;quot;An Overview of Local Search Software Tools&amp;quot;]] given at &amp;quot;Learning and Intelligent OptimizatioN (LION 2007)&amp;quot;, December 8-12, 2007, Trento, Italy.&lt;br /&gt;
&lt;br /&gt;
L. Di Gaspero and A. Schaerf. EASY LOCAL++: An object-oriented framework for ï¬‚exible design of local search algorithms. Software â€” Practice &amp;amp; Experience, 33(8):733â€“765, July 2003. [http://www.diegm.uniud.it/satt/papers/DiSc03.pdf]&lt;br /&gt;
&lt;br /&gt;
S. Cahon, N. Melab and T. El Ghazali. ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. Journal of Heuristics, 10(3):357-380, November 2004. [http://dx.doi.org/10.1023/B:HEUR.0000026900.92269.ec]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-19&lt;br /&gt;
|Sabrina M. de Oliveira&lt;br /&gt;
|A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Session on Real Parameter Optimization. S. Garcia, D. Molina, M. Lozano, F. Herrera - Journal of Heuristics, Volume 15, pp. 617-644, 2009. [http://sci2s.ugr.es/programacion/workshop/GarciaMolinaLozanoHerrera-JH2008.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-04&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|Analyzing Bandit-based Adaptive Operator Selection Mechanisms. Ãlvaro Fialho, Luis Da Costa, Marc Schoenauer and MichÃ©le Sebag. &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-01-14&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|SATzilla: Portfolio-based Algorithm Selection for SAT. L. Xu, F. Hutter, H. H. Hoos, K. Leyton-Brown - Journal of Artificial Intelligence Research, Volume 32, pp. 565-606, 2008. [http://www.jair.org/media/2490/live-2490-3923-jair.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2009-12-11&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|SATenstein: Automatically Building Local Search SAT Solvers From Components. Ashiqur R. KhudaBukhsh, Lin Xu, Holger H. Hoos and Kevin Leyton-Brown - Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 517-524, 2009. [http://www.cs.ubc.ca/labs/beta/Projects/SATenstein/SATenstein_ijcai.pdf]&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Other Previous Meetings==&lt;br /&gt;
&lt;br /&gt;
See [[Previous Optimization meetings | Minutes and agendas from previous meetings]].&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6442</id>
		<title>Optimization Group Meetings</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6442"/>
		<updated>2013-09-23T15:15:19Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;You can subscribe to an [http://en.wikipedia.org/wiki/ICalendar iCalendar] of these meetings at http://iridia.ulb.ac.be/Calendars/publish.php/_NUC_Optimization.ics&lt;br /&gt;
&lt;br /&gt;
==Breakfast Meetings==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
Breakfast meetings are informal meetings where there is a general discussion or someone presents their work. And additional goal is to have breakfast together.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, and a short summary of what you are going to talk about.&lt;br /&gt;
# Add a new entry to the table below.&lt;br /&gt;
# Bring breakfast.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Breakfast Meetings ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;200&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Summary&lt;br /&gt;
|-&lt;br /&gt;
|2013-09-12&lt;br /&gt;
|Leslie Perez&lt;br /&gt;
| Tuning and irace&lt;br /&gt;
|-&lt;br /&gt;
|2011-03-10&lt;br /&gt;
|Stefanie Kritzinger&lt;br /&gt;
| A Unified Framework for Routing Problems with Fixed Fleet Size&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-21&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
| Off-line vs. On-line Tuning: A Study on MAX-MIN Ant System for the TSP&lt;br /&gt;
|-&lt;br /&gt;
|2010-10-19&lt;br /&gt;
|Stefano Benedettini&lt;br /&gt;
| Experiments on Boolean Network Design by Local Search Algorithms.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-20&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
| The social learning strategies tournament, organized as part of the [http://www.intercult.su.se/cultaptation/ cultaptation project], and its results were described. No ideas about algorithm portfolios were discussed.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-??&lt;br /&gt;
|Renaud Lenne&lt;br /&gt;
| ???&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-04-29&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|The maximum clique problem, state of the art and ACO [http://dx.doi.org/10.1016/j.cor.2009.02.013] [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.80.2036&amp;amp;rep=rep1&amp;amp;type=pdf] [http://www710.univ-lyon1.fr/~csolnon/publications/rr-mai04.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-18&lt;br /&gt;
|Sabrina Oliveira&lt;br /&gt;
|Achieved results from the application of the Population Based Ant Colony Optimisation algorithm to TSP.&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-11&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|An overview of Container Loading Problems. &lt;br /&gt;
|-&lt;br /&gt;
| 2010-01-21&lt;br /&gt;
|Yuan, Zhi (Eric)&lt;br /&gt;
| Rice cooker vs. the idea of tuning. &lt;br /&gt;
|-&lt;br /&gt;
|2010-01-07&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|General discussion about the optimization group. &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Literature Sessions==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
The goal of the Literature Sessions is to examine and discuss&lt;br /&gt;
particularly interesting papers from the research literature. For each&lt;br /&gt;
session, one paper will be selected, there will be a short&lt;br /&gt;
presentation (10-15 minutes) about the contents, and a discussion will&lt;br /&gt;
ensue. Sessions will last around 40-45 minutes. Attendants should read&lt;br /&gt;
the paper before the session in order to have a productive discussion. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, a reference to the paper and the URL where it can be obtained. Also, attach the paper in PDF.&lt;br /&gt;
# Add a new entry to the table below. Use YYY-MM-DD (year-month-day) format for the date. Please add a complete bibliographic reference (you may find it in the homepages of the authors) and a hyperlink to a PDF (links to http://dx.doi.org are preferred).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Literature Sessions ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;180&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Paper discussed&lt;br /&gt;
|-&lt;br /&gt;
|2013-09-12&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|Automated Parameter Tuning Framework for Heterogeneous and Large Instances: Case study in Quadratic Assignment Problem Lindawati, Zhi Yuan, Hoong Chuin Lau &amp;amp; Feida Zhu. http://lion.disi.unitn.it/intelligent-optimization//LION7/Lindawati-Yuan-Lau-Zhu_Automated%20Parameter%20Tuning.pdf&lt;br /&gt;
|-&lt;br /&gt;
|2013-04-11&lt;br /&gt;
|Leslie Perez&lt;br /&gt;
| C. AnsÃ³tegui, M. Sellmann, and K. Tierney, â€œA Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms,â€ in Principles and Practice of Constraint Programming - CP 2009, I. P. Gent, Ed. Springer Berlin Heidelberg, 2009, pp. 142â€“157. http://itu.dk/people/kevt/papers/gga-cp2009.pdf &lt;br /&gt;
|-&lt;br /&gt;
|2012-10-18&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
| Yuri Malitsky, Meinolf Sellmann: Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. CPAIOR 2012: 244-259 &lt;br /&gt;
http://dx.doi.org/10.1007/978-3-642-29828-8_16&lt;br /&gt;
|-&lt;br /&gt;
|2012-10-12&lt;br /&gt;
| Tianjun Liao&lt;br /&gt;
|Bernd Bischl, Olaf Mersmann, Heike Trautmann, and Mike PreuÃŸ. 2012. Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference (GECCO 2012), Terence Soule (Ed.). ACM, New York, NY, USA, 313-320. DOI:[http://doi.acm.org/10.1145/2330163.2330209 10.1145/2330163.2330209]&lt;br /&gt;
&lt;br /&gt;
Olaf Mersmann, Bernd Bischl, Heike Trautmann, Mike Preuss, Claus Weihs, and GÃ¼nter Rudolph. 2011. Exploratory landscape analysis. In&lt;br /&gt;
Proceedings of the 13th annual conference on Genetic and evolutionary computation (GECCO 2011), Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 829-836. DOI:[http://doi.acm.org/10.1145/2001576.2001690 10.1145/2001576.2001690]&lt;br /&gt;
|-&lt;br /&gt;
|2012-04-19&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|E.K. Burke, M.R. Hyde, and G. Kendall. Grammatical Evolution of Local Search Heuristics. IEEE Transactions on Evolutionary Computation, 99, 2011. doi: 10.1109/TEVC.2011.2160401 [http://www.cs.nott.ac.uk/~mvh/papers/mvh-draft-ieeetec2011.pdf PDF] &lt;br /&gt;
|-&lt;br /&gt;
|2012-04-03&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|On the automatic discovery of variants of the NEH procedure for flow   shop scheduling using genetic programming. J A VÃ¡zquez-RodrÃ­guez and G Ochoa.Journal of the Operational Research Society (2011) 62, 381â€“396.   doi:[http://dx.doi.org/10.1057/jors.2010.132  10.1057/jors.2010.132]&lt;br /&gt;
|-&lt;br /&gt;
|2011-12-08&lt;br /&gt;
|Zhi Yuan&lt;br /&gt;
|Frank Hutter, Holger Hoos, and Kevin Leyton-Brown. Sequential Model-Based Optimization for General Algorithm Configuration. In Proceedings of Learning and Intelligent Optimization (LION 5), 2011. PDF: [http://www.cs.ubc.ca/~hutter/papers/11-LION5-SMAC.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2011-11-24&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|Ender Ã–zcan and Andrew J. Parkes. 2011. Policy matrix evolution for  generation of heuristics. In Proceedings of the 13th annual  conference on Genetic and evolutionary computation (GECCO 2011),  Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 2011-2018. DOI: [http://dx.doi.org/10.1145/2001576.2001846 10.1145/2001576.2001846]&lt;br /&gt;
|-&lt;br /&gt;
|2011-02-04&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
|HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms. By Christopher Nell, Chris Fawcett, Holger H. Hoos, and Kevin Leyton-Brown. [http://hal.cs.ubc.ca/pubs/NelEtAl11.pdf PDF]&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-17&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
|A. LaTorre, S. Muelas, and J.-M. PeÃ±a. A MOS-based dynamic memetic  differential evolution algorithm for continuous optimization: a  scalability test. Soft Computing. Special issue on Scalability of Evolutionary Algorithms and other Metaheuristics for Large Scale  Continuous Optimization Problems. DOI [http://dx.doi.org/10.1007/s00500-010-0646-3 10.1007/s00500-010-0646-3]&lt;br /&gt;
|-&lt;br /&gt;
|2010-11-10&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|A Rigorous Analysis of the Harmony Search Algorithm--How the Research Community can be misled by a &amp;quot;novel&amp;quot; Methodology. Dennis Weyland. International Journal of Applied Metaheuristic Computing, volume 1-2, April-June 2010, pages 50-60.  DOI: [http://dx.doi.org/10.4018/jamc.2010040104 10.4018/jamc.2010040104]&lt;br /&gt;
&lt;br /&gt;
Survival of the Fittest Algorithm or the Novelest Algorithm?: The Existence Reason of the Harmony Search Algorithm. Zong Woo Geem.&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-09-23&lt;br /&gt;
|Gianpiero Francesca&lt;br /&gt;
|Wenyin Gong, Ãlvaro Fialho and Zhihua Cai. Adaptive Strategy Selection in Differential Evolution. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 409-416. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/68/PDF/AOS-DE.pdf]&lt;br /&gt;
&lt;br /&gt;
Ãlvaro Fialho, Marc Schoenauer and Michele Sebag. Toward Comparison-based Adaptive Operator Selection. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 767-774. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/64/PDF/banditGECCO10.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-06-03&lt;br /&gt;
|Tianjun Liao &lt;br /&gt;
|Population-Based Algorithm Portfolios for Numerical Optimization. Peng, F. Tang, K.Chen, G.Yao, X. IEEE Transactions on Evolutionary Computation. DOI: [http://dx.doi.org/10.1109/TEVC.2010.2040183 10.1109/TEVC.2010.2040183] &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-07&lt;br /&gt;
|Zhi (Eric) Yuan&lt;br /&gt;
|Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. L. Xu, H.H. Hoos, K. Leyton-Brown. To appear at the Conference of the Association for the Advancement of Artificial Intelligence (AAAI-10), 2010. [http://ws.cs.ubc.ca/~kevinlb/pub.php?u=2010-AAAI-Hydra.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-04&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|A. Schaerf and L. Di Gaspero. [[:Image:ElPaCo_presentation.pdf|Slides of the tutorial  &amp;quot;An Overview of Local Search Software Tools&amp;quot;]] given at &amp;quot;Learning and Intelligent OptimizatioN (LION 2007)&amp;quot;, December 8-12, 2007, Trento, Italy.&lt;br /&gt;
&lt;br /&gt;
L. Di Gaspero and A. Schaerf. EASY LOCAL++: An object-oriented framework for ï¬‚exible design of local search algorithms. Software â€” Practice &amp;amp; Experience, 33(8):733â€“765, July 2003. [http://www.diegm.uniud.it/satt/papers/DiSc03.pdf]&lt;br /&gt;
&lt;br /&gt;
S. Cahon, N. Melab and T. El Ghazali. ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. Journal of Heuristics, 10(3):357-380, November 2004. [http://dx.doi.org/10.1023/B:HEUR.0000026900.92269.ec]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-19&lt;br /&gt;
|Sabrina M. de Oliveira&lt;br /&gt;
|A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Session on Real Parameter Optimization. S. Garcia, D. Molina, M. Lozano, F. Herrera - Journal of Heuristics, Volume 15, pp. 617-644, 2009. [http://sci2s.ugr.es/programacion/workshop/GarciaMolinaLozanoHerrera-JH2008.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-04&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|Analyzing Bandit-based Adaptive Operator Selection Mechanisms. Ãlvaro Fialho, Luis Da Costa, Marc Schoenauer and MichÃ©le Sebag. &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-01-14&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|SATzilla: Portfolio-based Algorithm Selection for SAT. L. Xu, F. Hutter, H. H. Hoos, K. Leyton-Brown - Journal of Artificial Intelligence Research, Volume 32, pp. 565-606, 2008. [http://www.jair.org/media/2490/live-2490-3923-jair.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2009-12-11&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|SATenstein: Automatically Building Local Search SAT Solvers From Components. Ashiqur R. KhudaBukhsh, Lin Xu, Holger H. Hoos and Kevin Leyton-Brown - Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 517-524, 2009. [http://www.cs.ubc.ca/labs/beta/Projects/SATenstein/SATenstein_ijcai.pdf]&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Other Previous Meetings==&lt;br /&gt;
&lt;br /&gt;
See [[Previous Optimization meetings | Minutes and agendas from previous meetings]].&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6396</id>
		<title>Optimization Group Meetings</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6396"/>
		<updated>2013-09-15T11:36:26Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: /* History of Literature Sessions */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;You can subscribe to an [http://en.wikipedia.org/wiki/ICalendar iCalendar] of these meetings at http://iridia.ulb.ac.be/Calendars/publish.php/_NUC_Optimization.ics&lt;br /&gt;
&lt;br /&gt;
==Breakfast Meetings==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
Breakfast meetings are informal meetings where there is a general discussion or someone presents their work. And additional goal is to have breakfast together.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, and a short summary of what you are going to talk about.&lt;br /&gt;
# Add a new entry to the table below.&lt;br /&gt;
# Bring breakfast.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Breakfast Meetings ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;200&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Summary&lt;br /&gt;
|-&lt;br /&gt;
|2011-03-10&lt;br /&gt;
|Stefanie Kritzinger&lt;br /&gt;
| A Unified Framework for Routing Problems with Fixed Fleet Size&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-21&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
| Off-line vs. On-line Tuning: A Study on MAX-MIN Ant System for the TSP&lt;br /&gt;
|-&lt;br /&gt;
|2010-10-19&lt;br /&gt;
|Stefano Benedettini&lt;br /&gt;
| Experiments on Boolean Network Design by Local Search Algorithms.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-20&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
| The social learning strategies tournament, organized as part of the [http://www.intercult.su.se/cultaptation/ cultaptation project], and its results were described. No ideas about algorithm portfolios were discussed.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-??&lt;br /&gt;
|Renaud Lenne&lt;br /&gt;
| ???&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-04-29&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|The maximum clique problem, state of the art and ACO [http://dx.doi.org/10.1016/j.cor.2009.02.013] [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.80.2036&amp;amp;rep=rep1&amp;amp;type=pdf] [http://www710.univ-lyon1.fr/~csolnon/publications/rr-mai04.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-18&lt;br /&gt;
|Sabrina Oliveira&lt;br /&gt;
|Achieved results from the application of the Population Based Ant Colony Optimisation algorithm to TSP.&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-11&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|An overview of Container Loading Problems. &lt;br /&gt;
|-&lt;br /&gt;
| 2010-01-21&lt;br /&gt;
|Yuan, Zhi (Eric)&lt;br /&gt;
| Rice cooker vs. the idea of tuning. &lt;br /&gt;
|-&lt;br /&gt;
|2010-01-07&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|General discussion about the optimization group. &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Literature Sessions==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
The goal of the Literature Sessions is to examine and discuss&lt;br /&gt;
particularly interesting papers from the research literature. For each&lt;br /&gt;
session, one paper will be selected, there will be a short&lt;br /&gt;
presentation (10-15 minutes) about the contents, and a discussion will&lt;br /&gt;
ensue. Sessions will last around 40-45 minutes. Attendants should read&lt;br /&gt;
the paper before the session in order to have a productive discussion. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, a reference to the paper and the URL where it can be obtained. Also, attach the paper in PDF.&lt;br /&gt;
# Add a new entry to the table below. Use YYY-MM-DD (year-month-day) format for the date. Please add a complete bibliographic reference (you may find it in the homepages of the authors) and a hyperlink to a PDF (links to http://dx.doi.org are preferred).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Literature Sessions ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;180&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Paper discussed&lt;br /&gt;
|-&lt;br /&gt;
|2013-09-12&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|Automated Parameter Tuning Framework for Heterogeneous and Large Instances: Case study in Quadratic Assignment Problem Lindawati, Zhi Yuan, Hoong Chuin Lau &amp;amp; Feida Zhu. http://lion.disi.unitn.it/intelligent-optimization//LION7/Lindawati-Yuan-Lau-Zhu_Automated%20Parameter%20Tuning.pdf&lt;br /&gt;
|-&lt;br /&gt;
|2013-04-11&lt;br /&gt;
|Leslie Perez&lt;br /&gt;
| C. AnsÃ³tegui, M. Sellmann, and K. Tierney, â€œA Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms,â€ in Principles and Practice of Constraint Programming - CP 2009, I. P. Gent, Ed. Springer Berlin Heidelberg, 2009, pp. 142â€“157. http://itu.dk/people/kevt/papers/gga-cp2009.pdf &lt;br /&gt;
|-&lt;br /&gt;
|2012-10-18&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
| Yuri Malitsky, Meinolf Sellmann: Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. CPAIOR 2012: 244-259 &lt;br /&gt;
http://dx.doi.org/10.1007/978-3-642-29828-8_16&lt;br /&gt;
|-&lt;br /&gt;
|2012-10-12&lt;br /&gt;
| Tianjun Liao&lt;br /&gt;
|Bernd Bischl, Olaf Mersmann, Heike Trautmann, and Mike PreuÃŸ. 2012. Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference (GECCO 2012), Terence Soule (Ed.). ACM, New York, NY, USA, 313-320. DOI:[http://doi.acm.org/10.1145/2330163.2330209 10.1145/2330163.2330209]&lt;br /&gt;
&lt;br /&gt;
Olaf Mersmann, Bernd Bischl, Heike Trautmann, Mike Preuss, Claus Weihs, and GÃ¼nter Rudolph. 2011. Exploratory landscape analysis. In&lt;br /&gt;
Proceedings of the 13th annual conference on Genetic and evolutionary computation (GECCO 2011), Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 829-836. DOI:[http://doi.acm.org/10.1145/2001576.2001690 10.1145/2001576.2001690]&lt;br /&gt;
|-&lt;br /&gt;
|2012-04-19&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|E.K. Burke, M.R. Hyde, and G. Kendall. Grammatical Evolution of Local Search Heuristics. IEEE Transactions on Evolutionary Computation, 99, 2011. doi: 10.1109/TEVC.2011.2160401 [http://www.cs.nott.ac.uk/~mvh/papers/mvh-draft-ieeetec2011.pdf PDF] &lt;br /&gt;
|-&lt;br /&gt;
|2012-04-03&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|On the automatic discovery of variants of the NEH procedure for flow   shop scheduling using genetic programming. J A VÃ¡zquez-RodrÃ­guez and G Ochoa.Journal of the Operational Research Society (2011) 62, 381â€“396.   doi:[http://dx.doi.org/10.1057/jors.2010.132  10.1057/jors.2010.132]&lt;br /&gt;
|-&lt;br /&gt;
|2011-12-08&lt;br /&gt;
|Zhi Yuan&lt;br /&gt;
|Frank Hutter, Holger Hoos, and Kevin Leyton-Brown. Sequential Model-Based Optimization for General Algorithm Configuration. In Proceedings of Learning and Intelligent Optimization (LION 5), 2011. PDF: [http://www.cs.ubc.ca/~hutter/papers/11-LION5-SMAC.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2011-11-24&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|Ender Ã–zcan and Andrew J. Parkes. 2011. Policy matrix evolution for  generation of heuristics. In Proceedings of the 13th annual  conference on Genetic and evolutionary computation (GECCO 2011),  Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 2011-2018. DOI: [http://dx.doi.org/10.1145/2001576.2001846 10.1145/2001576.2001846]&lt;br /&gt;
|-&lt;br /&gt;
|2011-02-04&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
|HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms. By Christopher Nell, Chris Fawcett, Holger H. Hoos, and Kevin Leyton-Brown. [http://hal.cs.ubc.ca/pubs/NelEtAl11.pdf PDF]&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-17&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
|A. LaTorre, S. Muelas, and J.-M. PeÃ±a. A MOS-based dynamic memetic  differential evolution algorithm for continuous optimization: a  scalability test. Soft Computing. Special issue on Scalability of Evolutionary Algorithms and other Metaheuristics for Large Scale  Continuous Optimization Problems. DOI [http://dx.doi.org/10.1007/s00500-010-0646-3 10.1007/s00500-010-0646-3]&lt;br /&gt;
|-&lt;br /&gt;
|2010-11-10&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|A Rigorous Analysis of the Harmony Search Algorithm--How the Research Community can be misled by a &amp;quot;novel&amp;quot; Methodology. Dennis Weyland. International Journal of Applied Metaheuristic Computing, volume 1-2, April-June 2010, pages 50-60.  DOI: [http://dx.doi.org/10.4018/jamc.2010040104 10.4018/jamc.2010040104]&lt;br /&gt;
&lt;br /&gt;
Survival of the Fittest Algorithm or the Novelest Algorithm?: The Existence Reason of the Harmony Search Algorithm. Zong Woo Geem.&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-09-23&lt;br /&gt;
|Gianpiero Francesca&lt;br /&gt;
|Wenyin Gong, Ãlvaro Fialho and Zhihua Cai. Adaptive Strategy Selection in Differential Evolution. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 409-416. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/68/PDF/AOS-DE.pdf]&lt;br /&gt;
&lt;br /&gt;
Ãlvaro Fialho, Marc Schoenauer and Michele Sebag. Toward Comparison-based Adaptive Operator Selection. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 767-774. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/64/PDF/banditGECCO10.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-06-03&lt;br /&gt;
|Tianjun Liao &lt;br /&gt;
|Population-Based Algorithm Portfolios for Numerical Optimization. Peng, F. Tang, K.Chen, G.Yao, X. IEEE Transactions on Evolutionary Computation. DOI: [http://dx.doi.org/10.1109/TEVC.2010.2040183 10.1109/TEVC.2010.2040183] &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-07&lt;br /&gt;
|Zhi (Eric) Yuan&lt;br /&gt;
|Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. L. Xu, H.H. Hoos, K. Leyton-Brown. To appear at the Conference of the Association for the Advancement of Artificial Intelligence (AAAI-10), 2010. [http://ws.cs.ubc.ca/~kevinlb/pub.php?u=2010-AAAI-Hydra.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-04&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|A. Schaerf and L. Di Gaspero. [[:Image:ElPaCo_presentation.pdf|Slides of the tutorial  &amp;quot;An Overview of Local Search Software Tools&amp;quot;]] given at &amp;quot;Learning and Intelligent OptimizatioN (LION 2007)&amp;quot;, December 8-12, 2007, Trento, Italy.&lt;br /&gt;
&lt;br /&gt;
L. Di Gaspero and A. Schaerf. EASY LOCAL++: An object-oriented framework for ï¬‚exible design of local search algorithms. Software â€” Practice &amp;amp; Experience, 33(8):733â€“765, July 2003. [http://www.diegm.uniud.it/satt/papers/DiSc03.pdf]&lt;br /&gt;
&lt;br /&gt;
S. Cahon, N. Melab and T. El Ghazali. ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. Journal of Heuristics, 10(3):357-380, November 2004. [http://dx.doi.org/10.1023/B:HEUR.0000026900.92269.ec]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-19&lt;br /&gt;
|Sabrina M. de Oliveira&lt;br /&gt;
|A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Session on Real Parameter Optimization. S. Garcia, D. Molina, M. Lozano, F. Herrera - Journal of Heuristics, Volume 15, pp. 617-644, 2009. [http://sci2s.ugr.es/programacion/workshop/GarciaMolinaLozanoHerrera-JH2008.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-04&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|Analyzing Bandit-based Adaptive Operator Selection Mechanisms. Ãlvaro Fialho, Luis Da Costa, Marc Schoenauer and MichÃ©le Sebag. &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-01-14&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|SATzilla: Portfolio-based Algorithm Selection for SAT. L. Xu, F. Hutter, H. H. Hoos, K. Leyton-Brown - Journal of Artificial Intelligence Research, Volume 32, pp. 565-606, 2008. [http://www.jair.org/media/2490/live-2490-3923-jair.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2009-12-11&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|SATenstein: Automatically Building Local Search SAT Solvers From Components. Ashiqur R. KhudaBukhsh, Lin Xu, Holger H. Hoos and Kevin Leyton-Brown - Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 517-524, 2009. [http://www.cs.ubc.ca/labs/beta/Projects/SATenstein/SATenstein_ijcai.pdf]&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Other Previous Meetings==&lt;br /&gt;
&lt;br /&gt;
See [[Previous Optimization meetings | Minutes and agendas from previous meetings]].&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=ProceedingsRepository&amp;diff=6380</id>
		<title>ProceedingsRepository</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=ProceedingsRepository&amp;diff=6380"/>
		<updated>2013-08-30T10:17:38Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: more robuts command&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;div class=&amp;quot;page-warning&amp;quot;&amp;gt;&lt;br /&gt;
[[Image:icon_warning.png|40px]] The proceedings moved out to the web server! However, keep copies of the proceedings that you care about somewhere safe. &lt;br /&gt;
&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
IRIDIA has a proceedings repository that contains digital copies of proceedings.&lt;br /&gt;
&lt;br /&gt;
=== Access ===&lt;br /&gt;
&lt;br /&gt;
They are two ways to get access to the proceedings.&lt;br /&gt;
&lt;br /&gt;
==== Directly on the web server ====&lt;br /&gt;
To get access you need to ask the password to the [[Lab_responsibilities#Servers.2C_infrastructures.2C_and_assets|webserver's administrator]].&lt;br /&gt;
&lt;br /&gt;
Then login on iridia &lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
ssh proceedings@iridia&lt;br /&gt;
&lt;br /&gt;
cd ~/public_html&lt;br /&gt;
&lt;br /&gt;
ls&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== From your browser ====&lt;br /&gt;
Just go to [http://iridia.ulb.ac.be/~proceedings http://iridia.ulb.ac.be/~proceedings]&lt;br /&gt;
&lt;br /&gt;
=== Adding new proceedings ===&lt;br /&gt;
&lt;br /&gt;
Let's say you want to add the directory /media/cdrom for the conference GECCO 2010.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
scp -o PubkeyAuthentication=no -r /media/cdrom proceedings@iridia.ulb.ac.be:/home/proceedings/public_html/2010-gecco&lt;br /&gt;
&lt;br /&gt;
ssh proceedings@iridia ./update_permissions&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Di-fusion&amp;diff=6360</id>
		<title>Di-fusion</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Di-fusion&amp;diff=6360"/>
		<updated>2013-07-26T17:01:29Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: minor edits&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The FNRS rules stipulate that Â«seules les publications en version Ã©lectronique intÃ©grale gÃ©nÃ©rÃ©es sous format pdf Ã  partir des dÃ©pÃ´ts institutionnels des universitÃ©s de la FÃ©dÃ©ration Wallonie-Bruxelles seront prises en considÃ©ration par le F.R.S.-FNRS et les fonds associÃ©s dans leurs procÃ©dures dâ€™Ã©valuation et dâ€™attribution de crÃ©dits de rechercheÂ» (Article 9).&lt;br /&gt;
&lt;br /&gt;
The FNRS requires that you upload on [https://dipot.ulb.ac.be/dspace DI-fusion], the '''post-print''' of your articles. This is the version after peer review and after all revisions. (The pre-print is  the version of the paper before peer-review.) In terms of content, post-prints are the article as published. However, in terms of appearance this might not be the same as the published article, as publishers often reserve for themselves their own arrangement of type-setting and formatting. Typically, this means that the author '''cannot''' use the publisher-generated PDF file, but must make their own PDF version for submission.&lt;br /&gt;
&lt;br /&gt;
The FNRS invites researchers to deposit the post-print version (but the publisher-generated pdf is ok also if permitted by the publisher!), as soon as possible after publication, and '''no later than 6 months''' after publication. This rule applies to all publications starting from 30th June of 2013. For previous publications (before 30th of June, 2013), the FNRS invites you to deposit the articles published since 2008. &lt;br /&gt;
&lt;br /&gt;
In order to know the open access policy of the publishers, please consult the Sherpa/Romeo database http://www.sherpa.ac.uk/romeo/ ; some publishers authorize deposit on open access of the postprints, sometimes with an embargo period, others authorize the deposit of the publisher-generated pdf.&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Di-fusion&amp;diff=6359</id>
		<title>Di-fusion</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Di-fusion&amp;diff=6359"/>
		<updated>2013-07-26T16:38:57Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: initial version&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The FNRS rules stipulate that Â«seules les publications en version Ã©lectronique intÃ©grale gÃ©nÃ©rÃ©es sous format pdf Ã  partir des dÃ©pÃ´ts institutionnels des universitÃ©s de la FÃ©dÃ©ration Wallonie-Bruxelles seront prises en considÃ©ration par le F.R.S.-FNRS et les fonds associÃ©s dans leurs procÃ©dures dâ€™Ã©valuation et dâ€™attribution de crÃ©dits de rechercheÂ» (Article 9).&lt;br /&gt;
&lt;br /&gt;
The FNRS requires that you upload on [https://dipot.ulb.ac.be/dspace/mydspace DI-fusion], your final manuscript of the articles, after peer review, with revisions having been made. This is called the '''postprint'''. (The preprint is  the version of the paper before peer review.) In terms of content, post-prints are the article as published. However, in terms of appearance this might not be the same as the published article, as publishers often reserve for themselves their own arrangement of type-setting and formatting. Typically, this means that the author '''cannot''' use the publisher-generated .pdf file, but must make their own .pdf version for submission to a repository.&lt;br /&gt;
&lt;br /&gt;
The FNRS invites researchers to deposit the postprint version (but the publisher-generated pdf is ok also if permitted by the publisher!), as soon as possible after publication, and no later than 6 months after publication; this rule should be applied to future publications.&lt;br /&gt;
&lt;br /&gt;
For previous publications (before July 2013), the FNRS invites you to deposit the articles published since 2008. &lt;br /&gt;
&lt;br /&gt;
In order to know the open access policy of the publishers, please consult the Sherpa/Romeo database http://www.sherpa.ac.uk/romeo/ ; some publishers authorize deposit on open access of the postprints, sometimes with an embargo period, others authorize the deposit of the publisher-generated pdf.&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6292</id>
		<title>Optimization Group Meetings</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6292"/>
		<updated>2013-04-11T17:44:27Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: new lit session&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;You can subscribe to an [http://en.wikipedia.org/wiki/ICalendar iCalendar] of these meetings at http://iridia.ulb.ac.be/Calendars/publish.php/_NUC_Optimization.ics&lt;br /&gt;
&lt;br /&gt;
==Breakfast Meetings==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
Breakfast meetings are informal meetings where there is a general discussion or someone presents their work. And additional goal is to have breakfast together.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, and a short summary of what you are going to talk about.&lt;br /&gt;
# Add a new entry to the table below.&lt;br /&gt;
# Bring breakfast.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Breakfast Meetings ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;200&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Summary&lt;br /&gt;
|-&lt;br /&gt;
|2011-03-10&lt;br /&gt;
|Stefanie Kritzinger&lt;br /&gt;
| A Unified Framework for Routing Problems with Fixed Fleet Size&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-21&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
| Off-line vs. On-line Tuning: A Study on MAX-MIN Ant System for the TSP&lt;br /&gt;
|-&lt;br /&gt;
|2010-10-19&lt;br /&gt;
|Stefano Benedettini&lt;br /&gt;
| Experiments on Boolean Network Design by Local Search Algorithms.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-20&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
| The social learning strategies tournament, organized as part of the [http://www.intercult.su.se/cultaptation/ cultaptation project], and its results were described. No ideas about algorithm portfolios were discussed.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-??&lt;br /&gt;
|Renaud Lenne&lt;br /&gt;
| ???&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-04-29&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|The maximum clique problem, state of the art and ACO [http://dx.doi.org/10.1016/j.cor.2009.02.013] [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.80.2036&amp;amp;rep=rep1&amp;amp;type=pdf] [http://www710.univ-lyon1.fr/~csolnon/publications/rr-mai04.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-18&lt;br /&gt;
|Sabrina Oliveira&lt;br /&gt;
|Achieved results from the application of the Population Based Ant Colony Optimisation algorithm to TSP.&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-11&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|An overview of Container Loading Problems. &lt;br /&gt;
|-&lt;br /&gt;
| 2010-01-21&lt;br /&gt;
|Yuan, Zhi (Eric)&lt;br /&gt;
| Rice cooker vs. the idea of tuning. &lt;br /&gt;
|-&lt;br /&gt;
|2010-01-07&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|General discussion about the optimization group. &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Literature Sessions==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
The goal of the Literature Sessions is to examine and discuss&lt;br /&gt;
particularly interesting papers from the research literature. For each&lt;br /&gt;
session, one paper will be selected, there will be a short&lt;br /&gt;
presentation (10-15 minutes) about the contents, and a discussion will&lt;br /&gt;
ensue. Sessions will last around 40-45 minutes. Attendants should read&lt;br /&gt;
the paper before the session in order to have a productive discussion. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, a reference to the paper and the URL where it can be obtained. Also, attach the paper in PDF.&lt;br /&gt;
# Add a new entry to the table below. Use YYY-MM-DD (year-month-day) format for the date. Please add a complete bibliographic reference (you may find it in the homepages of the authors) and a hyperlink to a PDF (links to http://dx.doi.org are preferred).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Literature Sessions ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;180&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Paper discussed&lt;br /&gt;
|-&lt;br /&gt;
|2013-04-11&lt;br /&gt;
|Leslie Perez&lt;br /&gt;
| C. AnsÃ³tegui, M. Sellmann, and K. Tierney, â€œA Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms,â€ in Principles and Practice of Constraint Programming - CP 2009, I. P. Gent, Ed. Springer Berlin Heidelberg, 2009, pp. 142â€“157. http://itu.dk/people/kevt/papers/gga-cp2009.pdf &lt;br /&gt;
|-&lt;br /&gt;
|2012-10-18&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
| Yuri Malitsky, Meinolf Sellmann: Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. CPAIOR 2012: 244-259 &lt;br /&gt;
http://dx.doi.org/10.1007/978-3-642-29828-8_16&lt;br /&gt;
|-&lt;br /&gt;
|2012-10-12&lt;br /&gt;
| Tianjun Liao&lt;br /&gt;
|Bernd Bischl, Olaf Mersmann, Heike Trautmann, and Mike PreuÃŸ. 2012. Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference (GECCO 2012), Terence Soule (Ed.). ACM, New York, NY, USA, 313-320. DOI:[http://doi.acm.org/10.1145/2330163.2330209 10.1145/2330163.2330209]&lt;br /&gt;
&lt;br /&gt;
Olaf Mersmann, Bernd Bischl, Heike Trautmann, Mike Preuss, Claus Weihs, and GÃ¼nter Rudolph. 2011. Exploratory landscape analysis. In&lt;br /&gt;
Proceedings of the 13th annual conference on Genetic and evolutionary computation (GECCO 2011), Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 829-836. DOI:[http://doi.acm.org/10.1145/2001576.2001690 10.1145/2001576.2001690]&lt;br /&gt;
|-&lt;br /&gt;
|2012-04-19&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|E.K. Burke, M.R. Hyde, and G. Kendall. Grammatical Evolution of Local Search Heuristics. IEEE Transactions on Evolutionary Computation, 99, 2011. doi: 10.1109/TEVC.2011.2160401 [http://www.cs.nott.ac.uk/~mvh/papers/mvh-draft-ieeetec2011.pdf PDF] &lt;br /&gt;
|-&lt;br /&gt;
|2012-04-03&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|On the automatic discovery of variants of the NEH procedure for flow   shop scheduling using genetic programming. J A VÃ¡zquez-RodrÃ­guez and G Ochoa.Journal of the Operational Research Society (2011) 62, 381â€“396.   doi:[http://dx.doi.org/10.1057/jors.2010.132  10.1057/jors.2010.132]&lt;br /&gt;
|-&lt;br /&gt;
|2011-12-08&lt;br /&gt;
|Zhi Yuan&lt;br /&gt;
|Frank Hutter, Holger Hoos, and Kevin Leyton-Brown. Sequential Model-Based Optimization for General Algorithm Configuration. In Proceedings of Learning and Intelligent Optimization (LION 5), 2011. PDF: [http://www.cs.ubc.ca/~hutter/papers/11-LION5-SMAC.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2011-11-24&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|Ender Ã–zcan and Andrew J. Parkes. 2011. Policy matrix evolution for  generation of heuristics. In Proceedings of the 13th annual  conference on Genetic and evolutionary computation (GECCO 2011),  Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 2011-2018. DOI: [http://dx.doi.org/10.1145/2001576.2001846 10.1145/2001576.2001846]&lt;br /&gt;
|-&lt;br /&gt;
|2011-02-04&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
|HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms. By Christopher Nell, Chris Fawcett, Holger H. Hoos, and Kevin Leyton-Brown. [http://hal.cs.ubc.ca/pubs/NelEtAl11.pdf PDF]&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-17&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
|A. LaTorre, S. Muelas, and J.-M. PeÃ±a. A MOS-based dynamic memetic  differential evolution algorithm for continuous optimization: a  scalability test. Soft Computing. Special issue on Scalability of Evolutionary Algorithms and other Metaheuristics for Large Scale  Continuous Optimization Problems. DOI [http://dx.doi.org/10.1007/s00500-010-0646-3 10.1007/s00500-010-0646-3]&lt;br /&gt;
|-&lt;br /&gt;
|2010-11-10&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|A Rigorous Analysis of the Harmony Search Algorithm--How the Research Community can be misled by a &amp;quot;novel&amp;quot; Methodology. Dennis Weyland. International Journal of Applied Metaheuristic Computing, volume 1-2, April-June 2010, pages 50-60.  DOI: [http://dx.doi.org/10.4018/jamc.2010040104 10.4018/jamc.2010040104]&lt;br /&gt;
&lt;br /&gt;
Survival of the Fittest Algorithm or the Novelest Algorithm?: The Existence Reason of the Harmony Search Algorithm. Zong Woo Geem.&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-09-23&lt;br /&gt;
|Gianpiero Francesca&lt;br /&gt;
|Wenyin Gong, Ãlvaro Fialho and Zhihua Cai. Adaptive Strategy Selection in Differential Evolution. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 409-416. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/68/PDF/AOS-DE.pdf]&lt;br /&gt;
&lt;br /&gt;
Ãlvaro Fialho, Marc Schoenauer and Michele Sebag. Toward Comparison-based Adaptive Operator Selection. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 767-774. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/64/PDF/banditGECCO10.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-06-03&lt;br /&gt;
|Tianjun Liao &lt;br /&gt;
|Population-Based Algorithm Portfolios for Numerical Optimization. Peng, F. Tang, K.Chen, G.Yao, X. IEEE Transactions on Evolutionary Computation. DOI: [http://dx.doi.org/10.1109/TEVC.2010.2040183 10.1109/TEVC.2010.2040183] &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-07&lt;br /&gt;
|Zhi (Eric) Yuan&lt;br /&gt;
|Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. L. Xu, H.H. Hoos, K. Leyton-Brown. To appear at the Conference of the Association for the Advancement of Artificial Intelligence (AAAI-10), 2010. [http://ws.cs.ubc.ca/~kevinlb/pub.php?u=2010-AAAI-Hydra.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-04&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|A. Schaerf and L. Di Gaspero. [[:Image:ElPaCo_presentation.pdf|Slides of the tutorial  &amp;quot;An Overview of Local Search Software Tools&amp;quot;]] given at &amp;quot;Learning and Intelligent OptimizatioN (LION 2007)&amp;quot;, December 8-12, 2007, Trento, Italy.&lt;br /&gt;
&lt;br /&gt;
L. Di Gaspero and A. Schaerf. EASY LOCAL++: An object-oriented framework for ï¬‚exible design of local search algorithms. Software â€” Practice &amp;amp; Experience, 33(8):733â€“765, July 2003. [http://www.diegm.uniud.it/satt/papers/DiSc03.pdf]&lt;br /&gt;
&lt;br /&gt;
S. Cahon, N. Melab and T. El Ghazali. ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. Journal of Heuristics, 10(3):357-380, November 2004. [http://dx.doi.org/10.1023/B:HEUR.0000026900.92269.ec]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-19&lt;br /&gt;
|Sabrina M. de Oliveira&lt;br /&gt;
|A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Session on Real Parameter Optimization. S. Garcia, D. Molina, M. Lozano, F. Herrera - Journal of Heuristics, Volume 15, pp. 617-644, 2009. [http://sci2s.ugr.es/programacion/workshop/GarciaMolinaLozanoHerrera-JH2008.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-04&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|Analyzing Bandit-based Adaptive Operator Selection Mechanisms. Ãlvaro Fialho, Luis Da Costa, Marc Schoenauer and MichÃ©le Sebag. &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-01-14&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|SATzilla: Portfolio-based Algorithm Selection for SAT. L. Xu, F. Hutter, H. H. Hoos, K. Leyton-Brown - Journal of Artificial Intelligence Research, Volume 32, pp. 565-606, 2008. [http://www.jair.org/media/2490/live-2490-3923-jair.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2009-12-11&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|SATenstein: Automatically Building Local Search SAT Solvers From Components. Ashiqur R. KhudaBukhsh, Lin Xu, Holger H. Hoos and Kevin Leyton-Brown - Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 517-524, 2009. [http://www.cs.ubc.ca/labs/beta/Projects/SATenstein/SATenstein_ijcai.pdf]&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Other Previous Meetings==&lt;br /&gt;
&lt;br /&gt;
See [[Previous Optimization meetings | Minutes and agendas from previous meetings]].&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Development_Server&amp;diff=6244</id>
		<title>Development Server</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Development_Server&amp;diff=6244"/>
		<updated>2013-01-30T17:07:35Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;IRIDIA has a development server called &amp;quot;iridia-dev&amp;quot;. The server&lt;br /&gt;
provides the following services:&lt;br /&gt;
&lt;br /&gt;
* subversion repositories&lt;br /&gt;
* git repositories&lt;br /&gt;
* 'trac' environments for projects (wiki, bugtracker etc)&lt;br /&gt;
* webpages for projects&lt;br /&gt;
&lt;br /&gt;
So if you have some software you would like to make open source, you&lt;br /&gt;
can host this on the new server.&lt;br /&gt;
&lt;br /&gt;
== How to add a new subversion/git repository? ==&lt;br /&gt;
&lt;br /&gt;
Currently, you have to contact the server administrator for that. See [[Lab responsibilities]] to find out who's the current administrator of the server and the repositories.&lt;br /&gt;
&lt;br /&gt;
== How to access the subversion/git repositories? ==&lt;br /&gt;
&lt;br /&gt;
You should get a username and a password from the repositories administrator. Instead of&lt;br /&gt;
accessing the server by ssh, you have to use https. The repository URL&lt;br /&gt;
is the following:&lt;br /&gt;
&lt;br /&gt;
  https://iridia-dev.ulb.ac.be/projects/%NAME%/{svn|git}&lt;br /&gt;
&lt;br /&gt;
For example, you can check out a project like this:&lt;br /&gt;
&lt;br /&gt;
  svn co https://%USERNAME%@iridia-dev.ulb.ac.be/projects/%REPNAME%/svn&lt;br /&gt;
&lt;br /&gt;
== I want to delete/archive old repositories ==&lt;br /&gt;
&lt;br /&gt;
Old repositories are stored in &amp;lt;tt&amp;gt;iridiadevserver@fallopius:~/archived_svn_repos&amp;lt;/tt&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Ask the administrator to move it there (&amp;lt;tt&amp;gt;ssh fallopius-backup&amp;lt;/tt&amp;gt; from iridia-dev as root).&lt;br /&gt;
&lt;br /&gt;
[[Lab responsibilities|Contact the administrator]] if you have any problems/questions.&lt;br /&gt;
&lt;br /&gt;
== I want to share one subdirectory of my repository, but I don't want to give access to the rest of my repository ==&lt;br /&gt;
&lt;br /&gt;
Normally, each repository is either all-or-nothing access (apart from read-write permissions), that is, if you give read access to someone, then they can read the whole repository. It is possible to [http://svnbook.red-bean.com/en/1.7/svn.serverconfig.pathbasedauthz.html setup per-directory access], but it is a bit more complicated and it requires a recent Apache and a recent SVN, which we don't have in iridia-dev.&lt;br /&gt;
&lt;br /&gt;
First, ''do you really need this?'' See the link (http://svnbook.red-bean.com/en/1.7/svn.serverconfig.pathbasedauthz.html) why it is better to not rely on this setup and rather to either trust or not trust people. Everything in SVN is reversible, so mistakes can easily be undone.&lt;br /&gt;
&lt;br /&gt;
If you really want to start a collaboration with someone and re-use some files in a repository but not give access to the whole repository, then please consider creating a new repository and copying the files. If you record revision info/url at the moment of the copy, for example, in the first commit to the new repository, you can always merge changes back and forth between repositories with &amp;lt;tt&amp;gt;svn merge&amp;lt;/tt&amp;gt;. Most likely, you will need to merge just once (when the project is finished), and possibly never. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Quick SVN HowTo ==&lt;br /&gt;
&lt;br /&gt;
[http://svnbook.red-bean.com/nightly/en/svn.intro.quickstart.html Subversion Quick Tutorial]: A very fast tutorial on Subversion (SVN).&lt;br /&gt;
&lt;br /&gt;
== Quick Git HowTo ==&lt;br /&gt;
&lt;br /&gt;
==== No password [Linux] ====&lt;br /&gt;
&lt;br /&gt;
If you don't want to be prompted for your password at each operation you have to add in your home directory a .netrc file:&lt;br /&gt;
&lt;br /&gt;
    cat &amp;gt; ~/.netrc&lt;br /&gt;
    machine iridia-dev.ulb.ac.be&lt;br /&gt;
    login %YOUR_USERNAME%&lt;br /&gt;
    password %YOUR_PASSWORD%&lt;br /&gt;
    CTRL+D&lt;br /&gt;
&lt;br /&gt;
and change permissions, so that you are the only one that can access it&lt;br /&gt;
&lt;br /&gt;
    chmod 600 ~/.netrc&lt;br /&gt;
&lt;br /&gt;
Note that if you clone a repository specifying your username in the URL (e.g., https://%USERNAME%@iridia.dev...) your .netrc file will be ignored and you'll have to specify also the password in the URL. If you don't like the idea of your password being stored in clear check out this [http://manpages.ubuntu.com/manpages/precise/man1/git-credential-store.1.html Ubuntu page] about how to store your password in your keyring. If you still want the password to be asked every time and in a remote connection you want to type the password in the command line and not a pop-up window, set in your bash profile:&lt;br /&gt;
&lt;br /&gt;
    unset SSH_ASKPASS&lt;br /&gt;
&lt;br /&gt;
==== No password [Os X] ====&lt;br /&gt;
&lt;br /&gt;
On Os X, after asking your password the first time, it will be stored in your keychain:&lt;br /&gt;
&lt;br /&gt;
    curl http://github-media-downloads.s3.amazonaws.com/osx/git-credential-osxkeychain -o git-credential-osxkeychain&lt;br /&gt;
    sudo mkdir -p /usr/local/bin&lt;br /&gt;
    sudo mv git-credential-osxkeychain /usr/local/bin&lt;br /&gt;
    sudo chmod u+x /usr/local/bin/git-credential-osxkeychain&lt;br /&gt;
    git config --global credential.helper osxkeychain&lt;br /&gt;
&lt;br /&gt;
==== Configuring Git ====&lt;br /&gt;
&lt;br /&gt;
Then you have to add some information about yourself in the configuration:&lt;br /&gt;
&lt;br /&gt;
    git config --global user.name &amp;quot;Pinco Pallino&amp;quot;&lt;br /&gt;
    git config --global user.email &amp;quot;ppallino@iridia.ulb.ac.be&amp;quot;&lt;br /&gt;
    git config --global --add color.ui true&lt;br /&gt;
&lt;br /&gt;
this will be default in git 2.0&lt;br /&gt;
&lt;br /&gt;
    git config --global push.default simple&lt;br /&gt;
&lt;br /&gt;
this is already default, but you could change it with your preferred editor&lt;br /&gt;
&lt;br /&gt;
    git config --global core.editor 'vim'&lt;br /&gt;
&lt;br /&gt;
to wrap lines in git diff&lt;br /&gt;
&lt;br /&gt;
    git config --global core.pager 'less -r'&lt;br /&gt;
&lt;br /&gt;
==== Iridia certificate ====&lt;br /&gt;
&lt;br /&gt;
'''Don't''' ignore the certificate verification&lt;br /&gt;
&lt;br /&gt;
    # git config --global http.sslverify &amp;quot;false&amp;quot;&lt;br /&gt;
&lt;br /&gt;
don't do it. Instead, open the page of your git repository in Firefox (this has to be done just for the first repository), when you are prompted for adding an exception for the certificate, ask Firefox to show you the certificate and export it as a X.509 (PEM) without chain or other options and save it in a file like iridia-dev.ulb.ac.be.pem. Then add it as a sslCAInfo:&lt;br /&gt;
&lt;br /&gt;
    git config --global http.sslCAInfo /home/%YOUR_USERNAME%/iridia-dev.ulb.ac.be.pem&lt;br /&gt;
&lt;br /&gt;
==== Other useful stuff ====&lt;br /&gt;
&lt;br /&gt;
All the configuration options specified above go into a configuration file in your home directory, i.e., ~/.gitconfig. You can add further options manually directly in that file or with git config command line. For example I shamelessly copied these useful aliases [http://durdn.com/blog/2012/11/22/must-have-git-aliases-advanced-examples/ from here]:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
    [alias]&lt;br /&gt;
        # list commits in short form, with colors and branch/tag annotations&lt;br /&gt;
        ls = log --pretty=format:&amp;quot;%C(yellow)%h%Cred%d\\ %Creset%s%Cblue\\ [%cn]&amp;quot; --decorate&lt;br /&gt;
&lt;br /&gt;
        # list commits showing changed files is invoked&lt;br /&gt;
        ll = log --pretty=format:&amp;quot;%C(yellow)%h%Cred%d\\ %Creset%s%Cblue\\ [%cn]&amp;quot; --decorate --numstat&lt;br /&gt;
&lt;br /&gt;
        # list with no colors if you need to chain the out put with Unix pipes&lt;br /&gt;
        lnc = log --pretty=format:&amp;quot;%h\\ %s\\ [%cn]&amp;quot;&lt;br /&gt;
&lt;br /&gt;
        # list oneline commits showing dates (git lds -10)&lt;br /&gt;
        lds = log --pretty=format:&amp;quot;%C(yellow)%h\\ %ad%Cred%d\\ %Creset%s%Cblue\\ [%cn]&amp;quot; --decorate --date=short&lt;br /&gt;
&lt;br /&gt;
        # list oneline commits showing relative dates (git ld -10)&lt;br /&gt;
        ld = log --pretty=format:&amp;quot;%C(yellow)%h\\ %ad%Cred%d\\ %Creset%s%Cblue\\ [%cn]&amp;quot; --decorate --date=relative&lt;br /&gt;
&lt;br /&gt;
        # default look for short git log&lt;br /&gt;
        le = log --oneline --decorate&lt;br /&gt;
&lt;br /&gt;
        # all the commits related to a file, with the diff of the changes&lt;br /&gt;
        filelog = log -u&lt;br /&gt;
        fl = log -u&lt;br /&gt;
&lt;br /&gt;
        # show modified files in last commit&lt;br /&gt;
        dl = &amp;quot;!git ll -1&amp;quot;&lt;br /&gt;
&lt;br /&gt;
        # show a diff last commit&lt;br /&gt;
        dlc = diff --cached HEAD^&lt;br /&gt;
&lt;br /&gt;
        # content of commit (full diff) given revision (got ls -10; git dr 8cf2224)&lt;br /&gt;
        dr  = &amp;quot;!f() { git diff &amp;quot;$1&amp;quot;^..&amp;quot;$1&amp;quot;; }; f&amp;quot;&lt;br /&gt;
        lc  = &amp;quot;!f() { git ll &amp;quot;$1&amp;quot;^..&amp;quot;$1&amp;quot;; }; f&amp;quot;&lt;br /&gt;
        diffr  = &amp;quot;!f() { git diff &amp;quot;$1&amp;quot;^..&amp;quot;$1&amp;quot;; }; f&amp;quot;&lt;br /&gt;
&lt;br /&gt;
        # find a file path in codebase (git f README.txt)&lt;br /&gt;
        f = &amp;quot;!git ls-files | grep -i&amp;quot;&lt;br /&gt;
&lt;br /&gt;
        # search/grep your entire codebase for a string&lt;br /&gt;
        grep = grep -Ii&lt;br /&gt;
        gr = grep -Ii&lt;br /&gt;
&lt;br /&gt;
        # grep from root folder&lt;br /&gt;
        gra = &amp;quot;!f() { A=$(pwd) &amp;amp;&amp;amp; TOPLEVEL=$(git rev-parse --show-toplevel) &amp;amp;&amp;amp; cd $TOPLEVEL &amp;amp;&amp;amp; git grep --full-name -In $1 | xargs -I{} echo $TOPLEVEL/{} &amp;amp;&amp;amp; cd $A; }; f&amp;quot;&lt;br /&gt;
&lt;br /&gt;
        # list all aliases&lt;br /&gt;
        la = &amp;quot;!git config -l | grep alias | cut -c 7-&amp;quot;&lt;br /&gt;
&lt;br /&gt;
        # show the last tag&lt;br /&gt;
        lasttag = describe --tags --abbrev=0&lt;br /&gt;
        lt = describe --tags --abbrev=0&lt;br /&gt;
&lt;br /&gt;
        # basic shortcuts&lt;br /&gt;
        cp = cherry-pick&lt;br /&gt;
        st = status -s&lt;br /&gt;
        cl = clone&lt;br /&gt;
        ci = commit&lt;br /&gt;
        co = checkout&lt;br /&gt;
        br = branch&lt;br /&gt;
        diff = diff --word-diff&lt;br /&gt;
        dc = diff --cached&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
and I also added a global gitignore file:&lt;br /&gt;
&lt;br /&gt;
    git config --global core.excludesfile ~/.gitignore_global&lt;br /&gt;
&lt;br /&gt;
containing some generic patterns for Linux and some specific ones for Os X:&lt;br /&gt;
&lt;br /&gt;
    cat &amp;gt; ~/.gitignore_global&lt;br /&gt;
    .DS_Store&lt;br /&gt;
    .DS_Store?&lt;br /&gt;
    ._*&lt;br /&gt;
    .Spotlight-V100&lt;br /&gt;
    .Trashes&lt;br /&gt;
    Icon?&lt;br /&gt;
    ehthumbs.db&lt;br /&gt;
    Thumbs.db&lt;br /&gt;
    *~&lt;br /&gt;
    *.lock&lt;br /&gt;
    *.DS_Store&lt;br /&gt;
    *.swp&lt;br /&gt;
    *.out&lt;br /&gt;
&lt;br /&gt;
==== Cloning your repository in a local directory ====&lt;br /&gt;
&lt;br /&gt;
At this point with everything configured you should be ready to clone a repository &lt;br /&gt;
&lt;br /&gt;
    git clone https://iridia-dev.ulb.ac.be/projects/%REPNAME%/git %REPNAME%&lt;br /&gt;
&lt;br /&gt;
if you are on Linux and you have configured your .netrc you should have no issues, otherwhise you have maybe to specify also your username:&lt;br /&gt;
&lt;br /&gt;
    git clone https://%YOUR_USERNAME%@iridia-dev.ulb.ac.be/projects/%REPNAME%/git %REPNAME%&lt;br /&gt;
&lt;br /&gt;
and you will be prompted for a password. If you later decide to use a .netrc file, you have to remove your username from the reopository url:&lt;br /&gt;
&lt;br /&gt;
    cd %REPNAME%&lt;br /&gt;
    git remote set-url origin https://iridia-dev.ulb.ac.be/projects/%REPNAME%/git&lt;br /&gt;
&lt;br /&gt;
On Os X, regardless of the username in the URL, if you installed the keychain helper, after typing the password the first time, you will not be prompted anymore.&lt;br /&gt;
&lt;br /&gt;
==== Using Git for SVN users ====&lt;br /&gt;
&lt;br /&gt;
You should definitely read this [http://learn.github.com/p/intro.html short introduction] and if you really want to understand what you are doing you should read this [http://git-scm.com/book slightly longer introduction].  ;)&lt;br /&gt;
&lt;br /&gt;
Anyway if you want a blind correspondence of basic SVN commands here it is:&lt;br /&gt;
&lt;br /&gt;
    svn commit =&amp;gt; git commit -a&lt;br /&gt;
&lt;br /&gt;
this is actually a local commit, to push it to the repository you need to make:&lt;br /&gt;
&lt;br /&gt;
    git push origin --all&lt;br /&gt;
&lt;br /&gt;
or simply&lt;br /&gt;
&lt;br /&gt;
    git push&lt;br /&gt;
&lt;br /&gt;
for updating your local copy to the most up-to-date version on the repository&lt;br /&gt;
&lt;br /&gt;
    svn update =&amp;gt; git pull&lt;br /&gt;
&lt;br /&gt;
changing your mind about your last commit message before pushing it on the repository&lt;br /&gt;
&lt;br /&gt;
    git commit --amend -m 'Edited message.'&lt;br /&gt;
&lt;br /&gt;
The other commands like git diff are very similar to the corresponding svn ones. Branching and tagging are of course different, but you know it already if you are planning to use git. &lt;br /&gt;
&lt;br /&gt;
Anyway, this short list is here to help you if you need to quickly commit something and you are not planning to use Git for your project. On the contrary, if you want to understand why there is a '-a' after the git command, what is the staging area, how to cherry pick a commit on a branch, or how to change the history of the commits on the repository, read at least the [http://learn.github.com/p/intro.html short introduction].&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Software_HOWTOs&amp;diff=6241</id>
		<title>Software HOWTOs</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Software_HOWTOs&amp;diff=6241"/>
		<updated>2013-01-23T14:08:11Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: add git howto link&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This page contains a list of software HOWTOs. These HOWTOs are not meant to be extensive or to explain in any detail, how different software packages can be used. They are meant to serve as a simple reference for setting the up and/or performing the basic actions often needed by researchers at IRIDIA.&lt;br /&gt;
&lt;br /&gt;
=== HOW-TOs ===&lt;br /&gt;
{| cellpadding=&amp;quot;5&amp;quot; border=&amp;quot;1&amp;quot; width=&amp;quot;100%&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
| [[R and 3D plots]] &lt;br /&gt;
| How to setup R and get it to plot experimental data in 3D.&lt;br /&gt;
|-&lt;br /&gt;
| [[Compiling ODE, KODEX, and MISS]] &lt;br /&gt;
| How to compile the open-source alternative to Vortex, ODE, a wrapper and the simulator MISS.&lt;br /&gt;
|-&lt;br /&gt;
| [[Small Video Processing Guide]] &lt;br /&gt;
| How to download and process data from digitial camcorder.&lt;br /&gt;
|-&lt;br /&gt;
| [[Cloning a Debian server]] &lt;br /&gt;
| How to clone a Debian-based server.&lt;br /&gt;
|-&lt;br /&gt;
| [http://svnbook.red-bean.com/nightly/en/svn.intro.quickstart.html Subversion Quick Tutorial] &lt;br /&gt;
| A very fast tutorial on Subversion (SVN).&lt;br /&gt;
|-&lt;br /&gt;
| [http://iridia.ulb.ac.be/wiki/Development_Server#Quick_Git_HowTo GIT Quick HOWTO]&lt;br /&gt;
| A very fast tutorial on git.&lt;br /&gt;
|-&lt;br /&gt;
| [[How to run your code for 2 CPU-seconds]] &lt;br /&gt;
| Optimization: How to stop your C/C++ code after a 10 CPU-seconds.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Development_Server&amp;diff=6240</id>
		<title>Development Server</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Development_Server&amp;diff=6240"/>
		<updated>2013-01-23T14:07:06Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: use pre&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;IRIDIA has a development server called &amp;quot;iridia-dev&amp;quot;. The server&lt;br /&gt;
provides the following services:&lt;br /&gt;
&lt;br /&gt;
* subversion repositories&lt;br /&gt;
* git repositories&lt;br /&gt;
* 'trac' environments for projects (wiki, bugtracker etc)&lt;br /&gt;
* webpages for projects&lt;br /&gt;
&lt;br /&gt;
So if you have some software you would like to make open source, you&lt;br /&gt;
can host this on the new server.&lt;br /&gt;
&lt;br /&gt;
== How to add a new subversion/git repository? ==&lt;br /&gt;
&lt;br /&gt;
Currently, you have to contact the server administrator for that. See [[Lab responsibilities]] to find out who's the current administrator of the server and the repositories.&lt;br /&gt;
&lt;br /&gt;
== How to access the subversion/git repositories? ==&lt;br /&gt;
&lt;br /&gt;
You should get a username and a password from the repositories administrator. Instead of&lt;br /&gt;
accessing the server by ssh, you have to use https. The repository URL&lt;br /&gt;
is the following:&lt;br /&gt;
&lt;br /&gt;
  https://iridia-dev.ulb.ac.be/projects/%NAME%/{svn|git}&lt;br /&gt;
&lt;br /&gt;
For example, you can check out a project like this:&lt;br /&gt;
&lt;br /&gt;
  svn co https://%USERNAME%@iridia-dev.ulb.ac.be/projects/%REPNAME%/svn&lt;br /&gt;
&lt;br /&gt;
== I want to delete/archive old repositories ==&lt;br /&gt;
&lt;br /&gt;
Old repositories are stored in &amp;lt;tt&amp;gt;iridiadevserver@fallopius:~/archived_svn_repos&amp;lt;/tt&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Ask the administrator to move it there (&amp;lt;tt&amp;gt;ssh fallopius-backup&amp;lt;/tt&amp;gt; from iridia-dev as root).&lt;br /&gt;
&lt;br /&gt;
[[Lab responsibilities|Contact the administrator]] if you have any problems/questions.&lt;br /&gt;
&lt;br /&gt;
== Quick SVN HowTo ==&lt;br /&gt;
&lt;br /&gt;
[http://svnbook.red-bean.com/nightly/en/svn.intro.quickstart.html Subversion Quick Tutorial]: A very fast tutorial on Subversion (SVN).&lt;br /&gt;
&lt;br /&gt;
== Quick Git HowTo ==&lt;br /&gt;
&lt;br /&gt;
==== No password [Linux] ====&lt;br /&gt;
&lt;br /&gt;
If you don't want to be prompted for your password at each operation you have to add in your home directory a .netrc file:&lt;br /&gt;
&lt;br /&gt;
    cat &amp;gt; ~/.netrc&lt;br /&gt;
    machine iridia-dev.ulb.ac.be&lt;br /&gt;
    login %YOUR_USERNAME%&lt;br /&gt;
    password %YOUR_PASSWORD%&lt;br /&gt;
    CTRL+D&lt;br /&gt;
&lt;br /&gt;
and change permissions, so that you are the only one that can access it&lt;br /&gt;
&lt;br /&gt;
    chmod 600 ~/.netrc&lt;br /&gt;
&lt;br /&gt;
Note that if you clone a repository specifying your username in the URL (e.g., https://%USERNAME%@iridia.dev...) your .netrc file will be ignored and you'll have to specify also the password in the URL. If you don't like the idea of your password being stored in clear check out this [http://manpages.ubuntu.com/manpages/precise/man1/git-credential-store.1.html Ubuntu page] about how to store your password in your keyring. If you still want the password to be asked every time and in a remote connection you want to type the password in the command line and not a pop-up window, set in your bash profile:&lt;br /&gt;
&lt;br /&gt;
    unset SSH_ASKPASS&lt;br /&gt;
&lt;br /&gt;
==== No password [Os X] ====&lt;br /&gt;
&lt;br /&gt;
On Os X, after asking your password the first time, it will be stored in your keychain:&lt;br /&gt;
&lt;br /&gt;
    curl http://github-media-downloads.s3.amazonaws.com/osx/git-credential-osxkeychain -o git-credential-osxkeychain&lt;br /&gt;
    sudo mkdir -p /usr/local/bin&lt;br /&gt;
    sudo mv git-credential-osxkeychain /usr/local/bin&lt;br /&gt;
    sudo chmod u+x /usr/local/bin/git-credential-osxkeychain&lt;br /&gt;
    git config --global credential.helper osxkeychain&lt;br /&gt;
&lt;br /&gt;
==== Configuring Git ====&lt;br /&gt;
&lt;br /&gt;
Then you have to add some information about yourself in the configuration:&lt;br /&gt;
&lt;br /&gt;
    git config --global user.name &amp;quot;Pinco Pallino&amp;quot;&lt;br /&gt;
    git config --global user.email &amp;quot;ppallino@iridia.ulb.ac.be&amp;quot;&lt;br /&gt;
    git config --global --add color.ui true&lt;br /&gt;
&lt;br /&gt;
this will be default in git 2.0&lt;br /&gt;
&lt;br /&gt;
    git config --global push.default simple&lt;br /&gt;
&lt;br /&gt;
this is already default, but you could change it with your preferred editor&lt;br /&gt;
&lt;br /&gt;
    git config --global core.editor 'vim'&lt;br /&gt;
&lt;br /&gt;
to wrap lines in git diff&lt;br /&gt;
&lt;br /&gt;
    git config --global core.pager 'less -r'&lt;br /&gt;
&lt;br /&gt;
==== Iridia certificate ====&lt;br /&gt;
&lt;br /&gt;
'''Don't''' ignore the certificate verification&lt;br /&gt;
&lt;br /&gt;
    # git config --global http.sslverify &amp;quot;false&amp;quot;&lt;br /&gt;
&lt;br /&gt;
don't do it. Instead, open the page of your git repository in Firefox (this has to be done just for the first repository), when you are prompted for adding an exception for the certificate, ask Firefox to show you the certificate and export it as a X.509 (PEM) without chain or other options and save it in a file like iridia-dev.ulb.ac.be.pem. Then add it as a sslCAInfo:&lt;br /&gt;
&lt;br /&gt;
    git config --global http.sslCAInfo /home/%YOUR_USERNAME%/iridia-dev.ulb.ac.be.pem&lt;br /&gt;
&lt;br /&gt;
==== Other useful stuff ====&lt;br /&gt;
&lt;br /&gt;
All the configuration options specified above go into a configuration file in your home directory, i.e., ~/.gitconfig. You can add further options manually directly in that file or with git config command line. For example I shamelessly copied these useful aliases [http://durdn.com/blog/2012/11/22/must-have-git-aliases-advanced-examples/ from here]:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
    [alias]&lt;br /&gt;
        # list commits in short form, with colors and branch/tag annotations&lt;br /&gt;
        ls = log --pretty=format:&amp;quot;%C(yellow)%h%Cred%d\\ %Creset%s%Cblue\\ [%cn]&amp;quot; --decorate&lt;br /&gt;
&lt;br /&gt;
        # list commits showing changed files is invoked&lt;br /&gt;
        ll = log --pretty=format:&amp;quot;%C(yellow)%h%Cred%d\\ %Creset%s%Cblue\\ [%cn]&amp;quot; --decorate --numstat&lt;br /&gt;
&lt;br /&gt;
        # list with no colors if you need to chain the out put with Unix pipes&lt;br /&gt;
        lnc = log --pretty=format:&amp;quot;%h\\ %s\\ [%cn]&amp;quot;&lt;br /&gt;
&lt;br /&gt;
        # list oneline commits showing dates (git lds -10)&lt;br /&gt;
        lds = log --pretty=format:&amp;quot;%C(yellow)%h\\ %ad%Cred%d\\ %Creset%s%Cblue\\ [%cn]&amp;quot; --decorate --date=short&lt;br /&gt;
&lt;br /&gt;
        # list oneline commits showing relative dates (git ld -10)&lt;br /&gt;
        ld = log --pretty=format:&amp;quot;%C(yellow)%h\\ %ad%Cred%d\\ %Creset%s%Cblue\\ [%cn]&amp;quot; --decorate --date=relative&lt;br /&gt;
&lt;br /&gt;
        # default look for short git log&lt;br /&gt;
        le = log --oneline --decorate&lt;br /&gt;
&lt;br /&gt;
        # all the commits related to a file, with the diff of the changes&lt;br /&gt;
        filelog = log -u&lt;br /&gt;
        fl = log -u&lt;br /&gt;
&lt;br /&gt;
        # show modified files in last commit&lt;br /&gt;
        dl = &amp;quot;!git ll -1&amp;quot;&lt;br /&gt;
&lt;br /&gt;
        # show a diff last commit&lt;br /&gt;
        dlc = diff --cached HEAD^&lt;br /&gt;
&lt;br /&gt;
        # content of commit (full diff) given revision (got ls -10; git dr 8cf2224)&lt;br /&gt;
        dr  = &amp;quot;!f() { git diff &amp;quot;$1&amp;quot;^..&amp;quot;$1&amp;quot;; }; f&amp;quot;&lt;br /&gt;
        lc  = &amp;quot;!f() { git ll &amp;quot;$1&amp;quot;^..&amp;quot;$1&amp;quot;; }; f&amp;quot;&lt;br /&gt;
        diffr  = &amp;quot;!f() { git diff &amp;quot;$1&amp;quot;^..&amp;quot;$1&amp;quot;; }; f&amp;quot;&lt;br /&gt;
&lt;br /&gt;
        # find a file path in codebase (git f README.txt)&lt;br /&gt;
        f = &amp;quot;!git ls-files | grep -i&amp;quot;&lt;br /&gt;
&lt;br /&gt;
        # search/grep your entire codebase for a string&lt;br /&gt;
        grep = grep -Ii&lt;br /&gt;
        gr = grep -Ii&lt;br /&gt;
&lt;br /&gt;
        # grep from root folder&lt;br /&gt;
        gra = &amp;quot;!f() { A=$(pwd) &amp;amp;&amp;amp; TOPLEVEL=$(git rev-parse --show-toplevel) &amp;amp;&amp;amp; cd $TOPLEVEL &amp;amp;&amp;amp; git grep --full-name -In $1 | xargs -I{} echo $TOPLEVEL/{} &amp;amp;&amp;amp; cd $A; }; f&amp;quot;&lt;br /&gt;
&lt;br /&gt;
        # list all aliases&lt;br /&gt;
        la = &amp;quot;!git config -l | grep alias | cut -c 7-&amp;quot;&lt;br /&gt;
&lt;br /&gt;
        # show the last tag&lt;br /&gt;
        lasttag = describe --tags --abbrev=0&lt;br /&gt;
        lt = describe --tags --abbrev=0&lt;br /&gt;
&lt;br /&gt;
        # basic shortcuts&lt;br /&gt;
        cp = cherry-pick&lt;br /&gt;
        st = status -s&lt;br /&gt;
        cl = clone&lt;br /&gt;
        ci = commit&lt;br /&gt;
        co = checkout&lt;br /&gt;
        br = branch&lt;br /&gt;
        diff = diff --word-diff&lt;br /&gt;
        dc = diff --cached&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
and I also added a global gitignore file:&lt;br /&gt;
&lt;br /&gt;
    git config --global core.excludesfile ~/.gitignore_global&lt;br /&gt;
&lt;br /&gt;
containing some generic patterns for Linux and some specific ones for Os X:&lt;br /&gt;
&lt;br /&gt;
    cat &amp;gt; ~/.gitignore_global&lt;br /&gt;
    .DS_Store&lt;br /&gt;
    .DS_Store?&lt;br /&gt;
    ._*&lt;br /&gt;
    .Spotlight-V100&lt;br /&gt;
    .Trashes&lt;br /&gt;
    Icon?&lt;br /&gt;
    ehthumbs.db&lt;br /&gt;
    Thumbs.db&lt;br /&gt;
    *~&lt;br /&gt;
    *.lock&lt;br /&gt;
    *.DS_Store&lt;br /&gt;
    *.swp&lt;br /&gt;
    *.out&lt;br /&gt;
&lt;br /&gt;
==== Cloning your repository in a local directory ====&lt;br /&gt;
&lt;br /&gt;
At this point with everything configured you should be ready to clone a repository &lt;br /&gt;
&lt;br /&gt;
    git clone https://iridia-dev.ulb.ac.be/projects/%REPNAME%/git %REPNAME%&lt;br /&gt;
&lt;br /&gt;
if you are on Linux and you have configured your .netrc you should have no issues, otherwhise you have maybe to specify also your username:&lt;br /&gt;
&lt;br /&gt;
    git clone https://%YOUR_USERNAME%@iridia-dev.ulb.ac.be/projects/%REPNAME%/git %REPNAME%&lt;br /&gt;
&lt;br /&gt;
and you will be prompted for a password. If you later decide to use a .netrc file, you have to remove your username from the reopository url:&lt;br /&gt;
&lt;br /&gt;
    cd %REPNAME%&lt;br /&gt;
    git remote set-url origin https://iridia-dev.ulb.ac.be/projects/%REPNAME%/git&lt;br /&gt;
&lt;br /&gt;
On Os X, regardless of the username in the URL, if you installed the keychain helper, after typing the password the first time, you will not be prompted anymore.&lt;br /&gt;
&lt;br /&gt;
==== Using Git for SVN users ====&lt;br /&gt;
&lt;br /&gt;
You should definitely read this [http://learn.github.com/p/intro.html short introduction] and if you really want to understand what you are doing you should read this [http://git-scm.com/book slightly longer introduction].  ;)&lt;br /&gt;
&lt;br /&gt;
Anyway if you want a blind correspondence of basic SVN commands here it is:&lt;br /&gt;
&lt;br /&gt;
    svn commit =&amp;gt; git commit -a&lt;br /&gt;
&lt;br /&gt;
this is actually a local commit, to push it to the repository you need to make:&lt;br /&gt;
&lt;br /&gt;
    git push origin --all&lt;br /&gt;
&lt;br /&gt;
or simply&lt;br /&gt;
&lt;br /&gt;
    git push&lt;br /&gt;
&lt;br /&gt;
for updating your local copy to the most up-to-date version on the repository&lt;br /&gt;
&lt;br /&gt;
    svn update =&amp;gt; git pull&lt;br /&gt;
&lt;br /&gt;
changing your mind about your last commit message before pushing it on the repository&lt;br /&gt;
&lt;br /&gt;
    git commit --amend -m 'Edited message.'&lt;br /&gt;
&lt;br /&gt;
The other commands like git diff are very similar to the corresponding svn ones. Branching and tagging are of course different, but you know it already if you are planning to use git. &lt;br /&gt;
&lt;br /&gt;
Anyway, this short list is here to help you if you need to quickly commit something and you are not planning to use Git for your project. On the contrary, if you want to understand why there is a '-a' after the git command, what is the staging area, how to cherry pick a commit on a branch, or how to change the history of the commits on the repository, read at least the [http://learn.github.com/p/intro.html short introduction].&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Development_Server&amp;diff=6238</id>
		<title>Development Server</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Development_Server&amp;diff=6238"/>
		<updated>2013-01-17T11:02:52Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: link to svn tutorial&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;IRIDIA has a development server called &amp;quot;iridia-dev&amp;quot;. The server&lt;br /&gt;
provides the following services:&lt;br /&gt;
&lt;br /&gt;
* subversion repositories&lt;br /&gt;
* git repositories&lt;br /&gt;
* 'trac' environments for projects (wiki, bugtracker etc)&lt;br /&gt;
* webpages for projects&lt;br /&gt;
&lt;br /&gt;
So if you have some software you would like to make open source, you&lt;br /&gt;
can host this on the new server.&lt;br /&gt;
&lt;br /&gt;
== How to add a new subversion/git repository? ==&lt;br /&gt;
&lt;br /&gt;
Currently, you have to contact the server administrator for that. See [[Lab responsibilities]] to find out who's the current administrator of the server and the repositories.&lt;br /&gt;
&lt;br /&gt;
== How to access the subversion/git repositories? ==&lt;br /&gt;
&lt;br /&gt;
You should get a username and a password from the repositories administrator. Instead of&lt;br /&gt;
accessing the server by ssh, you have to use https. The repository URL&lt;br /&gt;
is the following:&lt;br /&gt;
&lt;br /&gt;
  https://iridia-dev.ulb.ac.be/projects/%NAME%/{svn|git}&lt;br /&gt;
&lt;br /&gt;
For example, you can check out a project like this:&lt;br /&gt;
&lt;br /&gt;
  svn co https://%USERNAME%@iridia-dev.ulb.ac.be/projects/%REPNAME%/svn&lt;br /&gt;
&lt;br /&gt;
== I want to delete/archive old repositories ==&lt;br /&gt;
&lt;br /&gt;
Old repositories are stored in &amp;lt;tt&amp;gt;iridiadevserver@fallopius:~/archived_svn_repos&amp;lt;/tt&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Ask the administrator to move it there (&amp;lt;tt&amp;gt;ssh fallopius-backup&amp;lt;/tt&amp;gt; from iridia-dev as root).&lt;br /&gt;
&lt;br /&gt;
[[Lab responsibilities|Contact the administrator]] if you have any problems/questions.&lt;br /&gt;
&lt;br /&gt;
== Quick SVN HowTo ==&lt;br /&gt;
&lt;br /&gt;
[http://svnbook.red-bean.com/nightly/en/svn.intro.quickstart.html Subversion Quick Tutorial]: A very fast tutorial on Subversion (SVN).&lt;br /&gt;
&lt;br /&gt;
== Quick Git HowTo ==&lt;br /&gt;
&lt;br /&gt;
==== No password [Linux] ====&lt;br /&gt;
&lt;br /&gt;
If you don't want to be prompted for your password at each operation you have to add in your home directory a .netrc file:&lt;br /&gt;
&lt;br /&gt;
    cat &amp;gt; ~/.netrc&lt;br /&gt;
    machine iridia-dev.ulb.ac.be&lt;br /&gt;
    login %YOUR_USERNAME%&lt;br /&gt;
    password %YOUR_PASSWORD%&lt;br /&gt;
    CTRL+D&lt;br /&gt;
&lt;br /&gt;
and change permissions, so that you are the only one that can access it&lt;br /&gt;
&lt;br /&gt;
    chmod 600 ~/.netrc&lt;br /&gt;
&lt;br /&gt;
Note that if you clone a repository specifying your username in the URL (e.g., https://%USERNAME%@iridia.dev...) your .netrc file will be ignored and you'll have to specify also the password in the URL. If you don't like the idea of your password being stored in clear check out this [http://manpages.ubuntu.com/manpages/precise/man1/git-credential-store.1.html Ubuntu page] about how to store your password in your keyring. If you still want the password to be asked every time and in a remote connection you want to type the password in the command line and not a pop-up window, set in your bash profile:&lt;br /&gt;
&lt;br /&gt;
    unset SSH_ASKPASS&lt;br /&gt;
&lt;br /&gt;
==== No password [Os X] ====&lt;br /&gt;
&lt;br /&gt;
On Os X, after asking your password the first time, it will be stored in your keychain:&lt;br /&gt;
&lt;br /&gt;
    curl http://github-media-downloads.s3.amazonaws.com/osx/git-credential-osxkeychain -o git-credential-osxkeychain&lt;br /&gt;
    sudo mkdir -p /usr/local/bin&lt;br /&gt;
    sudo mv git-credential-osxkeychain /usr/local/bin&lt;br /&gt;
    sudo chmod u+x /usr/local/bin/git-credential-osxkeychain&lt;br /&gt;
    git config --global credential.helper osxkeychain&lt;br /&gt;
&lt;br /&gt;
==== Configuring Git ====&lt;br /&gt;
&lt;br /&gt;
Then you have to add some information about yourself in the configuration:&lt;br /&gt;
&lt;br /&gt;
    git config --global user.name &amp;quot;Pinco Pallino&amp;quot;&lt;br /&gt;
    git config --global user.email &amp;quot;ppallino@iridia.ulb.ac.be&amp;quot;&lt;br /&gt;
    git config --global --add color.ui true&lt;br /&gt;
&lt;br /&gt;
this will be default in git 2.0&lt;br /&gt;
&lt;br /&gt;
    git config --global push.default simple&lt;br /&gt;
&lt;br /&gt;
this is already default, but you could change it with your preferred editor&lt;br /&gt;
&lt;br /&gt;
    git config --global core.editor 'vim'&lt;br /&gt;
&lt;br /&gt;
to wrap lines in git diff&lt;br /&gt;
&lt;br /&gt;
    git config --global core.pager 'less -r'&lt;br /&gt;
&lt;br /&gt;
==== Iridia certificate ====&lt;br /&gt;
&lt;br /&gt;
'''Don't''' ignore the certificate verification&lt;br /&gt;
&lt;br /&gt;
    # git config --global http.sslverify &amp;quot;false&amp;quot;&lt;br /&gt;
&lt;br /&gt;
don't do it. Instead, open the page of your git repository in Firefox (this has to be done just for the first repository), when you are prompted for adding an exception for the certificate, ask Firefox to show you the certificate and export it as a X.509 (PEM) without chain or other options and save it in a file like iridia-dev.ulb.ac.be.pem. Then add it as a sslCAInfo:&lt;br /&gt;
&lt;br /&gt;
    git config --global http.sslCAInfo /home/%YOUR_USERNAME%/iridia-dev.ulb.ac.be.pem&lt;br /&gt;
&lt;br /&gt;
==== Other useful stuff ====&lt;br /&gt;
&lt;br /&gt;
All the configuration options specified above go into a configuration file in your home directory, i.e., ~/.gitconfig. You can add further options manually directly in that file or with git config command line. For example I shamelessly copied these useful aliases [http://durdn.com/blog/2012/11/22/must-have-git-aliases-advanced-examples/ from here]:&lt;br /&gt;
&lt;br /&gt;
    [alias]&lt;br /&gt;
        # list commits in short form, with colors and branch/tag annotations&lt;br /&gt;
        ls = log --pretty=format:&amp;quot;%C(yellow)%h%Cred%d\\ %Creset%s%Cblue\\ [%cn]&amp;quot; --decorate&lt;br /&gt;
&lt;br /&gt;
        # list commits showing changed files is invoked&lt;br /&gt;
        ll = log --pretty=format:&amp;quot;%C(yellow)%h%Cred%d\\ %Creset%s%Cblue\\ [%cn]&amp;quot; --decorate --numstat&lt;br /&gt;
&lt;br /&gt;
        # list with no colors if you need to chain the out put with Unix pipes&lt;br /&gt;
        lnc = log --pretty=format:&amp;quot;%h\\ %s\\ [%cn]&amp;quot;&lt;br /&gt;
&lt;br /&gt;
        # list oneline commits showing dates (git lds -10)&lt;br /&gt;
        lds = log --pretty=format:&amp;quot;%C(yellow)%h\\ %ad%Cred%d\\ %Creset%s%Cblue\\ [%cn]&amp;quot; --decorate --date=short&lt;br /&gt;
&lt;br /&gt;
        # list oneline commits showing relative dates (git ld -10)&lt;br /&gt;
        ld = log --pretty=format:&amp;quot;%C(yellow)%h\\ %ad%Cred%d\\ %Creset%s%Cblue\\ [%cn]&amp;quot; --decorate --date=relative&lt;br /&gt;
&lt;br /&gt;
        # default look for short git log&lt;br /&gt;
        le = log --oneline --decorate&lt;br /&gt;
&lt;br /&gt;
        # all the commits related to a file, with the diff of the changes&lt;br /&gt;
        filelog = log -u&lt;br /&gt;
        fl = log -u&lt;br /&gt;
&lt;br /&gt;
        # show modified files in last commit&lt;br /&gt;
        dl = &amp;quot;!git ll -1&amp;quot;&lt;br /&gt;
&lt;br /&gt;
        # show a diff last commit&lt;br /&gt;
        dlc = diff --cached HEAD^&lt;br /&gt;
&lt;br /&gt;
        # content of commit (full diff) given revision (got ls -10; git dr 8cf2224)&lt;br /&gt;
        dr  = &amp;quot;!f() { git diff &amp;quot;$1&amp;quot;^..&amp;quot;$1&amp;quot;; }; f&amp;quot;&lt;br /&gt;
        lc  = &amp;quot;!f() { git ll &amp;quot;$1&amp;quot;^..&amp;quot;$1&amp;quot;; }; f&amp;quot;&lt;br /&gt;
        diffr  = &amp;quot;!f() { git diff &amp;quot;$1&amp;quot;^..&amp;quot;$1&amp;quot;; }; f&amp;quot;&lt;br /&gt;
&lt;br /&gt;
        # find a file path in codebase (git f README.txt)&lt;br /&gt;
        f = &amp;quot;!git ls-files | grep -i&amp;quot;&lt;br /&gt;
&lt;br /&gt;
        # search/grep your entire codebase for a string&lt;br /&gt;
        grep = grep -Ii&lt;br /&gt;
        gr = grep -Ii&lt;br /&gt;
&lt;br /&gt;
        # grep from root folder&lt;br /&gt;
        gra = &amp;quot;!f() { A=$(pwd) &amp;amp;&amp;amp; TOPLEVEL=$(git rev-parse --show-toplevel) &amp;amp;&amp;amp; cd $TOPLEVEL &amp;amp;&amp;amp; git grep --full-name -In $1 | xargs -I{} echo $TOPLEVEL/{} &amp;amp;&amp;amp; cd $A; }; f&amp;quot;&lt;br /&gt;
&lt;br /&gt;
        # list all aliases&lt;br /&gt;
        la = &amp;quot;!git config -l | grep alias | cut -c 7-&amp;quot;&lt;br /&gt;
&lt;br /&gt;
        # show the last tag&lt;br /&gt;
        lasttag = describe --tags --abbrev=0&lt;br /&gt;
        lt = describe --tags --abbrev=0&lt;br /&gt;
&lt;br /&gt;
        # basic shortcuts&lt;br /&gt;
        cp = cherry-pick&lt;br /&gt;
        st = status -s&lt;br /&gt;
        cl = clone&lt;br /&gt;
        ci = commit&lt;br /&gt;
        co = checkout&lt;br /&gt;
        br = branch&lt;br /&gt;
        diff = diff --word-diff&lt;br /&gt;
        dc = diff --cached&lt;br /&gt;
&lt;br /&gt;
and I also added a global gitignore file:&lt;br /&gt;
&lt;br /&gt;
    git config --global core.excludesfile ~/.gitignore_global&lt;br /&gt;
&lt;br /&gt;
containing some generic patterns for Linux and some specific ones for Os X:&lt;br /&gt;
&lt;br /&gt;
    cat &amp;gt; ~/.gitignore_global&lt;br /&gt;
    .DS_Store&lt;br /&gt;
    .DS_Store?&lt;br /&gt;
    ._*&lt;br /&gt;
    .Spotlight-V100&lt;br /&gt;
    .Trashes&lt;br /&gt;
    Icon?&lt;br /&gt;
    ehthumbs.db&lt;br /&gt;
    Thumbs.db&lt;br /&gt;
    *~&lt;br /&gt;
    *.lock&lt;br /&gt;
    *.DS_Store&lt;br /&gt;
    *.swp&lt;br /&gt;
    *.out&lt;br /&gt;
&lt;br /&gt;
==== Cloning your repository in a local directory ====&lt;br /&gt;
&lt;br /&gt;
At this point with everything configured you should be ready to clone a repository &lt;br /&gt;
&lt;br /&gt;
    git clone https://iridia-dev.ulb.ac.be/projects/%REPNAME%/git %REPNAME%&lt;br /&gt;
&lt;br /&gt;
if you are on Linux and you have configured your .netrc you should have no issues, otherwhise you have maybe to specify also your username:&lt;br /&gt;
&lt;br /&gt;
    git clone https://%YOUR_USERNAME%@iridia-dev.ulb.ac.be/projects/%REPNAME%/git %REPNAME%&lt;br /&gt;
&lt;br /&gt;
and you will be prompted for a password. If you later decide to use a .netrc file, you have to remove your username from the reopository url:&lt;br /&gt;
&lt;br /&gt;
    cd %REPNAME%&lt;br /&gt;
    git remote set-url origin https://iridia-dev.ulb.ac.be/projects/%REPNAME%/git&lt;br /&gt;
&lt;br /&gt;
On Os X, regardless of the username in the URL, if you installed the keychain helper, after typing the password the first time, you will not be prompted anymore.&lt;br /&gt;
&lt;br /&gt;
==== Using Git for SVN users ====&lt;br /&gt;
&lt;br /&gt;
You should definitely read this [http://learn.github.com/p/intro.html short introduction] and if you really want to understand what you are doing you should read this [http://git-scm.com/book slightly longer introduction].  ;)&lt;br /&gt;
&lt;br /&gt;
Anyway if you want a blind correspondence of basic SVN commands here it is:&lt;br /&gt;
&lt;br /&gt;
    svn commit =&amp;gt; git commit -a&lt;br /&gt;
&lt;br /&gt;
this is actually a local commit, to push it to the repository you need to make:&lt;br /&gt;
&lt;br /&gt;
    git push origin --all&lt;br /&gt;
&lt;br /&gt;
or simply&lt;br /&gt;
&lt;br /&gt;
    git push&lt;br /&gt;
&lt;br /&gt;
for updating your local copy to the most up-to-date version on the repository&lt;br /&gt;
&lt;br /&gt;
    svn update =&amp;gt; git pull&lt;br /&gt;
&lt;br /&gt;
changing your mind about your last commit message before pushing it on the repository&lt;br /&gt;
&lt;br /&gt;
    git commit --amend -m 'Edited message.'&lt;br /&gt;
&lt;br /&gt;
The other commands like git diff are very similar to the corresponding svn ones. Branching and tagging are of course different, but you know it already if you are planning to use git. &lt;br /&gt;
&lt;br /&gt;
Anyway, this short list is here to help you if you need to quickly commit something and you are not planning to use Git for your project. On the contrary, if you want to understand why there is a '-a' after the git command, what is the staging area, how to cherry pick a commit on a branch, or how to change the history of the commits on the repository, read at least the [http://learn.github.com/p/intro.html short introduction].&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=ProceedingsRepository&amp;diff=6226</id>
		<title>ProceedingsRepository</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=ProceedingsRepository&amp;diff=6226"/>
		<updated>2013-01-13T14:57:59Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: restore warning icon&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;div class=&amp;quot;page-warning&amp;quot;&amp;gt;&lt;br /&gt;
[[Image:icon_warning.png|40px]] The proceedings moved out to the web server! However, keep copies of the proceedings that you care about somewhere safe. &lt;br /&gt;
&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
IRIDIA has a proceedings repository that contains digital copies of proceedings.&lt;br /&gt;
&lt;br /&gt;
=== Access ===&lt;br /&gt;
&lt;br /&gt;
They are two ways to get access to the proceedings.&lt;br /&gt;
&lt;br /&gt;
==== Directly on the web server ====&lt;br /&gt;
To get access you need to ask the password to the [[Lab_responsibilities#Servers.2C_infrastructures.2C_and_assets|webserver's administrator]].&lt;br /&gt;
&lt;br /&gt;
Then login on iridia &lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
ssh proceedings@iridia&lt;br /&gt;
&lt;br /&gt;
cd ~/public_html&lt;br /&gt;
&lt;br /&gt;
ls&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== From your browser ====&lt;br /&gt;
Just go to [http://iridia.ulb.ac.be/~proceedings http://iridia.ulb.ac.be/~proceedings]&lt;br /&gt;
&lt;br /&gt;
=== Adding new proceedings ===&lt;br /&gt;
&lt;br /&gt;
Let's say you want to add the directory /media/cdrom for the conference GECCO 2010.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
scp -r /media/cdrom proceedings@iridia:~/public_html/2010-gecco&lt;br /&gt;
&lt;br /&gt;
ssh proceedings@iridia ./update_permissions&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=IRIDIA_Seminars&amp;diff=6213</id>
		<title>IRIDIA Seminars</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=IRIDIA_Seminars&amp;diff=6213"/>
		<updated>2012-12-04T13:25:05Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Responsible Must Be==&lt;br /&gt;
* To be able to send emails to the Seminars mailing list you need to have the flag &amp;quot;mod&amp;quot; not checked in the Membership Management section of the Seminars mailing list.&lt;br /&gt;
* Your email address needs to be subscribed to the list of forwarded addresses of &amp;quot;semAdmin@iridia.ulb.ac.be&amp;quot;. Ask the administrator of iridia.ulb.ac.be if you need to be added.&lt;br /&gt;
&lt;br /&gt;
==How to Manage Seminars==&lt;br /&gt;
&lt;br /&gt;
The IRIDIA seminars can be divided into two main types: internal seminars (IS) and external seminars (ES).&lt;br /&gt;
Note that each class of seminars need a slightly different management procedure.&lt;br /&gt;
&lt;br /&gt;
# Ask for confirmation of the seminar date and time to at least one person from MD, MB, or TS. &lt;br /&gt;
# Add an entry to the IRIDIA Seminar Database (only for ES):&lt;br /&gt;
## Create a folder on your PC called &amp;quot;seminars/&amp;quot;&lt;br /&gt;
## Copy the semPush script to &amp;quot;seminars/&amp;quot;&lt;br /&gt;
## Create an xml file containing the xml received by email &amp;quot;FirstnameLastname.xml&amp;quot;. &lt;br /&gt;
## Execute &amp;quot;./semPush FirstnameLastname.xml&amp;quot; from a terminal&lt;br /&gt;
## Check on [http://iridia.ulb.ac.be/seminars/ IRIDIA Seminars List] that the entry has been successfully added&lt;br /&gt;
# Update the [http://iridia.ulb.ac.be/Calendars/month.php IRIDIA's Calendars] and book the seminar room:&lt;br /&gt;
## Login into the system&lt;br /&gt;
## Add an entry into the seminar for the requested date using the format &amp;quot;[SEMINAR@IRIDIA] FirstName LastName: Title of Seminar&amp;quot;&lt;br /&gt;
## If the location is the IRIDIA Seminar room then fill the 'Location' field of the calendar with 'SEMINAR ROOM, IRIDIA'.&lt;br /&gt;
## Always use timed events and remember to add the duration of the event&lt;br /&gt;
## Add participants to the event: &lt;br /&gt;
### If the seminar is an ES: &amp;quot;IRIDIA Seminars&amp;quot;&lt;br /&gt;
### If the seminar is an IS add the entry to (&amp;quot;IRIDIA Seminars&amp;quot;, &amp;quot; Robotics calendar&amp;quot;, &amp;quot;Optimization calendar&amp;quot;) depending on the particular case&lt;br /&gt;
### If there is the need to book the Seminar room add &amp;quot;Seminar room&amp;quot; in the participants (always for ES)&lt;br /&gt;
### Always add an entry to &amp;quot;Common calendar&amp;quot; (semAdmin participant)&lt;br /&gt;
# Send reminders for the seminars (only in case of ES)&lt;br /&gt;
## Login into the [http://iridia.ulb.ac.be IRIDIA server]&lt;br /&gt;
## Send new seminar comunication (where &amp;lt;key&amp;gt; is a date in the format YYYY-MM-DD): &amp;quot;./semMail -s -m &amp;lt;key&amp;gt;&amp;quot;&lt;br /&gt;
## Send reminder: &amp;quot;./semMail -s -r &amp;lt;key&amp;gt;&amp;quot;&lt;br /&gt;
## Ensure that the semMail script has a seminar admin email address as sender!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Some notes about the Calendar software ==&lt;br /&gt;
&lt;br /&gt;
* We are using [http://www.k5n.us/webcalendar.php WebCalendar]. The current version is probably very outdated and may be a security risk. It should be (carefully) updated to use the version current in Debian, so it receives automatic security updates.&lt;br /&gt;
&lt;br /&gt;
* It would be ideal to find a way to add events directly from a script, so many steps above could be automated. It should be possible, since it is possible to [http://www.k5n.us/wiki/index.php?title=Main_Page#WebCalendar_Mini-Guides add events from external applications]. However, how to do it from a script is not clear. Someone will have to read the WebCalendar documentation to find out how to do it.&lt;br /&gt;
&lt;br /&gt;
== Useful Links ==&lt;br /&gt;
* [http://iridia.ulb.ac.be/seminars/ IRIDIA's Seminars List]&lt;br /&gt;
* [http://iridia.ulb.ac.be/seminars/new-seminar.phtml New Seminar Form]&lt;br /&gt;
* [http://iridia.ulb.ac.be/Calendars/month.php IRIDIA's Calendars]&lt;br /&gt;
* [https://iridia.ulb.ac.be/cgi-bin/mailman/admin/seminars/ IRIDIA's Seminars Mailing List]&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=IRIDIA_Seminars&amp;diff=6212</id>
		<title>IRIDIA Seminars</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=IRIDIA_Seminars&amp;diff=6212"/>
		<updated>2012-12-04T13:24:20Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Responsible Must Be==&lt;br /&gt;
* To be able to send emails to the Seminars mailing list you need to have the flag &amp;quot;mod&amp;quot; not checked in the Membership Management section of the Seminars mailing list.&lt;br /&gt;
* Your email address needs to be subscribed to the list of forwarded addresses of &amp;quot;semAdmin@iridia.ulb.ac.be&amp;quot;. Ask the administrator of iridia.ulb.ac.be if you need to be added.&lt;br /&gt;
&lt;br /&gt;
==How to Manage Seminars==&lt;br /&gt;
&lt;br /&gt;
The IRIDIA seminars can be divided into two main types: internal seminars (IS) and external seminars (ES).&lt;br /&gt;
Note that each class of seminars need a slightly different management procedure.&lt;br /&gt;
&lt;br /&gt;
# Ask for confirmation of the seminar date and time to at least one person from MD, MB, or TS. &lt;br /&gt;
# Add an entry to the IRIDIA Seminar Database (only for ES):&lt;br /&gt;
## Create a folder on your PC called &amp;quot;seminars/&amp;quot;&lt;br /&gt;
## Copy the semPush script to &amp;quot;seminars/&amp;quot;&lt;br /&gt;
## Create an xml file containing the xml received by email &amp;quot;FirstnameLastname.xml&amp;quot;. &lt;br /&gt;
## Execute &amp;quot;./semPush FirstnameLastname.xml&amp;quot; from a terminal&lt;br /&gt;
## Check on [http://iridia.ulb.ac.be/seminars/ IRIDIA Seminars List] that the entry has been successfully added&lt;br /&gt;
# Update the [http://iridia.ulb.ac.be/Calendars/month.php IRIDIA's Calendars] and book the seminar room:&lt;br /&gt;
## Login into the system&lt;br /&gt;
## Add an entry into the seminar for the requested date using the format &amp;quot;[SEMINAR@IRIDIA] FirstName LastName: Title of Seminar&amp;quot;&lt;br /&gt;
## If the location is the IRIDIA Seminar room then fill the 'Location' field of the calendar with 'SEMINAR ROOM, IRIDIA'.&lt;br /&gt;
## Always use timed events and remember to add the duration of the event&lt;br /&gt;
## Add participants to the event: &lt;br /&gt;
### If the seminar is an ES: &amp;quot;IRIDIA Seminars&amp;quot;&lt;br /&gt;
### If the seminar is an IS add the entry to (&amp;quot;IRIDIA Seminars&amp;quot;, &amp;quot; Robotics calendar&amp;quot;, &amp;quot;Optimization calendar&amp;quot;) depending on the particular case&lt;br /&gt;
### If there is the need to book the Seminar room add &amp;quot;Seminar room&amp;quot; in the participants (always for ES)&lt;br /&gt;
### Always add an entry to &amp;quot;Common calendar&amp;quot; (semAdmin participant)&lt;br /&gt;
# Send reminders for the seminars (only in case of ES)&lt;br /&gt;
## Login into the [http://iridia.ulb.ac.be IRIDIA server]&lt;br /&gt;
## Send new seminar comunication (where &amp;lt;key&amp;gt; is a date in the format YYYY-MM-DD): &amp;quot;./semMail -s -m &amp;lt;key&amp;gt;&amp;quot;&lt;br /&gt;
## Send reminder: &amp;quot;./semMail -s -r &amp;lt;key&amp;gt;&amp;quot;&lt;br /&gt;
## Ensure that the semMail script has a seminar admin email address as sender!&lt;br /&gt;
&lt;br /&gt;
=== Some notes about the Calendar software ===&lt;br /&gt;
&lt;br /&gt;
* We are using [http://www.k5n.us/webcalendar.php WebCalendar]. The current version is probably very outdated and may be a security risk. It should be (carefully) updated to use the version current in Debian, so it receives automatic security updates.&lt;br /&gt;
&lt;br /&gt;
* It would be ideal to find a way to add events directly from a script, so many steps above could be automated. It should be possible, since it is possible to [http://www.k5n.us/wiki/index.php?title=Main_Page#WebCalendar_Mini-Guides add events from external applications]. However, how to do it from a script is not clear. Someone will have to read the WebCalendar documentation to find out how to do it.&lt;br /&gt;
&lt;br /&gt;
== Useful Links ==&lt;br /&gt;
* [http://iridia.ulb.ac.be/seminars/ IRIDIA's Seminars List]&lt;br /&gt;
* [http://iridia.ulb.ac.be/seminars/new-seminar.phtml New Seminar Form]&lt;br /&gt;
* [http://iridia.ulb.ac.be/Calendars/month.php IRIDIA's Calendars]&lt;br /&gt;
* [https://iridia.ulb.ac.be/cgi-bin/mailman/admin/seminars/ IRIDIA's Seminars Mailing List]&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=IRIDIA_Seminars&amp;diff=6211</id>
		<title>IRIDIA Seminars</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=IRIDIA_Seminars&amp;diff=6211"/>
		<updated>2012-12-04T13:15:15Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: notes about the calendar software&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Responsible Must Be==&lt;br /&gt;
* To be able to send emails to the Seminars mailing list you need to have the flag &amp;quot;mod&amp;quot; not checked in the Membership Management section of the Seminars mailing list.&lt;br /&gt;
* Your email address needs to be subscribed to the list of forwarded addresses of &amp;quot;semAdmin@iridia.ulb.ac.be&amp;quot;. Ask the administrator of iridia.ulb.ac.be if you need to be added.&lt;br /&gt;
&lt;br /&gt;
==How to Manage Seminars==&lt;br /&gt;
&lt;br /&gt;
The IRIDIA seminars can be divided into two main types: internal seminars (IS) and external seminars (ES).&lt;br /&gt;
Note that each class of seminars need a slightly different management procedure.&lt;br /&gt;
&lt;br /&gt;
# Ask for confirmation of the seminar date and time to at least one person from MD, MB, or TS. &lt;br /&gt;
# Add an entry to the IRIDIA Seminar Database (only for ES):&lt;br /&gt;
## Create a folder on your PC called &amp;quot;seminars/&amp;quot;&lt;br /&gt;
## Copy the semPush script to &amp;quot;seminars/&amp;quot;&lt;br /&gt;
## Create an xml file containing the xml received by email &amp;quot;FirstnameLastname.xml&amp;quot;. &lt;br /&gt;
## Execute &amp;quot;./semPush FirstnameLastname.xml&amp;quot; from a terminal&lt;br /&gt;
## Check on [http://iridia.ulb.ac.be/seminars/ IRIDIA Seminars List] that the entry has been successfully added&lt;br /&gt;
# Update the [http://iridia.ulb.ac.be/Calendars/month.php IRIDIA's Calendars] and book the seminar room:&lt;br /&gt;
## Login into the system&lt;br /&gt;
## Add an entry into the seminar for the requested date using the format &amp;quot;[SEMINAR@IRIDIA] FirstName LastName: Title of Seminar&amp;quot;&lt;br /&gt;
## If the location is the IRIDIA Seminar room then fill the 'Location' field of the calendar with 'SEMINAR ROOM, IRIDIA'.&lt;br /&gt;
## Always use timed events and remember to add the duration of the event&lt;br /&gt;
## Add participants to the event: &lt;br /&gt;
### If the seminar is an ES: &amp;quot;IRIDIA Seminars&amp;quot;&lt;br /&gt;
### If the seminar is an IS add the entry to (&amp;quot;IRIDIA Seminars&amp;quot;, &amp;quot; Robotics calendar&amp;quot;, &amp;quot;Optimization calendar&amp;quot;) depending on the particular case&lt;br /&gt;
### If there is the need to book the Seminar room add &amp;quot;Seminar room&amp;quot; in the participants (always for ES)&lt;br /&gt;
### Always add an entry to &amp;quot;Common calendar&amp;quot; (semAdmin participant)&lt;br /&gt;
# Send reminders for the seminars (only in case of ES)&lt;br /&gt;
## Login into the [http://iridia.ulb.ac.be IRIDIA server]&lt;br /&gt;
## Send new seminar comunication (where &amp;lt;key&amp;gt; is a date in the format YYYY-MM-DD): &amp;quot;./semMail -s -m &amp;lt;key&amp;gt;&amp;quot;&lt;br /&gt;
## Send reminder: &amp;quot;./semMail -s -r &amp;lt;key&amp;gt;&amp;quot;&lt;br /&gt;
## Ensure that the semMail script has a seminar admin email address as sender!&lt;br /&gt;
&lt;br /&gt;
=== Some notes about the Calendar software ===&lt;br /&gt;
&lt;br /&gt;
* We are using [http://www.k5n.us/webcalendar.php WebCalendar]. The current version is probably very outdated and may be a security risk. It should be (carefully) updated to use the version current in Debian, so it receives automatic security updates.&lt;br /&gt;
&lt;br /&gt;
* It would be ideal to find a way to add events directly from a script, so many steps above could be automated. Someone will have to read the WebCalendar documentation to find out if this is possible.&lt;br /&gt;
&lt;br /&gt;
== Useful Links ==&lt;br /&gt;
* [http://iridia.ulb.ac.be/seminars/ IRIDIA's Seminars List]&lt;br /&gt;
* [http://iridia.ulb.ac.be/seminars/new-seminar.phtml New Seminar Form]&lt;br /&gt;
* [http://iridia.ulb.ac.be/Calendars/month.php IRIDIA's Calendars]&lt;br /&gt;
* [https://iridia.ulb.ac.be/cgi-bin/mailman/admin/seminars/ IRIDIA's Seminars Mailing List]&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6178</id>
		<title>Optimization Group Meetings</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6178"/>
		<updated>2012-10-19T13:31:42Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;You can subscribe to an [http://en.wikipedia.org/wiki/ICalendar iCalendar] of these meetings at http://iridia.ulb.ac.be/Calendars/publish.php/_NUC_Optimization.ics&lt;br /&gt;
&lt;br /&gt;
==Breakfast Meetings==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
Breakfast meetings are informal meetings where there is a general discussion or someone presents their work. And additional goal is to have breakfast together.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, and a short summary of what you are going to talk about.&lt;br /&gt;
# Add a new entry to the table below.&lt;br /&gt;
# Bring breakfast.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Breakfast Meetings ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;200&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Summary&lt;br /&gt;
|-&lt;br /&gt;
|2011-03-10&lt;br /&gt;
|Stefanie Kritzinger&lt;br /&gt;
| A Unified Framework for Routing Problems with Fixed Fleet Size&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-21&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
| Off-line vs. On-line Tuning: A Study on MAX-MIN Ant System for the TSP&lt;br /&gt;
|-&lt;br /&gt;
|2010-10-19&lt;br /&gt;
|Stefano Benedettini&lt;br /&gt;
| Experiments on Boolean Network Design by Local Search Algorithms.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-20&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
| The social learning strategies tournament, organized as part of the [http://www.intercult.su.se/cultaptation/ cultaptation project], and its results were described. No ideas about algorithm portfolios were discussed.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-??&lt;br /&gt;
|Renaud Lenne&lt;br /&gt;
| ???&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-04-29&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|The maximum clique problem, state of the art and ACO [http://dx.doi.org/10.1016/j.cor.2009.02.013] [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.80.2036&amp;amp;rep=rep1&amp;amp;type=pdf] [http://www710.univ-lyon1.fr/~csolnon/publications/rr-mai04.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-18&lt;br /&gt;
|Sabrina Oliveira&lt;br /&gt;
|Achieved results from the application of the Population Based Ant Colony Optimisation algorithm to TSP.&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-11&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|An overview of Container Loading Problems. &lt;br /&gt;
|-&lt;br /&gt;
| 2010-01-21&lt;br /&gt;
|Yuan, Zhi (Eric)&lt;br /&gt;
| Rice cooker vs. the idea of tuning. &lt;br /&gt;
|-&lt;br /&gt;
|2010-01-07&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|General discussion about the optimization group. &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Literature Sessions==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
The goal of the Literature Sessions is to examine and discuss&lt;br /&gt;
particularly interesting papers from the research literature. For each&lt;br /&gt;
session, one paper will be selected, there will be a short&lt;br /&gt;
presentation (10-15 minutes) about the contents, and a discussion will&lt;br /&gt;
ensue. Sessions will last around 40-45 minutes. Attendants should read&lt;br /&gt;
the paper before the session in order to have a productive discussion. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, a reference to the paper and the URL where it can be obtained. Also, attach the paper in PDF.&lt;br /&gt;
# Add a new entry to the table below. Use YYY-MM-DD (year-month-day) format for the date. Please add a complete bibliographic reference (you may find it in the homepages of the authors) and a hyperlink to a PDF (links to http://dx.doi.org are preferred).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Literature Sessions ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;180&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Paper discussed&lt;br /&gt;
|-&lt;br /&gt;
|2012-10-18&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
| Yuri Malitsky, Meinolf Sellmann: Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. CPAIOR 2012: 244-259 &lt;br /&gt;
http://dx.doi.org/10.1007/978-3-642-29828-8_16&lt;br /&gt;
|-&lt;br /&gt;
|2012-10-12&lt;br /&gt;
| Tianjun Liao&lt;br /&gt;
|Bernd Bischl, Olaf Mersmann, Heike Trautmann, and Mike PreuÃŸ. 2012. Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference (GECCO 2012), Terence Soule (Ed.). ACM, New York, NY, USA, 313-320. DOI:[http://doi.acm.org/10.1145/2330163.2330209 10.1145/2330163.2330209]&lt;br /&gt;
&lt;br /&gt;
Olaf Mersmann, Bernd Bischl, Heike Trautmann, Mike Preuss, Claus Weihs, and GÃ¼nter Rudolph. 2011. Exploratory landscape analysis. In&lt;br /&gt;
Proceedings of the 13th annual conference on Genetic and evolutionary computation (GECCO 2011), Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 829-836. DOI:[http://doi.acm.org/10.1145/2001576.2001690 10.1145/2001576.2001690]&lt;br /&gt;
|-&lt;br /&gt;
|2012-04-19&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|E.K. Burke, M.R. Hyde, and G. Kendall. Grammatical Evolution of Local Search Heuristics. IEEE Transactions on Evolutionary Computation, 99, 2011. doi: 10.1109/TEVC.2011.2160401 [http://www.cs.nott.ac.uk/~mvh/papers/mvh-draft-ieeetec2011.pdf PDF] &lt;br /&gt;
|-&lt;br /&gt;
|2012-04-03&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|On the automatic discovery of variants of the NEH procedure for flow   shop scheduling using genetic programming. J A VÃ¡zquez-RodrÃ­guez and G Ochoa.Journal of the Operational Research Society (2011) 62, 381â€“396.   doi:[http://dx.doi.org/10.1057/jors.2010.132  10.1057/jors.2010.132]&lt;br /&gt;
|-&lt;br /&gt;
|2011-12-08&lt;br /&gt;
|Zhi Yuan&lt;br /&gt;
|Frank Hutter, Holger Hoos, and Kevin Leyton-Brown. Sequential Model-Based Optimization for General Algorithm Configuration. In Proceedings of Learning and Intelligent Optimization (LION 5), 2011. PDF: [http://www.cs.ubc.ca/~hutter/papers/11-LION5-SMAC.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2011-11-24&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|Ender Ã–zcan and Andrew J. Parkes. 2011. Policy matrix evolution for  generation of heuristics. In Proceedings of the 13th annual  conference on Genetic and evolutionary computation (GECCO 2011),  Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 2011-2018. DOI: [http://dx.doi.org/10.1145/2001576.2001846 10.1145/2001576.2001846]&lt;br /&gt;
|-&lt;br /&gt;
|2011-02-04&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
|HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms. By Christopher Nell, Chris Fawcett, Holger H. Hoos, and Kevin Leyton-Brown. [http://hal.cs.ubc.ca/pubs/NelEtAl11.pdf PDF]&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-17&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
|A. LaTorre, S. Muelas, and J.-M. PeÃ±a. A MOS-based dynamic memetic  differential evolution algorithm for continuous optimization: a  scalability test. Soft Computing. Special issue on Scalability of Evolutionary Algorithms and other Metaheuristics for Large Scale  Continuous Optimization Problems. DOI [http://dx.doi.org/10.1007/s00500-010-0646-3 10.1007/s00500-010-0646-3]&lt;br /&gt;
|-&lt;br /&gt;
|2010-11-10&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|A Rigorous Analysis of the Harmony Search Algorithm--How the Research Community can be misled by a &amp;quot;novel&amp;quot; Methodology. Dennis Weyland. International Journal of Applied Metaheuristic Computing, volume 1-2, April-June 2010, pages 50-60.  DOI: [http://dx.doi.org/10.4018/jamc.2010040104 10.4018/jamc.2010040104]&lt;br /&gt;
&lt;br /&gt;
Survival of the Fittest Algorithm or the Novelest Algorithm?: The Existence Reason of the Harmony Search Algorithm. Zong Woo Geem.&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-09-23&lt;br /&gt;
|Gianpiero Francesca&lt;br /&gt;
|Wenyin Gong, Ãlvaro Fialho and Zhihua Cai. Adaptive Strategy Selection in Differential Evolution. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 409-416. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/68/PDF/AOS-DE.pdf]&lt;br /&gt;
&lt;br /&gt;
Ãlvaro Fialho, Marc Schoenauer and Michele Sebag. Toward Comparison-based Adaptive Operator Selection. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 767-774. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/64/PDF/banditGECCO10.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-06-03&lt;br /&gt;
|Tianjun Liao &lt;br /&gt;
|Population-Based Algorithm Portfolios for Numerical Optimization. Peng, F. Tang, K.Chen, G.Yao, X. IEEE Transactions on Evolutionary Computation. DOI: [http://dx.doi.org/10.1109/TEVC.2010.2040183 10.1109/TEVC.2010.2040183] &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-07&lt;br /&gt;
|Zhi (Eric) Yuan&lt;br /&gt;
|Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. L. Xu, H.H. Hoos, K. Leyton-Brown. To appear at the Conference of the Association for the Advancement of Artificial Intelligence (AAAI-10), 2010. [http://ws.cs.ubc.ca/~kevinlb/pub.php?u=2010-AAAI-Hydra.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-04&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|A. Schaerf and L. Di Gaspero. [[:Image:ElPaCo_presentation.pdf|Slides of the tutorial  &amp;quot;An Overview of Local Search Software Tools&amp;quot;]] given at &amp;quot;Learning and Intelligent OptimizatioN (LION 2007)&amp;quot;, December 8-12, 2007, Trento, Italy.&lt;br /&gt;
&lt;br /&gt;
L. Di Gaspero and A. Schaerf. EASY LOCAL++: An object-oriented framework for ï¬‚exible design of local search algorithms. Software â€” Practice &amp;amp; Experience, 33(8):733â€“765, July 2003. [http://www.diegm.uniud.it/satt/papers/DiSc03.pdf]&lt;br /&gt;
&lt;br /&gt;
S. Cahon, N. Melab and T. El Ghazali. ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. Journal of Heuristics, 10(3):357-380, November 2004. [http://dx.doi.org/10.1023/B:HEUR.0000026900.92269.ec]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-19&lt;br /&gt;
|Sabrina M. de Oliveira&lt;br /&gt;
|A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Session on Real Parameter Optimization. S. Garcia, D. Molina, M. Lozano, F. Herrera - Journal of Heuristics, Volume 15, pp. 617-644, 2009. [http://sci2s.ugr.es/programacion/workshop/GarciaMolinaLozanoHerrera-JH2008.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-04&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|Analyzing Bandit-based Adaptive Operator Selection Mechanisms. Ãlvaro Fialho, Luis Da Costa, Marc Schoenauer and MichÃ©le Sebag. &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-01-14&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|SATzilla: Portfolio-based Algorithm Selection for SAT. L. Xu, F. Hutter, H. H. Hoos, K. Leyton-Brown - Journal of Artificial Intelligence Research, Volume 32, pp. 565-606, 2008. [http://www.jair.org/media/2490/live-2490-3923-jair.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2009-12-11&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|SATenstein: Automatically Building Local Search SAT Solvers From Components. Ashiqur R. KhudaBukhsh, Lin Xu, Holger H. Hoos and Kevin Leyton-Brown - Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 517-524, 2009. [http://www.cs.ubc.ca/labs/beta/Projects/SATenstein/SATenstein_ijcai.pdf]&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Other Previous Meetings==&lt;br /&gt;
&lt;br /&gt;
See [[Previous Optimization meetings | Minutes and agendas from previous meetings]].&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6177</id>
		<title>Optimization Group Meetings</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6177"/>
		<updated>2012-10-19T13:31:18Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;You can subscribe to an [http://en.wikipedia.org/wiki/ICalendar iCalendar] of these meetings at http://iridia.ulb.ac.be/Calendars/publish.php/_NUC_Optimization.ics&lt;br /&gt;
&lt;br /&gt;
==Breakfast Meetings==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
Breakfast meetings are informal meetings where there is a general discussion or someone presents their work. And additional goal is to have breakfast together.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, and a short summary of what you are going to talk about.&lt;br /&gt;
# Add a new entry to the table below.&lt;br /&gt;
# Bring breakfast.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Breakfast Meetings ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;200&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Summary&lt;br /&gt;
|-&lt;br /&gt;
|2011-03-10&lt;br /&gt;
|Stefanie Kritzinger&lt;br /&gt;
| A Unified Framework for Routing Problems with Fixed Fleet Size&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-21&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
| Off-line vs. On-line Tuning: A Study on MAX-MIN Ant System for the TSP&lt;br /&gt;
|-&lt;br /&gt;
|2010-10-19&lt;br /&gt;
|Stefano Benedettini&lt;br /&gt;
| Experiments on Boolean Network Design by Local Search Algorithms.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-20&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
| The social learning strategies tournament, organized as part of the [http://www.intercult.su.se/cultaptation/ cultaptation project], and its results were described. No ideas about algorithm portfolios were discussed.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-??&lt;br /&gt;
|Renaud Lenne&lt;br /&gt;
| ???&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-04-29&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|The maximum clique problem, state of the art and ACO [http://dx.doi.org/10.1016/j.cor.2009.02.013] [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.80.2036&amp;amp;rep=rep1&amp;amp;type=pdf] [http://www710.univ-lyon1.fr/~csolnon/publications/rr-mai04.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-18&lt;br /&gt;
|Sabrina Oliveira&lt;br /&gt;
|Achieved results from the application of the Population Based Ant Colony Optimisation algorithm to TSP.&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-11&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|An overview of Container Loading Problems. &lt;br /&gt;
|-&lt;br /&gt;
| 2010-01-21&lt;br /&gt;
|Yuan, Zhi (Eric)&lt;br /&gt;
| Rice cooker vs. the idea of tuning. &lt;br /&gt;
|-&lt;br /&gt;
|2010-01-07&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|General discussion about the optimization group. &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Literature Sessions==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
The goal of the Literature Sessions is to examine and discuss&lt;br /&gt;
particularly interesting papers from the research literature. For each&lt;br /&gt;
session, one paper will be selected, there will be a short&lt;br /&gt;
presentation (10-15 minutes) about the contents, and a discussion will&lt;br /&gt;
ensue. Sessions will last around 40-45 minutes. Attendants should read&lt;br /&gt;
the paper before the session in order to have a productive discussion. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, a reference to the paper and the URL where it can be obtained. Also, attach the paper in PDF.&lt;br /&gt;
# Add a new entry to the table below. Use YYY-MM-DD (year-month-day) format for the date. Please add a complete bibliographic reference (you may find it in the homepages of the authors) and a hyperlink to a PDF (links to http://dx.doi.org are preferred).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Literature Sessions ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;180&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Paper discussed&lt;br /&gt;
|-&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|2012-10-18&lt;br /&gt;
| Yuri Malitsky, Meinolf Sellmann: Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. CPAIOR 2012: 244-259 &lt;br /&gt;
http://dx.doi.org/10.1007/978-3-642-29828-8_16&lt;br /&gt;
|-&lt;br /&gt;
|2012-10-12&lt;br /&gt;
| Tianjun Liao&lt;br /&gt;
|Bernd Bischl, Olaf Mersmann, Heike Trautmann, and Mike PreuÃŸ. 2012. Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference (GECCO 2012), Terence Soule (Ed.). ACM, New York, NY, USA, 313-320. DOI:[http://doi.acm.org/10.1145/2330163.2330209 10.1145/2330163.2330209]&lt;br /&gt;
&lt;br /&gt;
Olaf Mersmann, Bernd Bischl, Heike Trautmann, Mike Preuss, Claus Weihs, and GÃ¼nter Rudolph. 2011. Exploratory landscape analysis. In&lt;br /&gt;
Proceedings of the 13th annual conference on Genetic and evolutionary computation (GECCO 2011), Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 829-836. DOI:[http://doi.acm.org/10.1145/2001576.2001690 10.1145/2001576.2001690]&lt;br /&gt;
|-&lt;br /&gt;
|2012-04-19&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|E.K. Burke, M.R. Hyde, and G. Kendall. Grammatical Evolution of Local Search Heuristics. IEEE Transactions on Evolutionary Computation, 99, 2011. doi: 10.1109/TEVC.2011.2160401 [http://www.cs.nott.ac.uk/~mvh/papers/mvh-draft-ieeetec2011.pdf PDF] &lt;br /&gt;
|-&lt;br /&gt;
|2012-04-03&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|On the automatic discovery of variants of the NEH procedure for flow   shop scheduling using genetic programming. J A VÃ¡zquez-RodrÃ­guez and G Ochoa.Journal of the Operational Research Society (2011) 62, 381â€“396.   doi:[http://dx.doi.org/10.1057/jors.2010.132  10.1057/jors.2010.132]&lt;br /&gt;
|-&lt;br /&gt;
|2011-12-08&lt;br /&gt;
|Zhi Yuan&lt;br /&gt;
|Frank Hutter, Holger Hoos, and Kevin Leyton-Brown. Sequential Model-Based Optimization for General Algorithm Configuration. In Proceedings of Learning and Intelligent Optimization (LION 5), 2011. PDF: [http://www.cs.ubc.ca/~hutter/papers/11-LION5-SMAC.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2011-11-24&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|Ender Ã–zcan and Andrew J. Parkes. 2011. Policy matrix evolution for  generation of heuristics. In Proceedings of the 13th annual  conference on Genetic and evolutionary computation (GECCO 2011),  Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 2011-2018. DOI: [http://dx.doi.org/10.1145/2001576.2001846 10.1145/2001576.2001846]&lt;br /&gt;
|-&lt;br /&gt;
|2011-02-04&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
|HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms. By Christopher Nell, Chris Fawcett, Holger H. Hoos, and Kevin Leyton-Brown. [http://hal.cs.ubc.ca/pubs/NelEtAl11.pdf PDF]&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-17&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
|A. LaTorre, S. Muelas, and J.-M. PeÃ±a. A MOS-based dynamic memetic  differential evolution algorithm for continuous optimization: a  scalability test. Soft Computing. Special issue on Scalability of Evolutionary Algorithms and other Metaheuristics for Large Scale  Continuous Optimization Problems. DOI [http://dx.doi.org/10.1007/s00500-010-0646-3 10.1007/s00500-010-0646-3]&lt;br /&gt;
|-&lt;br /&gt;
|2010-11-10&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|A Rigorous Analysis of the Harmony Search Algorithm--How the Research Community can be misled by a &amp;quot;novel&amp;quot; Methodology. Dennis Weyland. International Journal of Applied Metaheuristic Computing, volume 1-2, April-June 2010, pages 50-60.  DOI: [http://dx.doi.org/10.4018/jamc.2010040104 10.4018/jamc.2010040104]&lt;br /&gt;
&lt;br /&gt;
Survival of the Fittest Algorithm or the Novelest Algorithm?: The Existence Reason of the Harmony Search Algorithm. Zong Woo Geem.&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-09-23&lt;br /&gt;
|Gianpiero Francesca&lt;br /&gt;
|Wenyin Gong, Ãlvaro Fialho and Zhihua Cai. Adaptive Strategy Selection in Differential Evolution. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 409-416. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/68/PDF/AOS-DE.pdf]&lt;br /&gt;
&lt;br /&gt;
Ãlvaro Fialho, Marc Schoenauer and Michele Sebag. Toward Comparison-based Adaptive Operator Selection. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 767-774. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/64/PDF/banditGECCO10.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-06-03&lt;br /&gt;
|Tianjun Liao &lt;br /&gt;
|Population-Based Algorithm Portfolios for Numerical Optimization. Peng, F. Tang, K.Chen, G.Yao, X. IEEE Transactions on Evolutionary Computation. DOI: [http://dx.doi.org/10.1109/TEVC.2010.2040183 10.1109/TEVC.2010.2040183] &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-07&lt;br /&gt;
|Zhi (Eric) Yuan&lt;br /&gt;
|Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. L. Xu, H.H. Hoos, K. Leyton-Brown. To appear at the Conference of the Association for the Advancement of Artificial Intelligence (AAAI-10), 2010. [http://ws.cs.ubc.ca/~kevinlb/pub.php?u=2010-AAAI-Hydra.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-04&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|A. Schaerf and L. Di Gaspero. [[:Image:ElPaCo_presentation.pdf|Slides of the tutorial  &amp;quot;An Overview of Local Search Software Tools&amp;quot;]] given at &amp;quot;Learning and Intelligent OptimizatioN (LION 2007)&amp;quot;, December 8-12, 2007, Trento, Italy.&lt;br /&gt;
&lt;br /&gt;
L. Di Gaspero and A. Schaerf. EASY LOCAL++: An object-oriented framework for ï¬‚exible design of local search algorithms. Software â€” Practice &amp;amp; Experience, 33(8):733â€“765, July 2003. [http://www.diegm.uniud.it/satt/papers/DiSc03.pdf]&lt;br /&gt;
&lt;br /&gt;
S. Cahon, N. Melab and T. El Ghazali. ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. Journal of Heuristics, 10(3):357-380, November 2004. [http://dx.doi.org/10.1023/B:HEUR.0000026900.92269.ec]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-19&lt;br /&gt;
|Sabrina M. de Oliveira&lt;br /&gt;
|A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Session on Real Parameter Optimization. S. Garcia, D. Molina, M. Lozano, F. Herrera - Journal of Heuristics, Volume 15, pp. 617-644, 2009. [http://sci2s.ugr.es/programacion/workshop/GarciaMolinaLozanoHerrera-JH2008.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-04&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|Analyzing Bandit-based Adaptive Operator Selection Mechanisms. Ãlvaro Fialho, Luis Da Costa, Marc Schoenauer and MichÃ©le Sebag. &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-01-14&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|SATzilla: Portfolio-based Algorithm Selection for SAT. L. Xu, F. Hutter, H. H. Hoos, K. Leyton-Brown - Journal of Artificial Intelligence Research, Volume 32, pp. 565-606, 2008. [http://www.jair.org/media/2490/live-2490-3923-jair.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2009-12-11&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|SATenstein: Automatically Building Local Search SAT Solvers From Components. Ashiqur R. KhudaBukhsh, Lin Xu, Holger H. Hoos and Kevin Leyton-Brown - Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 517-524, 2009. [http://www.cs.ubc.ca/labs/beta/Projects/SATenstein/SATenstein_ijcai.pdf]&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Other Previous Meetings==&lt;br /&gt;
&lt;br /&gt;
See [[Previous Optimization meetings | Minutes and agendas from previous meetings]].&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6176</id>
		<title>Optimization Group Meetings</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6176"/>
		<updated>2012-10-19T13:30:31Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: new literature session&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;You can subscribe to an [http://en.wikipedia.org/wiki/ICalendar iCalendar] of these meetings at http://iridia.ulb.ac.be/Calendars/publish.php/_NUC_Optimization.ics&lt;br /&gt;
&lt;br /&gt;
==Breakfast Meetings==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
Breakfast meetings are informal meetings where there is a general discussion or someone presents their work. And additional goal is to have breakfast together.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, and a short summary of what you are going to talk about.&lt;br /&gt;
# Add a new entry to the table below.&lt;br /&gt;
# Bring breakfast.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Breakfast Meetings ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;200&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Summary&lt;br /&gt;
|-&lt;br /&gt;
|2011-03-10&lt;br /&gt;
|Stefanie Kritzinger&lt;br /&gt;
| A Unified Framework for Routing Problems with Fixed Fleet Size&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-21&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
| Off-line vs. On-line Tuning: A Study on MAX-MIN Ant System for the TSP&lt;br /&gt;
|-&lt;br /&gt;
|2010-10-19&lt;br /&gt;
|Stefano Benedettini&lt;br /&gt;
| Experiments on Boolean Network Design by Local Search Algorithms.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-20&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
| The social learning strategies tournament, organized as part of the [http://www.intercult.su.se/cultaptation/ cultaptation project], and its results were described. No ideas about algorithm portfolios were discussed.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-??&lt;br /&gt;
|Renaud Lenne&lt;br /&gt;
| ???&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-04-29&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|The maximum clique problem, state of the art and ACO [http://dx.doi.org/10.1016/j.cor.2009.02.013] [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.80.2036&amp;amp;rep=rep1&amp;amp;type=pdf] [http://www710.univ-lyon1.fr/~csolnon/publications/rr-mai04.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-18&lt;br /&gt;
|Sabrina Oliveira&lt;br /&gt;
|Achieved results from the application of the Population Based Ant Colony Optimisation algorithm to TSP.&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-11&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|An overview of Container Loading Problems. &lt;br /&gt;
|-&lt;br /&gt;
| 2010-01-21&lt;br /&gt;
|Yuan, Zhi (Eric)&lt;br /&gt;
| Rice cooker vs. the idea of tuning. &lt;br /&gt;
|-&lt;br /&gt;
|2010-01-07&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|General discussion about the optimization group. &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Literature Sessions==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
The goal of the Literature Sessions is to examine and discuss&lt;br /&gt;
particularly interesting papers from the research literature. For each&lt;br /&gt;
session, one paper will be selected, there will be a short&lt;br /&gt;
presentation (10-15 minutes) about the contents, and a discussion will&lt;br /&gt;
ensue. Sessions will last around 40-45 minutes. Attendants should read&lt;br /&gt;
the paper before the session in order to have a productive discussion. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, a reference to the paper and the URL where it can be obtained. Also, attach the paper in PDF.&lt;br /&gt;
# Add a new entry to the table below. Use YYY-MM-DD (year-month-day) format for the date. Please add a complete bibliographic reference (you may find it in the homepages of the authors) and a hyperlink to a PDF (links to http://dx.doi.org are preferred).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Literature Sessions ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;180&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Paper discussed&lt;br /&gt;
|-&lt;br /&gt;
|2012-10-18&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
| Yuri Malitsky, Meinolf Sellmann: Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. CPAIOR 2012: 244-259 &lt;br /&gt;
http://dx.doi.org/10.1007/978-3-642-29828-8_16&lt;br /&gt;
|2012-10-12&lt;br /&gt;
| Tianjun Liao&lt;br /&gt;
|Bernd Bischl, Olaf Mersmann, Heike Trautmann, and Mike PreuÃŸ. 2012. Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference (GECCO 2012), Terence Soule (Ed.). ACM, New York, NY, USA, 313-320. DOI:[http://doi.acm.org/10.1145/2330163.2330209 10.1145/2330163.2330209]&lt;br /&gt;
&lt;br /&gt;
Olaf Mersmann, Bernd Bischl, Heike Trautmann, Mike Preuss, Claus Weihs, and GÃ¼nter Rudolph. 2011. Exploratory landscape analysis. In&lt;br /&gt;
Proceedings of the 13th annual conference on Genetic and evolutionary computation (GECCO 2011), Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 829-836. DOI:[http://doi.acm.org/10.1145/2001576.2001690 10.1145/2001576.2001690]&lt;br /&gt;
|-&lt;br /&gt;
|2012-04-19&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|E.K. Burke, M.R. Hyde, and G. Kendall. Grammatical Evolution of Local Search Heuristics. IEEE Transactions on Evolutionary Computation, 99, 2011. doi: 10.1109/TEVC.2011.2160401 [http://www.cs.nott.ac.uk/~mvh/papers/mvh-draft-ieeetec2011.pdf PDF] &lt;br /&gt;
|-&lt;br /&gt;
|2012-04-03&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|On the automatic discovery of variants of the NEH procedure for flow   shop scheduling using genetic programming. J A VÃ¡zquez-RodrÃ­guez and G Ochoa.Journal of the Operational Research Society (2011) 62, 381â€“396.   doi:[http://dx.doi.org/10.1057/jors.2010.132  10.1057/jors.2010.132]&lt;br /&gt;
|-&lt;br /&gt;
|2011-12-08&lt;br /&gt;
|Zhi Yuan&lt;br /&gt;
|Frank Hutter, Holger Hoos, and Kevin Leyton-Brown. Sequential Model-Based Optimization for General Algorithm Configuration. In Proceedings of Learning and Intelligent Optimization (LION 5), 2011. PDF: [http://www.cs.ubc.ca/~hutter/papers/11-LION5-SMAC.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2011-11-24&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|Ender Ã–zcan and Andrew J. Parkes. 2011. Policy matrix evolution for  generation of heuristics. In Proceedings of the 13th annual  conference on Genetic and evolutionary computation (GECCO 2011),  Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 2011-2018. DOI: [http://dx.doi.org/10.1145/2001576.2001846 10.1145/2001576.2001846]&lt;br /&gt;
|-&lt;br /&gt;
|2011-02-04&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
|HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms. By Christopher Nell, Chris Fawcett, Holger H. Hoos, and Kevin Leyton-Brown. [http://hal.cs.ubc.ca/pubs/NelEtAl11.pdf PDF]&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-17&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
|A. LaTorre, S. Muelas, and J.-M. PeÃ±a. A MOS-based dynamic memetic  differential evolution algorithm for continuous optimization: a  scalability test. Soft Computing. Special issue on Scalability of Evolutionary Algorithms and other Metaheuristics for Large Scale  Continuous Optimization Problems. DOI [http://dx.doi.org/10.1007/s00500-010-0646-3 10.1007/s00500-010-0646-3]&lt;br /&gt;
|-&lt;br /&gt;
|2010-11-10&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|A Rigorous Analysis of the Harmony Search Algorithm--How the Research Community can be misled by a &amp;quot;novel&amp;quot; Methodology. Dennis Weyland. International Journal of Applied Metaheuristic Computing, volume 1-2, April-June 2010, pages 50-60.  DOI: [http://dx.doi.org/10.4018/jamc.2010040104 10.4018/jamc.2010040104]&lt;br /&gt;
&lt;br /&gt;
Survival of the Fittest Algorithm or the Novelest Algorithm?: The Existence Reason of the Harmony Search Algorithm. Zong Woo Geem.&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-09-23&lt;br /&gt;
|Gianpiero Francesca&lt;br /&gt;
|Wenyin Gong, Ãlvaro Fialho and Zhihua Cai. Adaptive Strategy Selection in Differential Evolution. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 409-416. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/68/PDF/AOS-DE.pdf]&lt;br /&gt;
&lt;br /&gt;
Ãlvaro Fialho, Marc Schoenauer and Michele Sebag. Toward Comparison-based Adaptive Operator Selection. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 767-774. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/64/PDF/banditGECCO10.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-06-03&lt;br /&gt;
|Tianjun Liao &lt;br /&gt;
|Population-Based Algorithm Portfolios for Numerical Optimization. Peng, F. Tang, K.Chen, G.Yao, X. IEEE Transactions on Evolutionary Computation. DOI: [http://dx.doi.org/10.1109/TEVC.2010.2040183 10.1109/TEVC.2010.2040183] &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-07&lt;br /&gt;
|Zhi (Eric) Yuan&lt;br /&gt;
|Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. L. Xu, H.H. Hoos, K. Leyton-Brown. To appear at the Conference of the Association for the Advancement of Artificial Intelligence (AAAI-10), 2010. [http://ws.cs.ubc.ca/~kevinlb/pub.php?u=2010-AAAI-Hydra.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-04&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|A. Schaerf and L. Di Gaspero. [[:Image:ElPaCo_presentation.pdf|Slides of the tutorial  &amp;quot;An Overview of Local Search Software Tools&amp;quot;]] given at &amp;quot;Learning and Intelligent OptimizatioN (LION 2007)&amp;quot;, December 8-12, 2007, Trento, Italy.&lt;br /&gt;
&lt;br /&gt;
L. Di Gaspero and A. Schaerf. EASY LOCAL++: An object-oriented framework for ï¬‚exible design of local search algorithms. Software â€” Practice &amp;amp; Experience, 33(8):733â€“765, July 2003. [http://www.diegm.uniud.it/satt/papers/DiSc03.pdf]&lt;br /&gt;
&lt;br /&gt;
S. Cahon, N. Melab and T. El Ghazali. ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. Journal of Heuristics, 10(3):357-380, November 2004. [http://dx.doi.org/10.1023/B:HEUR.0000026900.92269.ec]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-19&lt;br /&gt;
|Sabrina M. de Oliveira&lt;br /&gt;
|A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Session on Real Parameter Optimization. S. Garcia, D. Molina, M. Lozano, F. Herrera - Journal of Heuristics, Volume 15, pp. 617-644, 2009. [http://sci2s.ugr.es/programacion/workshop/GarciaMolinaLozanoHerrera-JH2008.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-04&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|Analyzing Bandit-based Adaptive Operator Selection Mechanisms. Ãlvaro Fialho, Luis Da Costa, Marc Schoenauer and MichÃ©le Sebag. &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-01-14&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|SATzilla: Portfolio-based Algorithm Selection for SAT. L. Xu, F. Hutter, H. H. Hoos, K. Leyton-Brown - Journal of Artificial Intelligence Research, Volume 32, pp. 565-606, 2008. [http://www.jair.org/media/2490/live-2490-3923-jair.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2009-12-11&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|SATenstein: Automatically Building Local Search SAT Solvers From Components. Ashiqur R. KhudaBukhsh, Lin Xu, Holger H. Hoos and Kevin Leyton-Brown - Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 517-524, 2009. [http://www.cs.ubc.ca/labs/beta/Projects/SATenstein/SATenstein_ijcai.pdf]&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Other Previous Meetings==&lt;br /&gt;
&lt;br /&gt;
See [[Previous Optimization meetings | Minutes and agendas from previous meetings]].&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6164</id>
		<title>Optimization Group Meetings</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6164"/>
		<updated>2012-10-14T13:22:55Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: new literature session&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;You can subscribe to an [http://en.wikipedia.org/wiki/ICalendar iCalendar] of these meetings at http://iridia.ulb.ac.be/Calendars/publish.php/_NUC_Optimization.ics&lt;br /&gt;
&lt;br /&gt;
==Breakfast Meetings==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
Breakfast meetings are informal meetings where there is a general discussion or someone presents their work. And additional goal is to have breakfast together.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, and a short summary of what you are going to talk about.&lt;br /&gt;
# Add a new entry to the table below.&lt;br /&gt;
# Bring breakfast.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Breakfast Meetings ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;200&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Summary&lt;br /&gt;
|-&lt;br /&gt;
|2011-03-10&lt;br /&gt;
|Stefanie Kritzinger&lt;br /&gt;
| A Unified Framework for Routing Problems with Fixed Fleet Size&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-21&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
| Off-line vs. On-line Tuning: A Study on MAX-MIN Ant System for the TSP&lt;br /&gt;
|-&lt;br /&gt;
|2010-10-19&lt;br /&gt;
|Stefano Benedettini&lt;br /&gt;
| Experiments on Boolean Network Design by Local Search Algorithms.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-20&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
| The social learning strategies tournament, organized as part of the [http://www.intercult.su.se/cultaptation/ cultaptation project], and its results were described. No ideas about algorithm portfolios were discussed.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-??&lt;br /&gt;
|Renaud Lenne&lt;br /&gt;
| ???&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-04-29&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|The maximum clique problem, state of the art and ACO [http://dx.doi.org/10.1016/j.cor.2009.02.013] [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.80.2036&amp;amp;rep=rep1&amp;amp;type=pdf] [http://www710.univ-lyon1.fr/~csolnon/publications/rr-mai04.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-18&lt;br /&gt;
|Sabrina Oliveira&lt;br /&gt;
|Achieved results from the application of the Population Based Ant Colony Optimisation algorithm to TSP.&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-11&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|An overview of Container Loading Problems. &lt;br /&gt;
|-&lt;br /&gt;
| 2010-01-21&lt;br /&gt;
|Yuan, Zhi (Eric)&lt;br /&gt;
| Rice cooker vs. the idea of tuning. &lt;br /&gt;
|-&lt;br /&gt;
|2010-01-07&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|General discussion about the optimization group. &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Literature Sessions==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
The goal of the Literature Sessions is to examine and discuss&lt;br /&gt;
particularly interesting papers from the research literature. For each&lt;br /&gt;
session, one paper will be selected, there will be a short&lt;br /&gt;
presentation (10-15 minutes) about the contents, and a discussion will&lt;br /&gt;
ensue. Sessions will last around 40-45 minutes. Attendants should read&lt;br /&gt;
the paper before the session in order to have a productive discussion. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Book a room (ask Muriel).&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, a reference to the paper and the URL where it can be obtained. Also, attach the paper in PDF.&lt;br /&gt;
# Add a new entry to the table below. Use YYY-MM-DD (year-month-day) format for the date. Please add a complete bibliographic reference (you may find it in the homepages of the authors) and a hyperlink to a PDF (links to http://dx.doi.org are preferred).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Literature Sessions ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;180&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Paper discussed&lt;br /&gt;
|-&lt;br /&gt;
|2012-10-12&lt;br /&gt;
| Tianjun Liao&lt;br /&gt;
|Bernd Bischl, Olaf Mersmann, Heike Trautmann, and Mike PreuÃŸ. 2012. Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference (GECCO 2012), Terence Soule (Ed.). ACM, New York, NY, USA, 313-320. DOI:[http://doi.acm.org/10.1145/2330163.2330209 10.1145/2330163.2330209]&lt;br /&gt;
&lt;br /&gt;
Olaf Mersmann, Bernd Bischl, Heike Trautmann, Mike Preuss, Claus Weihs, and GÃ¼nter Rudolph. 2011. Exploratory landscape analysis. In&lt;br /&gt;
Proceedings of the 13th annual conference on Genetic and evolutionary computation (GECCO 2011), Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 829-836. DOI:[http://doi.acm.org/10.1145/2001576.2001690 10.1145/2001576.2001690]&lt;br /&gt;
|-&lt;br /&gt;
|2012-04-19&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|E.K. Burke, M.R. Hyde, and G. Kendall. Grammatical Evolution of Local Search Heuristics. IEEE Transactions on Evolutionary Computation, 99, 2011. doi: 10.1109/TEVC.2011.2160401 [http://www.cs.nott.ac.uk/~mvh/papers/mvh-draft-ieeetec2011.pdf PDF] &lt;br /&gt;
|-&lt;br /&gt;
|2012-04-03&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|On the automatic discovery of variants of the NEH procedure for flow   shop scheduling using genetic programming. J A VÃ¡zquez-RodrÃ­guez and G Ochoa.Journal of the Operational Research Society (2011) 62, 381â€“396.   doi:[http://dx.doi.org/10.1057/jors.2010.132  10.1057/jors.2010.132]&lt;br /&gt;
|-&lt;br /&gt;
|2011-12-08&lt;br /&gt;
|Zhi Yuan&lt;br /&gt;
|Frank Hutter, Holger Hoos, and Kevin Leyton-Brown. Sequential Model-Based Optimization for General Algorithm Configuration. In Proceedings of Learning and Intelligent Optimization (LION 5), 2011. PDF: [http://www.cs.ubc.ca/~hutter/papers/11-LION5-SMAC.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2011-11-24&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|Ender Ã–zcan and Andrew J. Parkes. 2011. Policy matrix evolution for  generation of heuristics. In Proceedings of the 13th annual  conference on Genetic and evolutionary computation (GECCO 2011),  Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 2011-2018. DOI: [http://dx.doi.org/10.1145/2001576.2001846 10.1145/2001576.2001846]&lt;br /&gt;
|-&lt;br /&gt;
|2011-02-04&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
|HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms. By Christopher Nell, Chris Fawcett, Holger H. Hoos, and Kevin Leyton-Brown. [http://hal.cs.ubc.ca/pubs/NelEtAl11.pdf PDF]&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-17&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
|A. LaTorre, S. Muelas, and J.-M. PeÃ±a. A MOS-based dynamic memetic  differential evolution algorithm for continuous optimization: a  scalability test. Soft Computing. Special issue on Scalability of Evolutionary Algorithms and other Metaheuristics for Large Scale  Continuous Optimization Problems. DOI [http://dx.doi.org/10.1007/s00500-010-0646-3 10.1007/s00500-010-0646-3]&lt;br /&gt;
|-&lt;br /&gt;
|2010-11-10&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|A Rigorous Analysis of the Harmony Search Algorithm--How the Research Community can be misled by a &amp;quot;novel&amp;quot; Methodology. Dennis Weyland. International Journal of Applied Metaheuristic Computing, volume 1-2, April-June 2010, pages 50-60.  DOI: [http://dx.doi.org/10.4018/jamc.2010040104 10.4018/jamc.2010040104]&lt;br /&gt;
&lt;br /&gt;
Survival of the Fittest Algorithm or the Novelest Algorithm?: The Existence Reason of the Harmony Search Algorithm. Zong Woo Geem.&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-09-23&lt;br /&gt;
|Gianpiero Francesca&lt;br /&gt;
|Wenyin Gong, Ãlvaro Fialho and Zhihua Cai. Adaptive Strategy Selection in Differential Evolution. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 409-416. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/68/PDF/AOS-DE.pdf]&lt;br /&gt;
&lt;br /&gt;
Ãlvaro Fialho, Marc Schoenauer and Michele Sebag. Toward Comparison-based Adaptive Operator Selection. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 767-774. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/64/PDF/banditGECCO10.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-06-03&lt;br /&gt;
|Tianjun Liao &lt;br /&gt;
|Population-Based Algorithm Portfolios for Numerical Optimization. Peng, F. Tang, K.Chen, G.Yao, X. IEEE Transactions on Evolutionary Computation. DOI: [http://dx.doi.org/10.1109/TEVC.2010.2040183 10.1109/TEVC.2010.2040183] &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-07&lt;br /&gt;
|Zhi (Eric) Yuan&lt;br /&gt;
|Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. L. Xu, H.H. Hoos, K. Leyton-Brown. To appear at the Conference of the Association for the Advancement of Artificial Intelligence (AAAI-10), 2010. [http://ws.cs.ubc.ca/~kevinlb/pub.php?u=2010-AAAI-Hydra.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-04&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|A. Schaerf and L. Di Gaspero. [[:Image:ElPaCo_presentation.pdf|Slides of the tutorial  &amp;quot;An Overview of Local Search Software Tools&amp;quot;]] given at &amp;quot;Learning and Intelligent OptimizatioN (LION 2007)&amp;quot;, December 8-12, 2007, Trento, Italy.&lt;br /&gt;
&lt;br /&gt;
L. Di Gaspero and A. Schaerf. EASY LOCAL++: An object-oriented framework for ï¬‚exible design of local search algorithms. Software â€” Practice &amp;amp; Experience, 33(8):733â€“765, July 2003. [http://www.diegm.uniud.it/satt/papers/DiSc03.pdf]&lt;br /&gt;
&lt;br /&gt;
S. Cahon, N. Melab and T. El Ghazali. ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. Journal of Heuristics, 10(3):357-380, November 2004. [http://dx.doi.org/10.1023/B:HEUR.0000026900.92269.ec]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-19&lt;br /&gt;
|Sabrina M. de Oliveira&lt;br /&gt;
|A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Session on Real Parameter Optimization. S. Garcia, D. Molina, M. Lozano, F. Herrera - Journal of Heuristics, Volume 15, pp. 617-644, 2009. [http://sci2s.ugr.es/programacion/workshop/GarciaMolinaLozanoHerrera-JH2008.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-04&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|Analyzing Bandit-based Adaptive Operator Selection Mechanisms. Ãlvaro Fialho, Luis Da Costa, Marc Schoenauer and MichÃ©le Sebag. &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-01-14&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|SATzilla: Portfolio-based Algorithm Selection for SAT. L. Xu, F. Hutter, H. H. Hoos, K. Leyton-Brown - Journal of Artificial Intelligence Research, Volume 32, pp. 565-606, 2008. [http://www.jair.org/media/2490/live-2490-3923-jair.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2009-12-11&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|SATenstein: Automatically Building Local Search SAT Solvers From Components. Ashiqur R. KhudaBukhsh, Lin Xu, Holger H. Hoos and Kevin Leyton-Brown - Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 517-524, 2009. [http://www.cs.ubc.ca/labs/beta/Projects/SATenstein/SATenstein_ijcai.pdf]&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Other Previous Meetings==&lt;br /&gt;
&lt;br /&gt;
See [[Previous Optimization meetings | Minutes and agendas from previous meetings]].&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Tuning_your_algorithm_with_irace_on_the_IRIDIA_cluster&amp;diff=6162</id>
		<title>Tuning your algorithm with irace on the IRIDIA cluster</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Tuning_your_algorithm_with_irace_on_the_IRIDIA_cluster&amp;diff=6162"/>
		<updated>2012-10-12T13:01:46Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: actually, multicore is not needed for the cluster&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;You should '''really''' read the [http://iridia.ulb.ac.be/irace/files/README README] file, and take a look on the ''examples'' and ''templates'' in the irace directory. Or you can just follow this walk-through for a quick start but you will miss many options and configuration possibilities.&lt;br /&gt;
You can start from this example and then adapt it to the algorithm you want to configure.&lt;br /&gt;
&lt;br /&gt;
== Installation ==&lt;br /&gt;
&lt;br /&gt;
First of all, you have to install the [http://iridia.ulb.ac.be/irace/ irace] R package on majorana:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
$ ssh majorana&lt;br /&gt;
$ R&lt;br /&gt;
&amp;gt; install.packages(&amp;quot;irace&amp;quot;)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
select the belgian mirror and test the installation with&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
&amp;gt; library(irace)&lt;br /&gt;
&amp;gt; CTRL+d&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Once installed, exit R, and add at the end of your .bash_profile or .bashrc or .profile the local R package folder where irace was installed (e.g. '~/R/x86_64-redhat-linux-gnu-library/2.15/irace/'):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
export IRACE_HOME=~/R/x86_64-redhat-linux-gnu-library/2.15/irace/&lt;br /&gt;
# export PATH=$IRACE_HOME/bin/:$PATH&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and run:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
source ~/.bash_profile&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
to load the changes without the need to logout an login again.&lt;br /&gt;
&lt;br /&gt;
== The algorithm to be tuned ==&lt;br /&gt;
&lt;br /&gt;
You have to create a directory where you do the tuning&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
$ mkdir ~/tuning&lt;br /&gt;
$ cd ~/tuning&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
you copy here the program you are tuning, in this case it's just a simple C program&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
$ cat &amp;gt; algo.c&lt;br /&gt;
#include &amp;lt;stdio.h&amp;gt;&lt;br /&gt;
int main(int argc, char **argv) {&lt;br /&gt;
    // call me with ./algo -i instance --whatever &amp;lt;integer_parameter&amp;gt;&lt;br /&gt;
    printf(&amp;quot;%d\n&amp;quot;, atoi(argv[4]));&lt;br /&gt;
}&lt;br /&gt;
CTRL+d&lt;br /&gt;
$ make algo&lt;br /&gt;
cc     algo.c   -o algo&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Prepare for the tuning ==&lt;br /&gt;
&lt;br /&gt;
Copy some of the template and example files in the current (tuning) directory&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
$ cd ~/tuning&lt;br /&gt;
$ cp $IRACE_HOME/templates/tune-conf.tmpl tune-conf&lt;br /&gt;
$ cp $IRACE_HOME/templates/hook-run.tmpl hook-run&lt;br /&gt;
$ cp $IRACE_HOME/examples/mpi/tune-main-cluster-mpi tune-main-cluster-mpi&lt;br /&gt;
$ mkdir temp&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
change the EXE variable in hook-run like below:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
EXE=~/tuning/algo&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
create some dummy instances&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
$ mkdir Instances&lt;br /&gt;
$ for i in {1..100}; do touch Instances/$i; done&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
create a parameters file&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
$ cat &amp;gt; parameters.txt&lt;br /&gt;
dummy_par        &amp;quot;--whatever &amp;quot;        i   (1, 100)&lt;br /&gt;
CTRL+d&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
you '''should''' look in the examples/acotsp directory for a more complete example...&lt;br /&gt;
&lt;br /&gt;
== Tuning time! ==&lt;br /&gt;
&lt;br /&gt;
Now you are ready to run irace:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
$ ./tune-main-cluster-mpi $IRACE_HOME/bin temp --parallel 10&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
take a look at tune-main-cluster-mpi and change cluster queues and qsub parameters to better suit your needs.&lt;br /&gt;
If you have issues with your code or irace try to run it by specifying a debug level (e.g. 1, or 2, or more):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
$ ./tune-main-cluster-mpi $IRACE_HOME/bin temp --parallel 10 --debug-level 1&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
You can check if the job is waiting, running, or complete with the qstat command. In the directory ~/tuning/temp you will find an irace-$PID.stdout and an irace-$PID.stderr file. &lt;br /&gt;
In the stdout file you should have an output like the one below:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
-catch_rsh /opt/gridengine/default/spool/compute-3-14/active_jobs/7718068.1/pe_hostfile&lt;br /&gt;
compute-3-14&lt;br /&gt;
compute-3-14&lt;br /&gt;
compute-3-14&lt;br /&gt;
compute-3-14&lt;br /&gt;
compute-3-14&lt;br /&gt;
compute-3-14&lt;br /&gt;
compute-3-14&lt;br /&gt;
compute-3-14&lt;br /&gt;
compute-3-14&lt;br /&gt;
compute-3-14&lt;br /&gt;
compute-3-14&lt;br /&gt;
irace	version 1.0.560 &lt;br /&gt;
&lt;br /&gt;
irace: An implementation in R of Iterated Race&lt;br /&gt;
Copyright (C) 2010, 2011&lt;br /&gt;
Manuel Lopez-Ibanez     &amp;lt;manuel.lopez-ibanez@ulb.ac.be&amp;gt;&lt;br /&gt;
Jeremie Dubois-Lacoste  &amp;lt;jeremie.dubois-lacoste@ulb.ac.be&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This is free software, and you are welcome to redistribute it under certain&lt;br /&gt;
conditions.  See the GNU General Public License for details. There is NO   &lt;br /&gt;
warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.&lt;br /&gt;
&lt;br /&gt;
Warning: A default configuration file ' ./tune-conf ' has been found and will be read&lt;br /&gt;
Note: Reading configuration file ' ./tune-conf '....... done!&lt;br /&gt;
###   CONFIGURATION STATE TO BE USED&lt;br /&gt;
configurationFile &amp;lt;- &amp;quot;./tune-conf&amp;quot; &lt;br /&gt;
parameterFile &amp;lt;- &amp;quot;/home/mascia/tuning/./parameters.txt&amp;quot; &lt;br /&gt;
execDir &amp;lt;- &amp;quot;temp&amp;quot; &lt;br /&gt;
logFile &amp;lt;- &amp;quot;./irace.Rdata&amp;quot; &lt;br /&gt;
instances &amp;lt;- &amp;quot;/home/mascia/tuning/./Instances//1&amp;quot; &lt;br /&gt;
instanceDir &amp;lt;- &amp;quot;/home/mascia/tuning/./Instances&amp;quot; &lt;br /&gt;
instanceFile &amp;lt;- &amp;quot;&amp;quot; &lt;br /&gt;
candidatesFile &amp;lt;- &amp;quot;&amp;quot; &lt;br /&gt;
hookRun &amp;lt;- &amp;quot;/home/mascia/tuning/./hook-run&amp;quot; &lt;br /&gt;
expName &amp;lt;- &amp;quot;Experiment Name&amp;quot; &lt;br /&gt;
expDescription &amp;lt;- &amp;quot;Experiment Description&amp;quot; &lt;br /&gt;
maxExperiments &amp;lt;- 1000 &lt;br /&gt;
timeBudget &amp;lt;- 0 &lt;br /&gt;
timeEstimate &amp;lt;- 0 &lt;br /&gt;
digits &amp;lt;- 4 &lt;br /&gt;
debugLevel &amp;lt;- 0 &lt;br /&gt;
nbIterations &amp;lt;- 0 &lt;br /&gt;
nbExperimentsPerIteration &amp;lt;- 0 &lt;br /&gt;
sampleInstances &amp;lt;- TRUE &lt;br /&gt;
testType &amp;lt;- &amp;quot;friedman&amp;quot; &lt;br /&gt;
firstTest &amp;lt;- 5 &lt;br /&gt;
eachTest &amp;lt;- 1 &lt;br /&gt;
minNbSurvival &amp;lt;- 0 &lt;br /&gt;
nbCandidates &amp;lt;- 0 &lt;br /&gt;
mu &amp;lt;- 5 &lt;br /&gt;
seed &amp;lt;- &amp;quot;NA&amp;quot; &lt;br /&gt;
parallel &amp;lt;- 10 &lt;br /&gt;
sgeCluster &amp;lt;- FALSE &lt;br /&gt;
mpi &amp;lt;- TRUE &lt;br /&gt;
softRestart &amp;lt;- TRUE &lt;br /&gt;
### end of configuration&lt;br /&gt;
# 2012-03-02 14:41:13 CET: INITIALIZATION &lt;br /&gt;
# nbIterations: 2&lt;br /&gt;
# minSurvival: 2&lt;br /&gt;
# nbParameters: 1&lt;br /&gt;
# Seed: 1110701261&lt;br /&gt;
# 2012-03-02 14:41:13 CET: ITERATION 1 of 2&lt;br /&gt;
# experimentsUsedSoFar: 0&lt;br /&gt;
# timeUsedSoFar: 0&lt;br /&gt;
# timeEstimate: 0&lt;br /&gt;
# remainingBudget: 1000&lt;br /&gt;
# currentBudget: 500&lt;br /&gt;
# nbCandidates: 83&lt;br /&gt;
&lt;br /&gt;
Racing methods for the selection of the best&lt;br /&gt;
Copyright (C) 2003 Mauro Birattari&lt;br /&gt;
This software comes with ABSOLUTELY NO WARRANTY&lt;br /&gt;
&lt;br /&gt;
Race name:                                                      Experiment Name &lt;br /&gt;
Number of candidates:                                                        83 &lt;br /&gt;
Number of available tasks:                                                 1000 &lt;br /&gt;
Max number of experiments:                                                  500 &lt;br /&gt;
Statistical test:                                                 Friedman test &lt;br /&gt;
Tasks seen before discarding:                                                 5 &lt;br /&gt;
Initialization function:                                                     ok &lt;br /&gt;
 &lt;br /&gt;
 	Experiment Description &lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
                            Markers:                           &lt;br /&gt;
                               x No test is performed.         &lt;br /&gt;
                               - The test is performed and     &lt;br /&gt;
                                 some candidates are discarded.&lt;br /&gt;
                               = The test is performed but     &lt;br /&gt;
                                 no candidate is discarded.    &lt;br /&gt;
                                                               &lt;br /&gt;
                                                               &lt;br /&gt;
+-+-----------+-----------+-----------+-----------+-----------+&lt;br /&gt;
| |       Task|      Alive|       Best|  Mean best| Exp so far|&lt;br /&gt;
+-+-----------+-----------+-----------+-----------+-----------+&lt;br /&gt;
	10 slaves are spawned successfully. 0 failed.&lt;br /&gt;
master  (rank 0 , comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
slave1  (rank 1 , comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
slave2  (rank 2 , comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
slave3  (rank 3 , comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
slave4  (rank 4 , comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
slave5  (rank 5 , comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
slave6  (rank 6 , comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
slave7  (rank 7 , comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
slave8  (rank 8 , comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
slave9  (rank 9 , comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
slave10 (rank 10, comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
|x|          1|         83|          7|          1|         83|&lt;br /&gt;
|x|          2|         83|          7|          1|        166|&lt;br /&gt;
|x|          3|         83|          7|          1|        249|&lt;br /&gt;
|x|          4|         83|          7|          1|        332|&lt;br /&gt;
|-|          5|          1|          7|          1|        415|&lt;br /&gt;
+-+-----------+-----------+-----------+-----------+-----------+&lt;br /&gt;
&lt;br /&gt;
Selected candidate:           7	mean value:          1&lt;br /&gt;
&lt;br /&gt;
Description of the selected candidate:&lt;br /&gt;
[1] 1&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
# Elite candidates:&lt;br /&gt;
  dummy_par&lt;br /&gt;
7         1&lt;br /&gt;
# 2012-03-02 14:41:17 CET: ITERATION 2 of 2&lt;br /&gt;
# experimentsUsedSoFar: 415&lt;br /&gt;
# timeUsedSoFar: 0&lt;br /&gt;
# timeEstimate: 0&lt;br /&gt;
# remainingBudget: 585&lt;br /&gt;
# currentBudget: 585&lt;br /&gt;
# nbCandidates: 83&lt;br /&gt;
# Computing similarity of candidates .................................................................................. DONE&lt;br /&gt;
# 2012-03-02 14:41:21 CET: Soft restart: 7 85 86 87 88 89 90 91 92 93 94 95 96 98 100 102 103 104 105 108 109 110 111 112 113 115 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 135 136 138 139 140 142 145 146 147 148 149 150 152 153 154 155 156 158 159 160 161 163 164 84 97 99 101 106 107 114 116 134 137 141 143 144 151 157 162 165 !&lt;br /&gt;
&lt;br /&gt;
Racing methods for the selection of the best&lt;br /&gt;
Copyright (C) 2003 Mauro Birattari&lt;br /&gt;
This software comes with ABSOLUTELY NO WARRANTY&lt;br /&gt;
&lt;br /&gt;
Race name:                                                      Experiment Name &lt;br /&gt;
Number of candidates:                                                        83 &lt;br /&gt;
Number of available tasks:                                                 1000 &lt;br /&gt;
Max number of experiments:                                                  585 &lt;br /&gt;
Statistical test:                                                 Friedman test &lt;br /&gt;
Tasks seen before discarding:                                                 5 &lt;br /&gt;
Initialization function:                                                     ok &lt;br /&gt;
 &lt;br /&gt;
 	Experiment Description &lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
                            Markers:                           &lt;br /&gt;
                               x No test is performed.         &lt;br /&gt;
                               - The test is performed and     &lt;br /&gt;
                                 some candidates are discarded.&lt;br /&gt;
                               = The test is performed but     &lt;br /&gt;
                                 no candidate is discarded.    &lt;br /&gt;
                                                               &lt;br /&gt;
                                                               &lt;br /&gt;
+-+-----------+-----------+-----------+-----------+-----------+&lt;br /&gt;
| |       Task|      Alive|       Best|  Mean best| Exp so far|&lt;br /&gt;
+-+-----------+-----------+-----------+-----------+-----------+&lt;br /&gt;
|x|          1|         83|          1|          1|         83|&lt;br /&gt;
|x|          2|         83|          1|          1|        166|&lt;br /&gt;
|x|          3|         83|          1|          1|        249|&lt;br /&gt;
|x|          4|         83|          1|          1|        332|&lt;br /&gt;
|-|          5|         59|          1|          1|        415|&lt;br /&gt;
|=|          6|         59|          1|          1|        474|&lt;br /&gt;
|=|          7|         59|          1|          1|        533|&lt;br /&gt;
+-+-----------+-----------+-----------+-----------+-----------+&lt;br /&gt;
&lt;br /&gt;
Selected candidate:           1	mean value:          1&lt;br /&gt;
&lt;br /&gt;
Description of the selected candidate:&lt;br /&gt;
[1] 1&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
# Elite candidates:&lt;br /&gt;
   dummy_par&lt;br /&gt;
7          1&lt;br /&gt;
84         1&lt;br /&gt;
# 2012-03-02 14:41:25 CET: Limit of iterations reached&lt;br /&gt;
# 2012-03-02 14:41:25 CET: ITERATION 3 of 3&lt;br /&gt;
# experimentsUsedSoFar: 948&lt;br /&gt;
# timeUsedSoFar: 0&lt;br /&gt;
# timeEstimate: 0&lt;br /&gt;
# remainingBudget: 52&lt;br /&gt;
# currentBudget: 52&lt;br /&gt;
# nbCandidates: 6&lt;br /&gt;
# Computing similarity of candidates ..... DONE&lt;br /&gt;
# 2012-03-02 14:41:25 CET: Soft restart: 7 84 166 167 168 169 !&lt;br /&gt;
&lt;br /&gt;
Racing methods for the selection of the best&lt;br /&gt;
Copyright (C) 2003 Mauro Birattari&lt;br /&gt;
This software comes with ABSOLUTELY NO WARRANTY&lt;br /&gt;
&lt;br /&gt;
Race name:                                                      Experiment Name &lt;br /&gt;
Number of candidates:                                                         6 &lt;br /&gt;
Number of available tasks:                                                 1000 &lt;br /&gt;
Max number of experiments:                                                   52 &lt;br /&gt;
Statistical test:                                                 Friedman test &lt;br /&gt;
Tasks seen before discarding:                                                 5 &lt;br /&gt;
Initialization function:                                                     ok &lt;br /&gt;
 &lt;br /&gt;
 	Experiment Description &lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
                            Markers:                           &lt;br /&gt;
                               x No test is performed.         &lt;br /&gt;
                               - The test is performed and     &lt;br /&gt;
                                 some candidates are discarded.&lt;br /&gt;
                               = The test is performed but     &lt;br /&gt;
                                 no candidate is discarded.    &lt;br /&gt;
                                                               &lt;br /&gt;
                                                               &lt;br /&gt;
+-+-----------+-----------+-----------+-----------+-----------+&lt;br /&gt;
| |       Task|      Alive|       Best|  Mean best| Exp so far|&lt;br /&gt;
+-+-----------+-----------+-----------+-----------+-----------+&lt;br /&gt;
|x|          1|          6|          1|          1|          6|&lt;br /&gt;
|x|          2|          6|          1|          1|         12|&lt;br /&gt;
|x|          3|          6|          1|          1|         18|&lt;br /&gt;
|x|          4|          6|          1|          1|         24|&lt;br /&gt;
|-|          5|          2|          1|          1|         30|&lt;br /&gt;
+-+-----------+-----------+-----------+-----------+-----------+&lt;br /&gt;
&lt;br /&gt;
Selected candidate:           1	mean value:          1&lt;br /&gt;
&lt;br /&gt;
Description of the selected candidate:&lt;br /&gt;
[1] 1&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
# Elite candidates:&lt;br /&gt;
   dummy_par&lt;br /&gt;
7          1&lt;br /&gt;
84         1&lt;br /&gt;
# 2012-03-02 14:41:25 CET: Limit of iterations reached&lt;br /&gt;
# 2012-03-02 14:41:25 CET: Stopped because there is no enough budget to sample new candidates&lt;br /&gt;
# number of elites: 2&lt;br /&gt;
# indexIteration: 4&lt;br /&gt;
# mu: 5&lt;br /&gt;
# nbIterations: 4&lt;br /&gt;
# experimentsUsedSoFar: 978&lt;br /&gt;
# timeUsedSoFar: 0&lt;br /&gt;
# timeEstimate: 0&lt;br /&gt;
# remainingBudget: 22&lt;br /&gt;
# currentBudget: 22&lt;br /&gt;
# nbCandidates: 2&lt;br /&gt;
# Best candidates&lt;br /&gt;
   dummy_par&lt;br /&gt;
7          1&lt;br /&gt;
84         1&lt;br /&gt;
# Best candidates (as commandlines)&lt;br /&gt;
         command&lt;br /&gt;
7   --whatever 1&lt;br /&gt;
84  --whatever 1&lt;br /&gt;
# Finalize MPI...&lt;br /&gt;
[1] &amp;quot;Exiting Rmpi. Rmpi cannot be used unless relaunching R.&amp;quot;&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Tuning_your_algorithm_with_irace_on_the_IRIDIA_cluster&amp;diff=6128</id>
		<title>Tuning your algorithm with irace on the IRIDIA cluster</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Tuning_your_algorithm_with_irace_on_the_IRIDIA_cluster&amp;diff=6128"/>
		<updated>2012-09-26T14:07:11Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: update example&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;You should '''really''' read the [http://iridia.ulb.ac.be/irace/files/README README] file, and take a look on the ''examples'' and ''templates'' in the irace directory. Or you can just follow this walk-through for a quick start but you will miss many options and configuration possibilities.&lt;br /&gt;
You can start from this example and then adapt it to the algorithm you want to configure.&lt;br /&gt;
&lt;br /&gt;
== Installation ==&lt;br /&gt;
&lt;br /&gt;
First of all, you have to install the [http://iridia.ulb.ac.be/irace/ irace] R package on majorana:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
$ ssh majorana&lt;br /&gt;
$ R&lt;br /&gt;
&amp;gt; install.packages(&amp;quot;multicore&amp;quot;)&lt;br /&gt;
&amp;gt; install.packages(&amp;quot;irace&amp;quot;)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
select the belgian mirror and test the installation with&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
&amp;gt; library(irace)&lt;br /&gt;
&amp;gt; CTRL+d&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Once installed, exit R, and add at the end of your .bash_profile or .bashrc or .profile the local R package folder where irace was installed (e.g. '~/R/x86_64-redhat-linux-gnu-library/2.15/irace/'):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
export IRACE_HOME=~/R/x86_64-redhat-linux-gnu-library/2.15/irace/&lt;br /&gt;
# export PATH=$IRACE_HOME/bin/:$PATH&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and run:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
source ~/.bash_profile&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
to load the changes without the need to logout an login again.&lt;br /&gt;
&lt;br /&gt;
== The algorithm to be tuned ==&lt;br /&gt;
&lt;br /&gt;
You have to create a directory where you do the tuning&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
$ mkdir ~/tuning&lt;br /&gt;
$ cd ~/tuning&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
you copy here the program you are tuning, in this case it's just a simple C program&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
$ cat &amp;gt; algo.c&lt;br /&gt;
#include &amp;lt;stdio.h&amp;gt;&lt;br /&gt;
int main(int argc, char **argv) {&lt;br /&gt;
    // call me with ./algo -i instance --whatever &amp;lt;integer_parameter&amp;gt;&lt;br /&gt;
    printf(&amp;quot;%d\n&amp;quot;, atoi(argv[4]));&lt;br /&gt;
}&lt;br /&gt;
CTRL+d&lt;br /&gt;
$ make algo&lt;br /&gt;
cc     algo.c   -o algo&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Prepare for the tuning ==&lt;br /&gt;
&lt;br /&gt;
Copy some of the template and example files in the current (tuning) directory&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
$ cd ~/tuning&lt;br /&gt;
$ cp $IRACE_HOME/templates/tune-conf.tmpl tune-conf&lt;br /&gt;
$ cp $IRACE_HOME/templates/hook-run.tmpl hook-run&lt;br /&gt;
$ cp $IRACE_HOME/examples/mpi/tune-main-cluster-mpi tune-main-cluster-mpi&lt;br /&gt;
$ mkdir temp&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
change the EXE variable in hook-run like below:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
EXE=~/tuning/algo&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
create some dummy instances&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
$ mkdir Instances&lt;br /&gt;
$ for i in {1..100}; do touch Instances/$i; done&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
create a parameters file&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
$ cat &amp;gt; parameters.txt&lt;br /&gt;
dummy_par        &amp;quot;--whatever &amp;quot;        i   (1, 100)&lt;br /&gt;
CTRL+d&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
you '''should''' look in the examples/acotsp directory for a more complete example...&lt;br /&gt;
&lt;br /&gt;
== Tuning time! ==&lt;br /&gt;
&lt;br /&gt;
Now you are ready to run irace:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
$ ./tune-main-cluster-mpi $IRACE_HOME/bin temp --parallel 10&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
take a look at tune-main-cluster-mpi and change cluster queues and qsub parameters to better suit your needs.&lt;br /&gt;
If you have issues with your code or irace try to run it by specifying a debug level (e.g. 1, or 2, or more):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
$ ./tune-main-cluster-mpi $IRACE_HOME/bin temp --parallel 10 --debug-level 1&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
You can check if the job is waiting, running, or complete with the qstat command. In the directory ~/tuning/temp you will find an irace-$PID.stdout and an irace-$PID.stderr file. &lt;br /&gt;
In the stdout file you should have an output like the one below:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
-catch_rsh /opt/gridengine/default/spool/compute-3-14/active_jobs/7718068.1/pe_hostfile&lt;br /&gt;
compute-3-14&lt;br /&gt;
compute-3-14&lt;br /&gt;
compute-3-14&lt;br /&gt;
compute-3-14&lt;br /&gt;
compute-3-14&lt;br /&gt;
compute-3-14&lt;br /&gt;
compute-3-14&lt;br /&gt;
compute-3-14&lt;br /&gt;
compute-3-14&lt;br /&gt;
compute-3-14&lt;br /&gt;
compute-3-14&lt;br /&gt;
irace	version 1.0.560 &lt;br /&gt;
&lt;br /&gt;
irace: An implementation in R of Iterated Race&lt;br /&gt;
Copyright (C) 2010, 2011&lt;br /&gt;
Manuel Lopez-Ibanez     &amp;lt;manuel.lopez-ibanez@ulb.ac.be&amp;gt;&lt;br /&gt;
Jeremie Dubois-Lacoste  &amp;lt;jeremie.dubois-lacoste@ulb.ac.be&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This is free software, and you are welcome to redistribute it under certain&lt;br /&gt;
conditions.  See the GNU General Public License for details. There is NO   &lt;br /&gt;
warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.&lt;br /&gt;
&lt;br /&gt;
Warning: A default configuration file ' ./tune-conf ' has been found and will be read&lt;br /&gt;
Note: Reading configuration file ' ./tune-conf '....... done!&lt;br /&gt;
###   CONFIGURATION STATE TO BE USED&lt;br /&gt;
configurationFile &amp;lt;- &amp;quot;./tune-conf&amp;quot; &lt;br /&gt;
parameterFile &amp;lt;- &amp;quot;/home/mascia/tuning/./parameters.txt&amp;quot; &lt;br /&gt;
execDir &amp;lt;- &amp;quot;temp&amp;quot; &lt;br /&gt;
logFile &amp;lt;- &amp;quot;./irace.Rdata&amp;quot; &lt;br /&gt;
instances &amp;lt;- &amp;quot;/home/mascia/tuning/./Instances//1&amp;quot; &lt;br /&gt;
instanceDir &amp;lt;- &amp;quot;/home/mascia/tuning/./Instances&amp;quot; &lt;br /&gt;
instanceFile &amp;lt;- &amp;quot;&amp;quot; &lt;br /&gt;
candidatesFile &amp;lt;- &amp;quot;&amp;quot; &lt;br /&gt;
hookRun &amp;lt;- &amp;quot;/home/mascia/tuning/./hook-run&amp;quot; &lt;br /&gt;
expName &amp;lt;- &amp;quot;Experiment Name&amp;quot; &lt;br /&gt;
expDescription &amp;lt;- &amp;quot;Experiment Description&amp;quot; &lt;br /&gt;
maxExperiments &amp;lt;- 1000 &lt;br /&gt;
timeBudget &amp;lt;- 0 &lt;br /&gt;
timeEstimate &amp;lt;- 0 &lt;br /&gt;
digits &amp;lt;- 4 &lt;br /&gt;
debugLevel &amp;lt;- 0 &lt;br /&gt;
nbIterations &amp;lt;- 0 &lt;br /&gt;
nbExperimentsPerIteration &amp;lt;- 0 &lt;br /&gt;
sampleInstances &amp;lt;- TRUE &lt;br /&gt;
testType &amp;lt;- &amp;quot;friedman&amp;quot; &lt;br /&gt;
firstTest &amp;lt;- 5 &lt;br /&gt;
eachTest &amp;lt;- 1 &lt;br /&gt;
minNbSurvival &amp;lt;- 0 &lt;br /&gt;
nbCandidates &amp;lt;- 0 &lt;br /&gt;
mu &amp;lt;- 5 &lt;br /&gt;
seed &amp;lt;- &amp;quot;NA&amp;quot; &lt;br /&gt;
parallel &amp;lt;- 10 &lt;br /&gt;
sgeCluster &amp;lt;- FALSE &lt;br /&gt;
mpi &amp;lt;- TRUE &lt;br /&gt;
softRestart &amp;lt;- TRUE &lt;br /&gt;
### end of configuration&lt;br /&gt;
# 2012-03-02 14:41:13 CET: INITIALIZATION &lt;br /&gt;
# nbIterations: 2&lt;br /&gt;
# minSurvival: 2&lt;br /&gt;
# nbParameters: 1&lt;br /&gt;
# Seed: 1110701261&lt;br /&gt;
# 2012-03-02 14:41:13 CET: ITERATION 1 of 2&lt;br /&gt;
# experimentsUsedSoFar: 0&lt;br /&gt;
# timeUsedSoFar: 0&lt;br /&gt;
# timeEstimate: 0&lt;br /&gt;
# remainingBudget: 1000&lt;br /&gt;
# currentBudget: 500&lt;br /&gt;
# nbCandidates: 83&lt;br /&gt;
&lt;br /&gt;
Racing methods for the selection of the best&lt;br /&gt;
Copyright (C) 2003 Mauro Birattari&lt;br /&gt;
This software comes with ABSOLUTELY NO WARRANTY&lt;br /&gt;
&lt;br /&gt;
Race name:                                                      Experiment Name &lt;br /&gt;
Number of candidates:                                                        83 &lt;br /&gt;
Number of available tasks:                                                 1000 &lt;br /&gt;
Max number of experiments:                                                  500 &lt;br /&gt;
Statistical test:                                                 Friedman test &lt;br /&gt;
Tasks seen before discarding:                                                 5 &lt;br /&gt;
Initialization function:                                                     ok &lt;br /&gt;
 &lt;br /&gt;
 	Experiment Description &lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
                            Markers:                           &lt;br /&gt;
                               x No test is performed.         &lt;br /&gt;
                               - The test is performed and     &lt;br /&gt;
                                 some candidates are discarded.&lt;br /&gt;
                               = The test is performed but     &lt;br /&gt;
                                 no candidate is discarded.    &lt;br /&gt;
                                                               &lt;br /&gt;
                                                               &lt;br /&gt;
+-+-----------+-----------+-----------+-----------+-----------+&lt;br /&gt;
| |       Task|      Alive|       Best|  Mean best| Exp so far|&lt;br /&gt;
+-+-----------+-----------+-----------+-----------+-----------+&lt;br /&gt;
	10 slaves are spawned successfully. 0 failed.&lt;br /&gt;
master  (rank 0 , comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
slave1  (rank 1 , comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
slave2  (rank 2 , comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
slave3  (rank 3 , comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
slave4  (rank 4 , comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
slave5  (rank 5 , comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
slave6  (rank 6 , comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
slave7  (rank 7 , comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
slave8  (rank 8 , comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
slave9  (rank 9 , comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
slave10 (rank 10, comm 1) of size 11 is running on: compute-3-14 &lt;br /&gt;
|x|          1|         83|          7|          1|         83|&lt;br /&gt;
|x|          2|         83|          7|          1|        166|&lt;br /&gt;
|x|          3|         83|          7|          1|        249|&lt;br /&gt;
|x|          4|         83|          7|          1|        332|&lt;br /&gt;
|-|          5|          1|          7|          1|        415|&lt;br /&gt;
+-+-----------+-----------+-----------+-----------+-----------+&lt;br /&gt;
&lt;br /&gt;
Selected candidate:           7	mean value:          1&lt;br /&gt;
&lt;br /&gt;
Description of the selected candidate:&lt;br /&gt;
[1] 1&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
# Elite candidates:&lt;br /&gt;
  dummy_par&lt;br /&gt;
7         1&lt;br /&gt;
# 2012-03-02 14:41:17 CET: ITERATION 2 of 2&lt;br /&gt;
# experimentsUsedSoFar: 415&lt;br /&gt;
# timeUsedSoFar: 0&lt;br /&gt;
# timeEstimate: 0&lt;br /&gt;
# remainingBudget: 585&lt;br /&gt;
# currentBudget: 585&lt;br /&gt;
# nbCandidates: 83&lt;br /&gt;
# Computing similarity of candidates .................................................................................. DONE&lt;br /&gt;
# 2012-03-02 14:41:21 CET: Soft restart: 7 85 86 87 88 89 90 91 92 93 94 95 96 98 100 102 103 104 105 108 109 110 111 112 113 115 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 135 136 138 139 140 142 145 146 147 148 149 150 152 153 154 155 156 158 159 160 161 163 164 84 97 99 101 106 107 114 116 134 137 141 143 144 151 157 162 165 !&lt;br /&gt;
&lt;br /&gt;
Racing methods for the selection of the best&lt;br /&gt;
Copyright (C) 2003 Mauro Birattari&lt;br /&gt;
This software comes with ABSOLUTELY NO WARRANTY&lt;br /&gt;
&lt;br /&gt;
Race name:                                                      Experiment Name &lt;br /&gt;
Number of candidates:                                                        83 &lt;br /&gt;
Number of available tasks:                                                 1000 &lt;br /&gt;
Max number of experiments:                                                  585 &lt;br /&gt;
Statistical test:                                                 Friedman test &lt;br /&gt;
Tasks seen before discarding:                                                 5 &lt;br /&gt;
Initialization function:                                                     ok &lt;br /&gt;
 &lt;br /&gt;
 	Experiment Description &lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
                            Markers:                           &lt;br /&gt;
                               x No test is performed.         &lt;br /&gt;
                               - The test is performed and     &lt;br /&gt;
                                 some candidates are discarded.&lt;br /&gt;
                               = The test is performed but     &lt;br /&gt;
                                 no candidate is discarded.    &lt;br /&gt;
                                                               &lt;br /&gt;
                                                               &lt;br /&gt;
+-+-----------+-----------+-----------+-----------+-----------+&lt;br /&gt;
| |       Task|      Alive|       Best|  Mean best| Exp so far|&lt;br /&gt;
+-+-----------+-----------+-----------+-----------+-----------+&lt;br /&gt;
|x|          1|         83|          1|          1|         83|&lt;br /&gt;
|x|          2|         83|          1|          1|        166|&lt;br /&gt;
|x|          3|         83|          1|          1|        249|&lt;br /&gt;
|x|          4|         83|          1|          1|        332|&lt;br /&gt;
|-|          5|         59|          1|          1|        415|&lt;br /&gt;
|=|          6|         59|          1|          1|        474|&lt;br /&gt;
|=|          7|         59|          1|          1|        533|&lt;br /&gt;
+-+-----------+-----------+-----------+-----------+-----------+&lt;br /&gt;
&lt;br /&gt;
Selected candidate:           1	mean value:          1&lt;br /&gt;
&lt;br /&gt;
Description of the selected candidate:&lt;br /&gt;
[1] 1&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
# Elite candidates:&lt;br /&gt;
   dummy_par&lt;br /&gt;
7          1&lt;br /&gt;
84         1&lt;br /&gt;
# 2012-03-02 14:41:25 CET: Limit of iterations reached&lt;br /&gt;
# 2012-03-02 14:41:25 CET: ITERATION 3 of 3&lt;br /&gt;
# experimentsUsedSoFar: 948&lt;br /&gt;
# timeUsedSoFar: 0&lt;br /&gt;
# timeEstimate: 0&lt;br /&gt;
# remainingBudget: 52&lt;br /&gt;
# currentBudget: 52&lt;br /&gt;
# nbCandidates: 6&lt;br /&gt;
# Computing similarity of candidates ..... DONE&lt;br /&gt;
# 2012-03-02 14:41:25 CET: Soft restart: 7 84 166 167 168 169 !&lt;br /&gt;
&lt;br /&gt;
Racing methods for the selection of the best&lt;br /&gt;
Copyright (C) 2003 Mauro Birattari&lt;br /&gt;
This software comes with ABSOLUTELY NO WARRANTY&lt;br /&gt;
&lt;br /&gt;
Race name:                                                      Experiment Name &lt;br /&gt;
Number of candidates:                                                         6 &lt;br /&gt;
Number of available tasks:                                                 1000 &lt;br /&gt;
Max number of experiments:                                                   52 &lt;br /&gt;
Statistical test:                                                 Friedman test &lt;br /&gt;
Tasks seen before discarding:                                                 5 &lt;br /&gt;
Initialization function:                                                     ok &lt;br /&gt;
 &lt;br /&gt;
 	Experiment Description &lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
                            Markers:                           &lt;br /&gt;
                               x No test is performed.         &lt;br /&gt;
                               - The test is performed and     &lt;br /&gt;
                                 some candidates are discarded.&lt;br /&gt;
                               = The test is performed but     &lt;br /&gt;
                                 no candidate is discarded.    &lt;br /&gt;
                                                               &lt;br /&gt;
                                                               &lt;br /&gt;
+-+-----------+-----------+-----------+-----------+-----------+&lt;br /&gt;
| |       Task|      Alive|       Best|  Mean best| Exp so far|&lt;br /&gt;
+-+-----------+-----------+-----------+-----------+-----------+&lt;br /&gt;
|x|          1|          6|          1|          1|          6|&lt;br /&gt;
|x|          2|          6|          1|          1|         12|&lt;br /&gt;
|x|          3|          6|          1|          1|         18|&lt;br /&gt;
|x|          4|          6|          1|          1|         24|&lt;br /&gt;
|-|          5|          2|          1|          1|         30|&lt;br /&gt;
+-+-----------+-----------+-----------+-----------+-----------+&lt;br /&gt;
&lt;br /&gt;
Selected candidate:           1	mean value:          1&lt;br /&gt;
&lt;br /&gt;
Description of the selected candidate:&lt;br /&gt;
[1] 1&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
# Elite candidates:&lt;br /&gt;
   dummy_par&lt;br /&gt;
7          1&lt;br /&gt;
84         1&lt;br /&gt;
# 2012-03-02 14:41:25 CET: Limit of iterations reached&lt;br /&gt;
# 2012-03-02 14:41:25 CET: Stopped because there is no enough budget to sample new candidates&lt;br /&gt;
# number of elites: 2&lt;br /&gt;
# indexIteration: 4&lt;br /&gt;
# mu: 5&lt;br /&gt;
# nbIterations: 4&lt;br /&gt;
# experimentsUsedSoFar: 978&lt;br /&gt;
# timeUsedSoFar: 0&lt;br /&gt;
# timeEstimate: 0&lt;br /&gt;
# remainingBudget: 22&lt;br /&gt;
# currentBudget: 22&lt;br /&gt;
# nbCandidates: 2&lt;br /&gt;
# Best candidates&lt;br /&gt;
   dummy_par&lt;br /&gt;
7          1&lt;br /&gt;
84         1&lt;br /&gt;
# Best candidates (as commandlines)&lt;br /&gt;
         command&lt;br /&gt;
7   --whatever 1&lt;br /&gt;
84  --whatever 1&lt;br /&gt;
# Finalize MPI...&lt;br /&gt;
[1] &amp;quot;Exiting Rmpi. Rmpi cannot be used unless relaunching R.&amp;quot;&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Development_Server&amp;diff=6114</id>
		<title>Development Server</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Development_Server&amp;diff=6114"/>
		<updated>2012-09-11T14:51:46Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: add section about old repos&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;IRIDIA has a development server called &amp;quot;iridia-dev&amp;quot;. The server&lt;br /&gt;
provides the following services:&lt;br /&gt;
&lt;br /&gt;
* subversion repositories&lt;br /&gt;
* git repositories&lt;br /&gt;
* 'trac' environments for projects (wiki, bugtracker etc)&lt;br /&gt;
* webpages for projects&lt;br /&gt;
&lt;br /&gt;
So if you have some software you would like to make open source, you&lt;br /&gt;
can host this on the new server.&lt;br /&gt;
&lt;br /&gt;
== How to add a new subversion/git repository? ==&lt;br /&gt;
&lt;br /&gt;
Currently, you have to contact the server administrator for that. See [[Lab responsibilities]] to find out who's the current administrator of the server and the repositories.&lt;br /&gt;
&lt;br /&gt;
== How to access the subversion/git repositories? ==&lt;br /&gt;
&lt;br /&gt;
You should get a username and a password from the repositories administrator. Instead of&lt;br /&gt;
accessing the server by ssh, you have to use https. The repository URL&lt;br /&gt;
is the following:&lt;br /&gt;
&lt;br /&gt;
  https://iridia-dev.ulb.ac.be/projects/%NAME%/{svn|git}&lt;br /&gt;
&lt;br /&gt;
For example, you can check out a project like this:&lt;br /&gt;
&lt;br /&gt;
  svn co https://%USERNAME%@iridia-dev.ulb.ac.be/projects/%REPNAME%/svn&lt;br /&gt;
&lt;br /&gt;
== I want to delete/archive old repositories ==&lt;br /&gt;
&lt;br /&gt;
Old repositories are stored in &amp;lt;tt&amp;gt;iridiadevserver@fallopius:~/archived_svn_repos&amp;lt;/tt&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Ask the administrator to move it there (&amp;lt;tt&amp;gt;ssh fallopius-backup&amp;lt;/tt&amp;gt; from iridia-dev as root).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Lab responsibilities|Contact the administrator]] if you have any problems/questions.&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Posters&amp;diff=6111</id>
		<title>Posters</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Posters&amp;diff=6111"/>
		<updated>2012-09-06T07:51:41Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Printing ==&lt;br /&gt;
&lt;br /&gt;
The website for printing posters in the ULB is:&lt;br /&gt;
&lt;br /&gt;
http://cc.ulb.ac.be/webplot/&lt;br /&gt;
&lt;br /&gt;
Please, read the instructions with care in order to avoid wasting money and paper.&lt;br /&gt;
&lt;br /&gt;
You have to login with NetID &amp;quot;iridia&amp;quot;.&lt;br /&gt;
You can ask the password to Manuel LÃ³pez-IbÃ¡Ã±ez or Manuele Bambrilla.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Logos and graphical material ==&lt;br /&gt;
&lt;br /&gt;
* [[Logos|Download logos]] (ULB, IRIDIA, etc) for various projects from this wiki.&lt;br /&gt;
&lt;br /&gt;
* There is a [https://iridia-dev.ulb.ac.be/projects/material/svn SVN repository of graphical material] (for access see [[Development Server]]).&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Posters&amp;diff=6110</id>
		<title>Posters</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Posters&amp;diff=6110"/>
		<updated>2012-09-06T07:50:58Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: mention material&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Printing ==&lt;br /&gt;
&lt;br /&gt;
The website for printing posters in the ULB is:&lt;br /&gt;
&lt;br /&gt;
http://cc.ulb.ac.be/webplot/&lt;br /&gt;
&lt;br /&gt;
Please, read the instructions with care in order to avoid wasting money and paper.&lt;br /&gt;
&lt;br /&gt;
You have to login with NetID &amp;quot;iridia&amp;quot;.&lt;br /&gt;
You can ask the password to Manuel LÃ³pez-IbÃ¡Ã±ez or Manuele Bambrilla.&lt;br /&gt;
&lt;br /&gt;
=== Logos and graphical material ===&lt;br /&gt;
&lt;br /&gt;
* [[Logos|Download logos]] (ULB, IRIDIA, etc) for various projects from this wiki.&lt;br /&gt;
&lt;br /&gt;
* There is a [https://iridia-dev.ulb.ac.be/projects/material/svn SVN repository of graphical material] (for access see [[Development Server]]).&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Posters&amp;diff=6109</id>
		<title>Posters</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Posters&amp;diff=6109"/>
		<updated>2012-09-05T10:06:50Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: Protected &amp;quot;Posters&amp;quot; [edit=autoconfirmed:move=autoconfirmed:read=autoconfirmed]&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
== Printing ==&lt;br /&gt;
&lt;br /&gt;
The website for printing posters in the ULB is:&lt;br /&gt;
&lt;br /&gt;
http://cc.ulb.ac.be/webplot/&lt;br /&gt;
&lt;br /&gt;
Please, read the instructions with care in order to avoid wasting money and paper.&lt;br /&gt;
&lt;br /&gt;
You have to login with NetID &amp;quot;iridia&amp;quot;.&lt;br /&gt;
You can ask the password to Manuel LÃ³pez-IbÃ¡Ã±ez or Manuele Bambrilla.&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Posters&amp;diff=6107</id>
		<title>Posters</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Posters&amp;diff=6107"/>
		<updated>2012-09-04T08:17:18Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: add section on printing&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
== Printing ==&lt;br /&gt;
&lt;br /&gt;
The website for printing posters in the ULB is:&lt;br /&gt;
&lt;br /&gt;
http://cc.ulb.ac.be/webplot/&lt;br /&gt;
&lt;br /&gt;
Please, read the instructions with care in order to avoid wasting money and paper.&lt;br /&gt;
&lt;br /&gt;
You have to login with NetID &amp;quot;iridia&amp;quot;.&lt;br /&gt;
You can ask the password to Manuel LÃ³pez-IbÃ¡Ã±ez or Manuele Bambrilla.&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Logos&amp;diff=6104</id>
		<title>Logos</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Logos&amp;diff=6104"/>
		<updated>2012-08-02T14:27:10Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: update url of ULB logos&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;div class=&amp;quot;page-warning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Image:icon_warning.png|40px]] &lt;br /&gt;
'''IMPORTANT:''' If you create a logo/graphic&lt;br /&gt;
&lt;br /&gt;
* [[#Sources|UPLOAD ITS SOURCE to the IRIDIA Repository]]. Otherwise it's lost when you'll leave the lab.&lt;br /&gt;
&lt;br /&gt;
* Every time you upload a new file (a new logo or a new revision of an existing one), MENTION IN THE DESCRIPTION the precise software and steps.&lt;br /&gt;
&lt;br /&gt;
* If you create a better version of some existing file, REPLACE IT by going to the page of the existing file and uploading a new revision.&lt;br /&gt;
&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Sources ==&lt;br /&gt;
&lt;br /&gt;
The sources ([[Wikipedia:SVG|SVG]] vector files) of the logos below can be found in [[Development_Server|IRIDIA Repository]] at:&lt;br /&gt;
&lt;br /&gt;
 https://iridia-dev.ulb.ac.be/projects/iridia_logos/svn&lt;br /&gt;
&lt;br /&gt;
== IRIDIA ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Classic B/W logo ===&lt;br /&gt;
&lt;br /&gt;
{|&lt;br /&gt;
|[[Image:iridia_logo_classic_with_ulb.png|thumb|center|upright=1.4|IRIDIA Classic B/W version, with all text (PNG 300dpi). There is also a scalable vector version in [[:Image:iridia_logo_classic_with_ulb.pdf|PDF format]].]]&lt;br /&gt;
|[[Image:iridia_logo_classic_simple.png|thumb|center|upright=1.4|IRIDIA Classic B/W version, simpler without the name of the ULB (PNG 300dpi). There is also a scalable vector version in [[:Image:iridia_logo_classic_simple.pdf|PDF format]].]]&lt;br /&gt;
|[[Image:iridia_logo_classic_short.png|thumb|center|upright=1.4|IRIDIA Classic B/W version, short without any extra text (PNG 300dpi). There is also a scalable vector version in  [[:Image:iridia_logo_classic_short.pdf|PDF format]].]]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Modern B/W logo ===&lt;br /&gt;
&lt;br /&gt;
[[Image:iridia_logo_fancy.png|thumb|none|upright=2.5|IRIDIA Modern B/W version (PNG 300dpi). There is also a [[:Image:iridia_logo_fancy.pdf|PDF version]].]]&lt;br /&gt;
&lt;br /&gt;
== CoDE ==&lt;br /&gt;
&lt;br /&gt;
[[Image:code_logo_color.png|thumb|left|upright=1.5|CoDE logo (PNG). There is also a scalable vector version in [[:Image:code_logo.pdf|PDF format]].]]&lt;br /&gt;
[[Image:code_logo_bw.png|thumb|none|upright=1.5|CoDE logo black and white with stripes (PNG). There is also a scalable vector version in [[:Image:code_logo_bw.pdf|PDF format]].]]&lt;br /&gt;
&lt;br /&gt;
== ULB ==&lt;br /&gt;
&lt;br /&gt;
The ULB has a [http://www.ulb.ac.be/dre/com/logo-ulb.html gallery with many official logos]. If you create a version that is not available there, please upload it saying how you created it (precise software and steps) and add it to the SVN and below.&lt;br /&gt;
&lt;br /&gt;
== FNRS ==&lt;br /&gt;
&lt;br /&gt;
The logos below should be the same as the [http://www1.frs-fnrs.be/fr/communiquer-en-transparence/logos.html current official logo of the FNRS].&lt;br /&gt;
&lt;br /&gt;
== Project Logos ==&lt;br /&gt;
&lt;br /&gt;
=== Swarmanoid ===&lt;br /&gt;
&lt;br /&gt;
[[Image:swarmanoid_logo.png|thumb|none|upright=2|Swarmanoid logo bitmap only (PNG).]]&lt;br /&gt;
&lt;br /&gt;
=== Swarm-bots ===&lt;br /&gt;
&lt;br /&gt;
[[Image:swarm-bots_logo.png|thumb|none|upright=2|Swarm-bots logo bitmap only (PNG)]]&lt;br /&gt;
&lt;br /&gt;
=== MetaNet ===&lt;br /&gt;
&lt;br /&gt;
[[Image:metanet_logo_color.png|thumb|left|upright=1.2|MetaNet color logo (PNG). There is also a scalable vector version in  [[:Image:metanet_logo_color.pdf|PDF format]].]]&lt;br /&gt;
[[Image:metanet_logo_bw.png|thumb|none|upright=1.2|MetaNet black and white logo (PNG). There is also a scalable vector version in  [[:Image:metanet_logo_bw.pdf|PDF format]].]]&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Logos&amp;diff=6072</id>
		<title>Logos</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Logos&amp;diff=6072"/>
		<updated>2012-07-03T11:28:05Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: /* ULB */  fix link&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;div class=&amp;quot;page-warning&amp;quot;&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Image:icon_warning.png|40px]] &lt;br /&gt;
'''IMPORTANT:''' If you create a logo/graphic&lt;br /&gt;
&lt;br /&gt;
* [[#Sources|UPLOAD ITS SOURCE to the IRIDIA Repository]]. Otherwise it's lost when you'll leave the lab.&lt;br /&gt;
&lt;br /&gt;
* Every time you upload a new file (a new logo or a new revision of an existing one), MENTION IN THE DESCRIPTION the precise software and steps.&lt;br /&gt;
&lt;br /&gt;
* If you create a better version of some existing file, REPLACE IT by going to the page of the existing file and uploading a new revision.&lt;br /&gt;
&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Sources ==&lt;br /&gt;
&lt;br /&gt;
The sources ([[Wikipedia:SVG|SVG]] vector files) of the logos below can be found in [[Development_Server|IRIDIA Repository]] at:&lt;br /&gt;
&lt;br /&gt;
 https://iridia-dev.ulb.ac.be/projects/iridia_logos/svn&lt;br /&gt;
&lt;br /&gt;
== IRIDIA ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Classic B/W logo ===&lt;br /&gt;
&lt;br /&gt;
{|&lt;br /&gt;
|[[Image:iridia_logo_classic_with_ulb.png|thumb|center|upright=1.4|IRIDIA Classic B/W version, with all text (PNG 300dpi). There is also a scalable vector version in [[:Image:iridia_logo_classic_with_ulb.pdf|PDF format]].]]&lt;br /&gt;
|[[Image:iridia_logo_classic_simple.png|thumb|center|upright=1.4|IRIDIA Classic B/W version, simpler without the name of the ULB (PNG 300dpi). There is also a scalable vector version in [[:Image:iridia_logo_classic_simple.pdf|PDF format]].]]&lt;br /&gt;
|[[Image:iridia_logo_classic_short.png|thumb|center|upright=1.4|IRIDIA Classic B/W version, short without any extra text (PNG 300dpi). There is also a scalable vector version in  [[:Image:iridia_logo_classic_short.pdf|PDF format]].]]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Modern B/W logo ===&lt;br /&gt;
&lt;br /&gt;
[[Image:iridia_logo_fancy.png|thumb|none|upright=2.5|IRIDIA Modern B/W version (PNG 300dpi). There is also a [[:Image:iridia_logo_fancy.pdf|PDF version]].]]&lt;br /&gt;
&lt;br /&gt;
== CoDE ==&lt;br /&gt;
&lt;br /&gt;
[[Image:code_logo_color.png|thumb|left|upright=1.5|CoDE logo (PNG). There is also a scalable vector version in [[:Image:code_logo.pdf|PDF format]].]]&lt;br /&gt;
[[Image:code_logo_bw.png|thumb|none|upright=1.5|CoDE logo black and white with stripes (PNG). There is also a scalable vector version in [[:Image:code_logo_bw.pdf|PDF format]].]]&lt;br /&gt;
&lt;br /&gt;
== ULB ==&lt;br /&gt;
&lt;br /&gt;
The ULB has a [http://www.ulb.ac.be/facs/polytech/charte-polytech.html gallery with many official logos]. If you create a version that is not available there, please upload it saying how you created it (precise software and steps) and add it below.&lt;br /&gt;
&lt;br /&gt;
== FNRS ==&lt;br /&gt;
&lt;br /&gt;
The logos below should be the same as the [http://www1.frs-fnrs.be/fr/communiquer-en-transparence/logos.html current official logo of the FNRS].&lt;br /&gt;
&lt;br /&gt;
== Project Logos ==&lt;br /&gt;
&lt;br /&gt;
=== Swarmanoid ===&lt;br /&gt;
&lt;br /&gt;
[[Image:swarmanoid_logo.png|thumb|none|upright=2|Swarmanoid logo bitmap only (PNG).]]&lt;br /&gt;
&lt;br /&gt;
=== Swarm-bots ===&lt;br /&gt;
&lt;br /&gt;
[[Image:swarm-bots_logo.png|thumb|none|upright=2|Swarm-bots logo bitmap only (PNG)]]&lt;br /&gt;
&lt;br /&gt;
=== MetaNet ===&lt;br /&gt;
&lt;br /&gt;
[[Image:metanet_logo_color.png|thumb|left|upright=1.2|MetaNet color logo (PNG). There is also a scalable vector version in  [[:Image:metanet_logo_color.pdf|PDF format]].]]&lt;br /&gt;
[[Image:metanet_logo_bw.png|thumb|none|upright=1.2|MetaNet black and white logo (PNG). There is also a scalable vector version in  [[:Image:metanet_logo_bw.pdf|PDF format]].]]&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Main_Page&amp;diff=6069</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Main_Page&amp;diff=6069"/>
		<updated>2012-06-21T12:16:38Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: /* Diverse Material */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;!--        BANNER ACROSS TOP OF PAGE        --&amp;gt;&lt;br /&gt;
{| id=&amp;quot;mp-topbanner&amp;quot; style=&amp;quot;width:100%; background:#fcfcfc; margin-top:1.2em; border:1px solid #ccc;&amp;quot; align=center&lt;br /&gt;
| style=&amp;quot;width:56%; color:#000;&amp;quot; |&lt;br /&gt;
{| style=&amp;quot;width:100%; border:none; background:none;&amp;quot;&lt;br /&gt;
| style=&amp;quot;width:100%; text-align:center; white-space:nowrap; color:#000;&amp;quot; |&lt;br /&gt;
&amp;lt;div style=&amp;quot;font-size:162%; border:none; margin:0; padding:.1em; color:#000;&amp;quot;&amp;gt;Welcome to [http://iridia.ulb.ac.be IRIDIA]'s wiki.&amp;lt;/div&amp;gt;&lt;br /&gt;
[[Image:Iridia_logo_fancy.png|480px|center]]&lt;br /&gt;
|}&lt;br /&gt;
__NOTOC__&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div id=&amp;quot;Top&amp;quot;&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
{| cellspacing=&amp;quot;20&amp;quot; cellpadding=&amp;quot;5&amp;quot; align=center &lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|valign=&amp;quot;top&amp;quot; width=&amp;quot;50%&amp;quot; style=&amp;quot;border:1px solid #cef2e0; background:#f5fffa;&amp;quot;|&lt;br /&gt;
&amp;lt;h2 id=&amp;quot;mp-tfa-h2&amp;quot; style=&amp;quot;margin:3px; background:#cef2e0; font-size:120%; font-weight:bold; border:1px solid #a3bfb1; text-align:left; &lt;br /&gt;
color:#000; padding:0.2em 0.4em;&amp;quot;&amp;gt;[[#anc1 | Practicalities]]&amp;lt;/h2&amp;gt;&lt;br /&gt;
* [[#anc1_1 | Moving and surviving in Brussels]] &lt;br /&gt;
* [[#anc1_2 | Information for students]] &lt;br /&gt;
* [[#anc1_3 | Useful informations]] (menu, pizza, etc...)&lt;br /&gt;
* [[Lab responsibilities]] &lt;br /&gt;
&lt;br /&gt;
|valign=&amp;quot;top&amp;quot; width=&amp;quot;50%&amp;quot; style=&amp;quot;border:1px solid #cedff2; background:#f5faff; vertical-align:top;&amp;quot;|&lt;br /&gt;
&lt;br /&gt;
&amp;lt;h2 id=&amp;quot;mp-itn-h2&amp;quot; style=&amp;quot;margin:3px; background:#cedff2; font-size:120%; font-weight:bold; border:1px solid #a3b0bf; text-align:left; color:#000; padding:0.2em 0.4em;&amp;quot;&amp;gt;[[#anc2 | Research]]&amp;lt;/h2&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [[#anc2_1 | Robotics]] (S-Bots, E-pucks, Software, Links)&lt;br /&gt;
&lt;br /&gt;
* [[#anc2_2 | Optimization]] (Links)&lt;br /&gt;
&lt;br /&gt;
* [[IRIDIA Technical reports]]&lt;br /&gt;
&lt;br /&gt;
* [http://iridia.ulb.ac.be/seminars IRIDIA seminars]&lt;br /&gt;
&lt;br /&gt;
* [[#anc2_3 | Publications]] (how to publish IRIDIA reports, digital libraries)&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|valign=&amp;quot;top&amp;quot; width=&amp;quot;50%&amp;quot; style=&amp;quot;border:1px solid #ddcef2; background:#faf5ff; vertical-align:top; color:#000;&amp;quot;|&lt;br /&gt;
&amp;lt;h2  id=&amp;quot;mp-tfp-h2&amp;quot; style=&amp;quot;margin:3px; background:#ddcef2; font-size:120%; font-weight:bold; border:1px solid #afa3bf; text-align:left; color:#000; padding:0.2em 0.4em&amp;quot;&amp;gt;[[#anc3 | Infrastructure]]&amp;lt;/h2&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [[#anc3_1 | Hardware]] (configuration, backup, cluster, etc.)&lt;br /&gt;
* [[#anc3_2 | Software]] (HOWTOs, homepage, etc.)&lt;br /&gt;
* [[#material | Diverse material]] (Logos, graphic material, proceedings, etc.)&lt;br /&gt;
&lt;br /&gt;
|valign=&amp;quot;top&amp;quot; width=&amp;quot;50%&amp;quot; style=&amp;quot;padding: 2px; border:1px solid #FFEDCC; color: #000000; background: #FFFCE6;&amp;quot;|&lt;br /&gt;
&amp;lt;h2  id=&amp;quot;mp-tfp-h2&amp;quot; style=&amp;quot;margin:3px; background: #FFEDCC; font-size:120%; font-weight:bold; border:1px solid #cccccc; text-align:left; color:#000; padding:0.2em 0.4em&amp;quot;&amp;gt;Weekly meetings&amp;lt;/h2&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--* Alternate Thursdays at 15h00 : [[Robotics weekly meetings | Robotics meetings]]&lt;br /&gt;
* Alternate Thursdays at 15h00 : [[Literature meetings | Literature meetings]] --&amp;gt;&lt;br /&gt;
* Wednesdays at 15h00 : [[Robotics weekly meetings | Robotics meetings]]&lt;br /&gt;
* Thursdays at 10h30 : [[Administration weekly meetings | Administration weekly meeting]] &lt;br /&gt;
* Thursdays at 11h00 : [[Optimization Group Meetings]]&lt;br /&gt;
&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
'''WARNING''' : we have changed the access policy of the wiki. To consult some sensitive information, you need a login.&lt;br /&gt;
&lt;br /&gt;
== Adding information ==&lt;br /&gt;
&lt;br /&gt;
A Wiki is an excellent tool to maintain dynamic information. If you want to add something to this Wiki feel very free contact the system administrator and get an account. It is straight-forward to add and change the information in MediaWiki. Simply press ''edit'' on the top of this page to see how it was done. If you create a link to a non-existing page within this Wiki you can create that page by following the link - of course you would need a login to do so!. Pictures and documents have to be [[Special:Upload|uploaded]] before they can be used on pages. All popular image formats are supported and pdf and ps documents are allowed .&lt;br /&gt;
&lt;br /&gt;
For more information on the Wiki mark-up language see [http://en.wikipedia.org/wiki/Wikipedia:How_to_edit_a_page Wikipedia's page about How to edit a page]. When you become good at it, you can make cool looking pages.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &amp;lt;div id=&amp;quot;anc1&amp;quot;&amp;gt;Practicalities&amp;lt;/div&amp;gt; ==&lt;br /&gt;
&lt;br /&gt;
* &amp;lt;div id=&amp;quot;anc1_1&amp;quot;&amp;gt;'''Brussels'''&amp;lt;/div&amp;gt;&lt;br /&gt;
** [[Moving to Brussels]] - What you need to know for moving to Brussels (housing, transport, health care, etc.).&lt;br /&gt;
** [[Surviving in Brussels]] - French lessons, cultural events, etc.&lt;br /&gt;
** [[Allocations de chomage]] - Allocations de chomage.&lt;br /&gt;
&lt;br /&gt;
* &amp;lt;div id=&amp;quot;anc1_2&amp;quot;&amp;gt;'''Students'''&amp;lt;/div&amp;gt;&lt;br /&gt;
** [[What you need to begin to work in IRIDIA]] - Resources to activate to work at IRIDIA.&lt;br /&gt;
** [[For students visiting IRIDIA]] - Information for new students coming to IRIDIA.&lt;br /&gt;
** [[University Administration]] - (IMPORTANT!) The what, the where and the how of navigating university bureaucracy - inscription, regulations etc.&lt;br /&gt;
** [[Equivalence]] - Step by step explanations to request an equivalence of diplomas from Belgium.&lt;br /&gt;
** [[Funding]] - Information on getting funding for projects, scholarships and unemployment benefits in Belgium once the Ph.D. grant runs out.&lt;br /&gt;
** [[StudentsIRIDIA | Students]] - Information on students in IRIDIA.&lt;br /&gt;
** [http://www.ulb.ac.be/dep/financier/perso-avantages/index.html Intranet for ULB employees] - Web site with list of benefit for being ULB employees &lt;br /&gt;
** [[Insurance while travelling abroad]] - ULB's insurance&lt;br /&gt;
** [https://iridia.ulb.ac.be/cgi-bin/mailman/listinfo/ IRIDIA mailing lists]&lt;br /&gt;
** [[ECTS formation doctorale]] - a description of what you can use as ECTS for your DEA/formation doctorale&lt;br /&gt;
&lt;br /&gt;
* &amp;lt;div id=&amp;quot;anc1_3&amp;quot;&amp;gt;'''Useful information'''&amp;lt;/div&amp;gt;&lt;br /&gt;
** [[Working late | Pizza]] - menu for the local pizza place, it is a good idea to order in advance. &lt;br /&gt;
** [http://wwwdev.ulb.ac.be/restaurants/solbosch_s/r_pub.php3 Weekly menu at ULB restaurant]&lt;br /&gt;
** [http://www.snack44.net/ Snack 44] Menu for sandwich bar dans l'avenue de l'UniversitÃ©&lt;br /&gt;
&lt;br /&gt;
* &amp;lt;div id=&amp;quot;lab_responsibilities&amp;quot;&amp;gt;'''Lab responsibilities'''&amp;lt;/div&amp;gt;&lt;br /&gt;
** [[Lab responsibilities]] - list of labs responsibilities/tasks and who takes care of them.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;[[#Top | Back to top]]&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== &amp;lt;div id=&amp;quot;anc2&amp;quot;&amp;gt;Research&amp;lt;/div&amp;gt; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== &amp;lt;div id=&amp;quot;anc2_1&amp;quot;&amp;gt;Robotics&amp;lt;/div&amp;gt; ===&lt;br /&gt;
&lt;br /&gt;
* [[Robots | Main page for robots at IRIDIA]] - List of robots, technical information, how to access&lt;br /&gt;
* [[Arena time slots]] - Reserve arena time&lt;br /&gt;
* [[E-Pucks]] - All the information on how to use the e-pucks are here&lt;br /&gt;
&lt;br /&gt;
* '''Software'''&lt;br /&gt;
** [[ffmpeg | Using ffmpeg]] - Some examples on how to convert a set of frames to a video&lt;br /&gt;
&lt;br /&gt;
* '''Links &amp;amp; news'''&lt;br /&gt;
** [http://iridia.ulb.ac.be/comp2sys/ COMP2SYS project website]&lt;br /&gt;
** [[Robot labs around the World]]&lt;br /&gt;
** [http://robots.net Read more news on robots.net...]&lt;br /&gt;
** [[Old news]]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;[[#Top | Back to top]]&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== &amp;lt;div id=&amp;quot;anc2_2&amp;quot;&amp;gt;Optimization&amp;lt;/div&amp;gt; ===&lt;br /&gt;
&lt;br /&gt;
* '''Links &amp;amp; news'''&lt;br /&gt;
** [http://www.informs.org/Resources/ INFORMS OR/MS]&lt;br /&gt;
** [http://143.129.203.3/eume/php/eume.main.php EU/ME]&lt;br /&gt;
** [http://www.prism.uvsq.fr/~vdc/ECCO/ ECCO]&lt;br /&gt;
* '''Multi-objective Algorithms Software'''&lt;br /&gt;
** [http://www.tik.ee.ethz.ch/sop/pisa/ ETH - SOP - PISA]&lt;br /&gt;
** [http://paradiseo.gforge.inria.fr/index.php?n=Main.MOEO ParadisEO-MOEO]&lt;br /&gt;
** [http://shark-project.sourceforge.net/MOO-EALib/index.html Shark - MOO-EAlib]&lt;br /&gt;
&lt;br /&gt;
* '''Metaheuristics'''&lt;br /&gt;
** [http://www.aco-metaheuristic.org Ant Colony Optimization]&lt;br /&gt;
** [http://iew3.technion.ac.il/CE/about.php Cross Entropy Method]&lt;br /&gt;
** [http://evonet.lri.fr/ Evolutionary Computing]&lt;br /&gt;
** [http://www.research.att.com/~mgcr/grasp/gannbib/gannbib.html GRASP]&lt;br /&gt;
** [http://www.tabusearch.net/ Tabu Search]&lt;br /&gt;
* '''OR Software'''&lt;br /&gt;
** [http://code.google.com/p/or-tools/ OR-Tools by Google]&lt;br /&gt;
** [http://scip.zib.de/ SCIP]&lt;br /&gt;
* '''Projects'''&lt;br /&gt;
** [http://iridia.ulb.ac.be/comp2sys/ COMP2SYS]&lt;br /&gt;
** [http://www.metaheuristics.org/ Metaheuristics Network]&lt;br /&gt;
* '''Applications'''&lt;br /&gt;
** [http://www.nada.kth.se/~viggo/wwwcompendium/ A compendium of NP optimization problems]&lt;br /&gt;
** [http://www.tsp.gatech.edu/ TSP]&lt;br /&gt;
** [http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/ TSPLIB95] - A Traveling Salesman Problem Library&lt;br /&gt;
** [http://www.seas.upenn.edu/qaplib/ QAPLIB] - A Quadratic Assignment Problem Library&lt;br /&gt;
** [http://people.brunel.ac.uk/~mastjjb/jeb/info.html OR-Library]&lt;br /&gt;
** [http://iridia.ulb.ac.be/~manuel/tsptw-instances Benchmark Instances for the Travelling Salesman Problem with Time Windows (TSPTW)]&lt;br /&gt;
** [[Concorde]]&lt;br /&gt;
* '''Experimental Analysis and Statistics'''&lt;br /&gt;
** [http://www.r-project.org/ R project]&lt;br /&gt;
** [[Tutorials_and_links_about_C%2C_R%2C_LateX_and_bash_(unix)#R | Tutorials and links about R]]&lt;br /&gt;
** [http://www.statsoft.com/textbook/stathome.html Electronic Statistics Textbook. StatSoft, Inc. (2006)]&lt;br /&gt;
** [http://www.itl.nist.gov/div898/handbook/ NIST/SEMATECH e-Handbook of Statistical Methods]&lt;br /&gt;
**[http://www.keithbower.com/datasets/Audio%20Recordings.htm Videos on Statistical Concepts]&lt;br /&gt;
* '''Software Development'''&lt;br /&gt;
** [http://gcc.gnu.org/c99status.html C99 standard and use GCC compiler tools] - Suggested compiler&lt;br /&gt;
** [http://www.gnu.org/prep/standards/standards.pdf GNU Coding Standards] - Suggested coding style guidelines&lt;br /&gt;
** [http://www.gnu.org/software/gsl/ GSL] - GNU Scientific Library&lt;br /&gt;
** [http://subversion.tigris.org/ Subversion] - Suggested version control tool (see the page on the IRIDIA [[Development Server]] how to use it inside the lab)&lt;br /&gt;
** [http://www.stack.nl/~dimitri/doxygen/ Doxygen] - Suggested documentation tool for source code&lt;br /&gt;
&amp;lt;center&amp;gt;[[#Top | Back to top]]&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Generic Tutorials and Links ===&lt;br /&gt;
* [[Tutorials and links about C, R, LateX and bash (unix)]]&lt;br /&gt;
&lt;br /&gt;
=== Neural Networks ===&lt;br /&gt;
* [[Neural Network Tutorials]]&lt;br /&gt;
&lt;br /&gt;
=== &amp;lt;div id=&amp;quot;anc2_3&amp;quot;&amp;gt;Publications&amp;lt;/div&amp;gt; ===&lt;br /&gt;
&lt;br /&gt;
* [[IRIDIA Technical reports]] - Information on publishing a technical report and LaTeX package(s).&lt;br /&gt;
* [[Access to Digital Libraries]] - Which on-line papers archive we have access from IRIDIA network. &lt;br /&gt;
* [[Iridia Supplementary Information Instructions page]] - Information on HOW TO use the Iridia Supplementary Information page.&lt;br /&gt;
* [[Write Better English]] - Basic pointers on how to raise the level of english in your paper.&lt;br /&gt;
* [[Embed Fonts in your PDFs]] - A guide on how to embed fonts on your PDFs for submission to conferences.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;[[#Top | Back to top]]&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== &amp;lt;div id=&amp;quot;anc3&amp;quot;&amp;gt;Infrastructure&amp;lt;/div&amp;gt; ==&lt;br /&gt;
&lt;br /&gt;
* [[Infrastructure]] - Generalities, meetings, TODOS, etc.&lt;br /&gt;
&lt;br /&gt;
=== &amp;lt;div id=&amp;quot;anc3_1&amp;quot;&amp;gt;'''Hardware'''&amp;lt;/div&amp;gt; ===&lt;br /&gt;
* [[Workstation configuration]] - How to setup your personal workstation and laptop, printers, etc.&lt;br /&gt;
* [[Backup Server]] - How to use the backup server of IRIDIA&lt;br /&gt;
* [[Development Server]] - How to use the IRIDIA development server and how to use subversion repositories&lt;br /&gt;
* IRIDIA Cluster: See the [http://majorana.ulb.ac.be/wordpress/ Cluster Website] for usage information, tips and updates.&lt;br /&gt;
* [[Using the IRIDIA Experimental room]] - All you need to know to easily run real experiments.&lt;br /&gt;
* [[Workshop]] - Everything you wanted to know about the workshop but were afraid to ask&lt;br /&gt;
&lt;br /&gt;
=== &amp;lt;div id=&amp;quot;anc3_2&amp;quot;&amp;gt;'''Software'''&amp;lt;/div&amp;gt; ===&lt;br /&gt;
* [[Creating your own home page]] - How to create your own home.&lt;br /&gt;
* See all [[Software HOWTOs]]&lt;br /&gt;
* Suggested software for [[Workstation_configuration#For_Mac_OS_X_users | Mac OS X]] users&lt;br /&gt;
* List of [[Available_commercial_software | commercial software]] we have in IRIDIA&lt;br /&gt;
* Howto create a [[howto_create_new_svn_repos | new svn repository ]] on the iridia server&lt;br /&gt;
* Tune your algorithm on the [[Tuning_your_algorithm_with_irace_on_the_IRIDIA_cluster|IRIDIA cluster with irace]]&lt;br /&gt;
&lt;br /&gt;
=== &amp;lt;div id=&amp;quot;material&amp;quot;&amp;gt;'''Diverse Material'''&amp;lt;/div&amp;gt; ===&lt;br /&gt;
* [[Logos]]&lt;br /&gt;
* [https://iridia-dev.ulb.ac.be/projects/material/svn SVN repository of graphical material] (for access see [[Development Server]])&lt;br /&gt;
* [https://iridia-dev.ulb.ac.be/projects/optbib/svn SVN repository of BiBTeX files] (for access see [[Development Server]])&lt;br /&gt;
* [https://iridia-dev.ulb.ac.be/projects/optsrc/svn SVN repository of optimization source code and benchmark problems] (for access see [[Development Server]])&lt;br /&gt;
* [[ProceedingsRepository| Repository of Proceedings]]&lt;br /&gt;
&amp;lt;center&amp;gt;[[#Top | Back to top]]&amp;lt;/center&amp;gt;&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=User_talk:WikiSysop&amp;diff=6067</id>
		<title>User talk:WikiSysop</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=User_talk:WikiSysop&amp;diff=6067"/>
		<updated>2012-06-11T16:04:58Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: mention that all images are blocked&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;TODO:&lt;br /&gt;
&lt;br /&gt;
* [http://www.mediawiki.org/wiki/Manual:Security Security]. How much is implemented?&lt;br /&gt;
&lt;br /&gt;
* Currently image authorization blocks all images. This is excessive. We do not want to block images such as http://iridia.ulb.ac.be/wiki/Image:Icon_warning.png . It would be nice to have a way to whitelist images. See: http://www.mediawiki.org/wiki/Manual:Image_Authorization and http://www.mediawiki.org/wiki/Manual:$wgWhitelistRead&lt;br /&gt;
&lt;br /&gt;
UNDER TEST:&lt;br /&gt;
&lt;br /&gt;
* [http://www.mediawiki.org/wiki/Manual:Image_Authorization Image Authorization].&lt;br /&gt;
&lt;br /&gt;
DONE:&lt;br /&gt;
&lt;br /&gt;
* 2010.09.23 - Commented in &amp;lt;code&amp;gt;img_auth.php&amp;lt;/code&amp;gt; the lines of code which checked whether a user was logged in or not. &lt;br /&gt;
This prevented an anonymous user to see and download an image embedded in a publicly accessible page, such as the images in the [[Logos]] page. &lt;br /&gt;
The user who wants to limit access to a file, has now to explicitly change &lt;br /&gt;
permission settings in the '''protect''' tab.  &lt;br /&gt;
&lt;br /&gt;
* [http://www.mediawiki.org/wiki/Localsettings#Logo Logo moved into a proper directory].&lt;br /&gt;
&lt;br /&gt;
* [http://www.mediawiki.org/wiki/Manual:Short_URL Short URLS].&lt;br /&gt;
&lt;br /&gt;
* [http://www.mediawiki.org/wiki/Extension:SimpleSecurity Protect some pages from being read].&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6000</id>
		<title>Optimization Group Meetings</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=6000"/>
		<updated>2012-04-19T10:26:40Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: new literature&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;You can subscribe to an [http://en.wikipedia.org/wiki/ICalendar iCalendar] of these meetings at http://iridia.ulb.ac.be/Calendars/publish.php/_NUC_Optimization.ics&lt;br /&gt;
&lt;br /&gt;
==Breakfast Meetings==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
Breakfast meetings are informal meetings where there is a general discussion or someone presents their work. And additional goal is to have breakfast together.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, and a short summary of what you are going to talk about.&lt;br /&gt;
# Add a new entry to the table below.&lt;br /&gt;
# Bring breakfast.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Breakfast Meetings ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;200&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Summary&lt;br /&gt;
|-&lt;br /&gt;
|2011-03-10&lt;br /&gt;
|Stefanie Kritzinger&lt;br /&gt;
| A Unified Framework for Routing Problems with Fixed Fleet Size&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-21&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
| Off-line vs. On-line Tuning: A Study on MAX-MIN Ant System for the TSP&lt;br /&gt;
|-&lt;br /&gt;
|2010-10-19&lt;br /&gt;
|Stefano Benedettini&lt;br /&gt;
| Experiments on Boolean Network Design by Local Search Algorithms.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-20&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
| The social learning strategies tournament, organized as part of the [http://www.intercult.su.se/cultaptation/ cultaptation project], and its results were described. No ideas about algorithm portfolios were discussed.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-??&lt;br /&gt;
|Renaud Lenne&lt;br /&gt;
| ???&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-04-29&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|The maximum clique problem, state of the art and ACO [http://dx.doi.org/10.1016/j.cor.2009.02.013] [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.80.2036&amp;amp;rep=rep1&amp;amp;type=pdf] [http://www710.univ-lyon1.fr/~csolnon/publications/rr-mai04.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-18&lt;br /&gt;
|Sabrina Oliveira&lt;br /&gt;
|Achieved results from the application of the Population Based Ant Colony Optimisation algorithm to TSP.&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-11&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|An overview of Container Loading Problems. &lt;br /&gt;
|-&lt;br /&gt;
| 2010-01-21&lt;br /&gt;
|Yuan, Zhi (Eric)&lt;br /&gt;
| Rice cooker vs. the idea of tuning. &lt;br /&gt;
|-&lt;br /&gt;
|2010-01-07&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|General discussion about the optimization group. &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Literature Sessions==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
The goal of the Literature Sessions is to examine and discuss&lt;br /&gt;
particularly interesting papers from the research literature. For each&lt;br /&gt;
session, one paper will be selected, there will be a short&lt;br /&gt;
presentation (10-15 minutes) about the contents, and a discussion will&lt;br /&gt;
ensue. Sessions will last around 40-45 minutes. Attendants should read&lt;br /&gt;
the paper before the session in order to have a productive discussion. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Book a room (ask Muriel).&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, a reference to the paper and the URL where it can be obtained. Also, attach the paper in PDF.&lt;br /&gt;
# Add a new entry to the table below. Use YYY-MM-DD (year-month-day) format for the date. Please add a complete bibliographic reference (you may find it in the homepages of the authors) and a hyperlink to a PDF (links to http://dx.doi.org are preferred).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Literature Sessions ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;180&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Paper discussed&lt;br /&gt;
|-&lt;br /&gt;
|2012-04-19&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|E.K. Burke, M.R. Hyde, and G. Kendall. Grammatical Evolution of Local Search Heuristics. IEEE Transactions on Evolutionary Computation, 99, 2011. doi: 10.1109/TEVC.2011.2160401 [http://www.cs.nott.ac.uk/~mvh/papers/mvh-draft-ieeetec2011.pdf PDF] &lt;br /&gt;
|-&lt;br /&gt;
|2012-04-03&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|On the automatic discovery of variants of the NEH procedure for flow   shop scheduling using genetic programming. J A VÃ¡zquez-RodrÃ­guez and G Ochoa.Journal of the Operational Research Society (2011) 62, 381â€“396.   doi:[http://dx.doi.org/10.1057/jors.2010.132  10.1057/jors.2010.132]&lt;br /&gt;
|-&lt;br /&gt;
|2011-12-08&lt;br /&gt;
|Zhi Yuan&lt;br /&gt;
|Frank Hutter, Holger Hoos, and Kevin Leyton-Brown. Sequential Model-Based Optimization for General Algorithm Configuration. In Proceedings of Learning and Intelligent Optimization (LION 5), 2011. PDF: [http://www.cs.ubc.ca/~hutter/papers/11-LION5-SMAC.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2011-11-24&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|Ender Ã–zcan and Andrew J. Parkes. 2011. Policy matrix evolution for  generation of heuristics. In Proceedings of the 13th annual  conference on Genetic and evolutionary computation (GECCO 2011),  Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 2011-2018. DOI: [http://dx.doi.org/10.1145/2001576.2001846 10.1145/2001576.2001846]&lt;br /&gt;
|-&lt;br /&gt;
|2011-02-04&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
|HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms. By Christopher Nell, Chris Fawcett, Holger H. Hoos, and Kevin Leyton-Brown. [http://hal.cs.ubc.ca/pubs/NelEtAl11.pdf PDF]&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-17&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
|A. LaTorre, S. Muelas, and J.-M. PeÃ±a. A MOS-based dynamic memetic  differential evolution algorithm for continuous optimization: a  scalability test. Soft Computing. Special issue on Scalability of Evolutionary Algorithms and other Metaheuristics for Large Scale  Continuous Optimization Problems. DOI [http://dx.doi.org/10.1007/s00500-010-0646-3 10.1007/s00500-010-0646-3]&lt;br /&gt;
|-&lt;br /&gt;
|2010-11-10&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|A Rigorous Analysis of the Harmony Search Algorithm--How the Research Community can be misled by a &amp;quot;novel&amp;quot; Methodology. Dennis Weyland. International Journal of Applied Metaheuristic Computing, volume 1-2, April-June 2010, pages 50-60.  DOI: [http://dx.doi.org/10.4018/jamc.2010040104 10.4018/jamc.2010040104]&lt;br /&gt;
&lt;br /&gt;
Survival of the Fittest Algorithm or the Novelest Algorithm?: The Existence Reason of the Harmony Search Algorithm. Zong Woo Geem.&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-09-23&lt;br /&gt;
|Gianpiero Francesca&lt;br /&gt;
|Wenyin Gong, Ãlvaro Fialho and Zhihua Cai. Adaptive Strategy Selection in Differential Evolution. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 409-416. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/68/PDF/AOS-DE.pdf]&lt;br /&gt;
&lt;br /&gt;
Ãlvaro Fialho, Marc Schoenauer and Michele Sebag. Toward Comparison-based Adaptive Operator Selection. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 767-774. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/64/PDF/banditGECCO10.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-06-03&lt;br /&gt;
|Tianjun Liao &lt;br /&gt;
|Population-Based Algorithm Portfolios for Numerical Optimization. Peng, F. Tang, K.Chen, G.Yao, X. IEEE Transactions on Evolutionary Computation. DOI: [http://dx.doi.org/10.1109/TEVC.2010.2040183 10.1109/TEVC.2010.2040183] &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-07&lt;br /&gt;
|Zhi (Eric) Yuan&lt;br /&gt;
|Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. L. Xu, H.H. Hoos, K. Leyton-Brown. To appear at the Conference of the Association for the Advancement of Artificial Intelligence (AAAI-10), 2010. [http://ws.cs.ubc.ca/~kevinlb/pub.php?u=2010-AAAI-Hydra.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-04&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|A. Schaerf and L. Di Gaspero. [[:Image:ElPaCo_presentation.pdf|Slides of the tutorial  &amp;quot;An Overview of Local Search Software Tools&amp;quot;]] given at &amp;quot;Learning and Intelligent OptimizatioN (LION 2007)&amp;quot;, December 8-12, 2007, Trento, Italy.&lt;br /&gt;
&lt;br /&gt;
L. Di Gaspero and A. Schaerf. EASY LOCAL++: An object-oriented framework for ï¬‚exible design of local search algorithms. Software â€” Practice &amp;amp; Experience, 33(8):733â€“765, July 2003. [http://www.diegm.uniud.it/satt/papers/DiSc03.pdf]&lt;br /&gt;
&lt;br /&gt;
S. Cahon, N. Melab and T. El Ghazali. ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. Journal of Heuristics, 10(3):357-380, November 2004. [http://dx.doi.org/10.1023/B:HEUR.0000026900.92269.ec]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-19&lt;br /&gt;
|Sabrina M. de Oliveira&lt;br /&gt;
|A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Session on Real Parameter Optimization. S. Garcia, D. Molina, M. Lozano, F. Herrera - Journal of Heuristics, Volume 15, pp. 617-644, 2009. [http://sci2s.ugr.es/programacion/workshop/GarciaMolinaLozanoHerrera-JH2008.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-04&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|Analyzing Bandit-based Adaptive Operator Selection Mechanisms. Ãlvaro Fialho, Luis Da Costa, Marc Schoenauer and MichÃ©le Sebag. &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-01-14&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|SATzilla: Portfolio-based Algorithm Selection for SAT. L. Xu, F. Hutter, H. H. Hoos, K. Leyton-Brown - Journal of Artificial Intelligence Research, Volume 32, pp. 565-606, 2008. [http://www.jair.org/media/2490/live-2490-3923-jair.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2009-12-11&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|SATenstein: Automatically Building Local Search SAT Solvers From Components. Ashiqur R. KhudaBukhsh, Lin Xu, Holger H. Hoos and Kevin Leyton-Brown - Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 517-524, 2009. [http://www.cs.ubc.ca/labs/beta/Projects/SATenstein/SATenstein_ijcai.pdf]&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Other Previous Meetings==&lt;br /&gt;
&lt;br /&gt;
See [[Previous Optimization meetings | Minutes and agendas from previous meetings]].&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Lab_responsibilities&amp;diff=5997</id>
		<title>Lab responsibilities</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Lab_responsibilities&amp;diff=5997"/>
		<updated>2012-04-06T14:46:03Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: linkify tech reps&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;MD = Marco Dorigo, TS = Thomas StÃ¼tzle, MB = Mauro Birattari&lt;br /&gt;
=Servers, infrastructures, and assets=&lt;br /&gt;
{| border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
!Task&lt;br /&gt;
!Responsible&lt;br /&gt;
!Supervisor&lt;br /&gt;
!Comment&lt;br /&gt;
|-&lt;br /&gt;
| IRIDIA server maintenance&lt;br /&gt;
| Giovanni &lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| [[Development_Server | Development server maintenance]]&lt;br /&gt;
| Alessandro, Manuel&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Backup server maintenance&lt;br /&gt;
| Eliseo &lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Cluster maintenance&lt;br /&gt;
| JÃ©rÃ©mie, Manuele&lt;br /&gt;
| TS &lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Proceedings repository&lt;br /&gt;
| Leonardo&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Wireless network&lt;br /&gt;
| Nithin, Roman&lt;br /&gt;
| TS&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Printers, scanner, fax&lt;br /&gt;
| Nithin&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Workshop&lt;br /&gt;
| Manuele&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Photo-Video&lt;br /&gt;
| Gabriele&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Management Coffee Room&lt;br /&gt;
| Vito&lt;br /&gt;
| TS&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Reading material in Coffee Room&lt;br /&gt;
| Alessandro&lt;br /&gt;
| TS&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Mac OS X support and Muriel's Mac&lt;br /&gt;
| Andreagiovanni&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=Web sites, wiki pages, and mailing lists=&lt;br /&gt;
{| border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
!Task&lt;br /&gt;
!Responsible&lt;br /&gt;
!Supervisor&lt;br /&gt;
!Comment&lt;br /&gt;
|-&lt;br /&gt;
| Web pages (CoDE/IRIDIA)   &lt;br /&gt;
| Dhananjay, Romain&lt;br /&gt;
| TS&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Databases&lt;br /&gt;
| Andreagiovanni&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Maintenance websites of completed projects&lt;br /&gt;
| Carlo&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
|Swarmanoid wiki-page&lt;br /&gt;
| Vito&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| ACO website maintenance&lt;br /&gt;
| Romain, Leonardo&lt;br /&gt;
| TS &lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| IRIDIA mailing lists&lt;br /&gt;
| Leslie, Tianjun&lt;br /&gt;
| TS&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| ACO mailing list&lt;br /&gt;
| Tianjun, Leonardo&lt;br /&gt;
| TS &lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Wiki support  &lt;br /&gt;
| Alessandro, Sabrina&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=Organization of conferences and events=&lt;br /&gt;
{| border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
!Task&lt;br /&gt;
!Responsible&lt;br /&gt;
!Supervisor&lt;br /&gt;
!Comment&lt;br /&gt;
|-&lt;br /&gt;
| ANTS 2012&lt;br /&gt;
| Andreagiovanni&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=Support to new members and visitors=&lt;br /&gt;
{| border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
!Task&lt;br /&gt;
!Responsible&lt;br /&gt;
!Supervisor&lt;br /&gt;
!Comment&lt;br /&gt;
|-&lt;br /&gt;
| Assistance to visitors and new members&lt;br /&gt;
| Franco&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Assistance to applicants &lt;br /&gt;
| Gabriele&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=Seminars and meetings=&lt;br /&gt;
{| border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
!Task&lt;br /&gt;
!Responsible&lt;br /&gt;
!Supervisor&lt;br /&gt;
!Comment&lt;br /&gt;
|-&lt;br /&gt;
| [[IRIDIA Seminars | IRIDIA Seminars ]]&lt;br /&gt;
| Leslie, Dhananjay&lt;br /&gt;
| MB&lt;br /&gt;
| Write to seminars-owner@iridia.ulb.ac.be&lt;br /&gt;
|-&lt;br /&gt;
| [[IRIDIA Seminars | Seminar Room Booking ]]   &lt;br /&gt;
| Leslie, Dhananjay&lt;br /&gt;
| TS&lt;br /&gt;
| Write to seminars-owner@iridia.ulb.ac.be&lt;br /&gt;
|-&lt;br /&gt;
| Seminars (Technicals)&lt;br /&gt;
| Sabrina, Tianjun&lt;br /&gt;
| TS&lt;br /&gt;
| Set up seminar room&lt;br /&gt;
|-&lt;br /&gt;
| Seminars (Punctuality)&lt;br /&gt;
| Vito, Manuel&lt;br /&gt;
| TS&lt;br /&gt;
| Make sure seminars start on time&lt;br /&gt;
|-&lt;br /&gt;
| Admin meeting&lt;br /&gt;
| Michele&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Robotics meeting&lt;br /&gt;
| Vito&lt;br /&gt;
| MB &lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| [[Optimization Group Meetings | Optimization meetings ]]&lt;br /&gt;
| Manuel&lt;br /&gt;
| TS &lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=Library, technical reports, and supplementary pages=&lt;br /&gt;
{| border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
!Task&lt;br /&gt;
!Responsible&lt;br /&gt;
!Supervisor&lt;br /&gt;
!Comment&lt;br /&gt;
|-&lt;br /&gt;
| [[IRIDIA_Technical_reports|IRIDIA Technical Reports]]&lt;br /&gt;
| Gabriele, Romain&lt;br /&gt;
| MB&lt;br /&gt;
| Write to techrep@iridia.ulb.ac.be&lt;br /&gt;
|-&lt;br /&gt;
| Techrep covers (for non-latex users)&lt;br /&gt;
| Eric, Sabrina&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| [[Iridia_Supplementary_Information_Instructions_page|Supplementary pages]]&lt;br /&gt;
| Eliseo&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=Robotics: hardware and software=&lt;br /&gt;
{| border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
!Task&lt;br /&gt;
!Responsible&lt;br /&gt;
!Supervisors&lt;br /&gt;
!Comment&lt;br /&gt;
|-&lt;br /&gt;
| Swarmanoid simulator&lt;br /&gt;
| Carlo, Gabriele&lt;br /&gt;
| MB &lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| E-puck hardware&lt;br /&gt;
| Gianpiero, Manuele&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Foot-bot hardware&lt;br /&gt;
| Andreagiovanni, Giovanni&lt;br /&gt;
| MB &lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Eye-bot and Hand-bot hardware&lt;br /&gt;
| Nithin&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Robotics Lab&lt;br /&gt;
| Gianpiero&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Tracking System&lt;br /&gt;
| Alessandro&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|- &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=Didactics=&lt;br /&gt;
{| border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- &lt;br /&gt;
!Task&lt;br /&gt;
!Responsible&lt;br /&gt;
!Supervisors&lt;br /&gt;
!Comment&lt;br /&gt;
|-&lt;br /&gt;
| Supervision of Master students&lt;br /&gt;
| As needed&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Supervision TRAN-H-201&lt;br /&gt;
| Romain, Gaetan(Jun 2012)&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Admin PROJ-H-402&lt;br /&gt;
| Roman&lt;br /&gt;
| MB&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| INFO-H-414: ACO&lt;br /&gt;
| Eric, Sabrina&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| INFO-H-414: PSO&lt;br /&gt;
| Vito&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| INFO-H-414: Swarm Robotics&lt;br /&gt;
| Carlo, Manuele&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| iThenticate - SI&lt;br /&gt;
| Gabriele&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
| Dorigo's Web pages&lt;br /&gt;
| Andreagiovanni&lt;br /&gt;
| MD&lt;br /&gt;
| N/A&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=5993</id>
		<title>Optimization Group Meetings</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=5993"/>
		<updated>2012-04-03T15:13:35Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: new literature&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;You can subscribe to an [http://en.wikipedia.org/wiki/ICalendar iCalendar] of these meetings at http://iridia.ulb.ac.be/Calendars/publish.php/_NUC_Optimization.ics&lt;br /&gt;
&lt;br /&gt;
==Breakfast Meetings==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
Breakfast meetings are informal meetings where there is a general discussion or someone presents their work. And additional goal is to have breakfast together.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, and a short summary of what you are going to talk about.&lt;br /&gt;
# Add a new entry to the table below.&lt;br /&gt;
# Bring breakfast.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Breakfast Meetings ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;200&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Summary&lt;br /&gt;
|-&lt;br /&gt;
|2011-03-10&lt;br /&gt;
|Stefanie Kritzinger&lt;br /&gt;
| A Unified Framework for Routing Problems with Fixed Fleet Size&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-21&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
| Off-line vs. On-line Tuning: A Study on MAX-MIN Ant System for the TSP&lt;br /&gt;
|-&lt;br /&gt;
|2010-10-19&lt;br /&gt;
|Stefano Benedettini&lt;br /&gt;
| Experiments on Boolean Network Design by Local Search Algorithms.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-20&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
| The social learning strategies tournament, organized as part of the [http://www.intercult.su.se/cultaptation/ cultaptation project], and its results were described. No ideas about algorithm portfolios were discussed.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-??&lt;br /&gt;
|Renaud Lenne&lt;br /&gt;
| ???&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-04-29&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|The maximum clique problem, state of the art and ACO [http://dx.doi.org/10.1016/j.cor.2009.02.013] [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.80.2036&amp;amp;rep=rep1&amp;amp;type=pdf] [http://www710.univ-lyon1.fr/~csolnon/publications/rr-mai04.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-18&lt;br /&gt;
|Sabrina Oliveira&lt;br /&gt;
|Achieved results from the application of the Population Based Ant Colony Optimisation algorithm to TSP.&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-11&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|An overview of Container Loading Problems. &lt;br /&gt;
|-&lt;br /&gt;
| 2010-01-21&lt;br /&gt;
|Yuan, Zhi (Eric)&lt;br /&gt;
| Rice cooker vs. the idea of tuning. &lt;br /&gt;
|-&lt;br /&gt;
|2010-01-07&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|General discussion about the optimization group. &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Literature Sessions==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
The goal of the Literature Sessions is to examine and discuss&lt;br /&gt;
particularly interesting papers from the research literature. For each&lt;br /&gt;
session, one paper will be selected, there will be a short&lt;br /&gt;
presentation (10-15 minutes) about the contents, and a discussion will&lt;br /&gt;
ensue. Sessions will last around 40-45 minutes. Attendants should read&lt;br /&gt;
the paper before the session in order to have a productive discussion. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Book a room (ask Muriel).&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, a reference to the paper and the URL where it can be obtained. Also, attach the paper in PDF.&lt;br /&gt;
# Add a new entry to the table below. Use YYY-MM-DD (year-month-day) format for the date. Please add a complete bibliographic reference (you may find it in the homepages of the authors) and a hyperlink to a PDF (links to http://dx.doi.org are preferred).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Literature Sessions ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;180&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Paper discussed&lt;br /&gt;
|-&lt;br /&gt;
|2012-04-03&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|On the automatic discovery of variants of the NEH procedure for flow   shop scheduling using genetic programming. J A VÃ¡zquez-RodrÃ­guez and G Ochoa.Journal of the Operational Research Society (2011) 62, 381â€“396.   doi:[http://dx.doi.org/10.1057/jors.2010.132  10.1057/jors.2010.132]&lt;br /&gt;
|-&lt;br /&gt;
|2011-12-08&lt;br /&gt;
|Zhi Yuan&lt;br /&gt;
|Frank Hutter, Holger Hoos, and Kevin Leyton-Brown. Sequential Model-Based Optimization for General Algorithm Configuration. In Proceedings of Learning and Intelligent Optimization (LION 5), 2011. PDF: [http://www.cs.ubc.ca/~hutter/papers/11-LION5-SMAC.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2011-11-24&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|Ender Ã–zcan and Andrew J. Parkes. 2011. Policy matrix evolution for  generation of heuristics. In Proceedings of the 13th annual  conference on Genetic and evolutionary computation (GECCO 2011),  Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 2011-2018. DOI: [http://dx.doi.org/10.1145/2001576.2001846 10.1145/2001576.2001846]&lt;br /&gt;
|-&lt;br /&gt;
|2011-02-04&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
|HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms. By Christopher Nell, Chris Fawcett, Holger H. Hoos, and Kevin Leyton-Brown. [http://hal.cs.ubc.ca/pubs/NelEtAl11.pdf PDF]&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-17&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
|A. LaTorre, S. Muelas, and J.-M. PeÃ±a. A MOS-based dynamic memetic  differential evolution algorithm for continuous optimization: a  scalability test. Soft Computing. Special issue on Scalability of Evolutionary Algorithms and other Metaheuristics for Large Scale  Continuous Optimization Problems. DOI [http://dx.doi.org/10.1007/s00500-010-0646-3 10.1007/s00500-010-0646-3]&lt;br /&gt;
|-&lt;br /&gt;
|2010-11-10&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|A Rigorous Analysis of the Harmony Search Algorithm--How the Research Community can be misled by a &amp;quot;novel&amp;quot; Methodology. Dennis Weyland. International Journal of Applied Metaheuristic Computing, volume 1-2, April-June 2010, pages 50-60.  DOI: [http://dx.doi.org/10.4018/jamc.2010040104 10.4018/jamc.2010040104]&lt;br /&gt;
&lt;br /&gt;
Survival of the Fittest Algorithm or the Novelest Algorithm?: The Existence Reason of the Harmony Search Algorithm. Zong Woo Geem.&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-09-23&lt;br /&gt;
|Gianpiero Francesca&lt;br /&gt;
|Wenyin Gong, Ãlvaro Fialho and Zhihua Cai. Adaptive Strategy Selection in Differential Evolution. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 409-416. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/68/PDF/AOS-DE.pdf]&lt;br /&gt;
&lt;br /&gt;
Ãlvaro Fialho, Marc Schoenauer and Michele Sebag. Toward Comparison-based Adaptive Operator Selection. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 767-774. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/64/PDF/banditGECCO10.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-06-03&lt;br /&gt;
|Tianjun Liao &lt;br /&gt;
|Population-Based Algorithm Portfolios for Numerical Optimization. Peng, F. Tang, K.Chen, G.Yao, X. IEEE Transactions on Evolutionary Computation. DOI: [http://dx.doi.org/10.1109/TEVC.2010.2040183 10.1109/TEVC.2010.2040183] &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-07&lt;br /&gt;
|Zhi (Eric) Yuan&lt;br /&gt;
|Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. L. Xu, H.H. Hoos, K. Leyton-Brown. To appear at the Conference of the Association for the Advancement of Artificial Intelligence (AAAI-10), 2010. [http://ws.cs.ubc.ca/~kevinlb/pub.php?u=2010-AAAI-Hydra.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-04&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|A. Schaerf and L. Di Gaspero. [[:Image:ElPaCo_presentation.pdf|Slides of the tutorial  &amp;quot;An Overview of Local Search Software Tools&amp;quot;]] given at &amp;quot;Learning and Intelligent OptimizatioN (LION 2007)&amp;quot;, December 8-12, 2007, Trento, Italy.&lt;br /&gt;
&lt;br /&gt;
L. Di Gaspero and A. Schaerf. EASY LOCAL++: An object-oriented framework for ï¬‚exible design of local search algorithms. Software â€” Practice &amp;amp; Experience, 33(8):733â€“765, July 2003. [http://www.diegm.uniud.it/satt/papers/DiSc03.pdf]&lt;br /&gt;
&lt;br /&gt;
S. Cahon, N. Melab and T. El Ghazali. ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. Journal of Heuristics, 10(3):357-380, November 2004. [http://dx.doi.org/10.1023/B:HEUR.0000026900.92269.ec]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-19&lt;br /&gt;
|Sabrina M. de Oliveira&lt;br /&gt;
|A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Session on Real Parameter Optimization. S. Garcia, D. Molina, M. Lozano, F. Herrera - Journal of Heuristics, Volume 15, pp. 617-644, 2009. [http://sci2s.ugr.es/programacion/workshop/GarciaMolinaLozanoHerrera-JH2008.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-04&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|Analyzing Bandit-based Adaptive Operator Selection Mechanisms. Ãlvaro Fialho, Luis Da Costa, Marc Schoenauer and MichÃ©le Sebag. &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-01-14&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|SATzilla: Portfolio-based Algorithm Selection for SAT. L. Xu, F. Hutter, H. H. Hoos, K. Leyton-Brown - Journal of Artificial Intelligence Research, Volume 32, pp. 565-606, 2008. [http://www.jair.org/media/2490/live-2490-3923-jair.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2009-12-11&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|SATenstein: Automatically Building Local Search SAT Solvers From Components. Ashiqur R. KhudaBukhsh, Lin Xu, Holger H. Hoos and Kevin Leyton-Brown - Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 517-524, 2009. [http://www.cs.ubc.ca/labs/beta/Projects/SATenstein/SATenstein_ijcai.pdf]&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Other Previous Meetings==&lt;br /&gt;
&lt;br /&gt;
See [[Previous Optimization meetings | Minutes and agendas from previous meetings]].&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Moving_to_Brussels&amp;diff=5880</id>
		<title>Moving to Brussels</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Moving_to_Brussels&amp;diff=5880"/>
		<updated>2012-02-26T19:36:30Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: fixes&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Moving to a new country can be both exciting and frustrating. Everything is fascinating and at the same time it can be confusing to find your way around a new city, a culture and possibly a new language. The objective of this page is to provide some information for newcomers to IRIDIA, such as Ph.D. students, and Brussels in general in order to make the initial couple of weeks a bit easier. The information contained in this document has been collected by people who have been through the process. If you have any questions, suggestions, additions or such, please make them.&lt;br /&gt;
&lt;br /&gt;
NOTE for ITALIANS: for any kind of information or help, there is the [http://www.patronatoacli.be/it/le-nostre-sedi-20 Patronato Acli]. They can help for any kind of issues you have (accommodation, health,...) and it's all for free.&lt;br /&gt;
&lt;br /&gt;
== Short-term accommodation ==&lt;br /&gt;
&lt;br /&gt;
For short-term accommodation (that is a place to sleep for the first couple of weeks you are in Brussels) a bed and breakfast is a convenient option. Depending on your budget and confidence in finding more long-term accommodation quickly there is a number of different options to choose from:&lt;br /&gt;
&lt;br /&gt;
* [http://www.csfds.be  Centre Sportif de la Foret de Soignes] is a sports facility in the outskirts of Brussels. It is quite cheap for longer stays at ~230 euro/month or ~16 euros/day for shorter stays. There is easy access to the university: [http://www.stib.irisnet.be/FR/40000Fre/B/40072F.htm   Bus number 72] runs directly between ULB and the center (also known as A.D.E.P.S.) and the ride is 15 to 20 mins. And that is about all the good things that there are to say about the place. Breakfast is not included, the rooms are very basic, the reception closes at 23h00 on weekdays, 22h00 on Saturdays and at 20h00 on Sundays. You either have to be there before closing time or you'll have to arranged with the Security staff or the reception, that you will come at a later hour. Being so far out is by no means an ideal way to get acquainted with the city. However, if you intend to stay in short-term for a whole month [http://www.csfds.be  Centre Sportif de la Foret de Soignes] might be the least expensive option. If you want to book a room there you have to do it through IRIDIA.&lt;br /&gt;
* [http://www.bnb-brussels.be  Bed &amp;amp;amp; Brussels] manages rooms in more than 100 guesthouses. Have a look and contact them if you are interested. If you book a room make sure that it is close to the university (Ixelles 1050 or Uccle 1180). '''Hint:''' Go to [http://www.maporama.com   Maporama] and punch in the address of the guest house to see how far it is from ULB.&lt;br /&gt;
* [http://rycx.be/bedbreakfast/en/ Rycx's family house] The guest house at Square Robert Goldschmidt, 50 - B-1050 Brussels, Belgium] should be quite good, inexpensive and very close to the university. They only have few rooms.&lt;br /&gt;
* [http://www.brusselsdestination.be/en/index.html Brussels Destination] offers rooms, flats, and studios for stays of 4 weeks or longer. At the moment of writing this, the map offered by the site is often incorrect, so be sure to check the address given using a different map.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Long-term accommodation ==&lt;br /&gt;
In case you do not already live in Brussels, one of the first and most important things to do obviously is to find an apartment. One option is to buy the magazine &amp;quot;Vlan&amp;quot; where you have lots of ads for flats and etc. You can as well visit the [http://www.vlan.be  Vlan website], which is very good and publishes the announcements shortly after they are published in the magazine. You can try out [http://www.immoweb.be   IMMOWEB.be] on which apartments are also advertised. Another great website full of ads for apartments and furniture is [http://www.expatriates.com/classifieds/bru/ Expats in Brussel].&lt;br /&gt;
&lt;br /&gt;
An alternative method is to simply walk around in the neighborhood you are interested in living in as the landlords hang out easy identifiable announcements. As this might not be a usual way to find accommodation in other countries it works in Belgium. There are a lot of signs put up and sometimes this is the only way in which apartments are advertised. Walking around is probably a bit more time consuming than finding a flat through the Vlan, but on the other side you get to know the area, and you are likely to find one of the apartments close to the University not advertised on the web. The signs read &amp;quot;A Louer&amp;quot; or &amp;quot;Te Huur&amp;quot;, which translates to &amp;quot;for rent&amp;quot;. There are lots of rooms and apartments for rent. They vary a lot in terms of quality and price, so you might have to spend some time to find something that suites your budget and your style.&lt;br /&gt;
&lt;br /&gt;
Most other students at IRIDIA live quite close to the university; choosing a place in the neighborhood is likely to improve your social life.&lt;br /&gt;
&lt;br /&gt;
In case you don't speak any French it is recommendable to ask a French speaker (e.g. at IRIDIA) to check the contract. Even though the probability is low that some landlord wants to cheat, it is always better to know what exactly is written in the contract!&lt;br /&gt;
&lt;br /&gt;
=== Renting an apartment ===&lt;br /&gt;
Once you have found the property you want to rent, you need a lease (bail/kontract), an inventory (etat des lieux/plaatsbeschrijving), a security deposit, and to get the phone, electricity and gas reconnected.&lt;br /&gt;
&lt;br /&gt;
There is an element of Catch 22 here - there is a certain order to get things done that, at times, seems to be mutually exclusive.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''The lease'''&lt;br /&gt;
&lt;br /&gt;
Belgium has an odd system of a standard nine-year flexible lease, and an inflexible three-year lease. At first sight the three-year lease seems the most attractive to a newcomer whose time in the country is uncertain, but this is not necessarily the case.&lt;br /&gt;
&lt;br /&gt;
A three-year lease can be for any agreed period up to a maximum of three years. It fixes the rent for the period of the lease and commits the tenant to pay for the entire period of the lease. It can include a diplomatic clause (designed to indemnify the tenant if he wants to break the lease because he is leaving the country) but these have been nullified by the Belgian Courts in the past.&lt;br /&gt;
&lt;br /&gt;
It is thus better to opt for a nine-year lease, which can in fact be broken by giving three months notice. But if you leave in the first, second or third year, you will pay an indemnity of three, two and one month's rent respectively. From year four, there is no penalty for leaving.&lt;br /&gt;
&lt;br /&gt;
The monthly rent is fixed for nine years subject to the normal state-controlled annual indexation. The landlord can only give you notice if they intend to occupy the property personally, need to carry out major works (where major has a legal definition), or at the end of year three or year six, for no reason but subject to compensation to the tenant of nine or six month's rent respectively.&lt;br /&gt;
&lt;br /&gt;
For an apartment, the monthly outgoing may include an element of rent and a fixed amount of service charge. Usually the service charge is just a prepayment (provision pour charges/vooruitbetaling) and there will be an annual assessment of common charges for the property that you will share in.&lt;br /&gt;
&lt;br /&gt;
If you want to negotiate a better price, negotiate down the rental not the service charges! If there are things you want the landlord to correct before you move in, don't sign the lease until they have happened.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''The inventory'''&lt;br /&gt;
&lt;br /&gt;
The inventory (etat des lieux /plaatsbeschrijvin) is the source of more misery to tenants than any other legal document.&lt;br /&gt;
&lt;br /&gt;
Typically, the landlord's agent prepares a stunningly detailed list of the condition of the property complete with photographs. The tenant reads it or not and signs. At the end of the lease, the landlord's agent checks the property and finds an unreasonable amount of property damage.&lt;br /&gt;
&lt;br /&gt;
Expats have been charged for scratches in the bath that were there before they arrived, and for damp patches caused by the landlord's failure to repair a roof. That the cost of the damage often comes to about the level of the retained security deposit is a coincidence of course!&lt;br /&gt;
&lt;br /&gt;
It is bad enough to have someone who seems to be less than independent assessing costs against you, even more irritating is that you have to pay 50 percent of his bill. Some agents insist you sign a document agreeing to the fee and to accept his expertise before he starts. Don't do so.&lt;br /&gt;
&lt;br /&gt;
The way to avoid all such problems is simple. Select your own agent (expert immobilier/expert) to do the check-in and the check-out. That way both parties get a truly independent and fair assessment.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''The security deposit'''&lt;br /&gt;
&lt;br /&gt;
You will either need to pay around three months rental up front as a security deposit against tenant-effected damages, or to ask your bank for a guarantee.&lt;br /&gt;
&lt;br /&gt;
The latter option is basically a low-cost insurance policy sold to you by the bank which gets your salary as its means of security. It is typically the better option because a bad-faith landlord needs to prove to the bank that he deserves the guarantee.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Home insurance'''&lt;br /&gt;
&lt;br /&gt;
Whether you own or rent your property, you need to get insurance. Almost all rental agreements in Belgium require the tenant to take out insurance on the rented property within 30 days of signing a lease. This insurance is required by the Belgian Civil Code, which holds a tenant responsible for any damage to the building unless proof can be given that it was not his/her fault.&lt;br /&gt;
&lt;br /&gt;
If you are renting, take your lease with you when you arrange your insurance. You are also responsible for providing cover against third party liability, but the owner is required to have a policy covering the property against earthquakes, lightning, fire, etc. If you are in furnished accommodation, you are required to take out insurance against damage to the landlord's furniture.&lt;br /&gt;
&lt;br /&gt;
Contents insurance is not compulsory but advisable. Remember that theft is not covered automatically in contents insurance: it is an option. Valuable personal items such as jewellery or cameras may require an all risks policy, which will cover you for damage or loss in or out of the home. Premiums on these for desirables such as laptop computers are high.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Sharing an apartment/Renting a room ===&lt;br /&gt;
&lt;br /&gt;
Sharing an apartment or renting a room in some bigger building which features common space for every inhabitant has several advantages over living alone:&lt;br /&gt;
&lt;br /&gt;
* you'll be never be alone&lt;br /&gt;
* it's cheaper&lt;br /&gt;
* you will most certainly learn french a lot faster (or chinese, or...)&lt;br /&gt;
* it will improve your social life&lt;br /&gt;
* you can rely on the knowledge of your flatmates about Brussels&lt;br /&gt;
&lt;br /&gt;
Of course, it has several disadvantages:&lt;br /&gt;
&lt;br /&gt;
* you'll be never be alone&lt;br /&gt;
* you have to share kitchen and bathroom, which isn't always nice&lt;br /&gt;
&lt;br /&gt;
It's certainly not for everyone, but it's a good and fun option. It heavily depends on your flatmates, so finding a good match is even more important than finding a nice appartment to share.&lt;br /&gt;
&lt;br /&gt;
''' Options '''&lt;br /&gt;
&lt;br /&gt;
If you want to share a house/apartment, you should know a few things. You basically have two options when you want to do this:&lt;br /&gt;
&lt;br /&gt;
# Rent a room in a bigger building (kind of student-dorm like) In Belgium single rooms to rent is referred to as a ''kot'' or simply ''chambre''. This is usually the cheapest option, as you can get one for less than 300 Euros including charges. The rooms are usually rented individually by the landlord. The major drawback is that you don't know much about the people you're going to share the common rooms with. Sometimes these rooms are simply part of a Belgian family household, so if you're seeking contact to local people this might be a good way. Usually a kot is rented by young people and erasmus students.&lt;br /&gt;
# A ''colocation'' on the other hand is when several people rent a house/appartment together. You usually have more space and closer relationship to your flatmates. For this reason, you should choose them wisely. If your looking for a rich social life, this is the way to go. Colocations start around 300 Euros, but are usually around 450 Euros for a reasonably spaced room.&lt;br /&gt;
&lt;br /&gt;
''' Where to look '''&lt;br /&gt;
&lt;br /&gt;
In order to find a kot/colocation, you have several ways to look for it:&lt;br /&gt;
* For a kot go to the l'office de logement in building F1 on campus Solbosch. On the first floor are two big boards full of offers. Note that these offers are usually made by landlords which are french-speaking. You can access a list here: http://wwwdev.ulb.ac.be/intranet/logements/scripts/logpub.php (for contact details you have to write the office or have a look at the board though).&lt;br /&gt;
* Check the streets and the university buildings for handwritten ads.&lt;br /&gt;
* http://www.xpats.com/clads/clads_display.php?Action=view&amp;amp;categorie=7&amp;amp;start=60&lt;br /&gt;
* http://xsorbit29.com/users5/stageforum/index.php?board=4.0&lt;br /&gt;
* http://bruxelles.vivastreet.be/annonces-colocation+bruxelles&lt;br /&gt;
* http://www.languesvivantes.com/uk/roomsinbrussels.htm&lt;br /&gt;
* http://www.recherche-colocation.com/ (commercial, you have to pay to get contact details)&lt;br /&gt;
* http://www.appartager.be/ (commercial, you have to pay to get contact details)&lt;br /&gt;
&lt;br /&gt;
=== Furniture ===&lt;br /&gt;
&lt;br /&gt;
If you move into an unfurnished apartment, [http://www.ikea.be IKEA] is a good option. They have two branches in Brussels, the one in Zaventem is close to the airport. You can even rent a truck there to take your new furniture to your place (and it is not expensive).&lt;br /&gt;
&lt;br /&gt;
Another option is second-hand furniture. Brussels houses lots of expats coming and going, so often you can find good deals for second-hand items ranging from apartments, furniture and cars. [http://www.xpats.com   XPATS.com] - a site for expatriates in Brussels and the surrounding area. Go to the [http://www.xpats.com/classifieds_main.shtml   Classified]  section and choose the http://www.xpats.com/clads/clads_display.php?Action=view&amp;amp;categorie=12   For sale section]. There is usually heaps of stuff for sale and many new ads are added daily.&lt;br /&gt;
&lt;br /&gt;
== Currency ==&lt;br /&gt;
&lt;br /&gt;
Belgium is in the eurozone, sharing a common currency with Austria, France, Germany, Greece, Ireland, Italy, Luxembourg, Spain, Portugal and the Netherlands.&lt;br /&gt;
&lt;br /&gt;
Of the old EU countries, Sweden, Denmark and the UK are the outsiders and many of the 10 new EU countries plan to adopt the euro when they are ready to do so, but not for a few years yet.&lt;br /&gt;
&lt;br /&gt;
Coins: 1 cent, 2 cents, 5 cents, 10 cents, 20 cents, 50 cents, 1 EUR, 2 EUR&lt;br /&gt;
&lt;br /&gt;
Notes: 5 EUR, 10 EUR, 20 EUR, 50 EUR, 100 EUR, 200 EUR, 500 EUR&lt;br /&gt;
&lt;br /&gt;
On one side of the coins is a European Union emblem showing a map of the eurozone surrounded by the 12 stars of the union. On the other side is a design specific to the country where it was minted.&lt;br /&gt;
&lt;br /&gt;
Euros from any of the 12 countries may be used anywhere in the EU. All euro notes are the same, regardless of which country they come from.&lt;br /&gt;
&lt;br /&gt;
=== Paying for goods and services ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Cash'''&lt;br /&gt;
&lt;br /&gt;
Cash dispensers are everywhere where there is a bank, and they all take Bancontact cards issued by local banks. But beware, you might have to wander around to find one that takes your Visa or MasterCard or other major credit and debit cards.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Credit and Debit Cards'''&lt;br /&gt;
&lt;br /&gt;
Most types of credit card are widely accepted. If you get a standard Visa or Eurocard/MasterCard from a local bank, the standard option is for this to operate like a debit card, with the full balance taken from your account each month.&lt;br /&gt;
&lt;br /&gt;
A full service credit option is widely available on request.&lt;br /&gt;
&lt;br /&gt;
Diner's, American Express and other major international credit cards can also be obtained and used in Belgium.&lt;br /&gt;
&lt;br /&gt;
The most common card in Belgium is the Mister Cash-Bancontact card. It is linked to your current account, and is accepted in department stores, supermarkets, gas stations, and high street shops everywhere. It's a good idea to have one of these, as there are still many places in Belgium that don't accept alternatives.&lt;br /&gt;
&lt;br /&gt;
A Bancontact card with a PIN number will be issued when you open a Belgian bank account.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Proton'''&lt;br /&gt;
&lt;br /&gt;
Belgium is a pioneer in a cashless society.&lt;br /&gt;
&lt;br /&gt;
The Proton card is actually a chip integrated into your Bancontact card and is like a rechargeable electronic purse.&lt;br /&gt;
&lt;br /&gt;
It is designed to pay for everyday items such as newspapers and cigarettes, as well as&lt;br /&gt;
paying the butcher and the baker.&lt;br /&gt;
&lt;br /&gt;
You can even use it for the parking meter, or to fill up your car with petrol.&lt;br /&gt;
&lt;br /&gt;
This is how it works:&lt;br /&gt;
&lt;br /&gt;
Using your usual four-digit PIN code, you load the card with up to EUR 1,240 at a cash dispenser,and then go shopping.&lt;br /&gt;
&lt;br /&gt;
The shopkeeper enters the amount to be paid into the Proton terminal, and you put your Proton card into the terminal.&lt;br /&gt;
&lt;br /&gt;
When the amount to be paid appears on the screen, you simply press the OK button, and the payment is made.&lt;br /&gt;
&lt;br /&gt;
A word of caution: a lost card is like lost cash so choose the amount you load wisely.&lt;br /&gt;
&lt;br /&gt;
=== Bank account ===&lt;br /&gt;
&lt;br /&gt;
Getting a bank account is straight-forward. Simply choose a bank and set up an interview. Mrs. Laurence Schor (email: first name . second name @ing.be, phone number 02 639 65 46) is an excellent English speaker and very helpful. Make an appointment with her. She works for ING, which is one of the large banks in Belgium and they have a branch only ~400m from the university (Av. de l'Universite 11, 1050 Brussels). You may also open a bank account at the small ING branch on campus Solbosch. To open the bank account, you will need at least a passport (or ID card if you are from EU) and a document proving your relation with the university (e.g., a signed letter from your supervisor). You may need additional documents if you are from outside EU.&lt;br /&gt;
&lt;br /&gt;
Usually, banks can also help out with matters related to insurance of property etc.&lt;br /&gt;
&lt;br /&gt;
== Transportation ==&lt;br /&gt;
&lt;br /&gt;
Getting around Brussels by the public transport system is easy: The city sports a decent system of metros, busses and trams. The first thing to do when you arrive in Brussels is to get a map of the busses, trams and metros. You can get that in many places, e.g. at the Central Station, get one - it will be your best friend in the beginning. &lt;br /&gt;
&lt;br /&gt;
If you want to go straight to UniversitÃ© Libre de Bruxelles (ULB) from the Central Station you should take [http://www.stib.irisnet.be/FR/40000Fre/B/40071F.htm  bus 71] (when you exit the Central Station the stop for 71 is just 40m up the street alongside a number of other stops). It runs fairly frequently - every 20 mins or so - from early morning to midnight.&lt;br /&gt;
&lt;br /&gt;
===Tickets===&lt;br /&gt;
&lt;br /&gt;
In buses and trams you can buy a one-trip ticket for 2 euro from the driver. They will allow you to take any means of urban, public transport for one hour. In metro stations you can also by 5 and 10 trip tickets in machines (11 euro for the 10 trips ticket), which work in the exact same way, but are cheaper. The tickets are called &amp;quot;Jump tickets&amp;quot;. Once you have a ticket, it needs to be stamped by one of the orange machines located in every tram and bus (just remember to validate the ticket every time you get in, in case it's less than an hour from the previous validation, it will not consume a new ride but will stamp a transfer next to the previous one). If you use the metro, remember to stamp the ticket BEFORE entering the metro train (sometimes they have raids where tickets are checked and the cops doing that do not look friendly!)&lt;br /&gt;
&lt;br /&gt;
===Importing a car===&lt;br /&gt;
&lt;br /&gt;
====From outside the EU====&lt;br /&gt;
The various steps in importing a car into Belgium from outside the European Union are lengthy and complicated. Even armed with the most current information from the official Belgian government website, you will almost certainly need the services of a broker or specialized agent. A good agent can help you with the importation of your car, conversion to Belgian specifications, conformity certificate, and technical inspection and licensing.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A car imported into Belgium from outside the EU as part of a move of your personal and household effects can be exempt from customs duties and value-added tax if the following conditions are met:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
You resided outside the EU for at least 12 months before establishing residence in Belgium;&lt;br /&gt;
&lt;br /&gt;
You acquired the car abroad and drove it for at least six months before arrival;&lt;br /&gt;
&lt;br /&gt;
You paid sales tax in another country;&lt;br /&gt;
&lt;br /&gt;
You will retain the car for your personal use for at least 12 months following the date of import.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The Belgian customs authorities require the following documents:&lt;br /&gt;
&lt;br /&gt;
Letter requesting exemption of customs duties and value-added tax;&lt;br /&gt;
&lt;br /&gt;
Invoice for the car;&lt;br /&gt;
&lt;br /&gt;
Certificate of title; &lt;br /&gt;
&lt;br /&gt;
Sales tax receipts; &lt;br /&gt;
&lt;br /&gt;
Certificate of insurance covering at least six months prior to importation; &lt;br /&gt;
&lt;br /&gt;
Proof of residence in a country outside the European Union for at least 12 months before departure; &lt;br /&gt;
&lt;br /&gt;
Proof of residence in Belgium and date of establishment;&lt;br /&gt;
&lt;br /&gt;
Shipping document for personal effects.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
For further information on import procedures, contact Belgian Customs:&lt;br /&gt;
&lt;br /&gt;
Ministere des Finances Service Douane or &lt;br /&gt;
&lt;br /&gt;
Ministerie van Financier Kantoor Douane &lt;br /&gt;
&lt;br /&gt;
Rue Picard 1-3 &lt;br /&gt;
&lt;br /&gt;
1210 Brussels &lt;br /&gt;
&lt;br /&gt;
Tel. 0800.147.95 (toll-free number in Dutch, English, French and German)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Where import duty exemption is not extended, as in the case of a vehicle that has been owned less than six months, a customs duty of io percent and value-added tax of 21 percent of the market value of the car as determined by customs must be paid.&lt;br /&gt;
&lt;br /&gt;
====From within the EU====&lt;br /&gt;
It is much easier to import a car into Belgium from another European Union country. Present the car to the Belgian customs authorities, along with a copy of your Belgian identity card, proof of purchase and previous registration. Value-added tax will have to be paid on new cars (less than six months old or driven less than 6,000 kilometers) but not on cars considered to be secondhand ï¿½?? over six months old and/or with more than 6,000 kilometers on the clock. In all EU member states, VAT on secondhand cars is always paid in the country where the vehicle was purchased, because it is included in the price.&lt;br /&gt;
&lt;br /&gt;
An imported car with valid foreign registration and license plates can be driven immediately upon arrival in Belgium for a maximum of six months. During this period, you must go through the formalities of registering your car with the Belgian authorities and, in the case of non-EU nationals, applying for a Belgian driving license.&lt;br /&gt;
&lt;br /&gt;
== Mobile phone ==&lt;br /&gt;
&lt;br /&gt;
There are several options for getting a mobile phone and/or a SIM card. There are three companies operating in Belgium: &lt;br /&gt;
&lt;br /&gt;
* [http://www.proximus.be Proximus] &lt;br /&gt;
* [http://www.base.be Base] &lt;br /&gt;
* [http://www.mobistar.be Mobistar]&lt;br /&gt;
&lt;br /&gt;
You can buy either a subscription where you pay a monthly fee and they'll send you a bill sized in accordance with your use. Alternatively, you can go for a prepaid card deal, where calls are usually a bit more expensive, but you do not have to lock yourself into a long-term contract. Moreover, you can walk straight into a store and five minutes later you got your own phone number. The prepaid cards can be recharged in tobacco shops and in any of the operator's braches.&lt;br /&gt;
&lt;br /&gt;
Getting a mobile phone number right away is a GOOD IDEA. It is especially useful for finding accommodation. The rumor has it that [http://www.base.be   Base] has the less expensive deals at the moment.&lt;br /&gt;
&lt;br /&gt;
Make sure that your phone is not SIM-locked and that it works with the new card before leaving the store.&lt;br /&gt;
&lt;br /&gt;
== Registering at the local commune ==&lt;br /&gt;
At some point you have to register at the city hall to get a residence permit. However, it's better to wait until you have found yourself some long-term accommodation before registering because they want to have your permanent address. So it's not possible to register until you have a permanent place to live. Officially you have to do it within 3 months of arrival in case you are from an EU member state.&lt;br /&gt;
&lt;br /&gt;
If you live in [http://www.elsene.irisnet.be/ the commune of Ixelles] you have to call the following number: 02.515.66.03, 21, 22 et 23. You can find the office time table to the following direct link of the [http://www.elsene.irisnet.be/site/fr/01officiel/servicescommun/population.htm#etrangers Bureau des etrangers]. If you speak basic French and you are an UE citizen, itÂ´s likely that they will schedule an appointment with you in 2-3 months for the registration. All you have to say is your nationality and that you just arrived in Ixelles and you want to register. They will ask you your last name, your first name, your address in Ixelles and your telephone number.&lt;br /&gt;
&lt;br /&gt;
Some days or weeks later and before the appointment, a police man will come and visit you in your apartment to check that you are really living there (and your family members). Usually, if you are not there at that time, you just need to put your name in your mail box.&lt;br /&gt;
&lt;br /&gt;
You will usually get a residence permit valid for one year at the time, thus you might have to renew your permit every year. For renewing the permission, you have to go to Chausse d'Ixelles 124 to present: a) the confirmation of enrollment of the university, b) a proof of coverage by your health insurance, c) a photo and d) 7.50 EUR.&lt;br /&gt;
&lt;br /&gt;
=== Italians: registering at the AIRE ===&lt;br /&gt;
Italians that are staying in Belgium more than 12 months must register at the [http://www.consbruxelles.esteri.it/Consolato_Bruxelles/Menu/I_Servizi/Per_i_cittadini/Anagrafe/ AIRE (Anagrafe degli Italiani Residenti all'Estero)]. You have to register within 90 days after your arrival, and in order to do that you have to go to the [http://www.consbruxelles.esteri.it/Consolato_Bruxelles/ Consolato d'Italia] in Rue de Livourne, 38. You can schedule an appointment online by clicking on [http://www.consbruxelles.esteri.it/Consolato_Bruxelles/Menu/In_linea_con_utente/Prenota_OnLine/ sportello unico -&amp;gt; prendere appuntamento]. You will need an Italian identity card and a Belgian document like the residence permit.&lt;br /&gt;
&lt;br /&gt;
== Health-care == &lt;br /&gt;
In order to enroll in a health care plan you need contact a ''mutualitÃ©'' for instance [http://www.euromut.be Euromut]. Fill out the web form and they will send you the necessary documents.&lt;br /&gt;
&lt;br /&gt;
It take a while before you can become a member of a mutualitÃ©. However, once you are inscribed you can get any medical expenses reimbursed from the date on which you started at the university. Hence, in case something happens in between arrival and becoming a member of Euromut you are still covered.&lt;br /&gt;
&lt;br /&gt;
Normally Euromut will only provide you a basic, compulsory insurance and the coverage of such an insurance is far from complete. Therefore, it is a good and cheap option to buy additional coverage e.g. for hospitalization. You can do that either through Euromut or another mutualitÃ©. The rumor has it that the insurance through the University is the cheaper one. In order to get such an insurance you should contact the ULB Social Services (internal phone numbers: 3505, 3506, 3507) or simply go to their office in the V building on the third floor (right above the university book store on Av. Adolphe Buyl). You can try with English, but your milage may vary.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== The Belgian healtcare system ===&lt;br /&gt;
You can be assured of the highest-quality medical care in Belgium, regarded as among the best healthcare systems in Europe.&lt;br /&gt;
&lt;br /&gt;
As in most countries, the system divides itself into state and private, though fees are payable in both, so you need to ensure that you are adequately covered through either the state insurance and/or private insurance.&lt;br /&gt;
&lt;br /&gt;
The advantages of the state mutuelle/mutualiteit scheme is that you can choose any doctor, clinic or hospital you like, in any location and without referral, according to your needs in much the same way as you can with private insurance.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Doctors'''&lt;br /&gt;
&lt;br /&gt;
General practitioners can be found in private practices or attached to clinics and hospitals. You are free to consult or register with any you like; similarly with specialist consultants. It may be a decision based on location, language or recommendation.&lt;br /&gt;
&lt;br /&gt;
It's always worth speaking to neighbours or colleagues when you first arrive; everyone knows of a doctor, or has heard of one with a good reputation. Embassies usually keep lists of doctors who can work in your language, though it has to be said that most doctors have a good understanding of English. See for example the webpage &amp;quot;[http://ukinbelgium.fco.gov.uk/en/help-for-british-nationals/when-things-go-wrong/if-you-need-doctor if you need a doctor]&amp;quot; of the UK Embassy.&lt;br /&gt;
&lt;br /&gt;
When you first phone a doctor, check whether they are registered as national health service or private. Some are both, perhaps working at a hospital and also in their own private practice.&lt;br /&gt;
&lt;br /&gt;
One thing to remember when you go to a doctor '''take cash with you'''. Consultations usually end with a handing over of money and very few doctors offer payment by card of any type. If you have state social security, reimbursement rates are calculated and you pay the difference; if you are on a private scheme, or are uninsured, you pay the whole lot there and then. It's always worth checking fees before you book an appointment.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Dentists'''&lt;br /&gt;
&lt;br /&gt;
The majority of dentists in Belgium are private, though there are those who accept part-payment on state insurance. Make it a priority to check when registering as the fee differentials can be huge. For any specialist work, such as crowns and bridges, the dentist may well ask how you will pay and offer you different quotations. In the big cities, Brussels in particular, there are international dentistry practices as well as Belgian.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Hospitals'''&lt;br /&gt;
&lt;br /&gt;
As with general practitioners, you can arrange to see a specialist of your choice at any hospital. You can also walk into an emergency department for immediate treatment, though as in other countries, do not use this as a general practitioner replacement. It makes life a lot easier if you have your insurance card or other identifiable means of payment with you, though treatment will not be refused if you don't.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Emergency treatment'''&lt;br /&gt;
&lt;br /&gt;
If you need to use the emergency 100 number an ambulance will arrive quickly and take you to the nearest emergency centre. Sometimes, a decision may be made to admit you to the best centre suited for your needs, for example, a specialist burns unit.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Pharmacies'''&lt;br /&gt;
&lt;br /&gt;
Chemists are ubiquitous in Belgium, with the green cross sign everywhere. There is a rota system for chemists to open outside of usual hours and through the night. Lists are available from any pharmacy or check newspapers for those open at night in your area.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Health insurance'''&lt;br /&gt;
&lt;br /&gt;
Contributions to the state health system are made by you and your employer, or by you alone if you are self-employed. Payments and benefits are administered by one of the mutelle/mutualiteit societies.&lt;br /&gt;
&lt;br /&gt;
You can choose one that best suits your needs. For example, some are more geared to the self-employed, while others may provide cover for alternative medicine. Once you are a paying member you receive your social security ID, or SIS, a microchip card which carries all your details.&lt;br /&gt;
&lt;br /&gt;
Hospitals and chemists will use these to calculate what you are entitled to and if there is any price difference for you to cover. As already explained, many doctors have not yet invested in the necessary technology for SIS cards in their surgeries.&lt;br /&gt;
&lt;br /&gt;
You may choose to cover yourself with private insurance, indeed many overseas salary packages offer this as a benefit. However, if you are living and working in Belgium, you will still need to subscribe to the state system and your private insurance becomes an addition rather than a replacement.&lt;br /&gt;
&lt;br /&gt;
If you are an EU national, the social security form E111 gives you rights to use the Belgian state system until you have organised an SIS card. You need to arrange for this form in your own country, not in Belgium.&lt;br /&gt;
&lt;br /&gt;
== Useful web sites ==&lt;br /&gt;
&lt;br /&gt;
=== Online maps ===&lt;br /&gt;
&lt;br /&gt;
Check the following sites for maps:&lt;br /&gt;
&lt;br /&gt;
* [http://www.maporama.com Maporama] - an international site with lots of cities and options. Includes a route planner as well. The most accurate so far.&lt;br /&gt;
* [http://www.mappy.be Mappy] - a Belgian run site - type in an address or district and you get a zoomable map. &lt;br /&gt;
* [http://www.viamichelin.com Via Michelin] a nice route planer and map finder. Not as many Brussels addresses are available as [http://www.mappy.be Mappy], but produces nice maps for print outs.&lt;br /&gt;
&lt;br /&gt;
=== Transportation web sites ===&lt;br /&gt;
&lt;br /&gt;
* [http://www.stib.be STIB] - The site of the company responsible for urban transport in Brussels. It contains [http://www.stib.irisnet.be/FR/40000F.htm time tables for busses trams and metros]. The site is only in French and Dutch. Time table is &amp;lt;i&amp;gt;&amp;quot;Horaires&amp;quot;&amp;lt;/i&amp;gt; in French and &amp;lt;i&amp;gt;&amp;quot;Dienstregeling&amp;quot;&amp;lt;/i&amp;gt; in Dutch.&lt;br /&gt;
* [http://www.tec-wl.be Transport En Commun (TEC)] - Regional bus company. Their site is available in English.&lt;br /&gt;
* [http://www.sncb.be SNCB] - Regional train company.&lt;br /&gt;
&lt;br /&gt;
=== Expatriate web sites ===&lt;br /&gt;
These websites have various sections, communities and information related to being a foreigner in Belgium and Brussels in particular. Some have sections ranging from buy and sell to expat dating. Definitely worth checking out:&lt;br /&gt;
&lt;br /&gt;
* [http://www.xpats.com   XPATS.com]&lt;br /&gt;
* [http://www.expatsinbrussels.com   ExpatsInBrussels]&lt;br /&gt;
* [http://www.expatriates.com   Expatriates]&lt;br /&gt;
* [http://www.expatriate-online.com   Expatriate-online]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Mobile researchers in Europe have their own network of more than 200 ï¿½??service pointsï¿½?? in 32 countries to draw on for all kinds of support when moving between countries: visas, work permits, taxation, social security, healthcare, pension rights, accommodation, recognition of qualifications, to day care, schooling, language courses, social life and culture, intellectual property rights, and more.&lt;br /&gt;
* [http://europa.eu.int/eracareers/index_en.cfm?l1=4   European Network of Mobility Centres (ERA-MORE)]&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Access_to_Digital_Libraries&amp;diff=5840</id>
		<title>Access to Digital Libraries</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Access_to_Digital_Libraries&amp;diff=5840"/>
		<updated>2012-02-12T23:23:16Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: update link to ISI WOK, add EZ-Proxy&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt; ULB has NO general access to any of the (for us) most interesting collections: IEEE xPlore, ACM digital library.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The list of the journals accessible online when using IP addresses internal to the ULB network is available on the Internet at [http://www.ulb.ac.be/bibliotheques/bst/ http://www.ulb.ac.be/bibliotheques/bst/] or [http://www.ulb.ac.be/bibliotheques/bst/bst_per.html http://www.ulb.ac.be/bibliotheques/bst/bst_per.html]&lt;br /&gt;
There you can search and find out whether the journal you are interested in is available or not. As there are some 3000 titles, links can be broken as webmasters of ULB do not check them all the time. If you find a broken link the best you can do is to let them know and they will fix it.&lt;br /&gt;
&lt;br /&gt;
[http://isiknowledge.com/ Impact factors for journals] -- The link works only from within the ULB.&lt;br /&gt;
&lt;br /&gt;
Use [http://ezproxy.ulb.ac.be/ EZ-Proxy] to access outside ULB campus.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Elsevier: Journals in Computer Science category ==&lt;br /&gt;
&lt;br /&gt;
ULB has access to approximately 50% of Elsevier titles. To check which ones are available to us the only way is to go to http://www.elsevier.com, click on &amp;quot;Journals&amp;quot; and then search. Under the &amp;quot;Computer Science&amp;quot; category we have:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [http://www.elsevier.com/wps/find/journaldescription.cws_home/505601/description#description Artificial Intelligence], &lt;br /&gt;
* [http://www.elsevier.com/wps/find/journaldescription.cws_home/505626/description#description Cognition], &lt;br /&gt;
* [http://www.elsevier.com/wps/find/journaldescription.cws_home/522767/description#description Cognitive Brain Research], &lt;br /&gt;
* [http://www.elsevier.com/wps/find/journaldescription.cws_home/620194/description#description Cognitive Science], &lt;br /&gt;
* [http://www.elsevier.com/wps/find/journaldescription.cws_home/841/description#description Neural Networks], &lt;br /&gt;
* [http://www.elsevier.com/wps/find/journaldescription.cws_home/505628/description#description Neurocomputing], &lt;br /&gt;
* [http://www.elsevier.com/wps/find/journaldescription.cws_home/505617/description#description Parallel Computing], &lt;br /&gt;
* [http://www.elsevier.com/wps/find/journaldescription.cws_home/328/description#description Pattern Recognition], &lt;br /&gt;
* [http://www.elsevier.com/wps/find/journaldescription.cws_home/505619/description#description Pattern Recognition Letters], &lt;br /&gt;
* [http://www.elsevier.com/wps/find/journaldescription.cws_home/505714/description#description Physica D: Nonlinear Phenomena],&lt;br /&gt;
* [http://www.elsevier.com/wps/find/journaldescription.cws_home/505622/description#description Robotics and Autonomous Systems],&lt;br /&gt;
* [http://www.elsevier.com/wps/find/journaldescription.cws_home/505625/description#description Theoretical Computer Science].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Springer-Link  ==&lt;br /&gt;
&lt;br /&gt;
ULB has access to several titles of Springer-Link collection. To check which ones are available to us the only way is to go to http://www.springerlink.com and then search. Some of the journals we have access to:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
4OR,&lt;br /&gt;
&lt;br /&gt;
JoH,&lt;br /&gt;
&lt;br /&gt;
JMMA,&lt;br /&gt;
&lt;br /&gt;
[http://www.springerlink.com/(kgxq1e45yvowjt45uqvh3bnn)/app/home/journal.asp?referrer=parent&amp;amp;backto=subject,71,150;   International journal of parallel programming]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[http://www.doaj.org/   Directory of Open Access Journal]&lt;br /&gt;
&lt;br /&gt;
[http://www.bib.ulb.ac.be/BIB/per_jstor_info.htm   Journal Storage (200 journals)]&lt;br /&gt;
&lt;br /&gt;
[http://www.bib.ulb.ac.be/BIB/per_adb.htm   Article Database (18000 periodicals)]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Image:Phd022702s.gif||]]&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Moving_to_Brussels&amp;diff=5809</id>
		<title>Moving to Brussels</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Moving_to_Brussels&amp;diff=5809"/>
		<updated>2012-01-18T18:01:51Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: /* Long-term accommodation */  fix expats link&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Moving to a new country can be both exciting and frustrating. Everything is fascinating and at the same time it can be confusing to find your way around a new city, a culture and possibly a new language. The objective of this page is to provide some information for newcomers to IRIDIA, such as Ph.D. students, and Brussels in general in order to make the initial couple of weeks a bit easier. The information contained in this document has been collected by people who have been through the process. If you have any questions, suggestions, additions or such, please make them.&lt;br /&gt;
&lt;br /&gt;
NOTE for ITALIANS: for any kind of information or help, there is the Patronato Acli,[http://www.patronatoacli.be/it/le-nostre-sedi-20 link]. They can help for any kind of issues you have (accomodation, health,...) and it's all for free.&lt;br /&gt;
== Short-term accommodation ==&lt;br /&gt;
&lt;br /&gt;
For short-term accommodation (that is a place to sleep for the first couple of weeks you are in Brussels) a bed and breakfast is a convenient option. Depending on your budget and confidence in finding more long-term accommodation quickly there is a number of different options to choose from:&lt;br /&gt;
&lt;br /&gt;
* [http://www.csfds.be  Centre Sportif de la Foret de Soignes] is a sports facility in the outskirts of Brussels. It is quite cheap for longer stays at ~230 euro/month or ~16 euros/day for shorter stays. There is easy access to the university: [http://www.stib.irisnet.be/FR/40000Fre/B/40072F.htm   Bus number 72] runs directly between ULB and the center (also known as A.D.E.P.S.) and the ride is 15 to 20 mins. And that is about all the good things that there are to say about the place. Breakfast is not included, the rooms are very basic, the reception closes at 23h00 on weekdays, 22h00 on Saturdays and at 20h00 on Sundays. You either have to be there before closing time or you'll have to arranged with the Security staff or the reception, that you will come at a later hour. Being so far out is by no means an ideal way to get acquainted with the city. However, if you intend to stay in short-term for a whole month [http://www.csfds.be  Centre Sportif de la Foret de Soignes] might be the least expensive option. If you want to book a room there you have to do it through IRIDIA.&lt;br /&gt;
* [http://www.bnb-brussels.be  Bed &amp;amp;amp; Brussels] manages rooms in more than 100 guesthouses. Have a look and contact them if you are interested. If you book a room make sure that it is close to the university (Ixelles 1050 or Uccle 1180). '''Hint:''' Go to [http://www.maporama.com   Maporama] and punch in the address of the guest house to see how far it is from ULB.&lt;br /&gt;
* [http://rycx.be/bedbreakfast/en/ Rycx's family house] The guest house at Square Robert Goldschmidt, 50 - B-1050 Brussels, Belgium] should be quite good, inexpensive and very close to the university. They only have few rooms.&lt;br /&gt;
* [http://www.brusselsdestination.be/en/index.html Brussels Destination] offers rooms, flats, and studios for stays of 4 weeks or longer. At the moment of writing this, the map offered by the site is often incorrect, so be sure to check the address given using a different map.&lt;br /&gt;
* [http://www.myapartmentinbrussels.com/index.html MyAppartmentInBrussels] offers appartments (from 1 to 3 bedrooms), houses and studios completly furnished in different parts of the city. They permit stays from lest than 1 month to more than 1 year.&lt;br /&gt;
&lt;br /&gt;
== Long-term accommodation ==&lt;br /&gt;
In case you do not already live in Brussels, one of the first and most important things to do obviously is to find an apartment. One option is to buy the magazine &amp;quot;Vlan&amp;quot; where you have lots of ads for flats and etc. You can as well visit the [http://www.vlan.be  Vlan website], which is very good and publishes the announcements shortly after they are published in the magazine. You can try out [http://www.immoweb.be   IMMOWEB.be] on which apartments are also advertised. Another great website full of ads for apartments and furniture is [http://www.expatriates.com/classifieds/bru/ Expats in Brussel].&lt;br /&gt;
&lt;br /&gt;
An alternative method is to simply walk around in the neighborhood you are interested in living in as the landlords hang out easy identifiable announcements. As this might not be a usual way to find accommodation in other countries it works in Belgium. There are a lot of signs put up and sometimes this is the only way in which apartments are advertised. Walking around is probably a bit more time consuming than finding a flat through the Vlan, but on the other side you get to know the area, and you are likely to find one of the apartments close to the University not advertised on the web. The signs read &amp;quot;A Louer&amp;quot; or &amp;quot;Te Huur&amp;quot;, which translates to &amp;quot;for rent&amp;quot;. There are lots of rooms and apartments for rent. They vary a lot in terms of quality and price, so you might have to spend some time to find something that suites your budget and your style.&lt;br /&gt;
&lt;br /&gt;
Most other students at IRIDIA live quite close to the university; choosing a place in the neighborhood is likely to improve your social life.&lt;br /&gt;
&lt;br /&gt;
In case you don't speak any French it is recommendable to ask a French speaker (e.g. at IRIDIA) to check the contract. Even though the probability is low that some landlord wants to cheat, it is always better to know what exactly is written in the contract!&lt;br /&gt;
&lt;br /&gt;
=== Renting an apartment ===&lt;br /&gt;
Once you have found the property you want to rent, you need a lease (bail/kontract), an inventory (etat des lieux/plaatsbeschrijving), a security deposit, and to get the phone, electricity and gas reconnected.&lt;br /&gt;
&lt;br /&gt;
There is an element of Catch 22 here - there is a certain order to get things done that, at times, seems to be mutually exclusive.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''The lease'''&lt;br /&gt;
&lt;br /&gt;
Belgium has an odd system of a standard nine-year flexible lease, and an inflexible three-year lease. At first sight the three-year lease seems the most attractive to a newcomer whose time in the country is uncertain, but this is not necessarily the case.&lt;br /&gt;
&lt;br /&gt;
A three-year lease can be for any agreed period up to a maximum of three years. It fixes the rent for the period of the lease and commits the tenant to pay for the entire period of the lease. It can include a diplomatic clause (designed to indemnify the tenant if he wants to break the lease because he is leaving the country) but these have been nullified by the Belgian Courts in the past.&lt;br /&gt;
&lt;br /&gt;
It is thus better to opt for a nine-year lease, which can in fact be broken by giving three months notice. But if you leave in the first, second or third year, you will pay an indemnity of three, two and one month's rent respectively. From year four, there is no penalty for leaving.&lt;br /&gt;
&lt;br /&gt;
The monthly rent is fixed for nine years subject to the normal state-controlled annual indexation. The landlord can only give you notice if they intend to occupy the property personally, need to carry out major works (where major has a legal definition), or at the end of year three or year six, for no reason but subject to compensation to the tenant of nine or six month's rent respectively.&lt;br /&gt;
&lt;br /&gt;
For an apartment, the monthly outgoing may include an element of rent and a fixed amount of service charge. Usually the service charge is just a prepayment (provision pour charges/vooruitbetaling) and there will be an annual assessment of common charges for the property that you will share in.&lt;br /&gt;
&lt;br /&gt;
If you want to negotiate a better price, negotiate down the rental not the service charges! If there are things you want the landlord to correct before you move in, don't sign the lease until they have happened.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''The inventory'''&lt;br /&gt;
&lt;br /&gt;
The inventory (etat des lieux /plaatsbeschrijvin) is the source of more misery to tenants than any other legal document.&lt;br /&gt;
&lt;br /&gt;
Typically, the landlord's agent prepares a stunningly detailed list of the condition of the property complete with photographs. The tenant reads it or not and signs. At the end of the lease, the landlord's agent checks the property and finds an unreasonable amount of property damage.&lt;br /&gt;
&lt;br /&gt;
Expats have been charged for scratches in the bath that were there before they arrived, and for damp patches caused by the landlord's failure to repair a roof. That the cost of the damage often comes to about the level of the retained security deposit is a coincidence of course!&lt;br /&gt;
&lt;br /&gt;
It is bad enough to have someone who seems to be less than independent assessing costs against you, even more irritating is that you have to pay 50 percent of his bill. Some agents insist you sign a document agreeing to the fee and to accept his expertise before he starts. Don't do so.&lt;br /&gt;
&lt;br /&gt;
The way to avoid all such problems is simple. Select your own agent (expert immobilier/expert) to do the check-in and the check-out. That way both parties get a truly independent and fair assessment.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''The security deposit'''&lt;br /&gt;
&lt;br /&gt;
You will either need to pay around three months rental up front as a security deposit against tenant-effected damages, or to ask your bank for a guarantee.&lt;br /&gt;
&lt;br /&gt;
The latter option is basically a low-cost insurance policy sold to you by the bank which gets your salary as its means of security. It is typically the better option because a bad-faith landlord needs to prove to the bank that he deserves the guarantee.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Home insurance'''&lt;br /&gt;
&lt;br /&gt;
Whether you own or rent your property, you need to get insurance. Almost all rental agreements in Belgium require the tenant to take out insurance on the rented property within 30 days of signing a lease. This insurance is required by the Belgian Civil Code, which holds a tenant responsible for any damage to the building unless proof can be given that it was not his/her fault.&lt;br /&gt;
&lt;br /&gt;
If you are renting, take your lease with you when you arrange your insurance. You are also responsible for providing cover against third party liability, but the owner is required to have a policy covering the property against earthquakes, lightning, fire, etc. If you are in furnished accommodation, you are required to take out insurance against damage to the landlord's furniture.&lt;br /&gt;
&lt;br /&gt;
Contents insurance is not compulsory but advisable. Remember that theft is not covered automatically in contents insurance: it is an option. Valuable personal items such as jewellery or cameras may require an all risks policy, which will cover you for damage or loss in or out of the home. Premiums on these for desirables such as laptop computers are high.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Sharing an apartment/Renting a room ===&lt;br /&gt;
&lt;br /&gt;
Sharing an appartment or renting a room in some bigger building which features common space for every inhabitant has several advantages over living alone:&lt;br /&gt;
&lt;br /&gt;
* you'll be never be alone&lt;br /&gt;
* it's cheaper&lt;br /&gt;
* you will most certainly learn french a lot faster (or chinese, or...)&lt;br /&gt;
* it will improve your social life&lt;br /&gt;
* you can rely on the knowlegde of your flatmates about Brussels&lt;br /&gt;
&lt;br /&gt;
Of course, it has several disadvantages:&lt;br /&gt;
&lt;br /&gt;
* you'll be never be alone&lt;br /&gt;
* you have to share kitchen and bathroom, which isn't always nice&lt;br /&gt;
&lt;br /&gt;
It's certainly not for everyone, but it's a good and fun option. It heavily depends on your flatmates, so finding a good match is even more important than finding a nice appartment to share.&lt;br /&gt;
&lt;br /&gt;
''' Options '''&lt;br /&gt;
&lt;br /&gt;
If you want to share a house/appartment, you should know a few things. You basically have two options when you want to do this:&lt;br /&gt;
&lt;br /&gt;
# Rent a room in a bigger building (kind of student-dorm like) In Belgium single rooms to rent is referred to as a ''kot'' or simply ''chambre''. This is usually the cheapest option, as you can get one for less than 300 Euros including charges. The rooms are usually rented individually by the landlord. The major drawback is that you don't know much about the people you're going to share the common rooms with. Sometimes these rooms are simply part of a Belgian family household, so if you're seeking contact to local people this might be a good way. Usually a kot is rented by young people and erasmus students.&lt;br /&gt;
# A ''colocation'' on the other hand is when several people rent a house/appartment together. You usually have more space and closer relationship to your flatmates. For this reason, you should choose them wisely. If your looking for a rich social life, this is the way to go. Colocations start around 300 Euros, but are usually around 450 Euros for a reasonably spaced room.&lt;br /&gt;
&lt;br /&gt;
''' Where to look '''&lt;br /&gt;
&lt;br /&gt;
In order to find a kot/colocation, you have several ways to look for it:&lt;br /&gt;
* For a kot go to the l'office de logement in building F1 on campus Solbosch. On the first floor are two big boards full of offers. Note that these offers are usually made by landlords which are french-speaking. You can access a list here: http://wwwdev.ulb.ac.be/intranet/logements/scripts/logpub.php (for contact details you have to write the office or have a look at the board though).&lt;br /&gt;
* Check the streets and the university buildings for handwritten ads.&lt;br /&gt;
* http://www.xpats.com/clads/clads_display.php?Action=view&amp;amp;categorie=7&amp;amp;start=60&lt;br /&gt;
* http://xsorbit29.com/users5/stageforum/index.php?board=4.0&lt;br /&gt;
* http://bruxelles.vivastreet.be/annonces-colocation+bruxelles&lt;br /&gt;
* http://www.languesvivantes.com/uk/roomsinbrussels.htm&lt;br /&gt;
* http://www.recherche-colocation.com/ (commercial, you have to pay to get contact details)&lt;br /&gt;
* http://www.appartager.be/ (commercial, you have to pay to get contact details)&lt;br /&gt;
&lt;br /&gt;
=== Furniture ===&lt;br /&gt;
&lt;br /&gt;
If you move into an unfurnished apartment, [http://www.ikea.be IKEA] is a good option. They have two branches in Brussels, the one in Zaventem is close to the airport. You can even rent a truck there to take your new furniture to your place (and it is not expensive).&lt;br /&gt;
&lt;br /&gt;
Another option is second-hand furniture. Brussels houses lots of expats coming and going, so often you can find good deals for second-hand items ranging from apartments, furniture and cars. [http://www.xpats.com   XPATS.com] - a site for expatriates in Brussels and the surrounding area. Go to the [http://www.xpats.com/classifieds_main.shtml   Classified]  section and choose the http://www.xpats.com/clads/clads_display.php?Action=view&amp;amp;categorie=12   For sale section]. There is usually heaps of stuff for sale and many new ads are added daily.&lt;br /&gt;
&lt;br /&gt;
== Currency ==&lt;br /&gt;
&lt;br /&gt;
Belgium is in the eurozone, sharing a common currency with Austria, France, Germany, Greece, Ireland, Italy, Luxembourg, Spain, Portugal and the Netherlands.&lt;br /&gt;
&lt;br /&gt;
Of the old EU countries, Sweden, Denmark and the UK are the outsiders and many of the 10 new EU countries plan to adopt the euro when they are ready to do so, but not for a few years yet.&lt;br /&gt;
&lt;br /&gt;
Coins: 1 cent, 2 cents, 5 cents, 10 cents, 20 cents, 50 cents, 1 EUR, 2 EUR&lt;br /&gt;
&lt;br /&gt;
Notes: 5 EUR, 10 EUR, 20 EUR, 50 EUR, 100 EUR, 200 EUR, 500 EUR&lt;br /&gt;
&lt;br /&gt;
On one side of the coins is a European Union emblem showing a map of the eurozone surrounded by the 12 stars of the union. On the other side is a design specific to the country where it was minted.&lt;br /&gt;
&lt;br /&gt;
Euros from any of the 12 countries may be used anywhere in the EU. All euro notes are the same, regardless of which country they come from.&lt;br /&gt;
&lt;br /&gt;
=== Paying for goods and services ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Cash'''&lt;br /&gt;
&lt;br /&gt;
Cash dispensers are everywhere where there is a bank, and they all take Bancontact cards ï¿½?? issued by local banks. But beware, you might have to wander around to find one that takes your Visa or MasterCard or other major credit and debit cards.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Credit and Debit Cards'''&lt;br /&gt;
&lt;br /&gt;
Most types of credit card are widely accepted. If you get a standard Visa or Eurocard/MasterCard from a local bank, the standard option is for this to operate like a debit card, with the full balance taken from your account each month.&lt;br /&gt;
&lt;br /&gt;
A full service credit option is widely available on request.&lt;br /&gt;
&lt;br /&gt;
Diner's, American Express and other major international credit cards can also be obtained and used in Belgium.&lt;br /&gt;
&lt;br /&gt;
The most common card in Belgium is the Mister Cash-Bancontact card. It is linked to your current account, and is accepted in department stores, supermarkets, gas stations, and high street shops everywhere. It's a good idea to have one of these, as there are still many places in Belgium that don't accept alternatives.&lt;br /&gt;
&lt;br /&gt;
A Bancontact card with a PIN number will be issued when you open a Belgian bank account.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Proton'''&lt;br /&gt;
&lt;br /&gt;
Belgium is a pioneer in a cashless society.&lt;br /&gt;
&lt;br /&gt;
The Proton card is actually a chip integrated into your Bancontact card and is like a rechargeable electronic purse.&lt;br /&gt;
&lt;br /&gt;
It is designed to pay for everyday items such as newspapers and cigarettes, as well as&lt;br /&gt;
paying the butcher and the baker.&lt;br /&gt;
&lt;br /&gt;
You can even use it for the parking meter, or to fill up your car with petrol.&lt;br /&gt;
&lt;br /&gt;
This is how it works:&lt;br /&gt;
&lt;br /&gt;
Using your usual four-digit PIN code, you load the card with up to EUR 1,240 at a cash dispenser,and then go shopping.&lt;br /&gt;
&lt;br /&gt;
The shopkeeper enters the amount to be paid into the Proton terminal, and you put your Proton card into the terminal.&lt;br /&gt;
&lt;br /&gt;
When the amount to be paid appears on the screen, you simply press the OK button, and the payment is made.&lt;br /&gt;
&lt;br /&gt;
A word of caution: a lost card is like lost cash so choose the amount you load wisely.&lt;br /&gt;
&lt;br /&gt;
=== Bank account ===&lt;br /&gt;
&lt;br /&gt;
Getting a bank account is straight-forward. Simply choose a bank and set up an interview. Mrs. Laurence Schor (email: first name . second name @ing.be, phone number 02 639 65 46) is an excellent English speaker and very helpful. Make an appointment with her. She works for ING, which is one of the large banks in Belgium and they have a branch only ~400m from the university (Av. de l'Universite 11, 1050 Brussels). You may also open a bank account at the small ING branch on campus Solbosch. To open the bank account, you will need at least a passport (or ID card if you are from EU) and a document proving your relation with the university (e.g., a signed letter from your supervisor). You may need additional documents if you are from outside EU.&lt;br /&gt;
&lt;br /&gt;
Usually, banks can also help out with matters related to insurance of property etc.&lt;br /&gt;
&lt;br /&gt;
== Transportation ==&lt;br /&gt;
&lt;br /&gt;
Getting around Brussels by the public transport system is easy: The city sports a decent system of metros, busses and trams. The first thing to do when you arrive in Brussels is to get a map of the busses, trams and metros. You can get that in many places, e.g. at the Central Station, get one - it will be your best friend in the beginning. &lt;br /&gt;
&lt;br /&gt;
If you want to go straight to UniversitÃ© Libre de Bruxelles (ULB) from the Central Station you should take [http://www.stib.irisnet.be/FR/40000Fre/B/40071F.htm  bus 71] (when you exit the Central Station the stop for 71 is just 40m up the street alongside a number of other stops). It runs fairly frequently - every 20 mins or so - from early morning to midnight.&lt;br /&gt;
&lt;br /&gt;
===Tickets===&lt;br /&gt;
&lt;br /&gt;
In busses and trams you can buy a one-trip ticket for 2 euro from the driver. They will allow you to take any means of urban, public transport for one hour. In metro stations you can also by 5 and 10 trip tickets in machines (11 euro for the 10 trips ticket), which work in the exact same way, but are cheaper. The tickets are called &amp;quot;Jump tickets&amp;quot;. Once you have a ticket, it needs to be stamped by one of the orange machines located in every tram and bus (just remember to validate the ticket every time you get in, in case it's less than an hour from the previous validation, it will not consume a new ride but will stamp a transfer next to the previous one). If you use the metro, remember to stamp the ticket BEFORE entering the metro train (sometimes they have raids where tickets are checked and the cops doing that do not look friendly!)&lt;br /&gt;
&lt;br /&gt;
===Importing a car===&lt;br /&gt;
&lt;br /&gt;
====From outside the EU====&lt;br /&gt;
The various steps in importing a car into Belgium from outside the European Union are lengthy and complicated. Even armed with the most current information from the official Belgian government website, you will almost certainly need the services of a broker or specialized agent. A good agent can help you with the importation of your car, conversion to Belgian specifications, conformity certificate, and technical inspection and licensing.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A car imported into Belgium from outside the EU as part of a move of your personal and household effects can be exempt from customs duties and value-added tax if the following conditions are met:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
You resided outside the EU for at least 12 months before establishing residence in Belgium;&lt;br /&gt;
&lt;br /&gt;
You acquired the car abroad and drove it for at least six months before arrival;&lt;br /&gt;
&lt;br /&gt;
You paid sales tax in another country;&lt;br /&gt;
&lt;br /&gt;
You will retain the car for your personal use for at least 12 months following the date of import.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The Belgian customs authorities require the following documents:&lt;br /&gt;
&lt;br /&gt;
Letter requesting exemption of customs duties and value-added tax;&lt;br /&gt;
&lt;br /&gt;
Invoice for the car;&lt;br /&gt;
&lt;br /&gt;
Certificate of title; &lt;br /&gt;
&lt;br /&gt;
Sales tax receipts; &lt;br /&gt;
&lt;br /&gt;
Certificate of insurance covering at least six months prior to importation; &lt;br /&gt;
&lt;br /&gt;
Proof of residence in a country outside the European Union for at least 12 months before departure; &lt;br /&gt;
&lt;br /&gt;
Proof of residence in Belgium and date of establishment;&lt;br /&gt;
&lt;br /&gt;
Shipping document for personal effects.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
For further information on import procedures, contact Belgian Customs:&lt;br /&gt;
&lt;br /&gt;
Ministere des Finances Service Douane or &lt;br /&gt;
&lt;br /&gt;
Ministerie van Financier Kantoor Douane &lt;br /&gt;
&lt;br /&gt;
Rue Picard 1-3 &lt;br /&gt;
&lt;br /&gt;
1210 Brussels &lt;br /&gt;
&lt;br /&gt;
Tel. 0800.147.95 (toll-free number in Dutch, English, French and German)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Where import duty exemption is not extended, as in the case of a vehicle that has been owned less than six months, a customs duty of io percent and value-added tax of 21 percent of the market value of the car as determined by customs must be paid.&lt;br /&gt;
&lt;br /&gt;
====From within the EU====&lt;br /&gt;
It is much easier to import a car into Belgium from another European Union country. Present the car to the Belgian customs authorities, along with a copy of your Belgian identity card, proof of purchase and previous registration. Value-added tax will have to be paid on new cars (less than six months old or driven less than 6,000 kilometers) but not on cars considered to be secondhand ï¿½?? over six months old and/or with more than 6,000 kilometers on the clock. In all EU member states, VAT on secondhand cars is always paid in the country where the vehicle was purchased, because it is included in the price.&lt;br /&gt;
&lt;br /&gt;
An imported car with valid foreign registration and license plates can be driven immediately upon arrival in Belgium for a maximum of six months. During this period, you must go through the formalities of registering your car with the Belgian authorities and, in the case of non-EU nationals, applying for a Belgian driving license.&lt;br /&gt;
&lt;br /&gt;
== Mobile phone ==&lt;br /&gt;
&lt;br /&gt;
There are several options for getting a mobile phone and/or a SIM card. There are three companies operating in Belgium: &lt;br /&gt;
&lt;br /&gt;
* [http://www.proximus.be Proximus] &lt;br /&gt;
* [http://www.base.be Base] &lt;br /&gt;
* [http://www.mobistar.be Mobistar]&lt;br /&gt;
&lt;br /&gt;
You can buy either a subscription where you pay a monthly fee and they'll send you a bill sized in accordance with your use. Alternatively, you can go for a prepaid card deal, where calls are usually a bit more expensive, but you do not have to lock yourself into a long-term contract. Moreover, you can walk straight into a store and five minutes later you got your own phone number. The prepaid cards can be recharged in tobacco shops and in any of the operator's braches.&lt;br /&gt;
&lt;br /&gt;
Getting a mobile phone number right away is a GOOD IDEA. It is especially useful for finding accommodation. The rumor has it that [http://www.base.be   Base] has the less expensive deals at the moment.&lt;br /&gt;
&lt;br /&gt;
Make sure that your phone is not SIM-locked and that it works with the new card before leaving the store.&lt;br /&gt;
&lt;br /&gt;
== Registering at the local commune ==&lt;br /&gt;
At some point you have to register at the city hall to get a residence permit. However, it's better to wait until you have found yourself some long-term accommodation before registering because they want to have your permanent address. So itï¿½??s not possible to register until you have a permanent place to live. Officially you have to do it within 3 months of arrival in case you are from an EU member state.&lt;br /&gt;
&lt;br /&gt;
If you live in [http://www.elsene.irisnet.be/ the commune of Ixelles] you have to call the following number: 02.515.66.03, 21, 22 et 23. You can find the office time table to the following direct link of the [http://www.elsene.irisnet.be/site/fr/01officiel/servicescommun/population.htm#etrangers Bureau des ï¿½?trangers]. If you speak basic French and you are an UE citizen, itÂ´s likely that they will schedule an appointment with you in 2-3 months for the registration. All you have to say is your nationality and that you just arrived in Ixelles and you want to register. They will ask you your last name, your first name, your address in Ixelles and your telephone number.&lt;br /&gt;
&lt;br /&gt;
Some days or weeks later and before the appointment, a police man will come and visit you in your apartment to check that you are really living there (and your family members). Usually, if you are not there at that time, you just need to put your name in your mail box.&lt;br /&gt;
&lt;br /&gt;
You will usually get a residence permit valid for one year at the time, thus you might have to renew your permit every year. For renewing the permission, you have to go to Chausse d'Ixelles 124 to present: a) the confirmation of enrollment of the university, b) a proof of coverage by your health insurance, c) a photo and d) 7.50 EUR.&lt;br /&gt;
&lt;br /&gt;
=== Italians: registering at the AIRE ===&lt;br /&gt;
Italians that are staying in Belgium more than 12 months must register at the [http://www.consbruxelles.esteri.it/Consolato_Bruxelles/Menu/I_Servizi/Per_i_cittadini/Anagrafe/ AIRE (Anagrafe degli Italiani Residenti all'Estero)]. You have to register within 90 days after your arrival, and in order to do that you have to go to the [http://www.consbruxelles.esteri.it/Consolato_Bruxelles/ Consolato d'Italia] in Rue de Livourne, 38. You can schedule an appointment online by clicking on [http://www.consbruxelles.esteri.it/Consolato_Bruxelles/Menu/In_linea_con_utente/Prenota_OnLine/ sportello unico -&amp;gt; prendere appuntamento]. You will need an Italian identity card and a Belgian document like the residence permit.&lt;br /&gt;
&lt;br /&gt;
== Health-care == &lt;br /&gt;
In order to enroll in a health care plan you need contact a ''mutualitÃ©'' for instance [http://www.euromut.be Euromut]. Fill out the web form and they will send you the necessary documents.&lt;br /&gt;
&lt;br /&gt;
It take a while before you can become a member of a mutualitÃ©. However, once you are inscribed you can get any medical expenses reimbursed from the date on which you started at the university. Hence, in case something happens in between arrival and becoming a member of Euromut you are still covered.&lt;br /&gt;
&lt;br /&gt;
Normally Euromut will only provide you a basic, compulsory insurance and the coverage of such an insurance is far from complete. Therefore, it is a good and cheap option to buy additional coverage e.g. for hospitalization. You can do that either through Euromut or another mutualitÃ©. The rumor has it that the insurance through the University is the cheaper one. In order to get such an insurance you should contact the ULB Social Services (internal phone numbers: 3505, 3506, 3507) or simply go to their office in the V building on the third floor (right above the university book store on Av. Adolphe Buyl). You can try with English, but your milage may vary.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== The Belgian healtcare system ===&lt;br /&gt;
You can be assured of the highest-quality medical care in Belgium, regarded as among the best healthcare systems in Europe.&lt;br /&gt;
&lt;br /&gt;
As in most countries, the system divides itself into state and private, though fees are payable in both, so you need to ensure that you are adequately covered through either the state insurance and/or private insurance.&lt;br /&gt;
&lt;br /&gt;
The advantages of the state mutuelle/mutualiteit scheme is that you can choose any doctor, clinic or hospital you like, in any location and without referral, according to your needs in much the same way as you can with private insurance.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Doctors'''&lt;br /&gt;
&lt;br /&gt;
General practitioners can be found in private practices or attached to clinics and hospitals. You are free to consult or register with any you like; similarly with specialist consultants. It may be a decision based on location, language or recommendation.&lt;br /&gt;
&lt;br /&gt;
It's always worth speaking to neighbours or colleagues when you first arrive; everyone knows of a doctor, or has heard of one with a good reputation. Embassies usually keep lists of doctors who can work in your language, though it has to be said that most doctors have a good understanding of English. See for example the webpage &amp;quot;[http://ukinbelgium.fco.gov.uk/en/help-for-british-nationals/when-things-go-wrong/if-you-need-doctor if you need a doctor]&amp;quot; of the UK Embassy.&lt;br /&gt;
&lt;br /&gt;
When you first phone a doctor, check whether they are registered as national health service or private. Some are both, perhaps working at a hospital and also in their own private practice.&lt;br /&gt;
&lt;br /&gt;
One thing to remember when you go to a doctor '''take cash with you'''. Consultations usually end with a handing over of money and very few doctors offer payment by card of any type. If you have state social security, reimbursement rates are calculated and you pay the difference; if you are on a private scheme, or are uninsured, you pay the whole lot there and then. It's always worth checking fees before you book an appointment.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Dentists'''&lt;br /&gt;
&lt;br /&gt;
The majority of dentists in Belgium are private, though there are those who accept part-payment on state insurance. Make it a priority to check when registering as the fee differentials can be huge. For any specialist work, such as crowns and bridges, the dentist may well ask how you will pay and offer you different quotations. In the big cities, Brussels in particular, there are international dentistry practices as well as Belgian.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Hospitals'''&lt;br /&gt;
&lt;br /&gt;
As with general practitioners, you can arrange to see a specialist of your choice at any hospital. You can also walk into an emergency department for immediate treatment, though as in other countries, do not use this as a general practitioner replacement. It makes life a lot easier if you have your insurance card or other identifiable means of payment with you, though treatment will not be refused if you don't.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Emergency treatment'''&lt;br /&gt;
&lt;br /&gt;
If you need to use the emergency 100 number an ambulance will arrive quickly and take you to the nearest emergency centre. Sometimes, a decision may be made to admit you to the best centre suited for your needs, for example, a specialist burns unit.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Pharmacies'''&lt;br /&gt;
&lt;br /&gt;
Chemists are ubiquitous in Belgium, with the green cross sign everywhere. There is a rota system for chemists to open outside of usual hours and through the night. Lists are available from any pharmacy or check newspapers for those open at night in your area.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Health insurance'''&lt;br /&gt;
&lt;br /&gt;
Contributions to the state health system are made by you and your employer, or by you alone if you are self-employed. Payments and benefits are administered by one of the mutelle/mutualiteit societies.&lt;br /&gt;
&lt;br /&gt;
You can choose one that best suits your needs. For example, some are more geared to the self-employed, while others may provide cover for alternative medicine. Once you are a paying member you receive your social security ID, or SIS, a microchip card which carries all your details.&lt;br /&gt;
&lt;br /&gt;
Hospitals and chemists will use these to calculate what you are entitled to and if there is any price difference for you to cover. As already explained, many doctors have not yet invested in the necessary technology for SIS cards in their surgeries.&lt;br /&gt;
&lt;br /&gt;
You may choose to cover yourself with private insurance, indeed many overseas salary packages offer this as a benefit. However, if you are living and working in Belgium, you will still need to subscribe to the state system and your private insurance becomes an addition rather than a replacement.&lt;br /&gt;
&lt;br /&gt;
If you are an EU national, the social security form E111 gives you rights to use the Belgian state system until you have organised an SIS card. You need to arrange for this form in your own country, not in Belgium.&lt;br /&gt;
&lt;br /&gt;
== Useful web sites ==&lt;br /&gt;
&lt;br /&gt;
=== Online maps ===&lt;br /&gt;
&lt;br /&gt;
Check the following sites for maps:&lt;br /&gt;
&lt;br /&gt;
* [http://www.maporama.com Maporama] - an international site with lots of cities and options. Includes a route planner as well. The most accurate so far.&lt;br /&gt;
* [http://www.mappy.be Mappy] - a Belgian run site - type in an address or district and you get a zoomable map. &lt;br /&gt;
* [http://www.viamichelin.com Via Michelin] a nice route planer and map finder. Not as many Brussels addresses are available as [http://www.mappy.be Mappy], but produces nice maps for print outs.&lt;br /&gt;
&lt;br /&gt;
=== Transportation web sites ===&lt;br /&gt;
&lt;br /&gt;
* [http://www.stib.be STIB] - The site of the company responsible for urban transport in Brussels. It contains [http://www.stib.irisnet.be/FR/40000F.htm time tables for busses trams and metros]. The site is only in French and Dutch. Time table is &amp;lt;i&amp;gt;&amp;quot;Horaires&amp;quot;&amp;lt;/i&amp;gt; in French and &amp;lt;i&amp;gt;&amp;quot;Dienstregeling&amp;quot;&amp;lt;/i&amp;gt; in Dutch.&lt;br /&gt;
* [http://www.tec-wl.be Transport En Commun (TEC)] - Regional bus company. Their site is available in English.&lt;br /&gt;
* [http://www.sncb.be SNCB] - Regional train company.&lt;br /&gt;
&lt;br /&gt;
=== Expatriate web sites ===&lt;br /&gt;
These websites have various sections, communities and information related to being a foreigner in Belgium and Brussels in particular. Some have sections ranging from buy and sell to expat dating. Definitely worth checking out:&lt;br /&gt;
&lt;br /&gt;
* [http://www.xpats.com   XPATS.com]&lt;br /&gt;
* [http://www.expatsinbrussels.com   ExpatsInBrussels]&lt;br /&gt;
* [http://www.expatriates.com   Expatriates]&lt;br /&gt;
* [http://www.expatriate-online.com   Expatriate-online]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Mobile researchers in Europe have their own network of more than 200 ï¿½??service pointsï¿½?? in 32 countries to draw on for all kinds of support when moving between countries: visas, work permits, taxation, social security, healthcare, pension rights, accommodation, recognition of qualifications, to day care, schooling, language courses, social life and culture, intellectual property rights, and more.&lt;br /&gt;
* [http://europa.eu.int/eracareers/index_en.cfm?l1=4   European Network of Mobility Centres (ERA-MORE)]&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Software_HOWTOs&amp;diff=5806</id>
		<title>Software HOWTOs</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Software_HOWTOs&amp;diff=5806"/>
		<updated>2011-12-10T22:16:15Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: add svn tutorial&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This page contains a list of software HOWTOs. These HOWTOs are not meant to be extensive or to explain in any detail, how different software packages can be used. They are meant to serve as a simple reference for setting the up and/or performing the basic actions often needed by researchers at IRIDIA.&lt;br /&gt;
&lt;br /&gt;
=== HOW-TOs ===&lt;br /&gt;
{| cellpadding=&amp;quot;5&amp;quot; border=&amp;quot;1&amp;quot; width=&amp;quot;100%&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
| [[R and 3D plots]] &lt;br /&gt;
| How to setup R and get it to plot experimental data in 3D.&lt;br /&gt;
|-&lt;br /&gt;
| [[Compiling ODE, KODEX, and MISS]] &lt;br /&gt;
| How to compile the open-source alternative to Vortex, ODE, a wrapper and the simulator MISS.&lt;br /&gt;
|-&lt;br /&gt;
| [[Small Video Processing Guide]] &lt;br /&gt;
| How to download and process data from digitial camcorder.&lt;br /&gt;
|-&lt;br /&gt;
| [[Cloning a Debian server]] &lt;br /&gt;
| How to clone a Debian-based server.&lt;br /&gt;
|-&lt;br /&gt;
| [http://svnbook.red-bean.com/nightly/en/svn.intro.quickstart.html Subversion Quick Tutorial] &lt;br /&gt;
| A very fast tutorial on Subversion (SVN).&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=5804</id>
		<title>Optimization Group Meetings</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&amp;diff=5804"/>
		<updated>2011-11-24T10:46:51Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: new literature session&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;You can subscribe to an [http://en.wikipedia.org/wiki/ICalendar iCalendar] of these meetings at http://iridia.ulb.ac.be/Calendars/publish.php/_NUC_Optimization.ics&lt;br /&gt;
&lt;br /&gt;
==Breakfast Meetings==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
Breakfast meetings are informal meetings where there is a general discussion or someone presents their work. And additional goal is to have breakfast together.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, and a short summary of what you are going to talk about.&lt;br /&gt;
# Add a new entry to the table below.&lt;br /&gt;
# Bring breakfast.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Breakfast Meetings ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;200&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Summary&lt;br /&gt;
|-&lt;br /&gt;
|2011-03-10&lt;br /&gt;
|Stefanie Kritzinger&lt;br /&gt;
| A Unified Framework for Routing Problems with Fixed Fleet Size&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-21&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
| Off-line vs. On-line Tuning: A Study on MAX-MIN Ant System for the TSP&lt;br /&gt;
|-&lt;br /&gt;
|2010-10-19&lt;br /&gt;
|Stefano Benedettini&lt;br /&gt;
| Experiments on Boolean Network Design by Local Search Algorithms.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-20&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
| The social learning strategies tournament, organized as part of the [http://www.intercult.su.se/cultaptation/ cultaptation project], and its results were described. No ideas about algorithm portfolios were discussed.&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-??&lt;br /&gt;
|Renaud Lenne&lt;br /&gt;
| ???&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-04-29&lt;br /&gt;
|Franco Mascia&lt;br /&gt;
|The maximum clique problem, state of the art and ACO [http://dx.doi.org/10.1016/j.cor.2009.02.013] [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.80.2036&amp;amp;rep=rep1&amp;amp;type=pdf] [http://www710.univ-lyon1.fr/~csolnon/publications/rr-mai04.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-18&lt;br /&gt;
|Sabrina Oliveira&lt;br /&gt;
|Achieved results from the application of the Population Based Ant Colony Optimisation algorithm to TSP.&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-11&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|An overview of Container Loading Problems. &lt;br /&gt;
|-&lt;br /&gt;
| 2010-01-21&lt;br /&gt;
|Yuan, Zhi (Eric)&lt;br /&gt;
| Rice cooker vs. the idea of tuning. &lt;br /&gt;
|-&lt;br /&gt;
|2010-01-07&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|General discussion about the optimization group. &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Literature Sessions==&lt;br /&gt;
&lt;br /&gt;
===Purpose===&lt;br /&gt;
&lt;br /&gt;
The goal of the Literature Sessions is to examine and discuss&lt;br /&gt;
particularly interesting papers from the research literature. For each&lt;br /&gt;
session, one paper will be selected, there will be a short&lt;br /&gt;
presentation (10-15 minutes) about the contents, and a discussion will&lt;br /&gt;
ensue. Sessions will last around 40-45 minutes. Attendants should read&lt;br /&gt;
the paper before the session in order to have a productive discussion. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Organization ===&lt;br /&gt;
&lt;br /&gt;
# Book a room (ask Muriel).&lt;br /&gt;
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, a reference to the paper and the URL where it can be obtained. Also, attach the paper in PDF.&lt;br /&gt;
# Add a new entry to the table below. Use YYY-MM-DD (year-month-day) format for the date. Please add a complete bibliographic reference (you may find it in the homepages of the authors) and a hyperlink to a PDF (links to http://dx.doi.org are preferred).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== History of Literature Sessions ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!width=&amp;quot;180&amp;quot;|Presenter&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Paper discussed&lt;br /&gt;
|-&lt;br /&gt;
|2011-11-24&lt;br /&gt;
|Manuel LÃ³pez-IbÃ¡Ã±ez&lt;br /&gt;
|Ender Ã–zcan and Andrew J. Parkes. 2011. Policy matrix evolution for  generation of heuristics. In Proceedings of the 13th annual  conference on Genetic and evolutionary computation (GECCO 2011),  Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 2011-2018. DOI: [http://dx.doi.org/10.1145/2001576.2001846 10.1145/2001576.2001846]&lt;br /&gt;
|-&lt;br /&gt;
|2011-02-04&lt;br /&gt;
|Paola Pellegrini&lt;br /&gt;
|HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms. By Christopher Nell, Chris Fawcett, Holger H. Hoos, and Kevin Leyton-Brown. [http://hal.cs.ubc.ca/pubs/NelEtAl11.pdf PDF]&lt;br /&gt;
|-&lt;br /&gt;
|2010-12-17&lt;br /&gt;
|Marco Montes de Oca&lt;br /&gt;
|A. LaTorre, S. Muelas, and J.-M. PeÃ±a. A MOS-based dynamic memetic  differential evolution algorithm for continuous optimization: a  scalability test. Soft Computing. Special issue on Scalability of Evolutionary Algorithms and other Metaheuristics for Large Scale  Continuous Optimization Problems. DOI [http://dx.doi.org/10.1007/s00500-010-0646-3 10.1007/s00500-010-0646-3]&lt;br /&gt;
|-&lt;br /&gt;
|2010-11-10&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|A Rigorous Analysis of the Harmony Search Algorithm--How the Research Community can be misled by a &amp;quot;novel&amp;quot; Methodology. Dennis Weyland. International Journal of Applied Metaheuristic Computing, volume 1-2, April-June 2010, pages 50-60.  DOI: [http://dx.doi.org/10.4018/jamc.2010040104 10.4018/jamc.2010040104]&lt;br /&gt;
&lt;br /&gt;
Survival of the Fittest Algorithm or the Novelest Algorithm?: The Existence Reason of the Harmony Search Algorithm. Zong Woo Geem.&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-09-23&lt;br /&gt;
|Gianpiero Francesca&lt;br /&gt;
|Wenyin Gong, Ãlvaro Fialho and Zhihua Cai. Adaptive Strategy Selection in Differential Evolution. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 409-416. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/68/PDF/AOS-DE.pdf]&lt;br /&gt;
&lt;br /&gt;
Ãlvaro Fialho, Marc Schoenauer and Michele Sebag. Toward Comparison-based Adaptive Operator Selection. In J. Branke et al., eds.: &amp;quot;GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation&amp;quot;, ACM Press : p. 767-774. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/64/PDF/banditGECCO10.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-06-03&lt;br /&gt;
|Tianjun Liao &lt;br /&gt;
|Population-Based Algorithm Portfolios for Numerical Optimization. Peng, F. Tang, K.Chen, G.Yao, X. IEEE Transactions on Evolutionary Computation. DOI: [http://dx.doi.org/10.1109/TEVC.2010.2040183 10.1109/TEVC.2010.2040183] &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-05-07&lt;br /&gt;
|Zhi (Eric) Yuan&lt;br /&gt;
|Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. L. Xu, H.H. Hoos, K. Leyton-Brown. To appear at the Conference of the Association for the Advancement of Artificial Intelligence (AAAI-10), 2010. [http://ws.cs.ubc.ca/~kevinlb/pub.php?u=2010-AAAI-Hydra.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-03-04&lt;br /&gt;
|Sara Ceschia&lt;br /&gt;
|A. Schaerf and L. Di Gaspero. [[:Image:ElPaCo_presentation.pdf|Slides of the tutorial  &amp;quot;An Overview of Local Search Software Tools&amp;quot;]] given at &amp;quot;Learning and Intelligent OptimizatioN (LION 2007)&amp;quot;, December 8-12, 2007, Trento, Italy.&lt;br /&gt;
&lt;br /&gt;
L. Di Gaspero and A. Schaerf. EASY LOCAL++: An object-oriented framework for ï¬‚exible design of local search algorithms. Software â€” Practice &amp;amp; Experience, 33(8):733â€“765, July 2003. [http://www.diegm.uniud.it/satt/papers/DiSc03.pdf]&lt;br /&gt;
&lt;br /&gt;
S. Cahon, N. Melab and T. El Ghazali. ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. Journal of Heuristics, 10(3):357-380, November 2004. [http://dx.doi.org/10.1023/B:HEUR.0000026900.92269.ec]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-19&lt;br /&gt;
|Sabrina M. de Oliveira&lt;br /&gt;
|A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Session on Real Parameter Optimization. S. Garcia, D. Molina, M. Lozano, F. Herrera - Journal of Heuristics, Volume 15, pp. 617-644, 2009. [http://sci2s.ugr.es/programacion/workshop/GarciaMolinaLozanoHerrera-JH2008.pdf]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-02-04&lt;br /&gt;
|Thomas StÃ¼ztle&lt;br /&gt;
|Analyzing Bandit-based Adaptive Operator Selection Mechanisms. Ãlvaro Fialho, Luis Da Costa, Marc Schoenauer and MichÃ©le Sebag. &lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|2010-01-14&lt;br /&gt;
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]&lt;br /&gt;
|SATzilla: Portfolio-based Algorithm Selection for SAT. L. Xu, F. Hutter, H. H. Hoos, K. Leyton-Brown - Journal of Artificial Intelligence Research, Volume 32, pp. 565-606, 2008. [http://www.jair.org/media/2490/live-2490-3923-jair.pdf]&lt;br /&gt;
|-&lt;br /&gt;
|2009-12-11&lt;br /&gt;
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]&lt;br /&gt;
|SATenstein: Automatically Building Local Search SAT Solvers From Components. Ashiqur R. KhudaBukhsh, Lin Xu, Holger H. Hoos and Kevin Leyton-Brown - Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 517-524, 2009. [http://www.cs.ubc.ca/labs/beta/Projects/SATenstein/SATenstein_ijcai.pdf]&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Other Previous Meetings==&lt;br /&gt;
&lt;br /&gt;
See [[Previous Optimization meetings | Minutes and agendas from previous meetings]].&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Main_Page&amp;diff=5795</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Main_Page&amp;diff=5795"/>
		<updated>2011-11-15T13:26:16Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: &amp;quot;Other seminars&amp;quot; is a deadlink, delete&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;!--        BANNER ACROSS TOP OF PAGE        --&amp;gt;&lt;br /&gt;
{| id=&amp;quot;mp-topbanner&amp;quot; style=&amp;quot;width:100%; background:#fcfcfc; margin-top:1.2em; border:1px solid #ccc;&amp;quot; align=center&lt;br /&gt;
| style=&amp;quot;width:56%; color:#000;&amp;quot; |&lt;br /&gt;
{| style=&amp;quot;width:100%; border:none; background:none;&amp;quot;&lt;br /&gt;
| style=&amp;quot;width:100%; text-align:center; white-space:nowrap; color:#000;&amp;quot; |&lt;br /&gt;
&amp;lt;div style=&amp;quot;font-size:162%; border:none; margin:0; padding:.1em; color:#000;&amp;quot;&amp;gt;Welcome to [http://iridia.ulb.ac.be IRIDIA]'s wiki.&amp;lt;/div&amp;gt;&lt;br /&gt;
[[Image:Iridia_logo_fancy.png|480px|center]]&lt;br /&gt;
|}&lt;br /&gt;
__NOTOC__&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div id=&amp;quot;Top&amp;quot;&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
{| cellspacing=&amp;quot;20&amp;quot; cellpadding=&amp;quot;5&amp;quot; align=center &lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|valign=&amp;quot;top&amp;quot; width=&amp;quot;50%&amp;quot; style=&amp;quot;border:1px solid #cef2e0; background:#f5fffa;&amp;quot;|&lt;br /&gt;
&amp;lt;h2 id=&amp;quot;mp-tfa-h2&amp;quot; style=&amp;quot;margin:3px; background:#cef2e0; font-size:120%; font-weight:bold; border:1px solid #a3bfb1; text-align:left; &lt;br /&gt;
color:#000; padding:0.2em 0.4em;&amp;quot;&amp;gt;[[#anc1 | Practicalities]]&amp;lt;/h2&amp;gt;&lt;br /&gt;
* [[#anc1_1 | Moving and surviving in Brussels]] &lt;br /&gt;
* [[#anc1_2 | Information for students]] &lt;br /&gt;
* [[#anc1_3 | Useful informations]] (menu, pizza, etc...)&lt;br /&gt;
* [[Lab responsibilities]] &lt;br /&gt;
&lt;br /&gt;
|valign=&amp;quot;top&amp;quot; width=&amp;quot;50%&amp;quot; style=&amp;quot;border:1px solid #cedff2; background:#f5faff; vertical-align:top;&amp;quot;|&lt;br /&gt;
&lt;br /&gt;
&amp;lt;h2 id=&amp;quot;mp-itn-h2&amp;quot; style=&amp;quot;margin:3px; background:#cedff2; font-size:120%; font-weight:bold; border:1px solid #a3b0bf; text-align:left; color:#000; padding:0.2em 0.4em;&amp;quot;&amp;gt;[[#anc2 | Research]]&amp;lt;/h2&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [[#anc2_1 | Robotics]] (S-Bots, E-pucks, Software, Links)&lt;br /&gt;
&lt;br /&gt;
* [[#anc2_2 | Optimization]] (Links)&lt;br /&gt;
&lt;br /&gt;
* [[IRIDIA Technical reports]]&lt;br /&gt;
&lt;br /&gt;
* [http://iridia.ulb.ac.be/seminars IRIDIA seminars]&lt;br /&gt;
&lt;br /&gt;
* [[#anc2_3 | Publications]] (how to publish IRIDIA reports, digital libraries)&lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|valign=&amp;quot;top&amp;quot; width=&amp;quot;50%&amp;quot; style=&amp;quot;border:1px solid #ddcef2; background:#faf5ff; vertical-align:top; color:#000;&amp;quot;|&lt;br /&gt;
&amp;lt;h2  id=&amp;quot;mp-tfp-h2&amp;quot; style=&amp;quot;margin:3px; background:#ddcef2; font-size:120%; font-weight:bold; border:1px solid #afa3bf; text-align:left; color:#000; padding:0.2em 0.4em&amp;quot;&amp;gt;[[#anc3 | Infrastructure]]&amp;lt;/h2&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [[#anc3_1 | Hardware]] (configuration, backup, cluster, etc.)&lt;br /&gt;
* [[#anc3_2 | Software]] (HOWTOs, homepage, etc.)&lt;br /&gt;
* [[#material | Diverse material]] (Logos, graphic material, proceedings, etc.)&lt;br /&gt;
&lt;br /&gt;
|valign=&amp;quot;top&amp;quot; width=&amp;quot;50%&amp;quot; style=&amp;quot;padding: 2px; border:1px solid #FFEDCC; color: #000000; background: #FFFCE6;&amp;quot;|&lt;br /&gt;
&amp;lt;h2  id=&amp;quot;mp-tfp-h2&amp;quot; style=&amp;quot;margin:3px; background: #FFEDCC; font-size:120%; font-weight:bold; border:1px solid #cccccc; text-align:left; color:#000; padding:0.2em 0.4em&amp;quot;&amp;gt;Weekly meetings&amp;lt;/h2&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--* Alternate Thursdays at 15h00 : [[Robotics weekly meetings | Robotics meetings]]&lt;br /&gt;
* Alternate Thursdays at 15h00 : [[Literature meetings | Literature meetings]] --&amp;gt;&lt;br /&gt;
* Wednesdays at 15h00 : [[Robotics weekly meetings | Robotics meetings]]&lt;br /&gt;
* Thursdays at 10h30 : [[Administration weekly meetings | Administration weekly meeting]] &lt;br /&gt;
* Thursdays at 11h00 : [[Optimization Group Meetings]]&lt;br /&gt;
&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
'''WARNING''' : we have changed the access policy of the wiki. To consult some sensitive information, you need a login.&lt;br /&gt;
&lt;br /&gt;
== Adding information ==&lt;br /&gt;
&lt;br /&gt;
A Wiki is an excellent tool to maintain dynamic information. If you want to add something to this Wiki feel very free contact the system administrator and get an account. It is straight-forward to add and change the information in MediaWiki. Simply press ''edit'' on the top of this page to see how it was done. If you create a link to a non-existing page within this Wiki you can create that page by following the link - of course you would need a login to do so!. Pictures and documents have to be [[Special:Upload|uploaded]] before they can be used on pages. All popular image formats are supported and pdf and ps documents are allowed .&lt;br /&gt;
&lt;br /&gt;
For more information on the Wiki mark-up language see [http://en.wikipedia.org/wiki/Wikipedia:How_to_edit_a_page Wikipedia's page about How to edit a page]. When you become good at it, you can make cool looking pages.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &amp;lt;div id=&amp;quot;anc1&amp;quot;&amp;gt;Practicalities&amp;lt;/div&amp;gt; ==&lt;br /&gt;
&lt;br /&gt;
* &amp;lt;div id=&amp;quot;anc1_1&amp;quot;&amp;gt;'''Brussels'''&amp;lt;/div&amp;gt;&lt;br /&gt;
** [[Moving to Brussels]] - What you need to know for moving to Brussels (housing, transport, health care, etc.).&lt;br /&gt;
** [[Surviving in Brussels]] - French lessons, cultural events, etc.&lt;br /&gt;
** [[Allocations de chomage]] - Allocations de chomage.&lt;br /&gt;
&lt;br /&gt;
* &amp;lt;div id=&amp;quot;anc1_2&amp;quot;&amp;gt;'''Students'''&amp;lt;/div&amp;gt;&lt;br /&gt;
** [[What you need to begin to work in IRIDIA]] - Resources to activate to work at IRIDIA.&lt;br /&gt;
** [[For students visiting IRIDIA]] - Information for new students coming to IRIDIA.&lt;br /&gt;
** [[University Administration]] - (IMPORTANT!) The what, the where and the how of navigating university bureaucracy - inscription, regulations etc.&lt;br /&gt;
** [[Equivalence]] - Step by step explanations to request an equivalence of diplomas from Belgium.&lt;br /&gt;
** [[Funding]] - Information on getting funding for projects, scholarships and unemployment benefits in Belgium once the Ph.D. grant runs out.&lt;br /&gt;
** [[StudentsIRIDIA | Students]] - Information on students in IRIDIA.&lt;br /&gt;
** [http://www.ulb.ac.be/dep/financier/perso-avantages/index.html Intranet for ULB employees] - Web site with list of benefit for being ULB employees &lt;br /&gt;
** [[Insurance while travelling abroad]] - ULB's insurance&lt;br /&gt;
** [https://iridia.ulb.ac.be/cgi-bin/mailman/listinfo/ IRIDIA mailing lists]&lt;br /&gt;
** [[ECTS formation doctorale]] - a description of what you can use as ECTS for your DEA/formation doctorale&lt;br /&gt;
&lt;br /&gt;
* &amp;lt;div id=&amp;quot;anc1_3&amp;quot;&amp;gt;'''Useful information'''&amp;lt;/div&amp;gt;&lt;br /&gt;
** [[Working late | Pizza]] - menu for the local pizza place, it is a good idea to order in advance. &lt;br /&gt;
** [http://wwwdev.ulb.ac.be/restaurants/solbosch_s/r_pub.php3 Weekly menu at ULB restaurant]&lt;br /&gt;
** [http://www.snack44.net/ Snack 44] Menu for sandwich bar dans l'avenue de l'UniversitÃ©&lt;br /&gt;
&lt;br /&gt;
* &amp;lt;div id=&amp;quot;lab_responsibilities&amp;quot;&amp;gt;'''Lab responsibilities'''&amp;lt;/div&amp;gt;&lt;br /&gt;
** [[Lab responsibilities]] - list of labs responsibilities/tasks and who takes care of them.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;[[#Top | Back to top]]&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== &amp;lt;div id=&amp;quot;anc2&amp;quot;&amp;gt;Research&amp;lt;/div&amp;gt; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== &amp;lt;div id=&amp;quot;anc2_1&amp;quot;&amp;gt;Robotics&amp;lt;/div&amp;gt; ===&lt;br /&gt;
&lt;br /&gt;
* [[Robots | Main page for robots at IRIDIA]] - List of robots, technical information, how to access&lt;br /&gt;
* [[Arena time slots]] - Reserve arena time&lt;br /&gt;
* [[E-Pucks]] - All the information on how to use the e-pucks are here&lt;br /&gt;
&lt;br /&gt;
* '''Software'''&lt;br /&gt;
** [[ffmpeg | Using ffmpeg]] - Some examples on how to convert a set of frames to a video&lt;br /&gt;
&lt;br /&gt;
* '''Links &amp;amp; news'''&lt;br /&gt;
** [http://iridia.ulb.ac.be/comp2sys/ COMP2SYS project website]&lt;br /&gt;
** [[Robot labs around the World]]&lt;br /&gt;
** [http://robots.net Read more news on robots.net...]&lt;br /&gt;
** [[Old news]]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;[[#Top | Back to top]]&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== &amp;lt;div id=&amp;quot;anc2_2&amp;quot;&amp;gt;Optimization&amp;lt;/div&amp;gt; ===&lt;br /&gt;
&lt;br /&gt;
* '''Links &amp;amp; news'''&lt;br /&gt;
** [http://www.informs.org/Resources/ INFORMS OR/MS]&lt;br /&gt;
** [http://143.129.203.3/eume/php/eume.main.php EU/ME]&lt;br /&gt;
** [http://www.prism.uvsq.fr/~vdc/ECCO/ ECCO]&lt;br /&gt;
** [http://iridia.ulb.ac.be/sls-forum/ MH/SLS forum]&lt;br /&gt;
* '''Multi-objective Algorithms Software'''&lt;br /&gt;
** [http://www.tik.ee.ethz.ch/sop/pisa/ ETH - SOP - PISA]&lt;br /&gt;
** [http://paradiseo.gforge.inria.fr/index.php?n=Main.MOEO ParadisEO-MOEO]&lt;br /&gt;
** [http://shark-project.sourceforge.net/MOO-EALib/index.html Shark - MOO-EAlib]&lt;br /&gt;
&lt;br /&gt;
* '''Metaheuristics'''&lt;br /&gt;
** [http://www.aco-metaheuristic.org Ant Colony Optimization]&lt;br /&gt;
** [http://iew3.technion.ac.il/CE/about.php Cross Entropy Method]&lt;br /&gt;
** [http://evonet.lri.fr/ Evolutionary Computing]&lt;br /&gt;
** [http://www.research.att.com/~mgcr/grasp/gannbib/gannbib.html GRASP]&lt;br /&gt;
** [http://www.tabusearch.net/ Tabu Search]&lt;br /&gt;
* '''OR Software'''&lt;br /&gt;
** [http://code.google.com/p/or-tools/ OR-Tools by Google]&lt;br /&gt;
** [http://scip.zib.de/ SCIP]&lt;br /&gt;
* '''Projects'''&lt;br /&gt;
** [http://iridia.ulb.ac.be/comp2sys/ COMP2SYS]&lt;br /&gt;
** [http://www.metaheuristics.org/ Metaheuristics Network]&lt;br /&gt;
* '''Applications'''&lt;br /&gt;
** [http://www.nada.kth.se/~viggo/wwwcompendium/ A compendium of NP optimization problems]&lt;br /&gt;
** [http://www.tsp.gatech.edu/ TSP]&lt;br /&gt;
** [http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/ TSPLIB95] - A Traveling Salesman Problem Library&lt;br /&gt;
** [http://www.seas.upenn.edu/qaplib/ QAPLIB] - A Quadratic Assignment Problem Library&lt;br /&gt;
** [http://people.brunel.ac.uk/~mastjjb/jeb/info.html OR-Library]&lt;br /&gt;
** [http://iridia.ulb.ac.be/~manuel/tsptw-instances Benchmark Instances for the Travelling Salesman Problem with Time Windows (TSPTW)]&lt;br /&gt;
** [[Concorde]]&lt;br /&gt;
* '''Experimental Analysis and Statistics'''&lt;br /&gt;
** [http://www.r-project.org/ R project]&lt;br /&gt;
** [[Tutorials_and_links_about_C%2C_R%2C_LateX_and_bash_(unix)#R | Tutorials and links about R]]&lt;br /&gt;
** [http://www.statsoft.com/textbook/stathome.html Electronic Statistics Textbook. StatSoft, Inc. (2006)]&lt;br /&gt;
** [http://www.itl.nist.gov/div898/handbook/ NIST/SEMATECH e-Handbook of Statistical Methods]&lt;br /&gt;
**[http://www.keithbower.com/datasets/Audio%20Recordings.htm Videos on Statistical Concepts]&lt;br /&gt;
* '''Software Development'''&lt;br /&gt;
** [http://gcc.gnu.org/c99status.html C99 standard and use GCC compiler tools] - Suggested compiler&lt;br /&gt;
** [http://www.gnu.org/prep/standards/standards.pdf GNU Coding Standards] - Suggested coding style guidelines&lt;br /&gt;
** [http://www.gnu.org/software/gsl/ GSL] - GNU Scientific Library&lt;br /&gt;
** [http://subversion.tigris.org/ Subversion] - Suggested version control tool (see the page on the IRIDIA [[Development Server]] how to use it inside the lab)&lt;br /&gt;
** [http://www.stack.nl/~dimitri/doxygen/ Doxygen] - Suggested documentation tool for source code&lt;br /&gt;
&amp;lt;center&amp;gt;[[#Top | Back to top]]&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Generic Tutorials and Links ===&lt;br /&gt;
* [[Tutorials and links about C, R, LateX and bash (unix)]]&lt;br /&gt;
&lt;br /&gt;
=== Neural Networks ===&lt;br /&gt;
* [[Neural Network Tutorials]]&lt;br /&gt;
&lt;br /&gt;
=== &amp;lt;div id=&amp;quot;anc2_3&amp;quot;&amp;gt;Publications&amp;lt;/div&amp;gt; ===&lt;br /&gt;
&lt;br /&gt;
* [[IRIDIA Technical reports]] - Information on publishing a technical report and LaTeX package(s).&lt;br /&gt;
* [[Access to Digital Libraries]] - Which on-line papers archive we have access from IRIDIA network. &lt;br /&gt;
* [[Iridia Supplementary Information Instructions page]] - Information on HOW TO use the Iridia Supplementary Information page.&lt;br /&gt;
* [[Write Better English]] - Basic pointers on how to raise the level of english in your paper.&lt;br /&gt;
* [[Embed Fonts in your PDFs]] - A guide on how to embed fonts on your PDFs for submission to conferences.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;[[#Top | Back to top]]&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== &amp;lt;div id=&amp;quot;anc3&amp;quot;&amp;gt;Infrastructure&amp;lt;/div&amp;gt; ==&lt;br /&gt;
&lt;br /&gt;
* [[Infrastructure]] - Generalities, meetings, TODOS, etc.&lt;br /&gt;
&lt;br /&gt;
=== &amp;lt;div id=&amp;quot;anc3_1&amp;quot;&amp;gt;'''Hardware'''&amp;lt;/div&amp;gt; ===&lt;br /&gt;
* [[Workstation configuration]] - How to setup your personal workstation and laptop, printers, etc.&lt;br /&gt;
* [[Backup Server]] - How to use the backup server of IRIDIA&lt;br /&gt;
* [[Development Server]] - How to use the IRIDIA development server and how to use subversion repositories&lt;br /&gt;
* IRIDIA Cluster: See the [http://majorana.ulb.ac.be/wordpress/ Cluster Website] for usage information, tips and updates.&lt;br /&gt;
* [[Using the IRIDIA Experimental room]] - All you need to know to easily run real experiments.&lt;br /&gt;
* [[Workshop]] - Everything you wanted to know about the workshop but were afraid to ask&lt;br /&gt;
&lt;br /&gt;
=== &amp;lt;div id=&amp;quot;anc3_2&amp;quot;&amp;gt;'''Software'''&amp;lt;/div&amp;gt; ===&lt;br /&gt;
* [[Creating your own home page]] - How to create your own home.&lt;br /&gt;
* See all [[Software HOWTOs]]&lt;br /&gt;
* Suggested software for [[Workstation_configuration#For_Mac_OS_X_users | Mac OS X]] users&lt;br /&gt;
* List of [[Available_commercial_software | commercial software]] we have in IRIDIA&lt;br /&gt;
* Howto create a [[howto_create_new_svn_repos | new svn repository ]] on the iridia server&lt;br /&gt;
&lt;br /&gt;
=== &amp;lt;div id=&amp;quot;material&amp;quot;&amp;gt;'''Diverse Material'''&amp;lt;/div&amp;gt; ===&lt;br /&gt;
* [[Logos]]&lt;br /&gt;
* [https://iridia-dev.ulb.ac.be/projects/material/svn SVN repository of graphical material] (for access see [[Development Server]])&lt;br /&gt;
* [[ProceedingsRepository| Repository of Proceedings]]&lt;br /&gt;
&amp;lt;center&amp;gt;[[#Top | Back to top]]&amp;lt;/center&amp;gt;&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Embed_Fonts_in_your_PDFs&amp;diff=5776</id>
		<title>Embed Fonts in your PDFs</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Embed_Fonts_in_your_PDFs&amp;diff=5776"/>
		<updated>2011-10-29T23:28:48Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: mention pdffix script&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Many conferences/journals need you to embed all the used fonts in your pdfs. You can check if your pdfs have embedded fonts in two ways:&lt;br /&gt;
* Open it with your favorite pdf readers (tested with areader and evince), go to File-&amp;gt;Properties-&amp;gt;Fonts and check that everything is embedded&lt;br /&gt;
* from the command line:&lt;br /&gt;
 pdffonts my_pdf.pdf&lt;br /&gt;
&lt;br /&gt;
pdfLaTEX should already embed the fonts in your documents, so if you don't have all the fonts embedded the fault is probably of some images. R has the bad habit of not embedding the fonts.&lt;br /&gt;
&lt;br /&gt;
How to solve this:&lt;br /&gt;
&lt;br /&gt;
* the dirty solution is to convert the file (either the single images or the whole doc) to ps and then back to pdf with the fonts. Note that this process might mess up the layout, always check the obtained pdf. ([http://kailaspatil.blogspot.com/2011/03/embed-fonts-in-pdf-file-using-pdflatex.html Source])&lt;br /&gt;
 pdftops  mypaper.pdf&lt;br /&gt;
 ps2pdf14 -dPDFSETTINGS=/prepress mypaper.ps&lt;br /&gt;
&lt;br /&gt;
* A less dirty solution is to convert from PDF to PDF using ghostscript. This normally does not mess up the layout or lower the quality of the images. See the script pdffix in https://iridia-dev.ulb.ac.be/projects/optsrc/svn/scripts/pdffix&lt;br /&gt;
&lt;br /&gt;
* the correct solution would be to embed the fonts when producing the images. &lt;br /&gt;
** examples coming up in the future&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=IRIDIA_Technical_reports&amp;diff=5645</id>
		<title>IRIDIA Technical reports</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=IRIDIA_Technical_reports&amp;diff=5645"/>
		<updated>2011-10-10T14:10:49Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: fix link to TR&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[http://iridia.ulb.ac.be/IridiaTrSeries The IRIDIA -- Technical Report Series] is a series of reports published&lt;br /&gt;
on the web by IRIDIA. The series is officially registered and has an&lt;br /&gt;
ISSN number: 1781-3794.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== What is a suitable technical report? ==&lt;br /&gt;
&lt;br /&gt;
You should consider registering as a technical report any scientific&lt;br /&gt;
or technical document that you wish to share with other researchers at&lt;br /&gt;
IRIDIA or elsewhere. Good examples are: &lt;br /&gt;
&lt;br /&gt;
&amp;lt;ol&amp;gt;&lt;br /&gt;
     &amp;lt;li&amp;gt; a scientific paper that you have submitted for publication in a&lt;br /&gt;
     journal or in the proceedings of a conference (IRIDIA researchers are &lt;br /&gt;
    STRONGLY invited to submit as technical report, at the time of submission, &lt;br /&gt;
    all conference or journal papers they write).&amp;lt;/li&amp;gt;&lt;br /&gt;
&lt;br /&gt;
     &amp;lt;li&amp;gt; a scientific work that you have published somewhere. Please&lt;br /&gt;
     notice that there might be some copyright issues!!! In any case,&lt;br /&gt;
     you should be aware that the copyright notice of the technical&lt;br /&gt;
     report goes like this:&lt;br /&gt;
     &lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
          The authors take full responsibility for any copyright&lt;br /&gt;
 	  breaches that may result from publication of this paper in&lt;br /&gt;
 	  the IRIDIA -- Technical Report Series.  IRIDIA is not&lt;br /&gt;
 	  responsible for any use that might be made of data appearing&lt;br /&gt;
 	  in this publication.&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
     &amp;lt;/li&amp;gt;&lt;br /&gt;
&lt;br /&gt;
     &amp;lt;li&amp;gt; the dirty details of an algorithm that no scientific journal&lt;br /&gt;
     would ever wish to publish.&amp;lt;/li&amp;gt;&lt;br /&gt;
&lt;br /&gt;
     &amp;lt;li&amp;gt; the whole set of results of an experimental analysis with all&lt;br /&gt;
     plots and all tables.&amp;lt;/li&amp;gt;&lt;br /&gt;
&lt;br /&gt;
     &amp;lt;li&amp;gt; the manual of a computer program that you have written.&amp;lt;/li&amp;gt; &lt;br /&gt;
&amp;lt;/ol&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Note that not only the works that are&lt;br /&gt;
submitted and/or published can be registered as technical reports.&lt;br /&gt;
&lt;br /&gt;
You should consider a report registered in the [http://iridia.ulb.ac.be/IridiaTrSeries IRIDIA -- Technical Report Series] as a publication in itself.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== How to cite an IRIDIA technical report? ==&lt;br /&gt;
&lt;br /&gt;
Here's an example:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
  @TechReport{BirLopBru2005:IridiaTrCover,&lt;br /&gt;
    author =      {M. Birattari and M. L{\'o}pez-Ib{\'a}{\~n}ez and A. Brutschy },&lt;br /&gt;
    title =       &amp;quot;The {IridiaTrCover} package for \LaTeX:&lt;br /&gt;
                   How to typeset documents for the &lt;br /&gt;
                   IRIDIA -- Technical Report Series&amp;quot;,&lt;br /&gt;
    institution = {IRIDIA, Universit\'e Libre de Bruxelles},&lt;br /&gt;
    year =        2005,&lt;br /&gt;
    number =      {TR/IRIDIA/2005-006},&lt;br /&gt;
    address =     {Brussels, Belgium},&lt;br /&gt;
  }&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== How to register a technical report? ==&lt;br /&gt;
&lt;br /&gt;
If you have a scientific or technical document that you think fits&lt;br /&gt;
into the description given in the above section [[#What is a suitable technical report?]], you might consider registering it in the IRIDIA --&lt;br /&gt;
Technical Report Series. This is the procedure you should follow:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ol&amp;gt;&lt;br /&gt;
  &amp;lt;li&amp;gt; Double check that your document is indeed suitable for being&lt;br /&gt;
  registered in the IRIDIA -- Technical Report Series! If you are a&lt;br /&gt;
  Ph.D. student, check with your supervisor.&amp;lt;/li&amp;gt;&lt;br /&gt;
&lt;br /&gt;
  &amp;lt;li&amp;gt; Typeset the document using the [[#Where to find the LaTeX IridiaTrCover package? | LaTeX IridiaTrCover package]].&amp;lt;/li&amp;gt;&lt;br /&gt;
&lt;br /&gt;
  &amp;lt;li&amp;gt; Give Muriel the title of the document and the list of the&lt;br /&gt;
  authors. She will give you a technical report number and a date.&lt;br /&gt;
  The date will be something like &amp;quot;MONTH YEAR&amp;quot; where MONTH and YEAR&lt;br /&gt;
  are  respectively the month and the year in which the technical&lt;br /&gt;
  report number is assigned to your document.&amp;lt;/li&amp;gt;&lt;br /&gt;
&lt;br /&gt;
  &amp;lt;li&amp;gt; Include number and date in your document. See the documentation &lt;br /&gt;
  of the [[#Where to find the LaTeX IridiaTrCover package? | LaTeX IridiaTrCover package]] &lt;br /&gt;
  to learn how to do this.&amp;lt;/li&amp;gt;&lt;br /&gt;
&lt;br /&gt;
  &amp;lt;li&amp;gt; Give Muriel a printed copy of the technical report and send the&lt;br /&gt;
  PDF file to the email address &lt;br /&gt;
  [mailto:techrep@iridia.ulb.ac.be &amp;lt;techrep@iridia.ulb.ac.be&amp;gt;].&amp;lt;/li&amp;gt;  &lt;br /&gt;
&amp;lt;/ol&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Muriel will then announce the new technical report on the internal&lt;br /&gt;
mailing list of IRIDIA, and the report will be published on the web.&lt;br /&gt;
&lt;br /&gt;
IMPORTANT: Steps 3 and 5 should be performed with no delay in between!&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
  &amp;lt;li&amp;gt; '''DO NOT ask for a technical report date and number unless the'''&lt;br /&gt;
  '''document you want to register is already written, well formatted and'''&lt;br /&gt;
  '''ready to be distributed.'''&amp;lt;/li&amp;gt;&lt;br /&gt;
&lt;br /&gt;
  &amp;lt;li&amp;gt; '''DO NOT ask to register your technical report with a date that is'''&lt;br /&gt;
   '''not the one in which you indeed register it.'''&amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== How to submit a revised version of a technical report? ==&lt;br /&gt;
&lt;br /&gt;
Whenever you feel like submitting a revised version of a technical&lt;br /&gt;
report of yours, just give a printed copy of the new version to Muriel&lt;br /&gt;
and send the PDF file to the email address &lt;br /&gt;
[mailto:techrep@iridia.ulb.ac.be &amp;lt;techrep@iridia.ulb.ac.be&amp;gt;].&lt;br /&gt;
The new revision will be published on the web.&lt;br /&gt;
&lt;br /&gt;
A revised version must contain a &amp;quot;revision history&amp;quot; on the copyright&lt;br /&gt;
page. Please read [[#Numbering of the IRIDIA -- Technical Report Series]] to understand what a revision history is. You&lt;br /&gt;
should also have a look at the documentation of the [[#Where to find the LaTeX IridiaTrCover package? | LaTeX IridiaTrCover package]].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Numbering of the IRIDIA -- Technical Report Series ==&lt;br /&gt;
&lt;br /&gt;
The number of a technical report is composed by the string&lt;br /&gt;
&amp;quot;TR/IRIDIA/&amp;quot; followed by the year (4 digits), a hyphen and then a&lt;br /&gt;
progressive number (3 digits, possibly left-padded with zeros).&lt;br /&gt;
The first technical report of year XXXX gets the number&lt;br /&gt;
TR/IRIDIA/XXXX-001, the second TR/IRIDIA/XXXX-002, and so on.&lt;br /&gt;
&lt;br /&gt;
This is the number that appears on the cover of a technical report&lt;br /&gt;
together with the date.&lt;br /&gt;
&lt;br /&gt;
A technical report might be ''revised''. The first version of a&lt;br /&gt;
technical report is revision number 001. Revision numbers are made of&lt;br /&gt;
3 digits, possibly left-padded with zeros.&lt;br /&gt;
&lt;br /&gt;
If you wish to refer to revision ZZZ of technical report YYY&lt;br /&gt;
registered in year XXXX, the number you should use is&lt;br /&gt;
&amp;quot;TR/IRIDIA/XXXX-YYY.ZZZ&amp;quot;.  Remember the zero-padding!!!&lt;br /&gt;
&lt;br /&gt;
In general, TR/IRIDIA/XXXX-YYY refers to the most recent revision&lt;br /&gt;
available. When you cite a technical report, do not include the&lt;br /&gt;
revision number. The revision number should be included only if you&lt;br /&gt;
wish to refer to a specific revision or if you wish to point out&lt;br /&gt;
differences between revisions---e.g., &amp;quot;revision TR/IRIDIA/XXXX-YYY.002&lt;br /&gt;
contained a stupid mistake that has been corrected in following&lt;br /&gt;
revisions&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
In any case, the cover does not report the revision number, and the&lt;br /&gt;
date is always the one of the first revision, i.e., the version&lt;br /&gt;
originally submitted.&lt;br /&gt;
&lt;br /&gt;
The revision history appears on the copyright page.  A technical&lt;br /&gt;
report that is a revision of a previously submitted one must always&lt;br /&gt;
feature the revision history on the copyright page.&lt;br /&gt;
&lt;br /&gt;
A technical report is uniquely identified by its number. So a new&lt;br /&gt;
revision can have a different title and also different authors---e.g.,&lt;br /&gt;
different order, one author added, one removed, etc.&lt;br /&gt;
&lt;br /&gt;
Anyway, if the title and/or the author list changes and/or if&lt;br /&gt;
the technical report undergoes really MAJOR-MAJOR-MAJOR modifications,&lt;br /&gt;
please submit a new technical report.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- This is a bit confusing and unnecessary for most of the people. I leave it here just for the sake of completeness.&lt;br /&gt;
Please notice that the numbering conventions adopted for the IRIDIA --&lt;br /&gt;
Technical Report Series let us register 999 revisions of the same&lt;br /&gt;
technical report and let us write 999 new technical reports per year&lt;br /&gt;
till Dec 31, 9999. After that day some new set of conventions should&lt;br /&gt;
be designed. I suggest the trivial extension: writing the year with 5&lt;br /&gt;
digits. If you have a better idea, please let me know by dropping a&lt;br /&gt;
line to [mailto:mbiro@ulb.ac.be &amp;lt;mbiro@ulb.ac.be&amp;gt;]. &lt;br /&gt;
Anyway, I don't think that discussing the&lt;br /&gt;
conventions to be adopted starting from Jan 1, 10000 should be a&lt;br /&gt;
priority, at least for the next couple of months. :)&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== File name conventions ==&lt;br /&gt;
&lt;br /&gt;
The PDF file of a technical report should have a name that matches the&lt;br /&gt;
following pattern: IridiaTrXXXX-YYYrZZZ.pdf where XXXX is the year,&lt;br /&gt;
YYY is the number, and ZZZ is the revision. Remember zero-padding&lt;br /&gt;
number and revision! The original version is the very first revision and, hence, it contains the revision number 001 in its name.&lt;br /&gt;
&lt;br /&gt;
If you submit a technical report (very first version)&lt;br /&gt;
and Muriel gave you number TR/IRIDIA/XXXX-YYY, you should send to the&lt;br /&gt;
email address [mailto:techrep@iridia.ulb.ac.be &amp;lt;techrep@iridia.ulb.ac.be&amp;gt;]&lt;br /&gt;
a PDF file called IridiaTrXXXX-YYYr001.pdf (include the revision number!).  &lt;br /&gt;
If you revise the report, the PDF of the revised version will be called&lt;br /&gt;
IridiaTrXXXX-YYYr002.pdf and so on.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Where to find the LaTeX IridiaTrCover package? ==&lt;br /&gt;
&lt;br /&gt;
The most recent version of the LaTeX IridiaTrCover package is [[Media:IridiaTrCover-2.0-r11.tar.gz|IridiaTrCover-2.0-r11.tar.gz]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== How to use the IridiaTrCover.sty for LaTeX? ==&lt;br /&gt;
&lt;br /&gt;
Read the technical report [http://iridia.ulb.ac.be/IridiaTrSeries/IridiaTr2005-006.pdf TR/IRIDIA/2005-006]&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
  The IridiaTrCover package for LaTeX: &lt;br /&gt;
  How to typeset documents for the IRIDIA -- Technical Report Series&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The [[#Where to find the LaTeX IridiaTrCover package?|IridiaTrCover package]] contains also the technical report and its source file.  &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== What if you are not able to use LaTeX? ==&lt;br /&gt;
&lt;br /&gt;
If you are not able to use LaTeX, you can produce your technical&lt;br /&gt;
report in PDF format and  ask then  &lt;br /&gt;
[mailto:ericyuanzhi@gmail.com Eric] or [mailto:Sabrina.Oliveira@ulb.ac.be Sabrina]&lt;br /&gt;
to generate a cover page and to prefix it to your file. Apart from this step, please follow the [[#How to register a technical report?|other steps described above for registering your technical report]].&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Main_Page&amp;diff=5637</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Main_Page&amp;diff=5637"/>
		<updated>2011-10-06T12:09:07Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: /* Infrastructure */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;!--        BANNER ACROSS TOP OF PAGE        --&amp;gt;&lt;br /&gt;
{| id=&amp;quot;mp-topbanner&amp;quot; style=&amp;quot;width:100%; background:#fcfcfc; margin-top:1.2em; border:1px solid #ccc;&amp;quot; align=center&lt;br /&gt;
| style=&amp;quot;width:56%; color:#000;&amp;quot; |&lt;br /&gt;
{| style=&amp;quot;width:100%; border:none; background:none;&amp;quot;&lt;br /&gt;
| style=&amp;quot;width:100%; text-align:center; white-space:nowrap; color:#000;&amp;quot; |&lt;br /&gt;
&amp;lt;div style=&amp;quot;font-size:162%; border:none; margin:0; padding:.1em; color:#000;&amp;quot;&amp;gt;Welcome to [http://iridia.ulb.ac.be IRIDIA]'s wiki.&amp;lt;/div&amp;gt;&lt;br /&gt;
[[Image:Iridia_logo_fancy.png|480px|center]]&lt;br /&gt;
|}&lt;br /&gt;
__NOTOC__&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div id=&amp;quot;Top&amp;quot;&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
{| cellspacing=&amp;quot;20&amp;quot; cellpadding=&amp;quot;5&amp;quot; align=center &lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|valign=&amp;quot;top&amp;quot; width=&amp;quot;50%&amp;quot; style=&amp;quot;border:1px solid #cef2e0; background:#f5fffa;&amp;quot;|&lt;br /&gt;
&amp;lt;h2 id=&amp;quot;mp-tfa-h2&amp;quot; style=&amp;quot;margin:3px; background:#cef2e0; font-size:120%; font-weight:bold; border:1px solid #a3bfb1; text-align:left; &lt;br /&gt;
color:#000; padding:0.2em 0.4em;&amp;quot;&amp;gt;[[#anc1 | Practicalities]]&amp;lt;/h2&amp;gt;&lt;br /&gt;
* [[#anc1_1 | Moving and surviving in Brussels]] &lt;br /&gt;
* [[#anc1_2 | Information for students]] &lt;br /&gt;
* [[#anc1_3 | Useful informations]] (menu, pizza, etc...)&lt;br /&gt;
* [[Lab responsibilities]] &lt;br /&gt;
&lt;br /&gt;
|valign=&amp;quot;top&amp;quot; width=&amp;quot;50%&amp;quot; style=&amp;quot;border:1px solid #cedff2; background:#f5faff; vertical-align:top;&amp;quot;|&lt;br /&gt;
&lt;br /&gt;
&amp;lt;h2 id=&amp;quot;mp-itn-h2&amp;quot; style=&amp;quot;margin:3px; background:#cedff2; font-size:120%; font-weight:bold; border:1px solid #a3b0bf; text-align:left; color:#000; padding:0.2em 0.4em;&amp;quot;&amp;gt;[[#anc2 | Research]]&amp;lt;/h2&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [[#anc2_1 | Robotics]] (S-Bots, E-pucks, Software, Links)&lt;br /&gt;
&lt;br /&gt;
* [[#anc2_2 | Optimization]] (Links)&lt;br /&gt;
&lt;br /&gt;
* [[IRIDIA Technical reports]]&lt;br /&gt;
&lt;br /&gt;
* [http://iridia.ulb.ac.be/seminars IRIDIA seminars]&lt;br /&gt;
&lt;br /&gt;
* [[#anc2_3 | Publications]] (how to publish IRIDIA reports, digital libraries)&lt;br /&gt;
&lt;br /&gt;
* [[#anc2_4 | Other seminars]] &lt;br /&gt;
|- &lt;br /&gt;
&lt;br /&gt;
|valign=&amp;quot;top&amp;quot; width=&amp;quot;50%&amp;quot; style=&amp;quot;border:1px solid #ddcef2; background:#faf5ff; vertical-align:top; color:#000;&amp;quot;|&lt;br /&gt;
&amp;lt;h2  id=&amp;quot;mp-tfp-h2&amp;quot; style=&amp;quot;margin:3px; background:#ddcef2; font-size:120%; font-weight:bold; border:1px solid #afa3bf; text-align:left; color:#000; padding:0.2em 0.4em&amp;quot;&amp;gt;[[#anc3 | Infrastructure]]&amp;lt;/h2&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [[#anc3_1 | Hardware]] (configuration, backup, cluster, etc.)&lt;br /&gt;
* [[#anc3_2 | Software]] (HOWTOs, homepage, etc.)&lt;br /&gt;
* [[#material | Diverse material]] (Logos, graphic material, proceedings, etc.)&lt;br /&gt;
&lt;br /&gt;
|valign=&amp;quot;top&amp;quot; width=&amp;quot;50%&amp;quot; style=&amp;quot;padding: 2px; border:1px solid #FFEDCC; color: #000000; background: #FFFCE6;&amp;quot;|&lt;br /&gt;
&amp;lt;h2  id=&amp;quot;mp-tfp-h2&amp;quot; style=&amp;quot;margin:3px; background: #FFEDCC; font-size:120%; font-weight:bold; border:1px solid #cccccc; text-align:left; color:#000; padding:0.2em 0.4em&amp;quot;&amp;gt;Weekly meetings&amp;lt;/h2&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--* Alternate Thursdays at 15h00 : [[Robotics weekly meetings | Robotics meetings]]&lt;br /&gt;
* Alternate Thursdays at 15h00 : [[Literature meetings | Literature meetings]] --&amp;gt;&lt;br /&gt;
* Wednesdays at 15h00 : [[Robotics weekly meetings | Robotics meetings]]&lt;br /&gt;
* Thursdays at 10h30 : [[Administration weekly meetings | Administration weekly meeting]] &lt;br /&gt;
* Thursdays at 11h00 : [[Optimization Group Meetings]]&lt;br /&gt;
&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
'''WARNING''' : we have changed the access policy of the wiki. To consult some sensitive information, you need a login.&lt;br /&gt;
&lt;br /&gt;
== Adding information ==&lt;br /&gt;
&lt;br /&gt;
A Wiki is an excellent tool to maintain dynamic information. If you want to add something to this Wiki feel very free contact the system administrator and get an account. It is straight-forward to add and change the information in MediaWiki. Simply press ''edit'' on the top of this page to see how it was done. If you create a link to a non-existing page within this Wiki you can create that page by following the link - of course you would need a login to do so!. Pictures and documents have to be [[Special:Upload|uploaded]] before they can be used on pages. All popular image formats are supported and pdf and ps documents are allowed .&lt;br /&gt;
&lt;br /&gt;
For more information on the Wiki mark-up language see [http://en.wikipedia.org/wiki/Wikipedia:How_to_edit_a_page Wikipedia's page about How to edit a page]. When you become good at it, you can make cool looking pages.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &amp;lt;div id=&amp;quot;anc1&amp;quot;&amp;gt;Practicalities&amp;lt;/div&amp;gt; ==&lt;br /&gt;
&lt;br /&gt;
* &amp;lt;div id=&amp;quot;anc1_1&amp;quot;&amp;gt;'''Brussels'''&amp;lt;/div&amp;gt;&lt;br /&gt;
** [[Moving to Brussels]] - What you need to know for moving to Brussels (housing, transport, health care, etc.).&lt;br /&gt;
** [[Surviving in Brussels]] - French lessons, cultural events, etc.&lt;br /&gt;
&lt;br /&gt;
* &amp;lt;div id=&amp;quot;anc1_2&amp;quot;&amp;gt;'''Students'''&amp;lt;/div&amp;gt;&lt;br /&gt;
** [[What you need to begin to work in IRIDIA]] - Resources to activate to work at IRIDIA.&lt;br /&gt;
** [[For students visiting IRIDIA]] - Information for new students coming to IRIDIA.&lt;br /&gt;
** [[University Administration]] - (IMPORTANT!) The what, the where and the how of navigating university bureaucracy - inscription, regulations etc.&lt;br /&gt;
** [[Equivalence]] - Step by step explanations to request an equivalence of diplomas from Belgium.&lt;br /&gt;
** [[Funding]] - Information on getting funding for projects, scholarships and unemployment benefits in Belgium once the Ph.D. grant runs out.&lt;br /&gt;
** [[StudentsIRIDIA | Students]] - Information on students in IRIDIA.&lt;br /&gt;
** [http://www.ulb.ac.be/dep/financier/perso-avantages/index.html Intranet for ULB employees] - Web site with list of benefit for being ULB employees &lt;br /&gt;
** [[Insurance while travelling abroad]] - ULB's insurance&lt;br /&gt;
** [https://iridia.ulb.ac.be/cgi-bin/mailman/listinfo/ IRIDIA mailing lists]&lt;br /&gt;
** [[ECTS formation doctorale]] - a description of what you can use as ECTS for your DEA/formation doctorale&lt;br /&gt;
&lt;br /&gt;
* &amp;lt;div id=&amp;quot;anc1_3&amp;quot;&amp;gt;'''Useful information'''&amp;lt;/div&amp;gt;&lt;br /&gt;
** [[Working late | Pizza]] - menu for the local pizza place, it is a good idea to order in advance. &lt;br /&gt;
** [http://wwwdev.ulb.ac.be/restaurants/solbosch_s/r_pub.php3 Weekly menu at ULB restaurant]&lt;br /&gt;
** [http://www.snack44.net/ Snack 44] Menu for sandwich bar dans l'avenue de l'UniversitÃ©&lt;br /&gt;
&lt;br /&gt;
* &amp;lt;div id=&amp;quot;lab_responsibilities&amp;quot;&amp;gt;'''Lab responsibilities'''&amp;lt;/div&amp;gt;&lt;br /&gt;
** [[Lab responsibilities]] - list of labs responsibilities/tasks and who takes care of them.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;[[#Top | Back to top]]&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== &amp;lt;div id=&amp;quot;anc2&amp;quot;&amp;gt;Research&amp;lt;/div&amp;gt; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== &amp;lt;div id=&amp;quot;anc2_1&amp;quot;&amp;gt;Robotics&amp;lt;/div&amp;gt; ===&lt;br /&gt;
&lt;br /&gt;
* [[Robots | Main page for robots at IRIDIA]] - List of robots, technical information, how to access&lt;br /&gt;
* [[Arena time slots]] - Reserve arena time&lt;br /&gt;
* [[E-Pucks]] - All the information on how to use the e-pucks are here&lt;br /&gt;
&lt;br /&gt;
* '''Software'''&lt;br /&gt;
** [http://iridia.ulb.ac.be/~acampo/wiki/index.php/Tracker tracker] A program to track a single pattern in a sequence of pictures.&lt;br /&gt;
** [http://iridia.ulb.ac.be/~acampo/wiki/index.php/Libdistortion &amp;lt;span style=&amp;quot;color:red;&amp;quot;&amp;gt;libdistortion&amp;lt;/span&amp;gt;] &amp;lt;span style=&amp;quot;color:red;&amp;quot;&amp;gt;(BROKEN LINK)&amp;lt;/span&amp;gt; a simple library to rectify camera images and extract easily real world coordinates of objects.&lt;br /&gt;
&lt;br /&gt;
* '''Links &amp;amp; news'''&lt;br /&gt;
** [http://iridia.ulb.ac.be/comp2sys/ COMP2SYS project website]&lt;br /&gt;
** [[Robot labs around the World]]&lt;br /&gt;
** [http://robots.net Read more news on robots.net...]&lt;br /&gt;
** [[Old news]]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;[[#Top | Back to top]]&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== &amp;lt;div id=&amp;quot;anc2_2&amp;quot;&amp;gt;Optimization&amp;lt;/div&amp;gt; ===&lt;br /&gt;
&lt;br /&gt;
* '''Links &amp;amp; news'''&lt;br /&gt;
** [http://www.informs.org/Resources/ INFORMS OR/MS]&lt;br /&gt;
** [http://143.129.203.3/eume/php/eume.main.php EU/ME]&lt;br /&gt;
** [http://www.prism.uvsq.fr/~vdc/ECCO/ ECCO]&lt;br /&gt;
** [http://iridia.ulb.ac.be/sls-forum/ MH/SLS forum]&lt;br /&gt;
* '''Multi-objective Algorithms Software'''&lt;br /&gt;
** [http://www.tik.ee.ethz.ch/sop/pisa/ ETH - SOP - PISA]&lt;br /&gt;
** [http://paradiseo.gforge.inria.fr/index.php?n=Main.MOEO ParadisEO-MOEO]&lt;br /&gt;
** [http://shark-project.sourceforge.net/MOO-EALib/index.html Shark - MOO-EAlib]&lt;br /&gt;
&lt;br /&gt;
* '''Metaheuristics'''&lt;br /&gt;
** [http://www.aco-metaheuristic.org Ant Colony Optimization]&lt;br /&gt;
** [http://iew3.technion.ac.il/CE/about.php Cross Entropy Method]&lt;br /&gt;
** [http://evonet.lri.fr/ Evolutionary Computing]&lt;br /&gt;
** [http://www.research.att.com/~mgcr/grasp/gannbib/gannbib.html GRASP]&lt;br /&gt;
** [http://www.tabusearch.net/ Tabu Search]&lt;br /&gt;
* '''OR Software'''&lt;br /&gt;
** [http://code.google.com/p/or-tools/ OR-Tools by Google]&lt;br /&gt;
** [http://scip.zib.de/ SCIP]&lt;br /&gt;
* '''Projects'''&lt;br /&gt;
** [http://iridia.ulb.ac.be/comp2sys/ COMP2SYS]&lt;br /&gt;
** [http://www.metaheuristics.org/ Metaheuristics Network]&lt;br /&gt;
* '''Applications'''&lt;br /&gt;
** [http://www.nada.kth.se/~viggo/wwwcompendium/ A compendium of NP optimization problems]&lt;br /&gt;
** [http://www.tsp.gatech.edu/ TSP]&lt;br /&gt;
** [http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/ TSPLIB95] - A Traveling Salesman Problem Library&lt;br /&gt;
** [http://www.seas.upenn.edu/qaplib/ QAPLIB] - A Quadratic Assignment Problem Library&lt;br /&gt;
** [http://people.brunel.ac.uk/~mastjjb/jeb/info.html OR-Library]&lt;br /&gt;
** [http://iridia.ulb.ac.be/~manuel/tsptw-instances Benchmark Instances for the Travelling Salesman Problem with Time Windows (TSPTW)]&lt;br /&gt;
** [[Concorde]]&lt;br /&gt;
* '''Experimental Analysis and Statistics'''&lt;br /&gt;
** [http://www.r-project.org/ R project]&lt;br /&gt;
** [[Tutorials_and_links_about_C%2C_R%2C_LateX_and_bash_(unix)#R | Tutorials and links about R]]&lt;br /&gt;
** [http://www.statsoft.com/textbook/stathome.html Electronic Statistics Textbook. StatSoft, Inc. (2006)]&lt;br /&gt;
** [http://www.itl.nist.gov/div898/handbook/ NIST/SEMATECH e-Handbook of Statistical Methods]&lt;br /&gt;
**[http://www.keithbower.com/datasets/Audio%20Recordings.htm Videos on Statistical Concepts]&lt;br /&gt;
* '''Software Development'''&lt;br /&gt;
** [http://gcc.gnu.org/c99status.html C99 standard and use GCC compiler tools] - Suggested compiler&lt;br /&gt;
** [http://www.gnu.org/prep/standards/standards.pdf GNU Coding Standards] - Suggested coding style guidelines&lt;br /&gt;
** [http://www.gnu.org/software/gsl/ GSL] - GNU Scientific Library&lt;br /&gt;
** [http://subversion.tigris.org/ Subversion] - Suggested version control tool (see the page on the IRIDIA [[Development Server]] how to use it inside the lab)&lt;br /&gt;
** [http://www.stack.nl/~dimitri/doxygen/ Doxygen] - Suggested documentation tool for source code&lt;br /&gt;
&amp;lt;center&amp;gt;[[#Top | Back to top]]&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Generic Tutorials and Links ===&lt;br /&gt;
* [[Tutorials and links about C, R, LateX and bash (unix)]]&lt;br /&gt;
&lt;br /&gt;
=== Neural Networks ===&lt;br /&gt;
* [[Neural Network Tutorials]]&lt;br /&gt;
&lt;br /&gt;
=== &amp;lt;div id=&amp;quot;anc2_3&amp;quot;&amp;gt;Publications&amp;lt;/div&amp;gt; ===&lt;br /&gt;
&lt;br /&gt;
* [[IRIDIA Technical reports]] - Information on publishing a technical report and LaTeX package(s).&lt;br /&gt;
* [[Access to Digital Libraries]] - Which on-line papers archive we have access from IRIDIA network. &lt;br /&gt;
* [[Iridia Supplementary Information Instructions page]] - Information on HOW TO use the Iridia Supplementary Information page.&lt;br /&gt;
* [[Write Better English]] - Basic pointers on how to raise the level of english in your paper.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;[[#Top | Back to top]]&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &amp;lt;div id=&amp;quot;anc3&amp;quot;&amp;gt;Infrastructure&amp;lt;/div&amp;gt; ==&lt;br /&gt;
&lt;br /&gt;
* [[Infrastructure]] - Generalities, meetings, TODOS, etc.&lt;br /&gt;
&lt;br /&gt;
=== &amp;lt;div id=&amp;quot;anc3_1&amp;quot;&amp;gt;'''Hardware'''&amp;lt;/div&amp;gt; ===&lt;br /&gt;
* [[Workstation configuration]] - How to setup your personal workstation and laptop, printers, etc.&lt;br /&gt;
* [[Backup Server]] - How to use the backup server of IRIDIA&lt;br /&gt;
* [[Development Server]] - How to use the IRIDIA development server and how to use subversion repositories&lt;br /&gt;
* IRIDIA Cluster: See the [http://majorana.ulb.ac.be/wordpress/ Cluster Website] for usage information, tips and updates.&lt;br /&gt;
* [[Using the IRIDIA Experimental room]] - All you need to know to easily run real experiments.&lt;br /&gt;
&lt;br /&gt;
=== &amp;lt;div id=&amp;quot;anc3_2&amp;quot;&amp;gt;'''Software'''&amp;lt;/div&amp;gt; ===&lt;br /&gt;
* [[Creating your own home page]] - How to create your own home.&lt;br /&gt;
* See all [[Software HOWTOs]]&lt;br /&gt;
* Suggested software for [[Workstation_configuration#For_Mac_OS_X_users | Mac OS X]] users&lt;br /&gt;
* List of [[Available_commercial_software | commercial software]] we have in IRIDIA&lt;br /&gt;
* Howto create a [[howto_create_new_svn_repos | new svn repository ]] on the iridia server&lt;br /&gt;
&lt;br /&gt;
=== &amp;lt;div id=&amp;quot;material&amp;quot;&amp;gt;'''Diverse Material'''&amp;lt;/div&amp;gt; ===&lt;br /&gt;
* [[Logos]]&lt;br /&gt;
* [https://iridia-dev.ulb.ac.be/projects/material/svn SVN repository of graphical material] (for access see [[Development Server]])&lt;br /&gt;
* [[ProceedingsRepository| Repository of Proceedings]]&lt;br /&gt;
&amp;lt;center&amp;gt;[[#Top | Back to top]]&amp;lt;/center&amp;gt;&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=File:2011-10-06-infrastructure_meeting.pdf&amp;diff=5636</id>
		<title>File:2011-10-06-infrastructure meeting.pdf</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=File:2011-10-06-infrastructure_meeting.pdf&amp;diff=5636"/>
		<updated>2011-10-06T12:05:13Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: Protected &amp;quot;Image:2011-10-06-infrastructure meeting.pdf&amp;quot; [edit=autoconfirmed:move=autoconfirmed:read=autoconfirmed]&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Slides for first infrastructure meeting&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
	<entry>
		<id>https://iridia.ulb.ac.be/w/index.php?title=Infrastructure&amp;diff=5635</id>
		<title>Infrastructure</title>
		<link rel="alternate" type="text/html" href="https://iridia.ulb.ac.be/w/index.php?title=Infrastructure&amp;diff=5635"/>
		<updated>2011-10-06T12:04:27Z</updated>

		<summary type="html">&lt;p&gt;MLÃ³pez-IbÃ¡Ã±ez: Protected &amp;quot;Infrastructure&amp;quot; [edit=autoconfirmed:move=autoconfirmed:read=autoconfirmed]&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Infrastructure Meetings ==&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;sortable&amp;quot; border=&amp;quot;1&amp;quot; cellpadding=&amp;quot;2&amp;quot; cellspacing=&amp;quot;0&amp;quot;&lt;br /&gt;
|- align=&amp;quot;left&amp;quot;&lt;br /&gt;
!width=&amp;quot;100&amp;quot;|Date&lt;br /&gt;
!class=&amp;quot;unsortable&amp;quot;|Summary&lt;br /&gt;
|-&lt;br /&gt;
|2011-10-06&lt;br /&gt;
| [[Media:2011-10-06-infrastructure_meeting.pdf|Slides]]&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>MLÃ³pez-IbÃ¡Ã±ez</name></author>
	</entry>
</feed>