http://iridia.ulb.ac.be/w/api.php?action=feedcontributions&user=Prasanna&feedformat=atomIridiaWiki - User contributions [en]2020-10-21T16:30:32ZUser contributionsMediaWiki 1.19.20+dfsg-0+deb7u3http://iridia.ulb.ac.be/wiki/EquivalenceEquivalence2006-05-19T15:23:13Z<p>Prasanna: </p>
<hr />
<div>To anyone who wants to use the informations in this archive to apply for an equivalence of diploma in Belgium ...<br />
<br />
First : the equivalence is delivered by the CFWB (communaute francaise wallone de belgique). <br />
<br />
On their website, the sole information I was able to find is :<br />
http://www.enseignement.be/prof/espaces/sup/naric/Organigramme_equivalences_sup_juin_2005-1.xls<br />
<br />
This is the list of people in charge of communicating with you, categorized by type of diploma.<br />
<br />
If you are from computer science, you will probably interact with Philippe Polet. His email is : philippe.polet@cfwb.be<br />
<br />
You have to contact CFWB and ask a instructions for equivalence. You will receive the file INSTRUCTIONS_UNIV.doc<br />
or an updated version.<br />
<br />
The file inventaire.odt contains the list of all things you should send them back, that is :<br />
<br />
* a motivation letter (see the directory motivation for an example)<br />
* the list of all what you submit to them<br />
* a copie of an official document stating your identity (the photcopy of your ID card + passport should be ok)<br />
* ''certified'' copies of all the diplomas you received from universities<br />
* ''certified'' copies of all the mark sheets you received from universities<br />
* the original, official and detailed program of your courses. This should be given for each year, in original language. It must comprise at least a title for each course, a description and the amount of time (in hours). If the program is not in french you should also provide an official translation of the main facts (title of the courses, amount of time, year, university) in french.<br />
* a simple copie of each thesis you wrote<br />
* a copy of all the internships you made (see stages.odt for an example, if you have any official document, join a copy too). <br />
* the form page 7 present in the instructions (see formulaire_equivalence.odt). Of course the form should be filled properly. If you don't understand french, ask to a french speaking guy. If this is still not clear, don't bother asking clarifications to somebody of the cfwb, Mr Philippe Polet for instance.<br />
* a CV in french<br />
* a proof that you have paid 124 euros (the amount may change with time) to the cfwb. Informations on who to pay are provided within the instructions file. Pay attention : you should ask to your bank a transfer with proof, a simple ticket from an automata is not enough as the transaction may be cancelled after you make the request.<br />
<br />
This is most of it.<br />
<br />
Last advices :<br />
<br />
* Be patient with people from CFWB, they are sometimes a bit slow but it does not help to get angry.<br />
* The most difficult part is probably to gather certified copies of all your mark sheets, and to find back the official programs of your courses. <br />
* If you are not french speaking, translations may be costly. Try to have french friends (At least for some days...)<br />
* For the official translation, you can contact <br />
Paul Janssens, Av. Louise 146/B-1050 Brussels</div>Prasannahttp://iridia.ulb.ac.be/wiki/File:CISM.pdfFile:CISM.pdf2006-05-11T12:25:02Z<p>Prasanna: </p>
<hr />
<div></div>Prasannahttp://iridia.ulb.ac.be/wiki/Optimization_Group_MeetingsOptimization Group Meetings2006-05-11T12:23:53Z<p>Prasanna: </p>
<hr />
<div>==Purpose==<br />
<br />
The goal of the optimization weekly meeting is to facilitate and support the development and conduct of research in optimization at IRIDIA. The meeting will help you in your efforts to develop research ideas, gives feedback on your work and serves as a means for disseminating your research results.<br />
<br />
# '''Community'''. Keep everyone updated as to what other work in optimization is going on in the lab.<br />
# '''Research'''. Share research results. Discussions of general interest. Literature study on specific topics. Inspiration for new research. Reports on conference visits.<br />
# '''Admin'''. Optimization group administration. Discussion of practical problems. Guidelines for software etc. <br />
<br />
<br><br />
<br />
==Format==<br />
<br />
# Presentation & Discussion (30 - 50 mins)<br />
#* Work you have been doing<br />
#* Reading you have been doing in the context of your work<br />
#* Other reading on something you are passionate about<br />
# Optimization group administration (0 - 30 mins)<br />
<br />
<br />
Try and make your session as involving as possible for everyone:<br />
* Send the article/handout to be read beforehand.<br />
* Ask people before the meeting what aspects of your work / reading they would like to know about or discuss.<br />
* Think about implications of what you are presenting for the research direction of the lab as a whole - methodologies, technologies etc.<br />
<br><br />
<br />
==Timing & Attendance==<br />
<br />
The weekly meetings '''ALWAYS''' (yet to be finalized) take place on<br />
<br />
<center> '''Thursdays at 11.00 AM''' </center><br />
<br />
Unless:<br />
* A given Thursday is a public holiday, or<br />
* Something very important (like a Ph.D. defense) is overlapping.<br />
<br />
If either should happen the meeting is postponed to the next day.<br />
<br />
'''Please indicate on this wiki page if you are not going to be able to attend a meeting''' (no later than the Friday before). <br />
<br />
If you forget to note your absence in advance you will be severely punished and will be forced to buy a nice, big cake (yet to be finalized) for the following meeting.<br />
<br><br><br />
<br />
==Friday 28th October - Prasanna BALAPRAKASH==<br />
<br />
'''''Agenda'''''<br />
# '''Short Introduction to the optimization group weekly meeting'''<br />
# '''Presentation / Discussion'''<br />
#* Local Search under Uncertainty<br />
#* Probabilistic Traveling Salesman Problem as a case study<br />
#* Overview of the state-of-the-art local search techniques to tackle uncertainty<br />
#* Empirical estimation based local search to tackle uncertainty<br />
# '''Optimization Group Admin'''<br />
#* Structure for the weekly meeting<br />
#* Time schedule for the Optimization weekly meeting<br />
#* Wiki page administration<br />
#* Next week...<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
-NA-<br />
<br />
'''''Results'''''<br />
* Sharing Code: Writing code in a way such that others can understand (with comments where ever possible). This helps to share the code with others.<br />
* For the moment, the weekly meeting is scheduled on Thursdays at 11.00 AM. <br />
* The person, who is giving the talk, should present the field/area in which he/she considers himself/herself as an expert for about 5 mins. <br />
* We should agree on the coding language and compilers('''if possible'''). At the moment we are using Mauro's R "code" for statistical analysis and parameter tuning. This code will be made available in this wiki. <br />
* Skripts for doing useful things will be collected and also be made available in this wiki.<br />
<br />
<br />
<br />
[[Media :EmpiricalLocalSearch.pdf|Download Presentation(PDF)]]<br />
<br />
<br />
<br><br />
<br />
==Thursday 3nd November - Max MANFRIN==<br />
<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction / General interest discussion'''<br />
#* Brief introduction on Max background<br />
#* IRIDIA Cluster <br />
#** [http://iridia.ulb.ac.be/~alyhne/wiki/index.php/IRIDIA_cluster_architecture The architecture of the IRIDIA cluster]<br />
#** The Sun Grid Engine queueing system<br />
#** [http://iridia.ulb.ac.be/~alyhne/wiki/index.php/Using_the_IRIDIA_Cluster Policies for submission and execution of the jobs]<br />
# '''Presentation / Discussion'''<br />
#* Survey on Parallelization of Ant Colony Optimization<br />
#* Proposal of a parallel design for ACO algorithm to solve Rich Vehicle Routing Problems<br />
<br />
<br />
'''''Linked Presentations'''''<br />
<br />
* [http://landau.ulb.ac.be/~mmanfrin/media/pdf/MPI-overview.pdf An overview on Parallel Computing and Message Passing] Seminar at IRDIA - ULB, Brussels, Belgium, January 26, 2005<br />
<br />
<br />
'''''Reading Material'''''<br />
<br />
* There is no reading material for this weeks presentation<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br />
Christophe Philemotte<br />
<br />
<br><br><br />
<br />
==Wednesday 9th November - Jodelson A. SABINO==<br />
<br />
This talk is going to be given as a IRIDIA seminar. Therefore it will not take place on Thursday but on Wednesday. After the talk, there will be a MEETOPT discussion about the organizational matters.<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
#* Field of expertise etc.<br />
# '''Presentation / Discussion'''<br />
#* The Problem of Railroad Yards Operational Planning<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''Linked Presentations'''''<br />
<br />
'''''Abstract and Reading Material'''''<br />
<br />
* [http://iridia.ulb.ac.be/seminars/index.php?x=00070 The Problem of Railroad Yards Operational Planning]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
Christophe Philemotte <br />
<br />
<br><br><br />
<br />
==Thursday 17th November - Jodelson A. SABINO==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* A certain solution for the Switch Engine Assignment Problem<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''Linked Presentations'''''<br />
<br />
'''''Abstract and Reading Material'''''<br />
<br />
This seminar gives an overview of the algorithm presented in Jodelson's Master<br />
Degree dissertation to solve the Switch Engine Assignment Problem. This presentation <br />
start with a quick review of the problem statement (as it was presented in a previous <br />
IRIDIA seminar), definition of the concept of PDP path and the solution by the RR-COMPETants <br />
algorithm.<br />
<br />
* [http://iridia.ulb.ac.be/seminars/index.php?x=00070 The Problem of Railroad Yards Operational Planning]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br />
<br><br><br />
<br />
==Thursday 24th November - Thomas STÃTZLE==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Stochastic Local Search, introduction and engineering of algorithms<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''Linked Presentations'''''<br />
<br />
'''''Abstract and Reading Material'''''<br><br />
This presentation explaines concisely what Stochastic Local Search is and gives some thoughts on further work in this area that should lead to what can be called "Stochastic Local Search algorithms Engineering" or, short, SLS Engineering. <br><br />
<br />
[[Media :ORP3.2005.pdf|Download Presentation(PDF)]]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br />
<br><br><br />
<br />
==Wednsday 30th November - Marco MONTES DE OCA==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Particle Swarm Optimization<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''Linked Presentations'''''<br />
<br />
[[Media :Slides.pdf|Download Presentation(PDF)]]<br />
<br />
<br />
'''''Abstract and Reading Material'''''<br />
<br />
Particle Swarm Optimization (PSO for short) was first inspired by the flocking behavior of birds, although it also has roots in some theories of social adaptation.<br />
PSO is a population-based optimization technique in which each individual or "particle" represents a solution to a continuous optimization problem. Associated<br />
with each particle, there is a velocity vector that changes according to its own best past performance and that of its neighbors. In this way, particles "fly"<br />
over the search space resembling the movement of insects in a swarm.<br />
<br />
After its first publication, PSO has attracted the interest of a growing research community because it is conceptually simple, technically easy to implement, <br />
and has been successfully applied to many problems.<br />
<br />
In this meeting, a brief overview of what has been done in PSO research and possible future work will be presented.<br />
<br />
[http://www.swarmintelligence.org/tutorials.php PSO introductory tutorial]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br />
<br><br><br />
<br />
<br />
<br />
==Thursday 8th December - Andrea ROLI==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* An introduction to constraint programming (for metaheuristic-minded researchers) -- Part 1<br />
<br />
'''''Abstract and Reading Material'''''<br><br />
[http://iridia.ulb.ac.be/seminars/index.php?x=00072 Click here for more details]<br />
<br />
[[Media :Roli Talk Dec.4perpage.pdf|Download Presentation(PDF)]]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
Marco DORIGO, Thomas STÃTZLE<br />
<br />
<br><br><br />
<br />
==Friday 9th December - Andrea ROLI==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* An introduction to constraint programming (for metaheuristic-minded researchers) -- Part 2<br />
<br />
'''''Abstract and Reading Material'''''<br><br />
[http://iridia.ulb.ac.be/seminars/index.php?x=00073 Click here for more details]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
Marco DORIGO, Thomas STÃTZLE<br />
<br />
<br><br><br />
<br />
==Thursday 12th January - Tom LENAERTS==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Evolutionary Transitions in Solution Complexity<br />
<br />
'''''Abstract'''''<br><br />
Recently, Evolutionary Biology has proposed a generalised theory for the origin of complexity in biological systems. This theory, referred to as Evolutionary Transition Theory, provides a description on how complexity could have arisen out of the interaction of simple components. A well-known example is the transition from single cell to multi-cellularity. As evolution itself, this theory provides a metaphor for optimisation and learning where complex solutions are constructed through the evolutionary combination of partial ones. This talk discusses a new evolutionary algorithm based on this metaphor. We show that, in the context of constraint satisfaction problems, this metaphor provides a very useful technique to find solutions. Moreover, the results of this basic, unoptimised algorithm are close to what is observed in other highly-adjusted evolutionary techniques. As a consequence, it provides an important foundation for the further investigation of compositional algorithms in the context of optimisation<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
<br />
<br />
<br><br><br />
<br />
==Thursday 19th January - General Discussion (Optimization Library)==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Outcome of the discussion'''<br />
#*The C programming language will be selected for the implementation and development. We'll follow the C99 standard and use GCC compiler tools ([http://gcc.gnu.org/c99status.html Status of C99 features in GCC]). The standard compiler is the one provided in the most recent stable version of Debian.<br />
#**[http://www.kuro5hin.org/story/2001/2/23/194544/139 Are you Ready For C99?] <br />
#**[http://www-128.ibm.com/developerworks/linux/library/l-c99.html?ca=dgr-lnxw07UsingC99 Open source development using C99]<br />
#* We will have a look at [http://www.gnu.org/prep/standards/standards.pdf GNU coding standards] and if everyone feels it is good then they will be adopted.<br />
#** Christophe suggests the formating tool [http://mysite.wanadoo-members.co.uk/indent/beautify.html GNU Indent] to respect some GNU standards<br />
#*[http://subversion.tigris.org/ Subversion] will be adopted as the revision control system (Max will make a brief study) <br />
#*The format of result files should be standardised (Mauro, Thomas and Prasanna will come up with a format which should be discussed later).<br />
#*Common scripts have to be developed to extract required information from the results file should be developed. Mauro, Thomas, and Prasanna make an initial list of scripts to be developped.<br />
#*Mauro will have a look at COMET software libraries book and Prasanna will check about software libraries, in general, and the features they provide. <br />
#**Short term goal - sharing code to save the development time<br />
#**Long term goal - IRIDIA Optimization Library<br />
#*Christophe suggests [http://www.stack.nl/~dimitri/doxygen/ Doxygen] as documentation tools.<br />
<br><br><br />
<br />
==Thursday 26th January - Thomas STÃTZLE==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Empirical analysis of stochastic algorithms by measuring run-time distributions<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
#* Follow-up of the meeting about optimization libraries, tools etc. of the previous week<br />
<br />
<br />
'''''Linked Presentations'''''<br />
<br />
'''''Abstract and Reading Material'''''<br><br />
We start now the part of presentations / discussions on specific topics. The first topic to be discussed in a number of presentations / discussions is the '''Empirical Analysis of Algorithms, in particular SLS Algorithms'''. In this series we will discuss methods for their empirical analysis including run-time distributions, statistical analysis (hypothesis tests, ANOVA and alike methods), experimental design, tuning of algorithms, etc. We start this series by a presentation about the empirical analysis of algorithms through measuring run-time distributions. The presentation will be based on Chapter 4 of the book about ''Stochastic Local Search: Foundations and Applications'' by Holger Hoos and Thomas. The slides for the presentation are available via [http://www.sls-book.net SLS:FA] (check for the slides and figures section). The presentation will discuss only a small selection of the most important issues presented there.<br><br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
<br />
<br />
==Thursday 2nd February - Thomas STÃTZLE==<br />
<br />
'''''Agenda'''''<br />
<br />
Below is a list of topics that we will cover on empirical analysis. Since these topics in part also have to be elaborated from scratch, we will switch to the envisaged bi-weekly meeting, that is have roughly every two weeks one meeting. The topics below will be elaborated by the people participating in the seminar. This Thursday, Feb 2, we willl have a short meeting where we distribute the responsabilites of the tasks.<br />
<br />
On Thursday everybods needs to have a lists of his two main preferred tasks so that we make the decision on who takes over what part.<br />
<br />
We will also shortly discuss the state for the more practical directions.<br />
<br />
In any case, the meeting on Thursday should be finished after 10 - 15 minutes max.<br />
<br />
<br />
Topics on Empirical Analysis:<br />
<br />
- Statistical Analysis (hypothesis tests -- param, non-param, permutation; stability of estimates -- confidence intervals; various situations of things to test -- correlation, metric measures, binary tests etc.) Maybe follow some text-book (Sheshkin / Siegel Castellan)<br />
<br />
- Experimental Design (ANOVA and non-parametric analysis; planning of experiments; methodologies -- factorial designs, response surface methodology; follow some book: Montgomery / Dean, Voos etc.)<br />
<br />
- Exploratory data analysis (usage of plots to illustrate things ?); Take ideas here from published papers, maybe some book about exploratory data analysis..<br />
<br />
- Automated tuning of metaheuristics (overview of methods, issues); Overview of published papers plus new directions of work ..<br />
<br />
- Integration of experimental methodologies in the design of algorithms; still fuzzy, to be defined.<br />
<br />
<br />
'''Results'''<br />
<br />
<br />
We will read and discuss the book chapter by chapter. For each chapter, one person will be responsable to lead the discussion by a short presentation. However, it is expected that everybody present in the meeting has already read through the material; in fact, reading the material is important to make the meetings effective.<br />
<br />
The current schedule for the meetings is as follows.<br />
<br />
- Feb 16, Marco M.: Empirical Research + Exploratory Data Analysis<br />
<br />
- March 23, Anders: Basic Issues in Experiment Design<br />
<br />
- March 29, Max: Hypothesis Testing and Estimation<br />
<br />
- April 20, Christophe: Computer-Intensive Statistical Methods<br />
<br />
- May 4, Shervin: Performance Assessment<br />
<br />
- May 18, Prasanna: Explaining Performance: Interactions and Dependencies<br />
<br />
- June 1, Roderich: Modeling<br />
<br />
- June 15, Alexandre: Tactics for Generalization<br />
<br />
<br />
<br />
==Thursday 16th Feb - Marco M==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Empirical Research + Exploratory Data Analysis<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
'''''Resources'''''<br />
<br><br />
* [[Media :ShouldComputerScientistsExperimentMore.pdf|Should Computer Scientists Experiment More? ]] by Walter F. Tichy<br />
* [http://addictedtor.free.fr/graphiques/allgraph.php R Graph Gallery] A gallery of graphs that can be created using the R Graphic Engine.<br />
<br />
'''''Slides'''''<br />
<br><br />
* [[Media :SlidesEDA.pdf| Empirical research & exploratory data analysis ]]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
Rodi (I feel really very sorry for this, but its for my health)<br />
<br><br><br />
<br />
==Thursday 20th April - Anders ==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Basic Issues in Experiment Design<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
'''''Slides'''''<br />
<br><br />
* [[Media :SlidesBED.pdf| Basic Issues in Experiment Design]]<br />
<br />
==Thursday 27th April - Max Manfrin==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Hypothesis Testing and Estimation (1st part)<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''Resources'''''<br />
<br><br />
* [http://www.ruf.rice.edu/~lane/stat_sim/sampling_dist/index.html Sampling distribution demo] A java applet to test sampling distribution of the mean, standard deviation and variance.<br />
<br />
<br />
'''''Slides'''''<br />
<br><br />
* [[Media :Chapter4-part1.pdf| Hypothesis Testing and Estimation (1st part) ]]<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
==Thursday 4th May - Max Manfrin==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Hypothesis Testing and Estimation (2nd part)<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
<br />
'''''Resources'''''<br />
<br><br />
* [http://www.math.csusb.edu/faculty/stanton/m262/confidence_means/confidence_means.html Confidence Intervals for Means] A java applet to demo the confidence intervals for means.<br />
* [http://www.amstat.org/publications/jse/v11n3/anderson-cook.html Making the Concepts of Power and Sample Size Relevant and Accessible to Students in Introductory Statistics Courses using Applets] Journal of Statistics Education<br />
<br />
'''''Slides'''''<br />
<br><br />
* [[Media :Chapter4-part2.pdf| Hypothesis Testing and Estimation (2nd part) ]]<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
Marco Montes de Oca <br />
<br><br><br />
<br />
==Thursday 11th May - Prasanna==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Computer-Intensive Statistical Methods<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
'''''Slides'''''<br />
<br><br />
* [[Media :CISM.pdf| Computer-Intensive Statistical Methods ]]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
==Thursday 18th May - Shervin==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Performance Assessment<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
==Thursday 1st June - Christophe==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Explaining Performance: Interactions and Dependencies<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
==Thursday 15th June -Roderich==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Modeling<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
==Thursday 29th June -Alexandre==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Tactics for Generalization<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br></div>Prasannahttp://iridia.ulb.ac.be/wiki/File:SlidesBED.pdfFile:SlidesBED.pdf2006-05-02T15:48:07Z<p>Prasanna: </p>
<hr />
<div></div>Prasannahttp://iridia.ulb.ac.be/wiki/Optimization_Group_MeetingsOptimization Group Meetings2006-05-02T15:47:12Z<p>Prasanna: </p>
<hr />
<div>==Purpose==<br />
<br />
The goal of the optimization weekly meeting is to facilitate and support the development and conduct of research in optimization at IRIDIA. The meeting will help you in your efforts to develop research ideas, gives feedback on your work and serves as a means for disseminating your research results.<br />
<br />
# '''Community'''. Keep everyone updated as to what other work in optimization is going on in the lab.<br />
# '''Research'''. Share research results. Discussions of general interest. Literature study on specific topics. Inspiration for new research. Reports on conference visits.<br />
# '''Admin'''. Optimization group administration. Discussion of practical problems. Guidelines for software etc. <br />
<br />
<br><br />
<br />
==Format==<br />
<br />
# Presentation & Discussion (30 - 50 mins)<br />
#* Work you have been doing<br />
#* Reading you have been doing in the context of your work<br />
#* Other reading on something you are passionate about<br />
# Optimization group administration (0 - 30 mins)<br />
<br />
<br />
Try and make your session as involving as possible for everyone:<br />
* Send the article/handout to be read beforehand.<br />
* Ask people before the meeting what aspects of your work / reading they would like to know about or discuss.<br />
* Think about implications of what you are presenting for the research direction of the lab as a whole - methodologies, technologies etc.<br />
<br><br />
<br />
==Timing & Attendance==<br />
<br />
The weekly meetings '''ALWAYS''' (yet to be finalized) take place on<br />
<br />
<center> '''Thursdays at 11.00 AM''' </center><br />
<br />
Unless:<br />
* A given Thursday is a public holiday, or<br />
* Something very important (like a Ph.D. defense) is overlapping.<br />
<br />
If either should happen the meeting is postponed to the next day.<br />
<br />
'''Please indicate on this wiki page if you are not going to be able to attend a meeting''' (no later than the Friday before). <br />
<br />
If you forget to note your absence in advance you will be severely punished and will be forced to buy a nice, big cake (yet to be finalized) for the following meeting.<br />
<br><br><br />
<br />
==Friday 28th October - Prasanna BALAPRAKASH==<br />
<br />
'''''Agenda'''''<br />
# '''Short Introduction to the optimization group weekly meeting'''<br />
# '''Presentation / Discussion'''<br />
#* Local Search under Uncertainty<br />
#* Probabilistic Traveling Salesman Problem as a case study<br />
#* Overview of the state-of-the-art local search techniques to tackle uncertainty<br />
#* Empirical estimation based local search to tackle uncertainty<br />
# '''Optimization Group Admin'''<br />
#* Structure for the weekly meeting<br />
#* Time schedule for the Optimization weekly meeting<br />
#* Wiki page administration<br />
#* Next week...<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
-NA-<br />
<br />
'''''Results'''''<br />
* Sharing Code: Writing code in a way such that others can understand (with comments where ever possible). This helps to share the code with others.<br />
* For the moment, the weekly meeting is scheduled on Thursdays at 11.00 AM. <br />
* The person, who is giving the talk, should present the field/area in which he/she considers himself/herself as an expert for about 5 mins. <br />
* We should agree on the coding language and compilers('''if possible'''). At the moment we are using Mauro's R "code" for statistical analysis and parameter tuning. This code will be made available in this wiki. <br />
* Skripts for doing useful things will be collected and also be made available in this wiki.<br />
<br />
<br />
<br />
[[Media :EmpiricalLocalSearch.pdf|Download Presentation(PDF)]]<br />
<br />
<br />
<br><br />
<br />
==Thursday 3nd November - Max MANFRIN==<br />
<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction / General interest discussion'''<br />
#* Brief introduction on Max background<br />
#* IRIDIA Cluster <br />
#** [http://iridia.ulb.ac.be/~alyhne/wiki/index.php/IRIDIA_cluster_architecture The architecture of the IRIDIA cluster]<br />
#** The Sun Grid Engine queueing system<br />
#** [http://iridia.ulb.ac.be/~alyhne/wiki/index.php/Using_the_IRIDIA_Cluster Policies for submission and execution of the jobs]<br />
# '''Presentation / Discussion'''<br />
#* Survey on Parallelization of Ant Colony Optimization<br />
#* Proposal of a parallel design for ACO algorithm to solve Rich Vehicle Routing Problems<br />
<br />
<br />
'''''Linked Presentations'''''<br />
<br />
* [http://landau.ulb.ac.be/~mmanfrin/media/pdf/MPI-overview.pdf An overview on Parallel Computing and Message Passing] Seminar at IRDIA - ULB, Brussels, Belgium, January 26, 2005<br />
<br />
<br />
'''''Reading Material'''''<br />
<br />
* There is no reading material for this weeks presentation<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br />
Christophe Philemotte<br />
<br />
<br><br><br />
<br />
==Wednesday 9th November - Jodelson A. SABINO==<br />
<br />
This talk is going to be given as a IRIDIA seminar. Therefore it will not take place on Thursday but on Wednesday. After the talk, there will be a MEETOPT discussion about the organizational matters.<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
#* Field of expertise etc.<br />
# '''Presentation / Discussion'''<br />
#* The Problem of Railroad Yards Operational Planning<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''Linked Presentations'''''<br />
<br />
'''''Abstract and Reading Material'''''<br />
<br />
* [http://iridia.ulb.ac.be/seminars/index.php?x=00070 The Problem of Railroad Yards Operational Planning]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
Christophe Philemotte <br />
<br />
<br><br><br />
<br />
==Thursday 17th November - Jodelson A. SABINO==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* A certain solution for the Switch Engine Assignment Problem<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''Linked Presentations'''''<br />
<br />
'''''Abstract and Reading Material'''''<br />
<br />
This seminar gives an overview of the algorithm presented in Jodelson's Master<br />
Degree dissertation to solve the Switch Engine Assignment Problem. This presentation <br />
start with a quick review of the problem statement (as it was presented in a previous <br />
IRIDIA seminar), definition of the concept of PDP path and the solution by the RR-COMPETants <br />
algorithm.<br />
<br />
* [http://iridia.ulb.ac.be/seminars/index.php?x=00070 The Problem of Railroad Yards Operational Planning]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br />
<br><br><br />
<br />
==Thursday 24th November - Thomas STÃTZLE==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Stochastic Local Search, introduction and engineering of algorithms<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''Linked Presentations'''''<br />
<br />
'''''Abstract and Reading Material'''''<br><br />
This presentation explaines concisely what Stochastic Local Search is and gives some thoughts on further work in this area that should lead to what can be called "Stochastic Local Search algorithms Engineering" or, short, SLS Engineering. <br><br />
<br />
[[Media :ORP3.2005.pdf|Download Presentation(PDF)]]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br />
<br><br><br />
<br />
==Wednsday 30th November - Marco MONTES DE OCA==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Particle Swarm Optimization<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''Linked Presentations'''''<br />
<br />
[[Media :Slides.pdf|Download Presentation(PDF)]]<br />
<br />
<br />
'''''Abstract and Reading Material'''''<br />
<br />
Particle Swarm Optimization (PSO for short) was first inspired by the flocking behavior of birds, although it also has roots in some theories of social adaptation.<br />
PSO is a population-based optimization technique in which each individual or "particle" represents a solution to a continuous optimization problem. Associated<br />
with each particle, there is a velocity vector that changes according to its own best past performance and that of its neighbors. In this way, particles "fly"<br />
over the search space resembling the movement of insects in a swarm.<br />
<br />
After its first publication, PSO has attracted the interest of a growing research community because it is conceptually simple, technically easy to implement, <br />
and has been successfully applied to many problems.<br />
<br />
In this meeting, a brief overview of what has been done in PSO research and possible future work will be presented.<br />
<br />
[http://www.swarmintelligence.org/tutorials.php PSO introductory tutorial]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br />
<br><br><br />
<br />
<br />
<br />
==Thursday 8th December - Andrea ROLI==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* An introduction to constraint programming (for metaheuristic-minded researchers) -- Part 1<br />
<br />
'''''Abstract and Reading Material'''''<br><br />
[http://iridia.ulb.ac.be/seminars/index.php?x=00072 Click here for more details]<br />
<br />
[[Media :Roli Talk Dec.4perpage.pdf|Download Presentation(PDF)]]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
Marco DORIGO, Thomas STÃTZLE<br />
<br />
<br><br><br />
<br />
==Friday 9th December - Andrea ROLI==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* An introduction to constraint programming (for metaheuristic-minded researchers) -- Part 2<br />
<br />
'''''Abstract and Reading Material'''''<br><br />
[http://iridia.ulb.ac.be/seminars/index.php?x=00073 Click here for more details]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
Marco DORIGO, Thomas STÃTZLE<br />
<br />
<br><br><br />
<br />
==Thursday 12th January - Tom LENAERTS==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Evolutionary Transitions in Solution Complexity<br />
<br />
'''''Abstract'''''<br><br />
Recently, Evolutionary Biology has proposed a generalised theory for the origin of complexity in biological systems. This theory, referred to as Evolutionary Transition Theory, provides a description on how complexity could have arisen out of the interaction of simple components. A well-known example is the transition from single cell to multi-cellularity. As evolution itself, this theory provides a metaphor for optimisation and learning where complex solutions are constructed through the evolutionary combination of partial ones. This talk discusses a new evolutionary algorithm based on this metaphor. We show that, in the context of constraint satisfaction problems, this metaphor provides a very useful technique to find solutions. Moreover, the results of this basic, unoptimised algorithm are close to what is observed in other highly-adjusted evolutionary techniques. As a consequence, it provides an important foundation for the further investigation of compositional algorithms in the context of optimisation<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
<br />
<br />
<br><br><br />
<br />
==Thursday 19th January - General Discussion (Optimization Library)==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Outcome of the discussion'''<br />
#*The C programming language will be selected for the implementation and development. We'll follow the C99 standard and use GCC compiler tools ([http://gcc.gnu.org/c99status.html Status of C99 features in GCC]). The standard compiler is the one provided in the most recent stable version of Debian.<br />
#**[http://www.kuro5hin.org/story/2001/2/23/194544/139 Are you Ready For C99?] <br />
#**[http://www-128.ibm.com/developerworks/linux/library/l-c99.html?ca=dgr-lnxw07UsingC99 Open source development using C99]<br />
#* We will have a look at [http://www.gnu.org/prep/standards/standards.pdf GNU coding standards] and if everyone feels it is good then they will be adopted.<br />
#** Christophe suggests the formating tool [http://mysite.wanadoo-members.co.uk/indent/beautify.html GNU Indent] to respect some GNU standards<br />
#*[http://subversion.tigris.org/ Subversion] will be adopted as the revision control system (Max will make a brief study) <br />
#*The format of result files should be standardised (Mauro, Thomas and Prasanna will come up with a format which should be discussed later).<br />
#*Common scripts have to be developed to extract required information from the results file should be developed. Mauro, Thomas, and Prasanna make an initial list of scripts to be developped.<br />
#*Mauro will have a look at COMET software libraries book and Prasanna will check about software libraries, in general, and the features they provide. <br />
#**Short term goal - sharing code to save the development time<br />
#**Long term goal - IRIDIA Optimization Library<br />
#*Christophe suggests [http://www.stack.nl/~dimitri/doxygen/ Doxygen] as documentation tools.<br />
<br><br><br />
<br />
==Thursday 26th January - Thomas STÃTZLE==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Empirical analysis of stochastic algorithms by measuring run-time distributions<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
#* Follow-up of the meeting about optimization libraries, tools etc. of the previous week<br />
<br />
<br />
'''''Linked Presentations'''''<br />
<br />
'''''Abstract and Reading Material'''''<br><br />
We start now the part of presentations / discussions on specific topics. The first topic to be discussed in a number of presentations / discussions is the '''Empirical Analysis of Algorithms, in particular SLS Algorithms'''. In this series we will discuss methods for their empirical analysis including run-time distributions, statistical analysis (hypothesis tests, ANOVA and alike methods), experimental design, tuning of algorithms, etc. We start this series by a presentation about the empirical analysis of algorithms through measuring run-time distributions. The presentation will be based on Chapter 4 of the book about ''Stochastic Local Search: Foundations and Applications'' by Holger Hoos and Thomas. The slides for the presentation are available via [http://www.sls-book.net SLS:FA] (check for the slides and figures section). The presentation will discuss only a small selection of the most important issues presented there.<br><br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
<br />
<br />
==Thursday 2nd February - Thomas STÃTZLE==<br />
<br />
'''''Agenda'''''<br />
<br />
Below is a list of topics that we will cover on empirical analysis. Since these topics in part also have to be elaborated from scratch, we will switch to the envisaged bi-weekly meeting, that is have roughly every two weeks one meeting. The topics below will be elaborated by the people participating in the seminar. This Thursday, Feb 2, we willl have a short meeting where we distribute the responsabilites of the tasks.<br />
<br />
On Thursday everybods needs to have a lists of his two main preferred tasks so that we make the decision on who takes over what part.<br />
<br />
We will also shortly discuss the state for the more practical directions.<br />
<br />
In any case, the meeting on Thursday should be finished after 10 - 15 minutes max.<br />
<br />
<br />
Topics on Empirical Analysis:<br />
<br />
- Statistical Analysis (hypothesis tests -- param, non-param, permutation; stability of estimates -- confidence intervals; various situations of things to test -- correlation, metric measures, binary tests etc.) Maybe follow some text-book (Sheshkin / Siegel Castellan)<br />
<br />
- Experimental Design (ANOVA and non-parametric analysis; planning of experiments; methodologies -- factorial designs, response surface methodology; follow some book: Montgomery / Dean, Voos etc.)<br />
<br />
- Exploratory data analysis (usage of plots to illustrate things ?); Take ideas here from published papers, maybe some book about exploratory data analysis..<br />
<br />
- Automated tuning of metaheuristics (overview of methods, issues); Overview of published papers plus new directions of work ..<br />
<br />
- Integration of experimental methodologies in the design of algorithms; still fuzzy, to be defined.<br />
<br />
<br />
'''Results'''<br />
<br />
<br />
We will read and discuss the book chapter by chapter. For each chapter, one person will be responsable to lead the discussion by a short presentation. However, it is expected that everybody present in the meeting has already read through the material; in fact, reading the material is important to make the meetings effective.<br />
<br />
The current schedule for the meetings is as follows.<br />
<br />
- Feb 16, Marco M.: Empirical Research + Exploratory Data Analysis<br />
<br />
- March 23, Anders: Basic Issues in Experiment Design<br />
<br />
- March 29, Max: Hypothesis Testing and Estimation<br />
<br />
- April 20, Christophe: Computer-Intensive Statistical Methods<br />
<br />
- May 4, Shervin: Performance Assessment<br />
<br />
- May 18, Prasanna: Explaining Performance: Interactions and Dependencies<br />
<br />
- June 1, Roderich: Modeling<br />
<br />
- June 15, Alexandre: Tactics for Generalization<br />
<br />
<br />
<br />
==Thursday 16th Feb - Marco M==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Empirical Research + Exploratory Data Analysis<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
'''''Resources'''''<br />
<br><br />
* [[Media :ShouldComputerScientistsExperimentMore.pdf|Should Computer Scientists Experiment More? ]] by Walter F. Tichy<br />
* [http://addictedtor.free.fr/graphiques/allgraph.php R Graph Gallery] A gallery of graphs that can be created using the R Graphic Engine.<br />
<br />
'''''Slides'''''<br />
<br><br />
* [[Media :SlidesEDA.pdf| Empirical research & exploratory data analysis ]]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
Rodi (I feel really very sorry for this, but its for my health)<br />
<br><br><br />
<br />
==Thursday 20th April - Anders ==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Basic Issues in Experiment Design<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
'''''Slides'''''<br />
<br><br />
* [[Media :SlidesBED.pdf| Basic Issues in Experiment Design]]<br />
<br />
==Thursday 27th April - Max Manfrin==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Hypothesis Testing and Estimation (1st part)<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''Resources'''''<br />
<br><br />
* [http://www.ruf.rice.edu/~lane/stat_sim/sampling_dist/index.html Sampling distribution demo] A java applet to test sampling distribution of the mean, standard deviation and variance.<br />
<br />
<br />
'''''Slides'''''<br />
<br><br />
* [[Media :Chapter4-part1.pdf| Hypothesis Testing and Estimation (1st part) ]]<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
==Thursday 4th May - Max Manfrin==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Hypothesis Testing and Estimation (2nd part)<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
==Thursday 11th May - Christophe==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Computer-Intensive Statistical Methods<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
==Thursday 18th May - Shervin==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Performance Assessment<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
==Thursday 1st June -Prasanna==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Explaining Performance: Interactions and Dependencies<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
==Thursday 15th June -Roderich==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Modeling<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
==Thursday 29th June -Alexandre==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Tactics for Generalization<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br></div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T14:55:31Z<p>Prasanna: /* General responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T14:43:41Z<p>Prasanna: /* General responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T14:42:41Z<p>Prasanna: /* General responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T14:39:07Z<p>Prasanna: /* General responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T14:38:17Z<p>Prasanna: </p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T14:36:53Z<p>Prasanna: </p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T13:24:40Z<p>Prasanna: /* Optimization group responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T13:24:01Z<p>Prasanna: /* General responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T13:23:15Z<p>Prasanna: /* Robotics group responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T13:22:12Z<p>Prasanna: /* Robotics group responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T13:21:41Z<p>Prasanna: /* Robotics group responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T13:20:25Z<p>Prasanna: /* Robotics group responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T13:19:28Z<p>Prasanna: /* Robotics group responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T13:18:55Z<p>Prasanna: /* Robotics group responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T13:18:27Z<p>Prasanna: /* Optimization group responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T13:17:23Z<p>Prasanna: /* Optimization group responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T13:15:46Z<p>Prasanna: /* Robotics group responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T13:15:12Z<p>Prasanna: /* Robotics group responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T13:11:18Z<p>Prasanna: /* General responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T13:09:56Z<p>Prasanna: /* General responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T13:07:34Z<p>Prasanna: /* General responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T13:06:09Z<p>Prasanna: /* General responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T13:03:05Z<p>Prasanna: /* General responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T12:57:34Z<p>Prasanna: </p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T12:56:28Z<p>Prasanna: </p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-05-02T12:55:00Z<p>Prasanna: </p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-04-28T13:11:50Z<p>Prasanna: /* General responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-04-28T13:11:28Z<p>Prasanna: /* Optimization group responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-04-28T13:01:23Z<p>Prasanna: /* General responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-04-28T13:00:31Z<p>Prasanna: /* Optimization group responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-04-28T13:00:17Z<p>Prasanna: /* Optimization group responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-04-28T12:59:15Z<p>Prasanna: /* General responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-04-28T12:58:23Z<p>Prasanna: /* Optimization group responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-04-28T12:58:00Z<p>Prasanna: /* General responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Lab_responsibilitiesLab responsibilities2006-04-28T12:57:37Z<p>Prasanna: /* General responsibilities */</p>
<hr />
<div>'''Warning:''' "Lab responsibilities" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Plan_Prasanna_BalaprakashPlan Prasanna Balaprakash2006-02-21T14:41:58Z<p>Prasanna: /* Weekly Meeting */</p>
<hr />
<div>'''Warning:''' "Plan Prasanna Balaprakash" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Plan_Prasanna_BalaprakashPlan Prasanna Balaprakash2006-02-21T14:41:32Z<p>Prasanna: /* Things to do */</p>
<hr />
<div>'''Warning:''' "Plan Prasanna Balaprakash" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Plan_Prasanna_BalaprakashPlan Prasanna Balaprakash2006-02-15T16:45:06Z<p>Prasanna: /* Plan (future work) */</p>
<hr />
<div>'''Warning:''' "Plan Prasanna Balaprakash" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Plan_Prasanna_BalaprakashPlan Prasanna Balaprakash2006-02-15T16:44:41Z<p>Prasanna: /* Plan (future work) */</p>
<hr />
<div>'''Warning:''' "Plan Prasanna Balaprakash" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Plan_Prasanna_BalaprakashPlan Prasanna Balaprakash2006-02-15T16:42:51Z<p>Prasanna: /* Plan (future work) */</p>
<hr />
<div>'''Warning:''' "Plan Prasanna Balaprakash" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Plan_Prasanna_BalaprakashPlan Prasanna Balaprakash2006-02-15T16:42:28Z<p>Prasanna: /* Plan (future work) */</p>
<hr />
<div>'''Warning:''' "Plan Prasanna Balaprakash" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Plan_Prasanna_BalaprakashPlan Prasanna Balaprakash2006-02-15T16:41:33Z<p>Prasanna: /* Plan (future work) */</p>
<hr />
<div>'''Warning:''' "Plan Prasanna Balaprakash" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Plan_Prasanna_BalaprakashPlan Prasanna Balaprakash2006-02-15T16:39:37Z<p>Prasanna: /* Plan (future work) */</p>
<hr />
<div>'''Warning:''' "Plan Prasanna Balaprakash" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Plan_Prasanna_BalaprakashPlan Prasanna Balaprakash2006-02-15T16:21:56Z<p>Prasanna: /* Plan (future work) */</p>
<hr />
<div>'''Warning:''' "Plan Prasanna Balaprakash" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Plan_Prasanna_BalaprakashPlan Prasanna Balaprakash2006-02-15T16:06:59Z<p>Prasanna: /* Plan (future work) */</p>
<hr />
<div>'''Warning:''' "Plan Prasanna Balaprakash" is referred to here, but you do not have sufficient permissions to access it.</div>Prasannahttp://iridia.ulb.ac.be/wiki/Optimization_Group_MeetingsOptimization Group Meetings2006-02-13T07:57:41Z<p>Prasanna: /* Thursday 29th March - Max Manfrin */</p>
<hr />
<div>==Purpose==<br />
<br />
The goal of the optimization weekly meeting is to facilitate and support the development and conduct of research in optimization at IRIDIA. The meeting will help you in your efforts to develop research ideas, gives feedback on your work and serves as a means for disseminating your research results.<br />
<br />
# '''Community'''. Keep everyone updated as to what other work in optimization is going on in the lab.<br />
# '''Research'''. Share research results. Discussions of general interest. Literature study on specific topics. Inspiration for new research. Reports on conference visits.<br />
# '''Admin'''. Optimization group administration. Discussion of practical problems. Guidelines for software etc. <br />
<br />
<br><br />
<br />
==Format==<br />
<br />
# Presentation & Discussion (30 - 50 mins)<br />
#* Work you have been doing<br />
#* Reading you have been doing in the context of your work<br />
#* Other reading on something you are passionate about<br />
# Optimization group administration (0 - 30 mins)<br />
<br />
<br />
Try and make your session as involving as possible for everyone:<br />
* Send the article/handout to be read beforehand.<br />
* Ask people before the meeting what aspects of your work / reading they would like to know about or discuss.<br />
* Think about implications of what you are presenting for the research direction of the lab as a whole - methodologies, technologies etc.<br />
<br><br />
<br />
==Timing & Attendance==<br />
<br />
The weekly meetings '''ALWAYS''' (yet to be finalized) take place on<br />
<br />
<center> '''Thursdays at 11.00 AM''' </center><br />
<br />
Unless:<br />
* A given Thursday is a public holiday, or<br />
* Something very important (like a Ph.D. defense) is overlapping.<br />
<br />
If either should happen the meeting is postponed to the next day.<br />
<br />
'''Please indicate on this wiki page if you are not going to be able to attend a meeting''' (no later than the Friday before). <br />
<br />
If you forget to note your absence in advance you will be severely punished and will be forced to buy a nice, big cake (yet to be finalized) for the following meeting.<br />
<br><br><br />
<br />
==Friday 28th October - Prasanna BALAPRAKASH==<br />
<br />
'''''Agenda'''''<br />
# '''Short Introduction to the optimization group weekly meeting'''<br />
# '''Presentation / Discussion'''<br />
#* Local Search under Uncertainty<br />
#* Probabilistic Traveling Salesman Problem as a case study<br />
#* Overview of the state-of-the-art local search techniques to tackle uncertainty<br />
#* Empirical estimation based local search to tackle uncertainty<br />
# '''Optimization Group Admin'''<br />
#* Structure for the weekly meeting<br />
#* Time schedule for the Optimization weekly meeting<br />
#* Wiki page administration<br />
#* Next week...<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
-NA-<br />
<br />
'''''Results'''''<br />
* Sharing Code: Writing code in a way such that others can understand (with comments where ever possible). This helps to share the code with others.<br />
* For the moment, the weekly meeting is scheduled on Thursdays at 11.00 AM. <br />
* The person, who is giving the talk, should present the field/area in which he/she considers himself/herself as an expert for about 5 mins. <br />
* We should agree on the coding language and compilers('''if possible'''). At the moment we are using Mauro's R "code" for statistical analysis and parameter tuning. This code will be made available in this wiki. <br />
* Skripts for doing useful things will be collected and also be made available in this wiki.<br />
<br />
<br />
<br />
[[Media :EmpiricalLocalSearch.pdf|Download Presentation(PDF)]]<br />
<br />
<br />
<br><br />
<br />
==Thursday 3nd November - Max MANFRIN==<br />
<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction / General interest discussion'''<br />
#* Brief introduction on Max background<br />
#* IRIDIA Cluster <br />
#** [http://iridia.ulb.ac.be/~alyhne/wiki/index.php/IRIDIA_cluster_architecture The architecture of the IRIDIA cluster]<br />
#** The Sun Grid Engine queueing system<br />
#** [http://iridia.ulb.ac.be/~alyhne/wiki/index.php/Using_the_IRIDIA_Cluster Policies for submission and execution of the jobs]<br />
# '''Presentation / Discussion'''<br />
#* Survey on Parallelization of Ant Colony Optimization<br />
#* Proposal of a parallel design for ACO algorithm to solve Rich Vehicle Routing Problems<br />
<br />
<br />
'''''Linked Presentations'''''<br />
<br />
* [http://landau.ulb.ac.be/~mmanfrin/media/pdf/MPI-overview.pdf An overview on Parallel Computing and Message Passing] Seminar at IRDIA - ULB, Brussels, Belgium, January 26, 2005<br />
<br />
<br />
'''''Reading Material'''''<br />
<br />
* There is no reading material for this weeks presentation<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br />
Christophe Philemotte<br />
<br />
<br><br><br />
<br />
==Wednesday 9th November - Jodelson A. SABINO==<br />
<br />
This talk is going to be given as a IRIDIA seminar. Therefore it will not take place on Thursday but on Wednesday. After the talk, there will be a MEETOPT discussion about the organizational matters.<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
#* Field of expertise etc.<br />
# '''Presentation / Discussion'''<br />
#* The Problem of Railroad Yards Operational Planning<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''Linked Presentations'''''<br />
<br />
'''''Abstract and Reading Material'''''<br />
<br />
* [http://iridia.ulb.ac.be/seminars/index.php?x=00070 The Problem of Railroad Yards Operational Planning]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
Christophe Philemotte <br />
<br />
<br><br><br />
<br />
==Thursday 17th November - Jodelson A. SABINO==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* A certain solution for the Switch Engine Assignment Problem<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''Linked Presentations'''''<br />
<br />
'''''Abstract and Reading Material'''''<br />
<br />
This seminar gives an overview of the algorithm presented in Jodelson's Master<br />
Degree dissertation to solve the Switch Engine Assignment Problem. This presentation <br />
start with a quick review of the problem statement (as it was presented in a previous <br />
IRIDIA seminar), definition of the concept of PDP path and the solution by the RR-COMPETants <br />
algorithm.<br />
<br />
* [http://iridia.ulb.ac.be/seminars/index.php?x=00070 The Problem of Railroad Yards Operational Planning]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br />
<br><br><br />
<br />
==Thursday 24th November - Thomas STÃTZLE==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Stochastic Local Search, introduction and engineering of algorithms<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''Linked Presentations'''''<br />
<br />
'''''Abstract and Reading Material'''''<br><br />
This presentation explaines concisely what Stochastic Local Search is and gives some thoughts on further work in this area that should lead to what can be called "Stochastic Local Search algorithms Engineering" or, short, SLS Engineering. <br><br />
<br />
[[Media :ORP3.2005.pdf|Download Presentation(PDF)]]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br />
<br><br><br />
<br />
==Wednsday 30th November - Marco MONTES DE OCA==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Particle Swarm Optimization<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''Linked Presentations'''''<br />
<br />
[[Media :Slides.pdf|Download Presentation(PDF)]]<br />
<br />
<br />
'''''Abstract and Reading Material'''''<br />
<br />
Particle Swarm Optimization (PSO for short) was first inspired by the flocking behavior of birds, although it also has roots in some theories of social adaptation.<br />
PSO is a population-based optimization technique in which each individual or "particle" represents a solution to a continuous optimization problem. Associated<br />
with each particle, there is a velocity vector that changes according to its own best past performance and that of its neighbors. In this way, particles "fly"<br />
over the search space resembling the movement of insects in a swarm.<br />
<br />
After its first publication, PSO has attracted the interest of a growing research community because it is conceptually simple, technically easy to implement, <br />
and has been successfully applied to many problems.<br />
<br />
In this meeting, a brief overview of what has been done in PSO research and possible future work will be presented.<br />
<br />
[http://www.swarmintelligence.org/tutorials.php PSO introductory tutorial]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br />
<br><br><br />
<br />
<br />
<br />
==Thursday 8th December - Andrea ROLI==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* An introduction to constraint programming (for metaheuristic-minded researchers) -- Part 1<br />
<br />
'''''Abstract and Reading Material'''''<br><br />
[http://iridia.ulb.ac.be/seminars/index.php?x=00072 Click here for more details]<br />
<br />
[[Media :Roli Talk Dec.4perpage.pdf|Download Presentation(PDF)]]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
Marco DORIGO, Thomas STÃTZLE<br />
<br />
<br><br><br />
<br />
==Friday 9th December - Andrea ROLI==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* An introduction to constraint programming (for metaheuristic-minded researchers) -- Part 2<br />
<br />
'''''Abstract and Reading Material'''''<br><br />
[http://iridia.ulb.ac.be/seminars/index.php?x=00073 Click here for more details]<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
Marco DORIGO, Thomas STÃTZLE<br />
<br />
<br><br><br />
<br />
==Thursday 12th January - Tom LENAERTS==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Evolutionary Transitions in Solution Complexity<br />
<br />
'''''Abstract'''''<br><br />
Recently, Evolutionary Biology has proposed a generalised theory for the origin of complexity in biological systems. This theory, referred to as Evolutionary Transition Theory, provides a description on how complexity could have arisen out of the interaction of simple components. A well-known example is the transition from single cell to multi-cellularity. As evolution itself, this theory provides a metaphor for optimisation and learning where complex solutions are constructed through the evolutionary combination of partial ones. This talk discusses a new evolutionary algorithm based on this metaphor. We show that, in the context of constraint satisfaction problems, this metaphor provides a very useful technique to find solutions. Moreover, the results of this basic, unoptimised algorithm are close to what is observed in other highly-adjusted evolutionary techniques. As a consequence, it provides an important foundation for the further investigation of compositional algorithms in the context of optimisation<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
<br />
<br />
<br><br><br />
<br />
==Thursday 19th January - General Discussion (Optimization Library)==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Outcome of the discussion'''<br />
#*The C programming language will be selected for the implementation and development. We'll follow the C99 standard and use GCC compiler tools ([http://gcc.gnu.org/c99status.html Status of C99 features in GCC]). The standard compiler is the one provided in the most recent stable version of Debian.<br />
#**[http://www.kuro5hin.org/story/2001/2/23/194544/139 Are you Ready For C99?] <br />
#**[http://www-128.ibm.com/developerworks/linux/library/l-c99.html?ca=dgr-lnxw07UsingC99 Open source development using C99]<br />
#* We will have a look at [http://www.gnu.org/prep/standards/standards.pdf GNU coding standards] and if everyone feels it is good then they will be adopted.<br />
#** Christophe suggests the formating tool [http://mysite.wanadoo-members.co.uk/indent/beautify.html GNU Indent] to respect some GNU standards<br />
#*[http://subversion.tigris.org/ Subversion] will be adopted as the revision control system (Max will make a brief study) <br />
#*The format of result files should be standardised (Mauro, Thomas and Prasanna will come up with a format which should be discussed later).<br />
#*Common scripts have to be developed to extract required information from the results file should be developed. Mauro, Thomas, and Prasanna make an initial list of scripts to be developped.<br />
#*Mauro will have a look at COMET software libraries book and Prasanna will check about software libraries, in general, and the features they provide. <br />
#**Short term goal - sharing code to save the development time<br />
#**Long term goal - IRIDIA Optimization Library<br />
#*Christophe suggests [http://www.stack.nl/~dimitri/doxygen/ Doxygen] as documentation tools.<br />
<br><br><br />
<br />
==Thursday 26th January - Thomas STÃTZLE==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Empirical analysis of stochastic algorithms by measuring run-time distributions<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
#* Follow-up of the meeting about optimization libraries, tools etc. of the previous week<br />
<br />
<br />
'''''Linked Presentations'''''<br />
<br />
'''''Abstract and Reading Material'''''<br><br />
We start now the part of presentations / discussions on specific topics. The first topic to be discussed in a number of presentations / discussions is the '''Empirical Analysis of Algorithms, in particular SLS Algorithms'''. In this series we will discuss methods for their empirical analysis including run-time distributions, statistical analysis (hypothesis tests, ANOVA and alike methods), experimental design, tuning of algorithms, etc. We start this series by a presentation about the empirical analysis of algorithms through measuring run-time distributions. The presentation will be based on Chapter 4 of the book about ''Stochastic Local Search: Foundations and Applications'' by Holger Hoos and Thomas. The slides for the presentation are available via [http://www.sls-book.net SLS:FA] (check for the slides and figures section). The presentation will discuss only a small selection of the most important issues presented there.<br><br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
<br />
<br />
==Thursday 2nd February - Thomas STÃTZLE==<br />
<br />
'''''Agenda'''''<br />
<br />
Below is a list of topics that we will cover on empirical analysis. Since these topics in part also have to be elaborated from scratch, we will switch to the envisaged bi-weekly meeting, that is have roughly every two weeks one meeting. The topics below will be elaborated by the people participating in the seminar. This Thursday, Feb 2, we willl have a short meeting where we distribute the responsabilites of the tasks.<br />
<br />
On Thursday everybods needs to have a lists of his two main preferred tasks so that we make the decision on who takes over what part.<br />
<br />
We will also shortly discuss the state for the more practical directions.<br />
<br />
In any case, the meeting on Thursday should be finished after 10 - 15 minutes max.<br />
<br />
<br />
Topics on Empirical Analysis:<br />
<br />
- Statistical Analysis (hypothesis tests -- param, non-param, permutation; stability of estimates -- confidence intervals; various situations of things to test -- correlation, metric measures, binary tests etc.) Maybe follow some text-book (Sheshkin / Siegel Castellan)<br />
<br />
- Experimental Design (ANOVA and non-parametric analysis; planning of experiments; methodologies -- factorial designs, response surface methodology; follow some book: Montgomery / Dean, Voos etc.)<br />
<br />
- Exploratory data analysis (usage of plots to illustrate things ?); Take ideas here from published papers, maybe some book about exploratory data analysis..<br />
<br />
- Automated tuning of metaheuristics (overview of methods, issues); Overview of published papers plus new directions of work ..<br />
<br />
- Integration of experimental methodologies in the design of algorithms; still fuzzy, to be defined.<br />
<br />
<br />
'''Results'''<br />
<br />
<br />
We will read and discuss the book chapter by chapter. For each chapter, one person will be responsable to lead the discussion by a short presentation. However, it is expected that everybody present in the meeting has already read through the material; in fact, reading the material is important to make the meetings effective.<br />
<br />
The current schedule for the meetings is as follows.<br />
<br />
- Feb 16, Marco M.: Empirical Research + Exploratory Data Analysis<br />
<br />
- March 23, Anders: Basic Issues in Experiment Design<br />
<br />
- March 29, Max: Hypothesis Testing and Estimation<br />
<br />
- April 20, Christophe: Computer-Intensive Statistical Methods<br />
<br />
- May 4, Shervin: Performance Assessment<br />
<br />
- May 18, Prasanna: Explaining Performance: Interactions and Dependencies<br />
<br />
- June 1, Roderich: Modeling<br />
<br />
- June 15, Alexandre: Tactics for Generalization<br />
<br />
<br />
<br />
==Thursday 16th Feb - Marco M==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Empirical Research + Exploratory Data Analysis<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
<br />
==Thursday 23rd March - Anders==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Basic Issues in Experiment Design<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
<br />
==Thursday 30th March - Max Manfrin==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Hypothesis Testing and Estimation<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
==Thursday 20th April - Christophe==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Computer-Intensive Statistical Methods<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
<br />
==Thursday 4th May - Shervin==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Performance Assessment<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
<br />
==Thursday 18th May -Prasanna==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Explaining Performance: Interactions and Dependencies<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
<br />
==Thursday 1st June -Roderich==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Modeling<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br><br />
<br />
==Thursday 15th June -Alexandre==<br />
<br />
'''''Agenda'''''<br />
<br />
# '''Introduction'''<br />
# '''Presentation / Discussion'''<br />
#* Tactics for Generalization<br />
# '''MEETOPT Admin (10-15 mins)'''<br />
<br />
<br />
'''''People who will be absent'''''<br />
<br><br />
N.A.<br />
<br><br></div>Prasanna