Search Results for author:
Found 1 papers, 0 papers with code
Catch Me if You Can: Effective Honeypot Placement in Dynamic AD Attack Graphs
To solve the dynamic graph problem, we re-design the mixed-integer programming formulation by combining m MIP (dyMIP(m)) instances to produce a near-optimal blocking plan.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
