Zobrazeno 1 - 10
of 72
pro vyhledávání: '"Ruey-Maw Chen"'
Autor:
Yin-Mou Shen, Ruey-Maw Chen
Publikováno v:
Advances in Mechanical Engineering, Vol 9 (2017)
The depot locations have a significant effect on the transportation cost in the multi-depot vehicle routing problem. A two-tier particle swarm optimization framework is proposed, in which an external particle swarm optimization and an internal partic
Externí odkaz:
https://doaj.org/article/ed675a1e6dc14eb0b47020907b5535dd
Autor:
Hsiao-Fang Shih, Ruey-Maw Chen
Publikováno v:
Algorithms, Vol 6, Iss 2, Pp 227-244 (2013)
Course timetabling is a combinatorial optimization problem and has been confirmed to be an NP-complete problem. Course timetabling problems are different for different universities. The studied university course timetabling problem involves hard cons
Externí odkaz:
https://doaj.org/article/e93a17a5c9a34d859d4c73bfeadb7224
Autor:
Ruey-Maw Chen, Yin-Mou Shen
Publikováno v:
Advances in Mechanical Engineering, Vol 8 (2016)
Many machinery manufacturings are categorized as multi-mode resource-constrained project scheduling problems which have attracted significant interest in recent years. It has been shown that such problems are non-deterministic polynomial-time-hard. P
Externí odkaz:
https://doaj.org/article/f90628e9009a4537ad9ca1f7cb645339
Autor:
Ruey-Maw Chen, Chuin-Mu Wang
Publikováno v:
Abstract and Applied Analysis, Vol 2011 (2011)
The task scheduling problem has been widely studied for assigning resources to tasks in heterogeneous grid environment. Effective task scheduling is an important issue for the performance of grid computing. Meanwhile, the task scheduling problem is a
Externí odkaz:
https://doaj.org/article/8534d3749d544bedba3e73838bdc07df
Autor:
Ruey-Maw Chen, 陳瑞茂
88
Many applications involve the concept of scheduling. Most scheduling applications have been demonstrated as NP-complete problems. A variety of schemes are introduced in solving these scheduling applications, such as artificial intelligence, l
Many applications involve the concept of scheduling. Most scheduling applications have been demonstrated as NP-complete problems. A variety of schemes are introduced in solving these scheduling applications, such as artificial intelligence, l
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/13761442872747569571
Autor:
Hong-Yu Chuang, Ruey-Maw Chen
Publikováno v:
Sensors & Materials; 2024, Vol. 36 Issue 3, Part 3, p1035-1046, 12p
Autor:
Chia-Ju Lin, Ruey-Maw Chen
Publikováno v:
2021 IEEE/ACIS 22nd International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD).
Publikováno v:
Sensors and Materials. 34:2391
Publikováno v:
Computers & Electrical Engineering. 58:489-501
MRI has been a rather important imaging technique in clinical diagnosis in recent years. In particular, brain parenchyma classification and segmentation of normal and pathological tissue is the first step of addressing a wide range of clinical proble
Autor:
Po-Jen Fang, Ruey-Maw Chen
Publikováno v:
SNPD
The vehicle routing problem with simultaneous pickups and deliveries (VRPSPD) considers the delivery and pickup demands problem in the vehicle routing problem (VRP), so the customers allocated to the vehicle should not exceed the vehicle carrying cap