• Login
    Search 
    •   DORA Home
    • Faculty of Computing, Engineering and Media
    • School of Computer Science and Informatics
    • Search
    •   DORA Home
    • Faculty of Computing, Engineering and Media
    • School of Computer Science and Informatics
    • Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Search

    Show Advanced FiltersHide Advanced Filters

    Filters

    Use filters to refine the search results.

    Now showing items 11-20 of 24

    • Sort Options:
    • Relevance
    • Title Asc
    • Title Desc
    • Issue Date Asc
    • Issue Date Desc
    • Results Per Page:
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
    Thumbnail

    Minimum Cost Consensus Models based on Random Opinions 

    Chiclana, Francisco; Zhang, Ning; Gong, Zaiwu (Elsevier, 2017-07-25)
    In some complex group decision making cases, the opinions of decision makers (DMs) present random characteristic. However, it is difficult to determine the range of opinions by knowing only their probability distributions. ...
    Thumbnail

    Dynamic Structural Neural Network 

    Chiclana, Francisco; Cu Nguyen, Giap; Le Hoang, Son (IOS Press, 2017-12)
    Artificial neural network (ANN) has been well applied in pattern recognition, classification and machine learning thanks to its high performance. Most ANNs are designed by a static structure whose weights are trained ...
    Thumbnail

    Joint QoS multicast routing and channel assignment in multiradio multichannel wireless mesh networks using intelligent computational methods. 

    Cheng, Hui; Yang, Shengxiang (World Federation on Soft Computing (WFSC), 2011)
    In this paper, the quality of service multicast routing and channel assignment (QoS-MRCA) problem is investigated. It is proved to be a NP-hard problem. Previous work separates the multicast tree construction from the ...
    Thumbnail

    Metaheuristics for dynamic combinatorial optimization problems. 

    Yang, Shengxiang; Jiang, Y.; Nguyen, T. T. (The Institute of Mathematics and its Applications., 2012)
    Many real-world optimization problems are combinatorial optimization problems subject to dynamic environments. In such dynamic combinatorial optimization problems (DCOPs), the objective, decision variables and/or constraints ...
    Thumbnail

    A general framework of multi-population methods with clustering in undetectable dynamic environments. 

    Yang, Shengxiang (IEEE, 2012)
    To solve dynamic optimization problems, multiple population methods are used to enhance the population diversity for an algorithm with the aim of maintaining multiple populations in different subareas in the fitness ...
    Thumbnail

    Genetic algorithm and neural network hybrid approach for job-shop scheduling 

    Zhao, Kai; Yang, Shengxiang; Wang, Dingwei (ACTA Press, 1998)
    This paper proposes a genetic algorithm (GA) and constraint satisfaction adaptive neural network (CSANN) hybrid approach for job-shop scheduling problems. In the hybrid approach, GA is used to iterate for searching optimal ...
    Thumbnail

    Primal-dual genetic algorithms for royal road functions 

    Yang, Shengxiang (Elsevier Science Ltd, 2002)
    Based on Holland's simple genetic algorithm (SGA) there have been many variations developed. Inspired by the phenomenon of diploid genotype and dominance mechanisms broadly existing in nature, we have proposed a primal-dual ...
    Thumbnail

    A genetic algorithm for independent job scheduling in grid computing 

    Younis, Muhanad Tahrir; Yang, Shengxiang (Brno University of Technology, Brno, Czech Republic, 2017-06)
    Grid computing refers to the infrastructure which connects geographically distributed computers owned by various organizations allowing their resources, such as computational power and storage capabilities, to be shared, ...

    Adaptive mutation using statistics mechanism for genetic algorithms 

    Yang, Shengxiang (Springer, 2004)
    It has long been recognized that mutation is a key ingredient in genetic algorithms (GAs) and the choice of suitable mutation probability will have a significant effect on the performance of genetic search. In this paper, ...
    Thumbnail

    A new genetic algorithm based on primal-dual chromosomes for royal road functions 

    Yang, Shengxiang (2001-09)
    Genetic algorithms (GAs) have been broadly studied by a huge amount of researchers and there have been many variations developed based on Holland's simple genetic algorithm (SGA). Inspired by the phenomenon of diploid ...
    • 1
    • 2
    • 3
    Feed iconrss
    Bookmark icon Bookmark Search

    Submission Guide | Reporting Guide | Reporting Tool | DMU Open Access Libguide | Take Down Policy | Connect with DORA
    DMU LIbrary
     

     

    Browse

    All of DORACommunities & CollectionsAuthorsTitlesSubjects/KeywordsResearch InstituteBy Publication DateBy Submission DateThis CollectionAuthorsTitlesSubjects/KeywordsResearch InstituteBy Publication DateBy Submission Date

    My Account

    Login

    Discover

    AuthorYang, Shengxiang (20)Cheng, Hui (3)Chiclana, Francisco (2)Wang, Dingwei (2)Younis, Muhanad Tahrir (2)Chen, Liming (1)Cu Nguyen, Giap (1)Gong, Zaiwu (1)Jat, Sadaf Naseem (1)Jiang, Lei (1)... View MoreSubject
    Genetic algorithm (24)
    Dynamic optimization problem (3)Ant colony optimization (2)building blocks (2)dominance (2)Immigrants scheme (2)Job scheduling (2)Academic institutions (1)adaptive group mutation (1)Adaptive mutation (1)... View MoreDate Issued2010 - 2020 (13)2000 - 2009 (10)1998 - 1999 (1)Has File(s)Yes (16)No (8)

    Submission Guide | Reporting Guide | Reporting Tool | DMU Open Access Libguide | Take Down Policy | Connect with DORA
    DMU LIbrary