湿润 发表于 2025-3-28 18:38:48

,Maximizing the Number of Satisfied Charging Demands in Electric Vehicle Charging Scheduling Problem Electric vehicle drivers submit their charging demands. Given the limited resources, these charging demands are either accepted or rejected, and an accepted demand must be satisfied. The objective of the scheduler is to maximize the number of satisfied demands. We prove that the problem is NP-hard.

Affirm 发表于 2025-3-28 19:08:50

http://reply.papertrans.cn/17/1621/162017/162017_42.png

结构 发表于 2025-3-29 01:20:54

http://reply.papertrans.cn/17/1621/162017/162017_43.png

臭名昭著 发表于 2025-3-29 03:11:31

http://reply.papertrans.cn/17/1621/162017/162017_44.png

itinerary 发表于 2025-3-29 08:17:47

http://reply.papertrans.cn/17/1621/162017/162017_45.png

exceptional 发表于 2025-3-29 12:02:17

http://reply.papertrans.cn/17/1621/162017/162017_46.png

PAD416 发表于 2025-3-29 17:49:25

,Designing Attention Based Convolutional Neural Network (CNN) Architectures for Medical Image Classiaphy (OCT)) is a challenging task due to changing clinical environment and varying noise levels. Manually designing deep learning architectures is a tedious task. However, Neural Architecture Search (NAS) provides the flexibility to automatically search for a suitable architecture for a given proble

parasite 发表于 2025-3-29 20:50:40

,A Multi-objective 3D Offline UAV Path Planning Problem with Variable Flying Altitude,urban environment that is replete with static obstacles. The environment is decomposed into several equal-sized ground cells with an infinite flying altitude. The UAV can adjust the altitude to fly above obstacles or bypass them by choosing another way. Various cells may have different flying risks

aviator 发表于 2025-3-30 00:49:04

http://reply.papertrans.cn/17/1621/162017/162017_49.png

COLIC 发表于 2025-3-30 04:04:02

http://reply.papertrans.cn/17/1621/162017/162017_50.png
页: 1 2 3 4 [5] 6
查看完整版本: Titlebook: Artificial Evolution; 15th International C Pierrick Legrand,Arnaud Liefooghe,Evelyne Lutton Conference proceedings 2023 The Editor(s) (if a