Adaptive ε-Ranking on many-objective problems

Abstract  This work proposes Adaptive ε-Ranking to enhance Pareto based selection, aiming to develop effective many-objective evolutionary optimization algorithms. ε-Ranking fine grains ranking of solutions after they have been ranked by
P…

Abstract  This work proposes Adaptive ε-Ranking to enhance Pareto based selection, aiming to develop effective many-objective evolutionary optimization algorithms. ε-Ranking fine grains ranking of solutions after they have been ranked by
Pareto dominance, using a randomized sampling procedure combined with ε-dominance to favor a good distribution of the samples.
In the proposed method, sampled solutions keep their initial rank and solutions located within the virtually expanded ε-dominance
regions of the sampled solutions are demoted to an inferior rank. The parameter ε that determines the expanded regions of
dominance of the sampled solutions is adapted at each generation so that the number of best-ranked solutions is kept close
to a desired number that is expressed as a fraction of the population size. We enhance NSGA-II with the proposed method and
analyze its performance on MNK-Landscapes, showing that the adaptive method works effectively and that compared to NSGA-II
convergence and diversity of solutions can be improved remarkably on MNK-Landscapes with 3 ≤ M ≤ 10 objectives. Also, we compare the performance of Adaptive ε-Ranking with two representative many-objective evolutionary
algorithms on DTLZ continuous functions. Results on DTLZ functions with 3 ≤ M ≤ 10 objectives suggest that the three many-objective approaches emphasize different areas of objective space and could be
used as complementary strategies to produce a better approximation of the Pareto front.

  • Content Type Journal Article
  • DOI 10.1007/s12065-009-0031-2
  • Authors
    • Hernán Aguirre, Shinshu University International Young Researcher Empowerment Center, Faculty of Engineering 4-17-1 Wakasato Nagano 380-8553 Japan
    • Kiyoshi Tanaka, Shinshu University Faculty of Engineering 4-17-1 Wakasato Nagano 380-8553 Japan

Special issue on simulated evolution and learning

Special issue on simulated evolution and learning
Content Type Journal ArticleDOI 10.1007/s12065-009-0033-0Authors
Michael Kirley, The University of Melbourne Department of Computer Science and Software Engineering Melbourne AustraliaMengjie Zhang, …

Special issue on simulated evolution and learning

  • Content Type Journal Article
  • DOI 10.1007/s12065-009-0033-0
  • Authors
    • Michael Kirley, The University of Melbourne Department of Computer Science and Software Engineering Melbourne Australia
    • Mengjie Zhang, Victoria University School of Engineering and Computer Science Wellington New Zealand
    • Xiaodong Li, RMIT University School of Computer Science and Information Technology Melbourne Australia

Tesi/Stage Disponibili su Sviluppo di Videogiochi (Mileston)

Sono disponibili tre tesi/stage in collaborazione con Milestone (www.milestone.it) nell’ambito dei videogiochi di corse automobilistiche e motociclistiche. I candidati ideali devono avere una forte motivazione personale, passione per i videogiochi e conoscenza del C++
Per maggiori informazioni, inviare una mail a lanzi@elet.polimi.it
Comportamenti di Gruppo in Videogiochi di Corse Automobilistiche
Questa tesi prevede lo studio delle dinamiche dei […]

Sono disponibili tre tesi/stage in collaborazione con Milestone (www.milestone.it) nell’ambito dei videogiochi di corse automobilistiche e motociclistiche. I candidati ideali devono avere una forte motivazione personale, passione per i videogiochi e conoscenza del C++

Per maggiori informazioni, inviare una mail a lanzi@elet.polimi.it

Comportamenti di Gruppo in Videogiochi di Corse Automobilistiche
Questa tesi prevede lo studio delle dinamiche dei comportamenti dei piloti in competizioni automobilistiche su circuito e lo sviluppo di una intelligenza artificiale in grado di imitare i comportamenti di un vero mevero pilota. In particolare, il lavoro di tesi si concentrerà su comportamenti di gruppo come i sorpassi, le manovre per evitare collisioni con altri veicoli, il recupero da situazioni di emergenza, ecc. Terminatala fase di analisi e l’implementazione di un prototipo, verrà valutata la possibilità di inserire tale implementazione all’interno di un videogioco di ultima generazione.

