• Aucun résultat trouvé

18 résultats avec le mot-clé: 'algorithms minimum sum coloring problem review'

Algorithms for the minimum sum coloring problem: a review

HESA is also a hybrid search algorithm [24] that alternates between feasible and infea- sible regions of the search space. HESA relies on a double-crossover recombination method and

Protected

N/A

22
0
0
2021
Greedy Algorithms for the Minimum Sum Coloring Problem

We propose two families of greedy algorithms for solving MSCP, and suggest improvements to the two greedy algorithms most often referred to in the literature for solving the

Protected

N/A

7
0
0
2021
A memetic algorithm for the minimum sum coloring problem

This algorithm combines an original crossover based on the union of independent sets proposed in [1] and local search techniques dedicated to the minimum sum coloring problem

Protected

N/A

4
0
0
2021
Searching for determinism in observed data: a review of the issues involved

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

Protected

N/A

15
0
0
2021
Hybrid evolutionary search for the minimum sum coloring problem of graphs

The proposed algorithm relies on a joint use of two dedicated crossover operators to generate offspring solutions and an iterated double-phase tabu search procedure to improve

Protected

N/A

35
0
0
2021
Hybrid evolutionary search for the minimum sum coloring problem of graphs

The proposed algorithm relies on a joint use of two dedicated crossover operators to generate offspring solutions and an iterated double-phase tabu search procedure to improve

Protected

N/A

34
0
0
2022
Hybrid metaheuristic algorithms for sum coloring and bandwidth coloring

7 SBTS: Swap-Based Tabu Search for maximum independent set This Appendix presents a general swap-based tabu search SBTS heuristic for the maximum independent set problem MIS, which

Protected

N/A

131
0
0
2021
Un imaginaire pur non nul sera fix´e `a partir de la questionII.4

Universit´ e Paris 7-Denis Diderot Alg` ebre et G´ eom´ etrieM. Licence de math´ ematiques et informatique Ann´

Protected

N/A

1
0
0
2022
Lower Bound for (Sum) Coloring Problem

The GVCP consists in finding the minimum number of colors (or equivalently the minimum number of subsets), called chromatic number χ(G), required to color (or equivalently to

Protected

N/A

15
0
0
2022
An Application of Process Mining by Sequence Alignment Methods to the SAP Invoice Process Example

previous work to the business process area with the consideration to its spe- cific characteristics, especially to adjust methods for sequence alignment to be able to

Protected

N/A

10
0
0
2022
Optimized Data Representation for Interactive Multiview Navigation

These results indicate that, by adapting the segment partitions to the view popularity, the proposed method is able to provide different levels of navigation interactivity for

Protected

N/A

16
0
0
2021
2. n’ayant pas d’espérance.

indépendantes suivant des lois de Poisson de paramètres λ, µ... On va symétriser X pour obtenir

Protected

N/A

5
0
0
2022
- ATELIER REGIONAL ECOQUARTIER-

- Territoire à Energie Positive pour la Croissance Verte (TEPCV) avec le Ministère de l’Environnement - Contrat d’Objectifs Territoire Energie Climat (COTEC) avec l’ADEME?.

Protected

N/A

21
0
0
2022
Design of exact solutions for the manufacturing of "vias" using DSA technology

There are other types of graph coloring, in particular the edge coloring problem is the problem of coloring the edges of a graph with a minimum number of colors such that no two

Protected

N/A

112
0
0
2021
Technology for automatically characterizing the primary colors of the image and counting the number of objects

Next, there is a color distribution analysis of each layer, which results in a corrected table (matrix) of the color. The next stage of the resulting new three-layer matrix is

Protected

N/A

6
0
0
2022
Agrégation externe de Mathématiques

Dans la méthode précédente, on a besoin de savoir factoriser un polynôme annulateur de u pour trouver les projecteurs spectraux puis d et n. Pour cela on applique la méthode

Protected

N/A

2
0
0
2022
A Semantic Event Notification Service for Knowledge-Driven Coordination

In this paper, we present conceptual model and implementation of Semantic Event Notification Service (SENS), an event processing system that avoids redundant processing by

Protected

N/A

8
0
0
2022
Effets de la nature de la ration sur les performances, les caractéristiques (...)

Seul le muscle semi-tendineux des animaux it l'ensilage d'herbe est apparu plus oxydatif que celui des animaux au foin, sa teneur en collagbne a 6t6 trbs voisine mais la

Protected

N/A

4
0
0
2022

Télécharger plus de documents et télécharger des études de documentation immédiatement !