Repozitorij Univerze v Novi Gorici

Iskanje po repozitoriju
A+ | A- | Pomoč | SLO | ENG

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 4 / 4
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
2.
An efficient algorithm for PMFAP
Soumen Atta, Priya Ranjan Sinha Mahapatra, 2016, objavljeni znanstveni prispevek na konferenci

Opis: Perturbation-Minimizing Frequency Assignment Problem (PMFAP) is a frequency assignment problem in which newly generated demands are satisfied with minimum change in the already existing frequency assignment keeping all the interference constraints. In this paper an efficient heuristic algorithm for PMFAP is presented. The efficiency of this algorithm is compared with the existing results from literature. The proposed algorithm also works for the well-known Frequency Assignment Problem (FAP) and its performance is compared with the existing results for the standard benchmark data sets.
Ključne besede: Frequency Assignment Problem (FAP), Perturbation-Minimizing Frequency Assignment Problem (PMFAP), Perturbation, Heuristic Algorithm
Objavljeno v RUNG: 05.06.2023; Ogledov: 1136; Prenosov: 0
Gradivo ima več datotek! Več...

3.
Perturbation-minimising frequency assignment to address short term demand fluctuation in cellular network
Soumen Atta, Priya Ranjan Sinha Mahapatra, 2018, izvirni znanstveni članek

Opis: In cellular network short term demand fluctuation is a very common phenomenon. The demand of any cell may increase or decrease slightly or the system may expand by adding additional cells or the system may shrink if the demands of certain number of cells become zero. In this paper, the perturbation-minimising frequency assignment problem (PMFAP) is considered to address the short term fluctuation in demand vector. PMFAP is a frequency assignment problem in which newly generated demands are satisfied with minimum changes in the already existing frequency assignment keeping all the interference constraints. In this paper, an efficient heuristic algorithm for PMFAP is presented. The efficiency of this algorithm is compared with the existing results from literature. With a slight modification to the proposed algorithm, it can solve the well-known frequency assignment problem (FAP) and its performance is also compared with the existing results using the standard benchmark data sets for FAP.
Ključne besede: short term demand fluctuation, frequency assignment problem, FAP, PMFAP, cellular network, perturbation, heuristic algorithm
Objavljeno v RUNG: 17.04.2023; Ogledov: 974; Prenosov: 0
Gradivo ima več datotek! Več...

4.
Meta-heuristic algorithms to improve fuzzy C-means and K-means clustering for location allocation of telecenters under e-governance in developing nations
Rajan Gupta, Sunil K. Muttoo, Saibal K. Pal, 2019, izvirni znanstveni članek

Opis: The telecenter, popularly known as the rural kiosk or common service center, is an important building block for the improvement of e-governance in developing nations as they help in better citizen engagement. Setting up of these centers at appropriate locations is a challenging task; inappropriate locations can lead to a huge loss to the government and allied stakeholders. This study proposes the use of various meta-heuristic algorithms (particle swarm optimization, bat algorithm, and ant colony optimization) for the improvement of traditional clustering approaches (K-means and fuzzy C-means) used in the facility location allocation problem and maps them for the betterment of telecenter location allocation. A dataset from the Indian region was considered for the purpose of this experiment. The performance of the algorithms when applied to traditional facility location allocation problems such as set-cover, P-median, and the P-center problem was investigated, and it was found that their efficiency improved by 20%–25% over that of existing algorithms.
Ključne besede: ant colony optimization, bat algorithm, common service center, e-governance, fuzzy clustering, meta-heuristic algorithm, particle swarm optimization
Objavljeno v RUNG: 01.04.2021; Ogledov: 2133; Prenosov: 10
URL Povezava na celotno besedilo
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.03 sek.
Na vrh