Остановите войну!
for scientists:
default search action
Search 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
no 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 15 matches
- 2008
- Noa Agmon, Noam Hazon, Gal A. Kaminka:
The giving tree: constructing trees for efficient offline and online multi-robot coverage. Ann. Math. Artif. Intell. 52(2-4): 143-168 (2008) - Patrick Amstutz, Nikolaus Correll, Alcherio Martinoli:
Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm. Ann. Math. Artif. Intell. 52(2-4): 307-333 (2008) - Krzysztof R. Apt, Francesca Rossi, Kristen Brent Venable:
Comparing the notions of optimality in CP-nets, strategic games and soft constraints. Ann. Math. Artif. Intell. 52(1): 25-54 (2008) - Howard A. Blair, Victor W. Marek, Jeffrey B. Remmel:
Set based logic programming. Ann. Math. Artif. Intell. 52(1): 81-105 (2008) - Ondrej Cepek, David Kronus, Petr Kucera:
Recognition of interval Boolean functions. Ann. Math. Artif. Intell. 52(1): 1-24 (2008) - Lei Chen, Hung Keng Pung:
Convergence analysis of convex incremental neural networks. Ann. Math. Artif. Intell. 52(1): 67-80 (2008) - Andrea Gasparri, Bhaskar Krishnamachari, Gaurav S. Sukhatme:
A framework for multi-robot node coverage in sensor networks. Ann. Math. Artif. Intell. 52(2-4): 281-305 (2008) - Gal A. Kaminka, Amir Shapiro:
Editorial: Annals of Mathematics and Artificial Intelligence special issue on multi-robot coverage, search, and exploration. Ann. Math. Artif. Intell. 52(2-4): 107-108 (2008) - Geunho Lee, Nak Young Chong:
A geometric approach to deploying robot swarms. Ann. Math. Artif. Intell. 52(2-4): 257-280 (2008) - Joel Ratsaby:
On the complexity of binary samples. Ann. Math. Artif. Intell. 52(1): 55-65 (2008) - Ioannis M. Rekleitis, Ai Peng New, Edward Samuel Rankin, Howie Choset:
Efficient Boustrophedon Multi-Robot Coverage: an algorithmic approach. Ann. Math. Artif. Intell. 52(2-4): 109-142 (2008) - Shahar Sarid, Amir Shapiro:
Classifying the multi robot path finding problem into a quadratic competitive complexity class. Ann. Math. Artif. Intell. 52(2-4): 169-203 (2008) - Cyrill Stachniss, Óscar Martínez Mozos, Wolfram Burgard:
Efficient exploration of unknown indoor environments using a team of mobile robots. Ann. Math. Artif. Intell. 52(2-4): 205-227 (2008) - P. B. Sujit, Randy W. Beard:
Multiple UAV exploration of an unknown region. Ann. Math. Artif. Intell. 52(2-4): 335-366 (2008) - Régis Vincent, Dieter Fox, Jonathan Ko, Kurt Konolige, Benson Limketkai, Benoit Morisset, Charles Ortiz, Dirk Schulz, Benjamin Stewart:
Distributed multirobot exploration, mapping, and task allocation. Ann. Math. Artif. Intell. 52(2-4): 229-255 (2008)
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-04-23 19:45 CEST 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