loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Lamia Sadeg-Belkacem 1 ; Zineb Habbas 2 ; Fatima Benbouzid-Si Tayeb 3 and Daniel Singer 2

Affiliations: 1 LCMS, ESI, University of Lorraine and Military Polytechnic School, Algeria ; 2 University of Lorraine, France ; 3 LCMS and ESI, Algeria

Keyword(s): Frequency Assignment Problem, Constraint Satisfaction Problem, Graph Clustering, Genetic Algorithm.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Constraint Satisfaction ; Symbolic Systems

Abstract: This paper deals with solving MI-FAP problem. Because of the NP-hardness of the problem, it is difficult to cope with real FAP instances with exact or even with heuristic methods. This paper aims at solving MI-FAP using a decomposition approach and mainly proposes a generic Top-Down approach. The key idea behind the generic aspect of our approach is to link the decomposition and the resolution steps. More precisely, two generic algorithms called Top-Down and Iterative Top-Down algorithms are proposed. To validate this approach two decomposition techniques and one efficient Adaptive Genetic Algorithm (AGA-MI-FAP) are proposed. The first results demonstrate good trade-off between the quality of solutions and the execution time.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.140.198.173

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Sadeg-Belkacem, L.; Habbas, Z.; Benbouzid-Si Tayeb, F. and Singer, D. (2014). Decomposition Tehniques for Solving Frequency Assigment Problems (FAP) - A Top-Down Approach. In Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART; ISBN 978-989-758-015-4; ISSN 2184-433X, SciTePress, pages 477-484. DOI: 10.5220/0004820204770484

@conference{icaart14,
author={Lamia Sadeg{-}Belkacem. and Zineb Habbas. and Fatima {Benbouzid{-}Si Tayeb}. and Daniel Singer.},
title={Decomposition Tehniques for Solving Frequency Assigment Problems (FAP) - A Top-Down Approach},
booktitle={Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART},
year={2014},
pages={477-484},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004820204770484},
isbn={978-989-758-015-4},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART
TI - Decomposition Tehniques for Solving Frequency Assigment Problems (FAP) - A Top-Down Approach
SN - 978-989-758-015-4
IS - 2184-433X
AU - Sadeg-Belkacem, L.
AU - Habbas, Z.
AU - Benbouzid-Si Tayeb, F.
AU - Singer, D.
PY - 2014
SP - 477
EP - 484
DO - 10.5220/0004820204770484
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic