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 ...

Abstract: An Undirected Storage Time Aggregated Graph (US TAG) model is proposed for solving the maximum flow problem in Unmanned Surface Vessel (USV) networks. Considering the time-varying ...

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: 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 ...

With this project we researched, implemented and analyzed different algorithms to effectively and efficiently solve an NP-Complete problem such as the Minimum Vertex Cover (MVC).

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 ...

Swimming microorganisms and migrating cells have developed various strategies in order to move in nutrient-rich or other chemical environments. We apply a genetic algorithm to the internal ...

The conformational change associated with membrane fusion for Influenza A Hemagglutinin is investigated with a model based upon pre- and post-fusion structures of the HA2 component. We employ ...