Results 271 to 280 of about 61,394 (313)
LLM-Conductor: A Closed-Loop Resource-Adaptive Architecture for Secure LLM Deployment in Industrial Sensor Networks and IIoT Systems. [PDF]
Sensors (Basel)Xu K, Zhang D, Wang X.
europepmc +1 more source
Dynamic job-shop scheduling using reinforcement learning agents
Robotics and Autonomous Systems, 2000 Static and dynamic scheduling methods have attracted a lot of attention in recent years. Among these, dynamic scheduling techniques handle scheduling problems where the scheduler does not possess detailed information about the jobs, which may arrive at ...
Mehmet Emin Aydin, Ercan Oztemel
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Transportation Science, 2009
Demand stochasticity is a major challenge for the airlines in their quest to produce profit maximizing schedules. Even with an optimized schedule, many flights on departure have empty seats while others suffer a lack of seats to accommodate passengers who desire to travel.
Hai Jiang 0002, Cynthia Barnhart
openaire +1 more source
Demand stochasticity is a major challenge for the airlines in their quest to produce profit maximizing schedules. Even with an optimized schedule, many flights on departure have empty seats while others suffer a lack of seats to accommodate passengers who desire to travel.
Hai Jiang 0002, Cynthia Barnhart
openaire +1 more source
Dynamics in scheduled networks
Chaos: An Interdisciplinary Journal of Nonlinear Science, 2009When studying real or virtual systems through complex networks theories, usually time restrictions are neglected, and a static structure is defined to characterize which node is connected to which other. However, this approach is oversimplified, as real networks are indeed dynamically modified by external mechanisms. In order to bridge the gap, in this
Massimiliano, Zanin +2 more
openaire +2 more sources
Dynamic Scheduling on Heterogeneous Multicores
2019 Design, Automation & Test in Europe Conference & Exhibition (DATE), 2019Heterogeneous multicore systems can help adherence to design goals by providing a diverse set of hardware components to meet application requirements. Each core may also have tunable hardware that can reconfigured for different applications. However, scheduling becomes difficult in the presence of tunable hardware due to the additional constraint that ...
Ruben Vazquez +3 more
openaire +1 more source
Dynamic Journeying in Scheduled Networks
IEEE Transactions on Intelligent Transportation Systems, 2013We study a dynamic-journey planning problem for multimodal transportation networks. The goal is to find a journey, possibly involving transfers between different transport modes, from a given origin to a given destination within a specified time horizon.
Hakula, Harri, Hame, Lauri
openaire +2 more sources
23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002., 2003
We present an approach to computing cyclic schedules online and in real time, while attempting to maximize a quality-of-service metric. The motivation is the detection of RF emitters using a schedule that controls the scanning of disjoint frequency bands.
openaire +1 more source
We present an approach to computing cyclic schedules online and in real time, while attempting to maximize a quality-of-service metric. The motivation is the detection of RF emitters using a schedule that controls the scanning of disjoint frequency bands.
openaire +1 more source
1999
In parallel and distributed computing scheduling low level tasks on the available hardware is a fundamental problem. Traditionally, one has assumed that the set of tasks to be executed is known beforehand. Then the scheduling constraints are given by a precedence graph. Nodes represent the elementary tasks and edges the dependencies among tasks.
Andreas Jakoby +2 more
openaire +1 more source
In parallel and distributed computing scheduling low level tasks on the available hardware is a fundamental problem. Traditionally, one has assumed that the set of tasks to be executed is known beforehand. Then the scheduling constraints are given by a precedence graph. Nodes represent the elementary tasks and edges the dependencies among tasks.
Andreas Jakoby +2 more
openaire +1 more source