default search action
Journal of Artificial Intelligence Research, Volume 74
Volume 74, 2022
- Sriram Ganapathi Subramanian, Matthew E. Taylor, Kate Larson
, Mark Crowley:
Multi-Agent Advisor Q-Learning. 1-74 - Lindsay Weinberg
Rethinking Fairness: An Interdisciplinary Survey of Critiques of Hegemonic ML Fairness Approaches. 75-109 - Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas
A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching. - Bhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg, Martin Hoefer, Kurt Mehlhorn:
Fair Division of Indivisible Goods for a Class of Concave Valuations. 111-142 - Sandhya Saisubramanian, Ece Kamar, Shlomo Zilberstein:
Avoiding Negative Side Effects of Autonomous Systems in the Open World. 143-177 - Khoi D. Hoang, Ferdinando Fioretto, Ping Hou, William Yeoh
Proactive Dynamic Distributed Constraint Optimization Problems. 179-225 - Hadi Hosseini, Andrew Searns, Erel Segal-Halevi:
Ordinal Maximin Share Approximation for Goods. - Miquel Bofill
Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem. 263-301 - Wei Chen
Adaptive Greedy versus Non-adaptive Greedy for Influence Maximization. 303-351 - Jürgen Landes, Jon Williamson:
Objective Bayesian Nets for Integrating Consistent Datasets. 393-458 - Jonathan Francis
Core Challenges in Embodied Vision-Language Planning. 459-515 - Jack Parker-Holder, Raghu Rajan, Xingyou Song, André Biedenkapp
Automated Reinforcement Learning (AutoRL): A Survey and Open Problems. 517-568 - Felix Brandt, Martin Bullinger
Finding and Recognizing Popular Coalition Structures. 569-626 - Bowen Xing, Ivor W. Tsang
Out of Context: A New Clue for Context Modeling of Aspect-based Sentiment Analysis. 627-659 - Georgios Amanatidis, Federico Fusco
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. 661-690 - Lukás Chrpa, Mauro Vallati
Planning with Critical Section Macros: Theory and Practice. 691-732 - Ramona Merhej, Fernando P. Santos
Cooperation and Learning Dynamics under Wealth Inequality and Diversity in Individual Risk. 733-764 - Andrew Cropper, Sebastijan Dumancic:
Inductive Logic Programming At 30: A New Introduction. 765-850 - Ivan D. Rodriguez, Blai Bonet, Sebastian Sardiña, Hector Geffner:
Flexible FOND Planning with Explicit Fairness Assumptions. - Nikolai Käfer
Admissibility in Probabilistic Argumentation. - Guy Van den Broeck, Anton Lykov, Maximilian Schleich, Dan Suciu
On the Tractability of SHAP Explanations. 851-886 - Rhys Goldstein, Kean Walmsley, Jacobo Bibliowicz, Alexander Tessier, Simon Breslav, Azam Khan
Path Counting for Grid-Based Navigation. 917-955 - Simon Caton
Impact of Imputation Strategies on Fairness in Machine Learning. 1011-1035 - Zengjian Chen, Jin Xu, Meng Liao, Tong Xue, Kun He:
Two-phase Multi-document Event Summarization on Core Event Graphs. 1037-1057 - Veneta Haralampieva, Ozan Caglayan, Lucia Specia:
Supervised Visual Attention for Simultaneous Multimodal Machine Translation. 1059-1089 - Diego Aineto, Sergio Jiménez, Eva Onaindia:
A Comprehensive Framework for Learning Declarative Action Models. 1091-1123 - Georgios Piliouras, Mark Rowland, Shayegan Omidshafiei, Romuald Elie, Daniel Hennes, Jerome T. Connor, Karl Tuyls:
Evolutionary Dynamics and Phi-Regret Minimization in Games. 1125-1158 - Cédric Colas, Tristan Karch, Olivier Sigaud, Pierre-Yves Oudeyer:
Autotelic Agents with Intrinsically Motivated Goal-Conditioned Reinforcement Learning: A Short Survey. 1159-1199 - Gabriel Skantze
CoLLIE: Continual Learning of Language Grounding from Language-Image Embeddings. 1201-1223 - Niels Grüttemeier, Christian Komusiewicz
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis. 1225-1267 - Alexander I. Cowen-Rivers, Wenlong Lyu, Rasul Tutunov, Zhi Wang, Antoine Grosnit, Ryan-Rhys Griffiths
HEBO: An Empirical Study of Assumptions in Bayesian Optimisation. 1269-1349 - Evgeniia Razumovskaia, Goran Glavas, Olga Majewska, Edoardo Maria Ponti, Anna Korhonen, Ivan Vulic:
Crossing the Conversational Chasm: A Primer on Natural Language Processing for Multilingual Task-Oriented Dialogue Systems. 1351-1402 - Wolfgang Dvorák, Markus Ulbricht
Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility. 1403-1447 - Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos:
Metric-Distortion Bounds under Limited Information. 1449-1483 - Jian Gao, Yiqi Lv, Minghao Liu
Improving Simulated Annealing for Clique Partitioning Problems. 1485-1513 - Shaowei Cai, Xindi Zhang
Better Decision Heuristics in CDCL through Local Search and Target Phases. 1515-1563 - Qinbo Bai, Mridul Agarwal, Vaneet Aggarwal:
Joint Optimization of Concave Scalarized Multi-Objective Reinforcement Learning with Policy Gradient Based Algorithm. 1565-1597 - Masataro Asai, Hiroshi Kajino, Alex Fukunaga, Christian Muise:
Classical Planning in Deep Latent Space. 1599-1686 - Robert Ganian, André Schidler
Threshold Treewidth and Hypertree Width. 1687-1713 - Feng Han, Xudong Wang, Furao Shen, Jian Zhao:
C-Face: Using Compare Face on Face Hallucination for Low-Resolution Face Recognition. 1715-1737 - Nieves Montes, Carles Sierra:
Synthesis and Properties of Optimally Value-Aligned Normative Systems. 1739-1774 - Vincent Froese, Christoph Hertrich
The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality. 1775-1790 - Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Pricing Problems with Buyer Preselection. 1791-1822 - Bishwamittra Ghosh
Efficient Learning of Interpretable Classification Rules. 1823-1863
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 2024-12-23 19:19 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: