default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEyal Weiss 0001
Person information
- affiliation: Bar-Ilan University, Israel
Other persons with the same name
- Eyal Weiss 0002
![[0000-0001-9511-1472]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-9511-1472")
— Applied Physics Division, Soreq NRC, Yavneh, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Eyal Weiss, Ariel Felner, Gal A. Kaminka:
Tightest Admissible Shortest Path. ICAPS 2024: 643-652- 2023
- [c5]Eyal Weiss, Gal A. Kaminka:
Planning with Multiple Action-Cost Estimates. ICAPS 2023: 427-437 - [c4]Eyal Weiss, Ariel Felner, Gal A. Kaminka:
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates. ECAI 2023: 2607-2614 - [c3]Eyal Weiss:
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates (Student Abstract). SOCS 2023: 206-207 - [i8]Eyal Weiss, Ariel Felner, Gal A. Kaminka:
Tightest Admissible Shortest Path. CoRR abs/2308.08453 (2023) - 2022
- [i7]Eyal Weiss, Gal A. Kaminka:
Position Paper: Online Modeling for Offline Planning. CoRR abs/2206.03356 (2022) - [i6]Eyal Weiss, Gal A. Kaminka:
Planning with Dynamically Estimated Action Costs. CoRR abs/2206.04166 (2022) - [i5]Eyal Weiss, Gal A. Kaminka:
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates. CoRR abs/2208.11489 (2022) - 2021
- [j5]Eyal Weiss, Michael Margaliot:
A generalization of linear positive systems with applications to nonlinear systems: Invariant sets and the Poincaré-Bendixson property. Autom. 123: 109358 (2021) - [j4]Eyal Weiss, Michael Margaliot:
Is My System of ODEs k-Cooperative? IEEE Control. Syst. Lett. 5(1): 73-78 (2021)
2010 – 2019
- 2019
- [j3]Eyal Weiss, Michael Margaliot:
Output Selection and Observer Design for Boolean Control Networks: A Sub-Optimal Polynomial-Complexity Algorithm. IEEE Control. Syst. Lett. 3(1): 210-215 (2019) - [j2]Eyal Weiss, Michael Margaliot:
A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks. IEEE Trans. Autom. Control. 64(7): 2727-2736 (2019) - [c2]Eyal Weiss, Michael Margaliot:
A Generalization of Linear Positive Systems. MED 2019: 340-345 - [i4]Eyal Weiss, Michael Margaliot:
A Generalization of Linear Positive Systems. CoRR abs/1902.01630 (2019) - 2018
- [j1]Eyal Weiss, Michael Margaliot, Guy Even:
Minimal controllability of conjunctive Boolean networks is NP-complete. Autom. 92: 56-62 (2018) - [c1]Eyal Weiss, Michael Margaliot:
A Generalization of Smillie's Theorem on Strongly Cooperative Tridiagonal Systems. CDC 2018: 3080-3085 - [i3]Eyal Weiss, Michael Margaliot:
A Generalization of Smillie's Theorem on Strongly Cooperative Tridiagonal Systems. CoRR abs/1810.09732 (2018) - 2017
- [i2]Eyal Weiss, Michael Margaliot, Guy Even:
Minimal Controllability of Conjunctive Boolean Networks is NP-Complete. CoRR abs/1704.07291 (2017) - [i1]Eyal Weiss, Michael Margaliot:
A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks. CoRR abs/1706.04072 (2017)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
