So far, running LLMs has required a large amount of computing resources, mainly GPUs. Running locally, a simple prompt with a typical LLM takes on an average Mac ...
Abstract: The distributed no-idle permutation flowshop scheduling problem (DNIPFSP) has widely existed in various manufacturing systems. The makespan and total tardiness are optimized simultaneously ...
Abstract: Motivated by modern applications such as computerized adaptive testing, sequential rank aggregation, and heterogeneous data source selection, we study the problem of active sequential ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback