@article{liu2025prada, title={PRADA: Prompt-guided Representation Alignment and Dynamic Adaption for time series forecasting}, author={Liu, Yinhao and Kuang, Zhenyu and Zhang, Hongyang and Li, Chen ...

Abstract: The 0-1 Knapsack Problem (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in ...

Abstract: In the context of maintaining a constant total running time for the entire line, current strategies for running time allocation fail to achieve optimal total energy consumption. Furthermore, ...