Zobrazeno 1 - 10
of 112
pro vyhledávání: '"Dhaenens, Clarisse"'
Biclustering is an unsupervised machine learning technique that simultaneously clusters rows and columns in a data matrix. Biclustering has emerged as an important approach and plays an essential role in various applications such as bioinformatics, t
Externí odkaz:
http://arxiv.org/abs/2203.16241
The no-wait flowshop scheduling problem is a variant of the classical permutation flowshop problem, with the additional constraint that jobs have to be processed by the successive machines without waiting time. To efficiently address this NP-hard com
Externí odkaz:
http://arxiv.org/abs/1903.09035
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Reproduction de : Habilitation à diriger des recherches : Informatique : Lille 1 : 2005.
Synthèse des travaux en français. Recueil de publications en anglais non reproduit dans la version électronique. N° d'ordre (Lille 1) : 466. Curric
Synthèse des travaux en français. Recueil de publications en anglais non reproduit dans la version électronique. N° d'ordre (Lille 1) : 466. Curric
Externí odkaz:
https://iris.univ-lille1.fr/dspace/handle/1908/373
Autor:
Jacques, Julie *, Martin-Huyghe, Hélène, Lemtiri-Florek, Justine, Taillard, Julien, Jourdan, Laetitia, Dhaenens, Clarisse, Delerue, David, Hansske, Arnaud, Leclercq, Valérie
Publikováno v:
In International Journal of Medical Informatics October 2020 142
Publikováno v:
N° RR-8215 (2013)
The graph coloring problem is often investigated in the literature. Many insights about many neighboring solutions with the same fitness value are raised but as far as we know, no deep analysis of this neutrality has ever been conducted in the litera
Externí odkaz:
http://arxiv.org/abs/1301.6092
In multiobjective combinatorial optimization, there exists two main classes of metaheuristics, based either on multiple aggregations, or on a dominance relation. As in the single objective case, the structure of the search space can explain the diffi
Externí odkaz:
http://arxiv.org/abs/1207.4631
Recently, the property of connectedness has been claimed to give a strong motivation on the design of local search techniques for multiobjective combinatorial optimization (MOCO). Indeed, when connectedness holds, a basic Pareto local search, initial
Externí odkaz:
http://arxiv.org/abs/1207.4628