Abstract: Based on Storage Time Aggregated Graph (STAG) model in time-varying graph theory, we investigate the single-source-single-sink maximum flow problem in a time-varying Ad hoc network comprised ...

There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience. We introduce the Multi-Objective ...

In response to the challenge of rapid unmanned aerial vehicles (UAV) path planning for bridge construction in complex terrain, this paper presents an enhanced snake optimization (CSGLSO) UAV ...

Collision-free path planning and task scheduling optimization in multi-region operations of autonomous agricultural robots present a complex coupled problem. In addition to considering task access ...

Multi-objective scheduling problems in workshops are commonly encountered challenges in the increasingly competitive market economy. These scheduling problems require a trade-off among multiple ...

Download PDF Join the Discussion View in the ACM Digital Library The maximum flow problem and its generalization, the minimum-cost flow problem, are classic combinatorial graph problems that find ...

Finding bipartite matchings is one of the oldest and most well-studied problems in computer science. This problem comes up in many guises, such as when matching donors to recipients for organ ...

Aug 2: I'll have 2-hour office hours on Wed, Aug 7, 11:30-13:30. Aug 2: The final exam on Aug 9 will be on all topics of the course, with equal emphasis. You'll have 3 hours for an exam that will be ...

Abstract: In this paper, we investigate the maximum flow routing strategy with the service function chain (SFC) constraints in the space information networks (SINs), where a SFC consists of a specific ...

You are free to share (copy and redistribute) this article in any medium or format and to adapt (remix, transform, and build upon) the material for any purpose, even commercially within the parameters ...

Reinforcement Learning (RL) controllers have proved to effectively tackle the dual objectives of path following and collision avoidance. However, finding which RL algorithm setup optimally trades off ...