Loading...
Search for: construction-algorithms
0.01 seconds

    Joint cell muting and user scheduling in multicell networks with temporal fairness

    , Article Wireless Communications and Mobile Computing ; Volume 2018 , 2018 ; 15308669 (ISSN) Shahsavari, S ; Akar, N ; Khalaj, B. H ; Sharif University of Technology
    Hindawi Limited  2018
    Abstract
    A semicentralized joint cell muting and user scheduling scheme for interference coordination in a multicell network is proposed under two different temporal fairness criteria. In the proposed scheme, at a decision instant, each base station (BS) in the multicell network employs a cell-level scheduler to nominate one user for each of its inner and outer sections and their available transmission rates to a network-level scheduler which then computes the potential overall transmission rate for each muting pattern. Subsequently, the network-level scheduler selects one pattern to unmute, out of all the available patterns. This decision is shared with all cell-level schedulers which then forward... 

    A learning automata-based algorithm for determination of the number of hidden units for three-layer neural networks

    , Article International Journal of Systems Science ; Volume 40, Issue 1 , 2009 , Pages 101-118 ; 00207721 (ISSN) Beigy, H ; Meybodi, M. R ; Sharif University of Technology
    Abstract
    There is no method to determine the optimal topology for multi-layer neural networks for a given problem. Usually the designer selects a topology for the network and then trains it. Since determination of the optimal topology of neural networks belongs to class of NP-hard problems, most of the existing algorithms for determination of the topology are approximate. These algorithms could be classified into four main groups: pruning algorithms, constructive algorithms, hybrid algorithms and evolutionary algorithms. These algorithms can produce near optimal solutions. Most of these algorithms use hill-climbing method and may be stuck at local minima. In this article, we first introduce a...