default search action
Journal of Artificial Intelligence Research, Volume 78
Volume 78, 2023
- Jimmy H. M. Lee, Allen Z. Zhong:
Exploiting Functional Constraints in Automatic Dominance Breaking for Constraint Optimization. 1-35 - Stefano Faralli, Andrea Lenzi, Paola Velardi:
A Benchmark Study on Knowledge Graphs Enrichment and Pruning Methods in the Presence of Noisy Relationships. 37-68 - Gianfranco Lamperti, Stefano Trerotola, Marina Zanella, Xiangfu Zhao:
Sequence-Oriented Diagnosis of Discrete-Event Systems. 69-141 - Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue:
Clustering what Matters: Optimal Approximation for Clustering with Outliers. 143-166 - Ankush Ganguly, Sanjana Jain, Ukrit Watchareeruetai:
Amortized Variational Inference: A Systematic Review. 167-215 - Özgür Lütfü Özçep, Mena Leemhuis, Diedrich Wolter:
Embedding Ontologies in the Description Logic ALC by Axis-Aligned Cones. 217-267 - Micheal Abaho, Yousef H. Alfaifi:
Select and Augment: Enhanced Dense Retrieval Knowledge Graph Augmentation. 269-285 - Ijeoma Amuche Chikwendu, Xiaoling Zhang, Isaac Osei Agyemang, Isaac Adjei Mensah, Chiagoziem Chima Ukwuoma, Chukwuebuka Joseph Ejiyi:
A Comprehensive Survey on Deep Graph Representation Learning Methods. 287-356 - Xiao Peng, Olivier Simonin, Christine Solnon:
Non-Crossing Anonymous MAPF for Tethered Robots. 357-384 - Bartosz Bednarczyk, Sebastian Rudolph:
How to Tell Easy from Hard: Complexities of Conjunctive Query Entailment in Extensions of ALC. - Max Bannach, Malte Skambath, Till Tantau:
On the Parallel Parameterized Complexity of MaxSAT Variants. - Alon Jacovi, Jasmijn Bastings, Sebastian Gehrmann, Yoav Goldberg, Katja Filippova:
Diagnosing AI Explanation Methods with Folk Concepts of Behavior. 459-489 - Jessie Li:
Asymptotics of K-Fold Cross Validation. 491-526 - Alfonso Emilio Gerevini, Alessandro Saetti, Ivan Serina, Andrea Loreggia, Luca Putelli, Anna Roubícková:
Maintenance of Plan Libraries for Case-Based Planning: Offline and Online Policies. 527-577 - Arseny Skryagin, Daniel Ochs, Devendra Singh Dhami, Kristian Kersting:
Scalable Neural-Probabilistic Answer Set Programming. 579-617 - Patrik Haslum, Ryan Xiao Wang:
Maximisation of Admissible Multi-Objective Heuristics. 619-639 - Baturay Saglam, Furkan B. Mutlu, Dogan Can Çiçek, Suleyman S. Kozat:
Actor Prioritized Experience Replay. 639-672 - Emilio Gamba, Bart Bogaerts, Tias Guns:
Efficiently Explaining CSPs with Unsatisfiable Subset Optimization. 709-746 - Jack Blandin, Ian A. Kash:
Generalizing Group Fairness in Machine Learning via Utilities. 747-780 - Matthew J. Holland, Kazuki Tanabe:
A Survey of Learning Criteria Going Beyond the Usual Risk. 781-821 - Bin Liu, Guosheng Yin:
Graphmax for Text Generation. 823-848 - Niklas T. Lauffer, William Bowers Lassiter, Jeremy D. Frank:
On Expected Value Strong Controllability. 849-900 - Alexander Braylan, Madalyn Marabella, Omar Alonso, Matthew Lease:
A General Model for Aggregating Annotations Across Simple, Complex, and Multi-Object Annotation Tasks. 901-973 - Lukas Struppek, Dominik Hintersdorf, Felix Friedrich, Manuel Brack, Patrick Schramowski, Kristian Kersting:
Exploiting Cultural Biases via Homoglyphs in Text-to-Image Synthesis. 1017-1068 - Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse:
Improving Resource Allocations by Sharing in Pairs. 1069-1109 - Spyros Angelopoulos, Shahin Kamali, Kimia Shadkami:
Online Bin Packing with Predictions. 1111-1141 - Zhaonan Qu, Kaixiang Lin, Zhaojian Li, Jiayu Zhou, Zhengyuan Zhou:
A Unified Linear Speedup Analysis of Federated Averaging and Nesterov FedAvg. 1143-1200 - Jugal Garg, Peter McGlaughlin, Martin Hoefer, Marco Schmalhofer:
Competitive Equilibria with a Constant Number of Chores. 1201-1219 - Theofanis I. Aravanis:
Collective Belief Revision. 1221-1247
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.