57 citations · 190 across the 12 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2023
Tightest Admissible Shortest Path
Eyal Weiss, Ariel Felner, Gal A. Kaminka
The shortest path problem in graphs is fundamental to AI. Nearly all variants of the problem and relevant algorithms that solve them ignore edge-weight computation time and its com…
cs.DS2022★ 3 cited
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates
Eyal Weiss, Ariel Felner, Gal A. Kaminka
The shortest path problem in graphs is a cornerstone of AI theory and applications. Existing algorithms generally ignore edge weight computation time. We present a generalized fram…
cs.DS2017★ 52 cited
Minimal Controllability of Conjunctive Boolean Networks is NP-Complete
Eyal Weiss, Michael Margaliot, Guy Even
Given a conjunctive Boolean network (CBN) with state-variables, we consider the problem of finding a minimal set of state-variables to directly affect with an input so that the…