Comportamenti di Gruppo in Videogiochi di Corse Motociclistiche
Questa tesi prevede lo studio delle dinamiche dei comportamenti dei piloti in competizioni motociclistiche su circuito e lo sviluppo di una intelligenza artificiale in grado di imitare i comportamenti di un vero vero pilota. In particolare, il lavoro di tesi si concentrerà su comportamenti di gruppo come i sorpassi, le manovre per evitare collisioni con altre moto, il recupero da situazioni di emergenza, ecc. Terminata la fase di analisi e l’implementazione di un prototipo, verrà valutata la possibilità di inserire tale implementazione all’interno di un videogioco di ultima generazione.

Intelligenza Artificiale in Videogiochi di Corse Motociclistiche
La tesi prevede l’analisi e l’implementazione dell’intelligenza artificiale per un videogioco di corse motociclistiche. Il sistema dovrà essere in grado di eseguire in modo corretto ed efficace un insieme di manovre complesse quali: l’accelerazione da fermo, la frenata in situazioni limite, l’approccio ad una curva che preveda la fase di stacco, di impostazione, di percorrenza e di uscita, l’approccio a serie di curve, ecc. Si valuterà la possibilità di inserire tale implementazione all’interno di un videogioco di ultima generazione.

Designing the Engineer of the Future Workshop (EF2009)

I organized the workshop EF2009, which was held at La Salle last November 12th, 2009. This is the summary of the workshop. For more details, visit EF2009 webpage.
Engineering has played an important role in the progress of society and has greatly contributed to the people’s welfare. At the beginning of the 21st century, we are […]

EF2009 announcement
I organized the workshop EF2009, which was held at La Salle last November 12th, 2009. This is the summary of the workshop. For more details, visit EF2009 webpage.

Engineering has played an important role in the progress of society and has greatly contributed to the people’s welfare. At the beginning of the 21st century, we are continuously facing new challenges where engineers have much to say. The workshop on the Engineer of the Future (EF2009) is intended to gather faculty members, industry, engineering associations, and society representatives to discuss on the type of engineers the society needs for the 21st century and how engineering education should be aligned to prepare such professionals.

The workshop aims at sharing ideas on issues such as: Which type of engineer do the society and industry need? Are current engineers prepared enough for the society and industry needs? What set of knowledge and skills should engineers possess? How can we do better at the university to educate engineers? How to make the profession attractive to new students?

The workshop will bring two keynote speakers who are effectively promoting the need for transforming the engineering education. Prof. David E. Goldberg is co-director of Illinois Foundry for Innovation in Engineering Education (iFoundry), University of Illinois, USA. Lueny Morell, M.S., P.E., is a member of the University Relations staff of the Hewlett Packard Company and President-elect of the International Federation of Engineering Education Societies.

Optical solution for hard on average #P-complete instances (using exponential space for solving instances of the permanent)

Abstract  Optical architectures that use exponential space for solving instances of the (non-necessarily-binary) permanent are presented.
This is the first work to specifically focus on such hard on average problems. Two architectures are su…

Abstract  

Optical architectures that use exponential space for solving instances of the (non-necessarily-binary) permanent are presented.
This is the first work to specifically focus on such hard on average problems. Two architectures are suggested the first is
based on programmable masks, and the second on preprepared fixed number of masks.

  • Content Type Journal Article
  • DOI 10.1007/s11047-009-9168-2
  • Authors
    • Amir Anter, Department of Computer Science, Ben-Gurion University of the Negev, Beer Sheva, Israel
    • Shlomi Dolev, Department of Computer Science, Ben-Gurion University of the Negev, Beer Sheva, Israel

SIGEVOlution Volume 4, Issue 1, is now available

The new issue of the SIGEVOlution newsletter, Volume 4 Issue 1, is now available for you to download from: http://www.sigevolution.orgThe new issue features:”Computational Intelligence Marketing” by Arthur Kordon”Pyevolve: a Python Open-Source Framewor…

The new issue of the SIGEVOlution newsletter, Volume 4 Issue 1, is now available for you to download from: http://www.sigevolution.org
The new issue features:
  • “Computational Intelligence Marketing” by Arthur Kordon
  • “Pyevolve: a Python Open-Source Framework for Genetic Algorithms” by Christian S. Perone
  • Calls & calendar
The newsletter is intended to be viewed electronically.
Thanks to Pier Luca Lanzi, SIGEvolution Editor-in-Chief.