• Aucun résultat trouvé

A variable neighborhood search algorithm for assigning cells to switches in wireless networks

N/A
N/A
Info
Télécharger
Protected

Academic year: 2021

Partager "A variable neighborhood search algorithm for assigning cells to switches in wireless networks"

Copied!
8
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

(1)

Titre:

Title

:

A variable neighborhood search algorithm for assigning cells to

switches in wireless networks

Auteurs:

Authors

: Matthieu André, Gilles Pesant et Samuel Pierre

Date: 2005

Type:

Article de revue / Journal article

Référence:

Citation

:

André, M., Pesant, G. & Pierre, S. (2005). A variable neighborhood search algorithm for assigning cells to switches in wireless networks. Journal of Computer Science, 1(2), p. 175-181. doi:10.3844/jcssp.2005.175.181

Document en libre accès dans PolyPublie

Open Access document in PolyPublie URL de PolyPublie:

PolyPublie URL: https://publications.polymtl.ca/4750/

Version: Version officielle de l'éditeur / Published versionRévisé par les pairs / Refereed Conditions d’utilisation:

Terms of Use: CC BY

Document publié chez l’éditeur officiel

Document issued by the official publisher

Titre de la revue:

Journal Title: Journal of Computer Science (vol. 1, no 2)

Maison d’édition:

Publisher: Science Publications

URL officiel:

Official URL: https://doi.org/10.3844/jcssp.2005.175.181

Mention légale:

Legal notice:

Ce fichier a été téléchargé à partir de PolyPublie, le dépôt institutionnel de Polytechnique Montréal

This file has been downloaded from PolyPublie, the institutional repository of Polytechnique Montréal

(2)
(3)
(4)
(5)
(6)
(7)
(8)

Références

Télécharger maintenant ( PDF - 8 Page - 788.83 KB )

Documents relatifs

Combined neighborhood tabu search for community detection in complex networks

In this section, we show a comparison between our proposed approach and the three state-of-the-art algorithms mentioned above: SS+ML (multi-level al- gorithm), MSG-VM (multi step

Edge-Ratio Network Clustering by Variable Neighborhood Search

E 81(2):026105, 2010], a criterion is proposed for a graph bipartition to be optimal: one seeks to maximize the minimum for both classes of the bipartition of the ratio of inner

Assigning Codes in a Random Wireless Network

In this paper we present an algorithm that can assign codes in the Code Division Multiple Access (CDMA) framework for multihop ad hoc wireless networks.. In CDMA framework,

CTA: a collaborative tracking algorithm in wireless sensor networks

We consider here that the best tracking precision (100%) is obtained when we have one point every five meters (the target speed corresponds to a pedestrian). Figure

A variable neighborhood search algorithm for solving the single machine scheduling problem with periodic maintenance

In this work we propose to study the single machine scheduling problem in order to minimize weighted sum completion times where the machine has to undergo a periodic

Variable Neighborhood Search with Cost Function Networks To Solve Large Computational Protein Design Problems

Variable Neighborhood Search with Cost Function Networks To Solve Large Computational Protein Design Problems... Variable Neighborhood Search with Cost Function Networks to Solve

Variable Neighborhood Search with Cost Function Networks to Solve Large Computational Protein Design Problems

Variable Neighborhood Search with Cost Function Networks to Solve Large Computational Protein Design Problems: we explored various mutator for improving VNS robustness for the

Variable Neighborhood Search for Edge-Ratio Network Clustering

In case of equality, the coefficient α is equal to the ratio of twice the number of edges within the community S divided by the number of edges within the cut of that community. It