Eyal Weiss

Orcid: 0000-0003-0508-6213

Affiliations:
  • Bar-Ilan University, Israel


According to our database1, Eyal Weiss authored at least 14 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Tightest Admissible Shortest Path.
Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

2023
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates (Student Abstract).
Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Planning with Multiple Action-Cost Estimates.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates.
CoRR, 2022

Planning with Dynamically Estimated Action Costs.
CoRR, 2022

Position Paper: Online Modeling for Offline Planning.
CoRR, 2022

2021
Is My System of ODEs k-Cooperative?
IEEE Control. Syst. Lett., 2021

A generalization of linear positive systems with applications to nonlinear systems: Invariant sets and the Poincaré-Bendixson property.
Autom., 2021

2019
A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks.
IEEE Trans. Autom. Control., 2019

Output Selection and Observer Design for Boolean Control Networks: A Sub-Optimal Polynomial-Complexity Algorithm.
IEEE Control. Syst. Lett., 2019

A Generalization of Linear Positive Systems.
Proceedings of the 27th Mediterranean Conference on Control and Automation, 2019

2018
Minimal controllability of conjunctive Boolean networks is NP-complete.
Autom., 2018

A Generalization of Smillie's Theorem on Strongly Cooperative Tridiagonal Systems.
Proceedings of the 57th IEEE Conference on Decision and Control, 2018


  Loading...