default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Noa Agmon
![[0000-0003-0890-7734]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-0890-7734")
Bar-Ilan University, Computer Science Department, Ramat Gan, Israel
Likely matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 106 matches
- 2024
- Arseniy Pertzovsky, Roie Zivan
, Noa Agmon:
Collision Avoiding Max-Sum for Mobile Sensor Teams. J. Artif. Intell. Res. 79: 1281-1311 (2024) - Saar Cohen, Noa Agmon:
Near-Optimal Online Resource Allocation in the Random-Order Model. AAMAS 2024: 2219-2221 - Saar Cohen, Noa Agmon:
Online Friends Partitioning Under Uncertainty. ECAI 2024: 3332-3339 - Saar Cohen, Noa Agmon:
Online Learning of Partitions in Additively Separable Hedonic Games. IJCAI 2024: 2722-2730 - 2023
- Saar Cohen, Noa Agmon:
Complexity of Probabilistic Inference in Random Dichotomous Hedonic Games. AAAI 2023: 5573-5581 - Saar Cohen, Noa Agmon:
Online Coalitional Skill Formation. AAMAS 2023: 494-503 - Gilad Fine, Dor Atzmon, Noa Agmon:
Anonymous Multi-Agent Path Finding with Individual Deadlines. AAMAS 2023: 869-877 - Arseni Pertzovskiy, Roie Zivan, Noa Agmon:
CAMS: Collision Avoiding Max-Sum for Mobile Sensor Teams. AAMAS 2023: 104-112 - Lital Kuchy, Ran Levy, Avihai Mejer, Noam Segev, Shunit Agmon, Miriam Farber:
Generating Product Insights from Community Q&A. CIKM 2023: 4660-4666 - Alon Shats, Michael Amir, Noa Agmon:
Competitive Ant Coverage: The Value of Pursuit. IROS 2023: 6733-6740 - Yair Korngut, Noa Agmon:
Multi-Robot Heterogeneous Adversarial Coverage. MRS 2023: 100-106 - Noa Agmon, Bo An, Alessandro Ricci, William Yeoh:
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2023, London, United Kingdom, 29 May 2023 - 2 June 2023. ACM 2023, ISBN 978-1-4503-9432-1 [contents] - 2022
- Michael Amir, Noa Agmon, Alfred M. Bruckstein:
A Locust-Inspired Model of Collective Marching on Rings. Entropy 24(7): 918 (2022) - Saar Cohen, Noa Agmon:
Optimizing Multi-Agent Coordination via Hierarchical Graph Probabilistic Recursive Reasoning. AAMAS 2022: 290-299 - Ori Fogler, Noa Agmon:
Multi-Robot Dynamic Swarm Disablement. IROS 2022: 13722-13729 - Mor Sinay, Noa Agmon, Oleg Maksimov, Aviad Fux, Sarit Kraus:
Uncertainty with UAV Search of Multiple Goal-oriented Targets. CoRR abs/2203.09476 (2022) - Lior Moshe, Noa Agmon:
Too Global To Be Local: Swarm Consensus in Adversarial Settings. CoRR abs/2209.08587 (2022) - 2021
- Saar Cohen, Noa Agmon:
Spatial Consensus-Prevention in Robotic Swarms. AAMAS 2021: 359-367 - Michael Amir, Noa Agmon, Alfred M. Bruckstein:
A Discrete Model of Collective Marching on Rings. DARS 2021: 320-334 - Nofar Menashe, Noa Agmon:
Leading a Swarm with Signals. DARS 2021: 16-30 - Saar Cohen, Noa Agmon:
Convexified Graph Neural Networks for Distributed Control in Robotic Swarms. IJCAI 2021: 2307-2313 - Eyal Zehavi, Noa Agmon:
Hybrid Path Planning for UAV Traffic Management. IROS 2021: 6427-6433 - 2020
- Yaniv Oshrat, Noa Agmon, Sarit Kraus:
Adversarial Fence Patrolling: Non-Uniform Policies for Asymmetric Environments. AAAI 2020: 10377-10384 - Yaniv Oshrat, Noa Agmon, Sarit Kraus:
Non-Uniform Policies for Multi-Robot Asymmetric Perimeter Patrol in Adversarial Domains. AAMAS 2020: 983-991 - Elad Sarafian, Mor Sinay, Yoram Louzoun, Noa Agmon, Sarit Kraus:
Explicit Gradient Learning for Black-Box Optimization. ICML 2020: 8480-8490 - Yuval Maymon, Noa Agmon:
Multi-Robot Containment and Disablement. IROS 2020: 11724-11731 - Moshe N. Samson, Noa Agmon:
Competitive Coverage: (Full) Information as a Game Changer. IROS 2020: 6633-6640 - Mor Sinay, Elad Sarafian, Yoram Louzoun, Noa Agmon, Sarit Kraus:
Explicit Gradient Learning. CoRR abs/2006.08711 (2020) - Saar Cohen, Noa Agmon:
Converging to a Desired Orientation in a Flock of Agents. CoRR abs/2010.04686 (2020) - Michael Amir, Noa Agmon, Alfred M. Bruckstein:
A Discrete Model of Collective Marching on Rings. CoRR abs/2012.04980 (2020)
skipping 76 more matches
loading more results 
failed to load more results, please try again later
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.
retrieved on 2024-12-10 21:12 CET from data curated 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:
