Zobrazeno 1 - 10
of 157
pro vyhledávání: '"De Meng"'
Publikováno v:
IEEE Access, Vol 12, Pp 135831-135853 (2024)
The dimension of the operational-fixed-interval-scheduling-problem-modeled (OFISP-modeled) $\mathcal {NP}$ -hard satellite range scheduling problem (SRSP) extends rather than expands especially in large cases. This feature inspires us with the chain-
Externí odkaz:
https://doaj.org/article/cf48d78a806f4f4097020a2f438a7669
Publikováno v:
IEEE Access, Vol 11, Pp 7727-7738 (2023)
This paper studied a novel parallel machine rescheduling problem with controllable processing times under machine breakdown and precedence constraints. This problem is strongly $\mathcal {NP}$ -hard, and we modeled it as a mixed-integer problem (MIP)
Externí odkaz:
https://doaj.org/article/c420d9c6257240a084cce0c1f55a5f09
Publikováno v:
IEEE Access, Vol 7, Pp 60672-60683 (2019)
Uploading virtual reality (VR) video over cellular networks is expected to boom in the near future, as general consumers could generate the high-quality VR videos with portable 360-degree cameras and are willing to share with others. Consequently, th
Externí odkaz:
https://doaj.org/article/ce0e413bb0584fe596c1ff897aca953e
Publikováno v:
IEEE Access, Vol 6, Pp 3387-3399 (2018)
Recently, vehicle to everything (V2X) communications have drawn a significant amount of attention. Emerging V2X applications demand the efficient utilization of heterogeneous access technologies, such as long-term evolution (LTE), Wi-Fi, and dedicate
Externí odkaz:
https://doaj.org/article/5c3a0364044c498988703aa8ff1ca78a
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.