Follow
Eyal Weiss
Eyal Weiss
PhD student of Computer Science, Bar-Ilan University
Verified email at cs.biu.ac.il - Homepage
Title
Cited by
Cited by
Year
A polynomial-time algorithm for solving the minimal observability problem in conjunctive Boolean networks
E Weiss, M Margaliot
IEEE Transactions on Automatic Control 64 (7), 2727-2736, 2018
502018
Minimal controllability of conjunctive Boolean networks is NP-complete
E Weiss, M Margaliot, G Even
Automatica 92, 56-62, 2018
472018
A generalization of linear positive systems with applications to nonlinear systems: Invariant sets and the Poincaré–Bendixson property
E Weiss, M Margaliot
Automatica 123, 109358, 2021
282021
Output Selection and Observer Design for Boolean Control Networks: A Sub-Optimal Polynomial-Complexity Algorithm
E Weiss, M Margaliot
IEEE control systems letters 3 (1), 210-215, 2018
202018
Is My System of ODEs k-Cooperative?
E Weiss, M Margaliot
IEEE Control Systems Letters 5 (1), 73-78, 2020
92020
A Generalization of Smillie's Theorem on Strongly Cooperative Tridiagonal Systems
E Weiss, M Margaliot
2018 IEEE Conference on Decision and Control, 2018
52018
A Generalization of Linear Positive Systems
E Weiss, M Margaliot
27th Mediterranean Conference on Control and Automation (MED), 2019
32019
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates
E Weiss, A Felner, GA Kaminka
Proceedings of the European Conference on Artificial Intelligence 372, 2607-2614, 2023
22023
Planning with Multiple Action-Cost Estimates
E Weiss, GA Kaminka
Proceedings of the International Conference on Automated Planning and …, 2023
22023
Position Paper: Online Modeling for Offline Planning
E Weiss, GA Kaminka
ICAPS 2022 Workshop on Reliable Data-Driven Planning and Scheduling, 2022
22022
A Generalization of Automated Planning Using Dynamically Estimated Action Models–Dissertation Abstract
E Weiss
Proceedings of the 20th ICAPS Doctoral Consortium (ICAPS DC 2022), 1--3, 2022
22022
Planning with Dynamically Estimated Action Costs
E Weiss, GA Kaminka
ICAPS 2022 Workshop on Reliable Data-Driven Planning and Scheduling, 2022
12022
Tightest Admissible Shortest Path
E Weiss, A Felner, GA Kaminka
arXiv:2308.08453, 2023
2023
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates (Student Abstract)
E Weiss
Proceedings of the International Symposium on Combinatorial Search 16 (1 …, 2023
2023
Observability Analysis and Observer Design for Boolean Control Networks: A Sub-Optimal Polynomial-Complexity Algorithm
E Weiss, M Margaliot
2018 IEEE International Conference on the Science of Electrical Engineering, 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–15