Multi-Neighborhood simulated annealing for the minimum interference frequency assignment problem
EURO Journal on Computational Optimization, 2022 We consider the Minimum Interference Frequency Assignment Problem and we propose a novel Simulated Annealing approach that makes use of a portfolio of different neighborhoods, specifically designed for this problem.We undertake at once the two versions ...
Sara Ceschia +3 more
doaj +1 more source
Acyclic orientations with path constraints [PDF]
, 2005 Many well-known combinatorial optimization problems can be stated over the set of acyclic orientations of an undirected graph. For example, acyclic orientations with certain diameter constraints are closely related to the optimal solutions of the vertex ...
Bermond +8 more
core +2 more sources
A High Capacity Energy Efficient Approach for Traffic Transmission in Cellular Networks
Journal of Telecommunications and Information Technology, 2015 The efficiency of cellular networks can be improved in various aspects such as energy consumption, network capacity and interference between neighboring cells.
Maryam Esmaeilifard +1 more
doaj +1 more source
Hybrid Spectrum Allocation Scheme in Wireless Cellular Networks [PDF]
, 2011 Mobile services have seen a major upswing driven by the bandwidth hungry applications thus leading to higher data rate requirements on the wireless networks. Spectrum being the most precious resource in the wireless industry is of keen interest.
Aliu, Osianoh Glenn +2 more
core +1 more source
A variational inequality reformulation of a congested transit assignment model by Cominetti, Correa, Cepeda, and Florian [PDF]
, 2012 In the paper by Cominetti and Correa (2001) [Common-lines and passenger assignment in congested transit networks. Transportation Science 35 (3), pp 250-267], an extension to the common-lines problem for general multidestination networks under congestion ...
Codina Sancho, Esteve
core +2 more sources
- and -labeling problems on interval graphs
AKCE International Journal of Graphs and Combinatorics, 2017 For a given graph , the - and -labeling problems assign the labels to the vertices of . Let be the set of non-negative integers. An - and -labeling of a graph is a function such that , for respectively, where represents the distance (minimum number of ...
Sk Amanathulla, Madhumangal Pal
doaj +1 more source
THE METOD OF SYNTHESIS OF QUASI-DUAL-BAND MATCHING DEVICE
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2020 The article presents some findings on the potential of analytical methods for the synthesis of broadband matching circuits for solving nontrivial circuit engeneering problems.
M. A. Yantsevich, H. A. Filipovich
doaj +1 more source
Frequency planning optimisation in real mobile networks [PDF]
, 1999 Due to the annual increase of cellular subscribers, there is a growing interest by the network operators, in how to deploy the network infrastructure to achieve maximum capacity.
Colet, X +2 more
core +1 more source
An algorithm for optimal network planning and frequency channel assignment in indoor WLANs [PDF]
, 2014 The increased use of wireless local area networks has led to an increased interference and a reduced performance, as a high amount of access points are often operating on the same frequency channel.
Joseph, Wout +3 more
core +1 more source
Gender Agreement and Assignment in Spanish Heritage Speakers: Does Frequency Matter?
Languages, 2020 Gender has been extensively studied in Spanish heritage speakers. However, lexical frequency effects have yet to be explored in depth. This study aimed to uncover the extent to which lexical frequency affects the acquisition of gender assignment and ...
Esther Hur +2 more
doaj +1 more source