Optimization Group Meetings

2010-06-01T11:23:20Z

Ltianjun: /* History of Literature Sessions */

==Breakfast Meetings==

===Purpose===

Breakfast meetings are informal meetings where there is a general discussion or someone presents their work. And additional goal is to have breakfast together.

=== Organization ===

# 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.
# Add a new entry to the table below.
# Bring breakfast.

=== History of Breakfast Meetings ===

{| class="sortable" border="1" cellpadding="2" cellspacing="0"
|- align="left"
!width="100"|Date
!width="200"|Presenter
!class="unsortable"|Summary
|-
|2010-05-20
|Marco Montes de Oca
| 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.
|-
|2010-05-??
|Renaud Lenne
| ???

|-
|2010-04-29
|Franco Mascia
|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&rep=rep1&type=pdf] [http://www710.univ-lyon1.fr/~csolnon/publications/rr-mai04.pdf]

|-
|2010-03-18
|Sabrina Oliveira
|Achieved results from the application of the Population Based Ant Colony Optimisation algorithm to TSP.
|-
|2010-02-11
|Sara Ceschia
|An overview of Container Loading Problems.
|-
| 2010-01-21
|Yuan, Zhi (Eric)
| Rice cooker vs. the idea of tuning.
|-
|2010-01-07
|Thomas StÃ¼ztle
|General discussion about the optimization group.
|}

==Literature Sessions==

===Purpose===

The goal of the Literature Sessions is to examine and discuss
particularly interesting papers from the research literature. For each
session, one paper will be selected, there will be a short
presentation (10-15 minutes) about the contents, and a discussion will
ensue. Sessions will last around 40-45 minutes. Attendants should read
the paper before the session in order to have a productive discussion.

=== Organization ===

# Book a room (ask Muriel).
# 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.
# Add a new entry to the table below. 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).

=== History of Literature Sessions ===

{| class="sortable" border="1" cellpadding="2" cellspacing="0"
|- align="left"
!width="100"|Date
!width="180"|Presenter
!class="unsortable"|Paper discussed

|-
|2010-03-06
|Tianjun Liao
|Population-Based Algorithm Portfolios for Numerical Optimization.Peng, F. Tang, K.Chen, G.Yao, X. Evolutionary Computation, IEEE Transactions on Volume: PP Issue:99 On page(s): 1 - 1ISSN: 1089-778X Digital Object Identifier: 10.1109/TEVC.2010.2040183.Date of Publication: 29 March 2010

|-
|2010-05-07
|Zhi (Eric) Yuan
|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]

|-
|2010-03-04
|Sara Ceschia
|A. Schaerf and L. Di Gaspero. [[:Image:ElPaCo_presentation.pdf|Slides of the tutorial "An Overview of Local Search Software Tools"]] given at "Learning and Intelligent OptimizatioN (LION 2007)", December 8-12, 2007, Trento, Italy.

L. Di Gaspero and A. Schaerf. EASY LOCAL++: An object-oriented framework for ï¬‚exible design of local search algorithms. Software â€” Practice & Experience, 33(8):733â€“765, July 2003. [http://www.diegm.uniud.it/satt/papers/DiSc03.pdf]

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]

|-
|2010-02-19
|Sabrina M. de Oliveira
|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]

|-
|2010-02-04
|Thomas StÃ¼ztle
|Analyzing Bandit-based Adaptive Operator Selection Mechanisms. Ãlvaro Fialho, Luis Da Costa, Marc Schoenauer and MichÃ©le Sebag.

|-
|2010-01-14
|[http://iridia.ulb.ac.be/~jdubois/ JÃ©rÃ©mie Dubois-Lacoste]
|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]
|-
|2009-12-11
|[http://iridia.ulb.ac.be/~manuel/ Manuel LÃ³pez-IbÃ¡Ã±ez]
|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]
|}
<br>
<br>

== Other Previous Meetings==

See [[Previous Optimization meetings | Minutes and agendas from previous meetings]].

IridiaWiki - User contributions [en]

Optimization Group Meetings