1 code implementation • 27 Mar 2024 • Ahmad Hafez, Frank J. Jiang, Karl H. Johansson, Amr Alanwar
To address this, we formulate constrained polynomial logical zonotopes, which maintain the computational efficiency and exactness of polynomial logical zonotopes for reachability analysis while supporting exact intersections.
1 code implementation • 21 Jun 2021 • Ahmad Hafez, Atulya Praphul, Yousef Jaradt, Ezani Godwin
Learning node representations on temporal graphs is a fundamental step to learn real-word dynamic graphs efficiently.