default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Artificial Intelligence Research, Volume 61
Volume 61, January 2018
- Richard Evans, Edward Grefenstette:
Learning Explanatory Rules from Noisy Data. 1-64 - Albert Gatt, Emiel Krahmer:
Survey of the State of the Art in Natural Language Generation: Core tasks, applications and evaluation. 65-170 - Sergio Abriola, Pablo Barceló, Diego Figueira, Santiago Figueira:
Bisimulations on Data Graphs. 171-213 - George Dimitri Konidaris, Leslie Pack Kaelbling, Tomás Lozano-Pérez:
From Skills to Symbols: Learning Symbolic Representations for Abstract High-Level Planning. 215-289 - Kei Kimura, Kazuhisa Makino:
Linear Satisfiability Preserving Assignments. 291-321 - Andre Gaschler, Ronald P. A. Petrick, Oussama Khatib, Alois C. Knoll
:
KABouM: Knowledge-Level Action and Bounding Geometry Motion Planner. 323-362 - Yunus Emre Kara, Gaye Genç, Oya Aran, Lale Akarun:
Actively Estimating Crowd Annotation Consensus. 363-405 - William S. Zwicker:
Cycles and Intractability in a Large Class of Aggregation Rules. 407-431 - Alexandros Zenonos, Sebastian Stein, Nicholas R. Jennings:
Coordinating Measurements in Uncertain Participatory Sensing Settings. 433-474 - Daniel Fiser, Antonín Komenda:
Fact-Alternating Mutex Groups for Classical Planning. 475-521 - Marlos C. Machado, Marc G. Bellemare, Erik Talvitie, Joel Veness, Matthew J. Hausknecht, Michael Bowling:
Revisiting the Arcade Learning Environment: Evaluation Protocols and Open Problems for General Agents. 523-562 - Dario Garcia-Gasulla, Ferran Parés, Armand Vilalta, Jonathan Moreno, Eduard Ayguadé, Jesús Labarta, Ulises Cortés, Toyotaro Suzumura:
On the Behavior of Convolutional Nets for Feature Extraction. 563-592 - Nicolás D'Ippolito, Natalia Rodríguez, Sebastian Sardiña:
Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis. 593-621 - Ferdinando Fioretto, Enrico Pontelli, William Yeoh:
Distributed Constraint Optimization Problems and Applications: A Survey. 623-698 - Richard Booth, Aaron Hunter:
Trust as a Precursor to Belief Revision. 699-722 - Ciaran McCreesh, Patrick Prosser, Christine Solnon, James Trimble:
When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases. 723-759 - Yury Maximov, Massih-Reza Amini, Zaïd Harchaoui:
Rademacher Complexity Bounds for a Penalized Multi-class Semi-supervised Algorithm. 761-786 - Federico Raue, Andreas Dengel, Thomas M. Breuel, Marcus Liwicki:
Symbol Grounding Association in Multimodal Sequences with Missing Elements. 787-806 - Nadia Creignou, Raïda Ktari, Odile Papini:
Belief Update within Propositional Fragments. 807-834 - Yadollah Yaghoobzadeh, Heike Adel, Hinrich Schütze:
Corpus-Level Fine-Grained Entity Typing. 835-862 - Alberto Fernández, Salvador García, Francisco Herrera, Nitesh V. Chawla:
SMOTE for Learning from Imbalanced Data: Progress and Challenges, Marking the 15-year Anniversary. 863-905 - Dieuwke Hupkes, Sara Veldhoen, Willem H. Zuidema:
Visualisation and 'Diagnostic Classifiers' Reveal How Recurrent and Recursive Neural Networks Process Hierarchical Structure. 907-926 - Raquel G. Alhama, Willem H. Zuidema:
Pre-Wiring and Pre-Training: What Does a Neural Network Need to Learn Truly General Identity Rules? 927-946 - Marta R. Costa-jussà:
From Feature To Paradigm: Deep Learning In Machine Translation. 947-974
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.
last updated on 2025-11-11 02:24 CET 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:
