Остановите войну!
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 36 matches
- 2018
- Martin Aleksandrov, Toby Walsh:
Group Envy Freeness and Group Pareto Efficiency in Fair Division with Indivisible Items. KI 2018: 57-72 - Michael Barry, Hubert Abgottspon, René Schumann:
Solver Tuning and Model Configuration. KI 2018: 141-154 - Christoph Beierle, Tanja Bock, Gabriele Kern-Isberner, Marco Ragni, Kai Sauerwald:
Kinds and Aspects of Forgetting in Common-Sense Knowledge and Belief Management. KI 2018: 366-373 - Daniel Beßler, Mihai Pomarlan, Aliakbar Akbari, Muhayyuddin, Mohammed Diab, Jan Rosell, John A. Bateman, Michael Beetz:
Assembly Planning in Cluttered Environments Through Heterogeneous Reasoning. KI 2018: 201-214 - Tanya Braun, Ralf Möller:
Fusing First-Order Knowledge Compilation and the Lifted Junction Tree Algorithm. KI 2018: 24-37 - Seda Polat Erdeniz, Alexander Felfernig, Muesluem Atas:
LearnDiag: A Direct Diagnosis Algorithm Based On Learned Heuristics. KI 2018: 190-197 - Rustam Galimullin, Natasha Alechina, Hans van Ditmarsch:
Model Checking for Coalition Announcement Logic. KI 2018: 11-23 - Marcel Gehrke, Tanya Braun, Ralf Möller:
Towards Preventing Unnecessary Groundings in the Lifted Dynamic Junction Tree Algorithm. KI 2018: 38-45 - Andreas Hertle, Bernhard Nebel:
Efficient Auction Based Coordination for Distributed Multi-agent Planning in Temporal Domains Using Resource Abstraction. KI 2018: 86-98 - Patryk Hopner, Eneldo Loza Mencía:
Analysis and Optimization of Deep Counterfactual Value Networks. KI 2018: 305-312 - Brijnesh J. Jain:
Condorcet's Jury Theorem for Consensus Clustering. KI 2018: 155-168 - Dietmar Jannach:
Keynote: Session-Based Recommendation - Challenges and Recent Advances. KI 2018: 3-7 - Tobias Joppen, Christian Wirth, Johannes Fürnkranz:
Preference-Based Monte Carlo Tree Search. KI 2018: 327-340 - Ilir Kola, Marco Ragni:
Predict the Individual Reasoner: A New Approach. KI 2018: 401-414 - Daniel Krakowczyk, Jannik Wolff, Alexandru Ciobanu, Dennis Julian Meyer, Christopher-Eyk Hrabia:
Developing a Distributed Drone Delivery System with a Hybrid Behavior Planning System. KI 2018: 107-114 - Francesco Kriegel:
Acquisition of Terminological Knowledge in Probabilistic Description Logic. KI 2018: 46-53 - Daniel Lückehe, Sonja Veith, Gabriele von Voigt:
Evolutionary Structure Minimization of Deep Neural Networks for Motion Sensor Data. KI 2018: 243-257 - Stefan Lüdtke, Max Schröder, Thomas Kirste:
Approximate Probabilistic Parallel Multiset Rewriting Using MCMC. KI 2018: 73-85 - Peer Neubert, Subutai Ahmad, Peter Protzel:
A Sequence-Based Neuronal Model for Mobile Robot Localization. KI 2018: 117-130 - Peer Neubert, Peter Protzel:
Towards Hypervector Representations for Learning and Planning with Schemas. KI 2018: 182-189 - Stefan Oehmcke, Oliver Kramer:
Knowledge Sharing for Population Based Neural Network Training. KI 2018: 258-269 - Özgür Lütfü Özçep:
Bounded-Memory Stream Processing. KI 2018: 377-390 - Lisset Salinas Pinacho, Alexander Wich, Fereshta Yazdani, Michael Beetz:
Acquiring Knowledge of Object Arrangements from Human Examples for Household Robots. KI 2018: 131-138 - Mihai Pomarlan, John A. Bateman:
Understanding NLP Neural Networks by the Texts They Generate. KI 2018: 284-296 - Jonas Prellberg, Oliver Kramer:
Limited Evaluation Evolutionary Optimization of Large Neural Networks. KI 2018: 270-283 - Christoph Raab, Frank-Michael Schleif:
Sparse Transfer Classification for Text Documents. KI 2018: 169-181 - Gavin Rens, Thomas Andreas Meyer, Gabriele Kern-Isberner, Abhaya Nayak:
Probabilistic Belief Revision via Similarity of Worlds Modulo Evidence. KI 2018: 343-356 - Gavin Rens, Abhaya Nayak, Thomas Andreas Meyer:
Maximizing Expected Impact in an Agent Reputation Network. KI 2018: 99-106 - Nicolas Riesterer, Daniel Brand, Marco Ragni:
The Predictive Power of Heuristic Portfolios in Human Syllogistic Reasoning. KI 2018: 415-421 - Dorothee Rocznik, Klaus Goffart, Manuel Wiesche, Helmut Krcmar:
An Implementation and Evaluation of User-Centered Requirements for Smart In-house Mobility Services. KI 2018: 391-398
skipping 6 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-06-06 06:36 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