Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (4)
  • Open Access

    ARTICLE

    Spatio-temporal pattern detection in spatio-temporal graphs

    Use case of invasive team sports and urban road traffic

    Kamaldeep Singh Oberoi1, Géraldine Del Mondo2

    Revue Internationale de Géomatique, Vol.31, No.2, pp. 377-399, 2022, DOI:10.3166/RIG.31.377-399 c 2022

    Abstract Spatio-temporal (ST) graphs have been used in many application domains to model evolving ST phenomenon. Such models represent the underlying structure of the phenomenon in terms of its entities and different types of spatial interactions between them. The reason behind using graph-based models to represent ST phenomenon is due to the existing well-established graph analysis tools and algorithms which can be directly applied to analyze the phenomenon under consideration. In this paper, considering the use case of two distinct, highly dynamic phenomena - invasive team sports, with a focus on handball and urban road traffic, we propose a spatio-temporal graph… More >

  • Open Access

    ARTICLE

    Pythagorean Neutrosophic Planar Graphs with an Application in Decision-Making

    P. Chellamani1,2,*, D. Ajay1, Mohammed M. Al-Shamiri3,4, Rashad Ismail3,4

    CMC-Computers, Materials & Continua, Vol.75, No.3, pp. 4935-4953, 2023, DOI:10.32604/cmc.2023.036321

    Abstract Graph theory has a significant impact and is crucial in the structure of many real-life situations. To simulate uncertainty and ambiguity, many extensions of graph theoretical notions were created. Planar graphs play a vital role in modelling which has the property of non-crossing edges. Although crossing edges benefit, they have some drawbacks, which paved the way for the introduction of planar graphs. The overall purpose of the study is to contribute to the conceptual development of the Pythagorean Neutrosophic graph. The basic methodology of our research is the incorporation of the analogous concepts of planar graphs in the Pythagorean Neutrosophic… More >

  • Open Access

    ARTICLE

    Deep Reinforcement Learning-Based Job Shop Scheduling of Smart Manufacturing

    Eman K. Elsayed1, Asmaa K. Elsayed2,*, Kamal A. Eldahshan3

    CMC-Computers, Materials & Continua, Vol.73, No.3, pp. 5103-5120, 2022, DOI:10.32604/cmc.2022.030803

    Abstract Industry 4.0 production environments and smart manufacturing systems integrate both the physical and decision-making aspects of manufacturing operations into autonomous and decentralized systems. One of the key aspects of these systems is a production planning, specifically, Scheduling operations on the machines. To cope with this problem, this paper proposed a Deep Reinforcement Learning with an Actor-Critic algorithm (DRLAC). We model the Job-Shop Scheduling Problem (JSSP) as a Markov Decision Process (MDP), represent the state of a JSSP as simple Graph Isomorphism Networks (GIN) to extract nodes features during scheduling, and derive the policy of optimal scheduling which guides the included… More >

  • Open Access

    ARTICLE

    Approximation of Unit-Hypercubic Infinite Noncooperative Game Via Dimension-Dependent Samplings and Reshaping the Player’s Payoffs into Line Array for the Finite Game Simplification

    Vadim V. Romanuke1

    CMES-Computer Modeling in Engineering & Sciences, Vol.108, No.2, pp. 113-134, 2015, DOI:10.3970/cmes.2015.108.113

    Abstract The problem of solving infinite noncooperative games approximately is considered. The game may either have solution or have no solution. The existing solution may be unknown as well. Therefore, an approach of obtaining the approximate solution of the infinite noncooperative game on the unit hypercube is suggested. The unit-hypercubic game isomorphism to compact infinite noncooperative games allows to disseminate the approximation approach on a pretty wide class of noncooperative games. The approximation intention is in converting the infinite game into a finite one, whose solution methods are easier rather than solving infinite games. The conversion starts with sampling the players’… More >

Displaying 1-10 on page 1 of 4. Per Page