![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Meir Goldenberg
Person information
- affiliation: Jerusalem College of Technology
- affiliation (former): Ben-Gurion University of the Negev, Beersheba, Israel
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c19]Meir Goldenberg, Loay Mualem, Amit Shahar, Sagi Snir, Adi Akavia:
Privacy Preserving Epigenetic PaceMaker: Stronger Privacy and Improved Efficiency. RECOMB 2024: 412-416 - 2022
- [c18]Meir Goldenberg, Sagi Snir, Adi Akavia
:
Private Epigenetic PaceMaker Detector Using Homomorphic Encryption - Extended Abstract. ISBRA 2022: 52-61 - [i1]Meir Goldenberg:
ExpoCloud: a Framework for Time and Budget-Effective Parameter Space Explorations Using a Cloud Compute Engine. CoRR abs/2208.12195 (2022) - 2021
- [j6]Roni Stern
, Meir Goldenberg, Abdallah Saffidine, Ariel Felner:
Heuristic search for one-to-many shortest path queries. Ann. Math. Artif. Intell. 89(12): 1175-1214 (2021)
2010 – 2019
- 2019
- [j5]Meir Goldenberg:
LiteRef: A software system for managing the knowledge of research literature. Knowl. Based Syst. 174: 1-3 (2019) - 2018
- [c17]Meir Goldenberg:
Extended Abstract: The Heuristic Search Research Framework. SOCS 2018: 186-187 - 2017
- [j4]Meir Goldenberg, Ariel Felner
, Alon Palombo, Nathan R. Sturtevant, Jonathan Schaeffer:
The compressed differential heuristic. AI Commun. 30(6): 393-418 (2017) - [j3]Meir Goldenberg:
The Heuristic Search Research Framework. Knowl. Based Syst. 129: 1-3 (2017) - [c16]Ariel Felner, Roni Stern, Solomon Eyal Shimony, Eli Boyarski, Meir Goldenberg, Guni Sharon, Nathan R. Sturtevant, Glenn Wagner, Pavel Surynek:
Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges. SOCS 2017: 29-37 - [c15]Roni Tzvi Stern, Meir Goldenberg, Ariel Felner:
Shortest Path for K Goals. SOCS 2017: 167-168 - 2014
- [j2]Meir Goldenberg, Ariel Felner, Roni Stern, Guni Sharon, Nathan R. Sturtevant, Robert C. Holte, Jonathan Schaeffer:
Enhanced Partial Expansion A. J. Artif. Intell. Res. 50: 141-187 (2014) - 2013
- [j1]Guni Sharon, Roni Stern
, Meir Goldenberg, Ariel Felner
:
The increasing cost tree search for optimal multi-agent pathfinding. Artif. Intell. 195: 470-495 (2013) - [c14]Meir Goldenberg, Ariel Felner, Nathan R. Sturtevant, Robert C. Holte, Jonathan Schaeffer:
Optimal-Generation Variants of EPEA. SOCS 2013: 89-97 - 2012
- [c13]Ariel Felner, Meir Goldenberg, Guni Sharon, Roni Stern, Tal Beja, Nathan R. Sturtevant, Jonathan Schaeffer, Robert Holte:
Partial-Expansion A* with Selective Node Generation. AAAI 2012: 471-477 - [c12]Meir Goldenberg, Ariel Felner, Roni Stern, Guni Sharon, Jonathan Schaeffer:
A* Variants for Optimal Multi-Agent Pathfinding. MAPF@AAAI 2012 - [c11]Meir Goldenberg, Ariel Felner, Roni Stern, Jonathan Schaeffer:
A* Variants for Optimal Multi-Agent Pathfinding. SOCS 2012: 157-158 - [c10]Ariel Felner, Meir Goldenberg, Guni Sharon, Roni Stern, Tal Beja, Nathan R. Sturtevant, Robert Holte, Jonathan Schaeffer:
Partial-Expansion A* with Selective Node Generation. SOCS 2012: 180-181 - 2011
- [c9]Meir Goldenberg, Nathan R. Sturtevant, Ariel Felner, Jonathan Schaeffer:
The Compressed Differential Heuristic. AAAI 2011: 24-29 - [c8]Guni Sharon, Roni Stern
, Meir Goldenberg, Ariel Felner
:
The Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding. IJCAI 2011: 662-667 - [c7]Guni Sharon, Roni Tzvi Stern, Meir Goldenberg, Ariel Felner:
Pruning Techniques for the Increasing Cost Tree Search for Optimal Multi-agent Pathfinding. SOCS 2011: 150-157 - [c6]Meir Goldenberg, Nathan R. Sturtevant, Ariel Felner, Jonathan Schaeffer:
The Compressed Differential Heuristic. SOCS 2011: 191-192 - 2010
- [c5]Meir Goldenberg, Ariel Felner, Nathan R. Sturtevant, Jonathan Schaeffer:
Portal-Based True-Distance Heuristics for Path Finding. SOCS 2010: 39-45
2000 – 2009
- 2004
- [c4]Morgan Kan, Danny Ngo, Mark Lee, Paul Lu, Nolan Bard, Michael Closson, Meng Ding, Mark Goldenberg, Nicholas Lamb, Yang Wang, Ron Senda, Edmund Sumbar:
The Trellis Security Infrastructure: A Layered Approach to Overlay Metacomputers . HPCS 2004: 109-117 - 2003
- [c3]Mark Goldenberg, Alexander Kovarsky, Xiaomeng Wu, Jonathan Schaeffer:
Multiple Agents Moving Target Search. IJCAI 2003: 1536-1538 - [c2]Mark Goldenberg, Paul Lu, Jonathan Schaeffer:
TrellisDAG: A System for Structured DAG Scheduling. JSSPP 2003: 21-43 - 2002
- [c1]Christopher Pinchak, Paul Lu, Mark Goldenberg:
Practical Heterogeneous Placeholder Scheduling in Overlay Metacomputers: Early Experiences. JSSPP 2002: 205-228
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-06-05 21:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint