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

Thanks to the impressive planning, reasoning, and tool-calling capabilities of Large Language Models (LLMs), people are actively studying and developing LLM-powered agents. These agents are possible ...

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

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

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

Prediction of combustion-related properties of (oxygenated) hydrocarbons is an important and challenging task for which quantitative structure–property relationship (QSPR) models are frequently ...