Остановите войну!
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 25 matches
- 2019
- Christopher Amato, George Dimitri Konidaris, Leslie Pack Kaelbling, Jonathan P. How:
Modeling and Planning with Macro-Actions in Decentralized POMDPs. J. Artif. Intell. Res. 64: 817-859 (2019) - Vernon Asuncion, Yan Zhang, Heng Zhang, Ruixuan Li:
Polynomial and Exponential Bounded Logic Programs with Function Symbols: Some New Decidable Classes. J. Artif. Intell. Res. 64: 749-815 (2019) - Meghyn Bienvenu, Camille Bourgaux, François Goasdoué:
Computing and Explaining Query Answers over Inconsistent DL-Lite Knowledge Bases. J. Artif. Intell. Res. 64: 563-644 (2019) - Neil Burch, Matej Moravcik, Martin Schmid:
Revisiting CFR+ and Alternating Updates. J. Artif. Intell. Res. 64: 429-443 (2019) - Carlo Combi, Roberto Posenato, Luca Viganò, Matteo Zavatteri:
Conditional Simple Temporal Networks with Uncertainty and Resources. J. Artif. Intell. Res. 64: 931-985 (2019) - Jing Cui, Patrik Haslum:
Dynamic Controllability of Controllable Conditional Temporal Problems with Uncertainty. J. Artif. Intell. Res. 64: 445-495 (2019) - Katharina Eggensperger, Marius Lindauer, Frank Hutter:
Pitfalls and Best Practices in Algorithm Configuration. J. Artif. Intell. Res. 64: 861-893 (2019) - Alireza Farhadi, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods to Asymmetric Agents. J. Artif. Intell. Res. 64: 1-20 (2019) - Nikhil Garg, Vijay Kamble, Ashish Goel, David Marn, Kamesh Munagala:
Iterative Local Voting for Collective Decision-making in Continuous Spaces. J. Artif. Intell. Res. 64: 315-355 (2019) - Umberto Grandi, Davide Grossi, Paolo Turrini:
Negotiable Votes. J. Artif. Intell. Res. 64: 895-929 (2019) - Bernardo Cuenca Grau, Egor V. Kostylev:
Logical Foundations of Linked Data Anonymisation. J. Artif. Intell. Res. 64: 253-314 (2019) - José Hernández-Orallo:
AI Generality and Spearman's Law of Diminishing Returns. J. Artif. Intell. Res. 64: 529-562 (2019) - Orgad Keller, Avinatan Hassidim, Noam Hazon:
New Approximations for Coalitional Manipulation in Scoring Rules. J. Artif. Intell. Res. 64: 109-145 (2019) - Kathryn Laing, Peter Adam Thwaites, John Paul Gosling:
Rank Pruning for Dominance Queries in CP-Nets. J. Artif. Intell. Res. 64: 55-107 (2019) - Allan Rodrigo Leite, Fabrício Enembreck:
Using Collective Behavior of Coupled Oscillators for Solving DCOP. J. Artif. Intell. Res. 64: 987-1023 (2019) - Peta Masters, Sebastian Sardiña:
Cost-Based Goal Recognition in Navigational Domains. J. Artif. Intell. Res. 64: 197-242 (2019) - Bernhard Nebel, Thomas Bolander, Thorsten Engesser, Robert Mattmüller:
Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity. J. Artif. Intell. Res. 64: 497-527 (2019) - Duc Thien Nguyen, William Yeoh, Hoong Chuin Lau, Roie Zivan:
Distributed Gibbs: A Linear-Space Sampling-Based DCOP Algorithm. J. Artif. Intell. Res. 64: 705-748 (2019) - Felipe Leno da Silva, Anna Helena Reali Costa:
A Survey on Transfer Learning for Multiagent Reinforcement Learning Systems. J. Artif. Intell. Res. 64: 645-703 (2019) - Wen Song, Donghun Kang, Jie Zhang, Zhiguang Cao, Hui Xi:
A Sampling Approach for Proactive Project Scheduling under Generalized Time-dependent Workability Uncertainty. J. Artif. Intell. Res. 64: 385-427 (2019) - Yan Tian, Xun Wang, Jiachen Wu, Ruili Wang, Bailin Yang:
Multi-scale Hierarchical Residual Network for Dense Captioning. J. Artif. Intell. Res. 64: 181-196 (2019) - Théo Trouillon, Éric Gaussier, Christopher R. Dance, Guillaume Bouchard:
On Inductive Abilities of Latent Factor Models for Relational Learning. J. Artif. Intell. Res. 64: 21-53 (2019) - James R. Wright, Kevin Leyton-Brown:
Level-0 Models for Predicting Human Behavior in Games. J. Artif. Intell. Res. 64: 357-383 (2019) - Fabio Massimo Zanzotto:
Viewpoint: Human-in-the-loop Artificial Intelligence. J. Artif. Intell. Res. 64: 243-252 (2019) - Zhiqiang Zhuang, Zhe Wang, Kewen Wang, James P. Delgrande:
A Generalisation of AGM Contraction and Revision to Fragments of First-Order Logic. J. Artif. Intell. Res. 64: 147-179 (2019)
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-07-07 03:17 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