57 citations · 190 across the 12 of their papers we have counts for
12 papers
Cost-Sensitive Neighborhood Aggregation for Heterophilous Graphs: When Does Per-Edge Routing Help?
Eyal Weiss
Recent work distinguishes two heterophily regimes: adversarial, where cross-class edges dilute class signal and harm classification, and informative, where the heterophilous struct…
Generalizing Multi-Objective Search via Objective-Aggregation Functions
Hadar Peer, Eyal Weiss, Ron Alterovitz +1
Multi-objective search (MOS) has become essential in robotics, as real-world robotic systems need to simultaneously balance multiple, often conflicting objectives. Recent works exp…
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…
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…
Position Paper: Online Modeling for Offline Planning
Eyal Weiss, Gal A. Kaminka
The definition and representation of planning problems is at the heart of AI planning research. A key part is the representation of action models. Decades of advances improving dec…
Planning with Dynamically Estimated Action Costs
Eyal Weiss, Gal A. Kaminka
Information about action costs is critical for real-world AI planning applications. Rather than rely solely on declarative action models, recent approaches also use black-box exter…
Is my system of ODEs -cooperative?
Eyal Weiss, Michael Margaliot
A linear dynamical system is called positive if its flow maps the non-negative orthant to itself. More precisely, it maps the set of vectors with zero sign variations to itself. A…
A Generalization of Linear Positive Systems with Applications to Nonlinear Systems: Invariant Sets and the Poincaré-Bendixson Property
Eyal Weiss, Michael Margaliot
The dynamics of linear positive systems map the positive orthant to itself. In other words, it maps a set of vectors with zero sign variations to itself. This raises the following…
A Generalization of Smillie's Theorem on Strongly Cooperative Tridiagonal Systems
Eyal Weiss, Michael Margaliot
Smillie (1984) proved an interesting result on the stability of nonlinear, time-invariant, strongly cooperative, and tridiagonal dynamical systems. This result has found many appli…
Output Selection and Observer Design for Boolean Control Networks: A Sub-Optimal Polynomial-Complexity Algorithm
Eyal Weiss, Michael Margaliot
Using a graph-theoretic approach, we derive a new sufficient condition for observability of a Boolean control network (BCN). Based on this condition, we describe two algorithms: th…
A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks
Eyal Weiss, Michael Margaliot
Many complex systems in biology, physics, and engineering include a large number of state-variables, and measuring the full state of the system is often impossible. Typically, a se…
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…