default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShahaf S. Shperberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Andrea Soltoggio
, Eseoghene Ben-Iwhiwhu, Vladimir Braverman, Eric Eaton, Benjamin Epstein, Yunhao Ge, Lucy Halperin, Jonathan P. How, Laurent Itti, Michael A. Jacobs, Pavan Kantharaju, Long Le, Steven Lee, Xinran Liu, Sildomar T. Monteiro, David Musliner, Saptarshi Nath, Priyadarshini Panda, Christos Peridis, Hamed Pirsiavash, Vishwa S. Parekh, Kaushik Roy, Shahaf S. Shperberg, Hava T. Siegelmann, Peter Stone, Kyle Vedder, Jingfeng Wu, Lin Yang, Guangyao Zheng, Soheil Kolouri:
A collective AI via lifelong learning and sharing at the edge. Nat. Mac. Intell. 6(3): 251-264 (2024)- [j3]Laszlo Szoke, Shahaf S. Shperberg, Jarrett Holtz, Alessandro Allievi:
Adaptive Curriculum Learning With Successor Features for Imbalanced Compositional Reward Functions. IEEE Robotics Autom. Lett. 9(6): 5174-5181 (2024) - [c38]Daniel Koyfman, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner:
Minimizing State Exploration While Searching Graphs with Unknown Obstacles. AAMAS 2024: 1038-1046 - [c37]Shahaf S. Shperberg, Bo Liu, Peter Stone:
Relaxed Exploration Constrained Reinforcement Learning. AAMAS 2024: 1727-1735 - [c36]Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant:
On Parallel External-Memory Bidirectional Search. ECAI 2024: 4190-4197 - [c35]Andrew Coles, Erez Karpas, Andrey Lavrinenko, Wheeler Ruml, Solomon Eyal Shimony, Shahaf S. Shperberg:
Planning and Acting While the Clock Ticks. ICAPS 2024: 95-103 - [c34]Shawn Skyler, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner, Oren Salzman, Shao-Hung Chan, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernández Ulloa:
Theoretical Study on Multi-objective Heuristic Search. IJCAI 2024: 7021-7028 - [c33]Shahaf S. Shperberg, Ariel Felner, Lior Siag, Nathan R. Sturtevant:
On the Properties of All-Pair Heuristics. SOCS 2024: 127-133 - [c32]Yarin Benyamin, Argaman Mordoch, Shahaf S. Shperberg, Wiktor Piotrowski, Roni Stern:
Crafting a Pogo Stick in Minecraft with Heuristic Search (Extended Abstract). SOCS 2024: 261-262 - [c31]Daniel Koyfman, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner:
Minimizing State Exploration While Searching Graphs with Unknown Obstacles (Extended Abstract). SOCS 2024: 273-274 - [c30]Sean Mariasin, Andrew Coles, Erez Karpas, Wheeler Ruml, Solomon Eyal Shimony, Shahaf S. Shperberg:
Evaluating Distributional Predictions of Search Time: Put Up or Shut Up Games (Extended Abstract). SOCS 2024: 277-278 - [c29]Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant:
On Parallel External-Memory Bidirectional Search (Extended Abstract). SOCS 2024: 283-284 - [i4]Andrew Coles, Erez Karpas, Andrey Lavrinenko, Wheeler Ruml, Solomon Eyal Shimony, Shahaf S. Shperberg:
Planning and Acting While the Clock Ticks. CoRR abs/2403.14796 (2024) - 2023
- [j2]Dor Atzmon, Ariel Felner, Jiaoyang Li, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig:
Conflict-tolerant and conflict-free multi-agent meeting. Artif. Intell. 322: 103950 (2023) - [c28]Amihay Elboher, Ava Bensoussan, Erez Karpas, Wheeler Ruml, Shahaf S. Shperberg, Solomon Eyal Shimony:
A Formal Metareasoning Model of Concurrent Planning and Execution. AAAI 2023: 12427-12435 - [c27]Dor Atzmon, Shahaf S. Shperberg, Netanel Sabah, Ariel Felner, Nathan R. Sturtevant:
W-restrained Bidirectional Bounded-Suboptimal Heuristic Search. ICAPS 2023: 26-30 - [c26]Shahaf S. Shperberg, Bo Liu, Peter Stone:
Relaxed Exploration Constrained Reinforcement Learning. AAMAS 2023: 2821-2823 - [c25]Zifan Xu, Yulin Zhang, Shahaf S. Shperberg, Reuth Mirsky, Yuqian Jiang, Bo Liu, Peter Stone:
Model-Based Meta Automatic Curriculum Learning. CoLLAs 2023: 846-860 - [c24]Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant:
Front-to-End Bidirectional Heuristic Search with Consistent Heuristics: Enumerating and Evaluating Algorithms and Bounds. IJCAI 2023: 5631-5638 - [c23]Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant:
Comparing Front-to-Front and Front-to-End Heuristics in Bidirectional Search. SOCS 2023: 158-162 - [c22]Shawn Skyler, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner, Oren Salzman, Shao-Hung Chan, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernández Ulloa:
Must-Expand Nodes in Multi-Objective Search [Extended Abstract]. SOCS 2023: 183-184 - [i3]Amihay Elboher, Ava Bensoussan, Erez Karpas, Wheeler Ruml, Shahaf S. Shperberg, Solomon Eyal Shimony:
A Formal Metareasoning Model of Concurrent Planning and Execution. CoRR abs/2303.02664 (2023) - [i2]Argaman Mordoch, Shahaf S. Shperberg, Roni Stern, Brendan Juba:
Enhancing Numeric-SAM for Learning with Few Observations. CoRR abs/2312.10705 (2023) - 2022
- [c21]Shahaf S. Shperberg, Bo Liu, Alessandro Allievi, Peter Stone:
A Rule-based Shield: Accumulating Safety Rules from Catastrophic Action Effects. CoLLAs 2022: 231-242 - [c20]Tianyi Gu, Wheeler Ruml, Shahaf S. Shperberg, Solomon Eyal Shimony, Erez Karpas:
When to Commit to an Action in Online Planning and Search. SOCS 2022: 83-90 - [i1]Shahaf S. Shperberg, Bo Liu, Peter Stone:
Learning a Shield from Catastrophic Action Effects: Never Repeat the Same Mistake. CoRR abs/2202.09516 (2022) - 2021
- [c19]Shahaf S. Shperberg, Steven Danishevski, Ariel Felner, Nathan R. Sturtevant:
Iterative-deepening Bidirectional Heuristic Search with Restricted Memory. ICAPS 2021: 331-339 - [c18]Shahaf S. Shperberg, Andrew Coles, Erez Karpas, Wheeler Ruml, Solomon Eyal Shimony:
Situated Temporal Planning Using Deadline-aware Metareasoning. ICAPS 2021: 340-348 - [c17]Ariel Felner, Shahaf S. Shperberg, Hadar Buzhish:
The Closed List is an Obstacle Too. SOCS 2021: 121-125 - [c16]Amihay Elboher, Shahaf S. Shperberg, Solomon Eyal Shimony:
Metareasoning for Interleaved Planning and Execution. SOCS 2021: 167-169 - [c15]Shahaf S. Shperberg, Steven Danishevski, Ariel Felner, Nathan R. Sturtevant:
Iterative-Deepening Bidirectional Heuristic Search with Restricted Memory. SOCS 2021: 194-196 - [c14]Shahaf S. Shperberg:
Meta-level Techniques for Planning, Search, and Scheduling. SOCS 2021: 236-238 - 2020
- [c13]Nathan R. Sturtevant, Shahaf S. Shperberg, Ariel Felner, Jingwei Chen:
Predicting the Effectiveness of Bidirectional Heuristic Search. ICAPS 2020: 281-290 - [c12]Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig:
Multi-Directional Heuristic Search. IJCAI 2020: 4062-4068 - [c11]Shahaf S. Shperberg, Andrew Coles, Erez Karpas, Solomon Eyal Shimony, Wheeler Ruml:
Trading Plan Cost for Timeliness in Situated Temporal Planning. IJCAI 2020: 4176-4182 - [c10]Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant, Solomon Eyal Shimony, Avi Hayoun:
Bidirectional Heuristic Search: Expanding Nodes by a Lower Bound. IJCAI 2020: 4775-4779 - [c9]Shahaf S. Shperberg, Ariel Felner:
On the Differences and Similarities of fMM and GBFHS. SOCS 2020: 66-74 - [c8]Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig:
Multi-Directional Search. SOCS 2020: 121-122
2010 – 2019
- 2019
- [c7]Shahaf S. Shperberg, Andrew Coles, Bence Cserna, Erez Karpas, Wheeler Ruml, Solomon Eyal Shimony:
Allocating Planning Effort When Actions Expire. AAAI 2019: 2371-2378 - [c6]Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant, Solomon Eyal Shimony, Avi Hayoun:
Enriching Non-Parametric Bidirectional Search Algorithms. AAAI 2019: 2379-2386 - [c5]Shahaf S. Shperberg, Solomon Eyal Shimony, Avinoam Yehezkel:
Algorithm Selection in Optimization and Application to Angry Birds. ICAPS 2019: 437-445 - [c4]Shahaf S. Shperberg, Ariel Felner, Solomon Eyal Shimony, Nathan R. Sturtevant, Avi Hayoun:
Improving Bidirectional Heuristic Search by Bounds Propagation. SOCS 2019: 106-114 - [c3]Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant, Solomon Eyal Shimony, Avi Hayoun:
Enriching Non-Parametric Bidirectional Search Algorithms - Extended Abstract. SOCS 2019: 196-197 - 2017
- [j1]Shahaf S. Shperberg, Solomon Eyal Shimony:
Some Properties of Batch Value of Information in the Selection Problem. J. Artif. Intell. Res. 58: 777-796 (2017) - [c2]Shahaf S. Shperberg, Solomon Eyal Shimony:
Some Properties of Batch Value of Information in the Selection Problem (Extended Abstract). IJCAI 2017: 5065-5069 - [c1]Shahaf S. Shperberg, Solomon Eyal Shimony, Ariel Felner:
Monte-Carlo Tree Search using Batch Value of Perfect Information. UAI 2017
Coauthor Index
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-28 20:10 CET 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:
