• Aucun résultat trouvé

18 résultats avec le mot-clé: 'lower bound for sum coloring problem'

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
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
- 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
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
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
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
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
Sharp bounds for the first eigenvalue of a fourth order Steklov problem

We give a computable, sharp lower bound of the first eigenvalue of this problem, which depends only on the dimension, a lower bound of the Ricci curvature of the domain, a lower

Protected

N/A

18
0
0
2021
A new Lagrangian bound for the min-sum job-shop scheduling

In this study we proposed a new Lagrangian lower bound for the min-sum job-shop scheduling problem that integrates the job-level and machine-level decomposition methods.. It was

Protected

N/A

7
0
0
2021
STADE LARVAIRE DE THYNNASCARIS SP. (NEMATODE ANISAKIDAE) CHEZ SAGITTA SETOSA

La présence de Némalodes parasites a été signalée à plusieurs reprises dans le genre Sagitta (Chétognathe) ; aucune certitude n'a pu cependant être apportée

Protected

N/A

5
0
0
2021
Air Traffic Deconfliction Using Sum Coloring

Graph coloring has many different applications, such as in scheduling or register allocation problems, where, for instance, a set of jobs need to be assigned to time slots,

Protected

N/A

7
0
0
2021
New membership category / Nouvelle categorie de cotisation

Pour que la SHC puisse remettre un reçu pour fins d'impôts aux membres de soutien pour l'année 1988, il faut absolument que le secrétariat ait reçu les dons avant le 31

Protected

N/A

1
0
0
2021
Centre for Studies in Primary Care: offering a laboratory of primary care practices.

Dr Godwin is Director, Ms Seguin is Research and Programs Manager, Dr Jones is Network for Studies in Primary Care Coordinator, and Ms Jones is Research Secretary at the Centre

Protected

N/A

1
0
0
2022
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
2. Lower bound

In the free-noise case ( = 0), minimax fast rates of convergence are well-known under the margin assumption in discriminant analysis (see [27]) or in the more general

Protected

N/A

23
0
0
2022
G ENRE ET SEXUALITÉ DANS LA CITE

[r]

Protected

N/A

2
0
0
2022

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