IJCAI 2011

513 papers
The 2011 International Joint Conference on Artificial Intelligence (IJCAI) featured research spanning multi-robot systems, optimization techniques, and information retrieval. Contributions from authors such as Can Erdoğan, Pinghua Gong, and Dijun Luo highlighted diverse applications of machine learning. In the field of robotics, research addressed action selection by learning behavior patterns within multi-robot domains, focusing on coordination and decision-making. Technical developments in optimization were also prominent, including the introduction of fast dual projected Newton methods for $l_1$-regularized least squares. This work aimed to improve the efficiency of sparse representation models. Furthermore, the conference included research on content-based multimedia retrieval, specifically through the development of ball ranking machines. These papers illustrate a focus on refining algorithmic performance and expanding AI methodologies into specialized areas like multimedia analysis and multi-agent coordination.

Top Research Directions

Research directions most represented by IJCAI 2011 papers.

Balancing Logical Expressivity and Computational Tractability 5
Self Supervised Regularization for Sparse Recommender Systems 5
Breaking Symmetry to Prune Combinatorial Search Spaces 4
Taming the Complexity of Decentralized Multiagent Planning 4
Dead-End Detection in State Space Search 3
Non-Monotonic Reasoning for Dynamic Belief Revision 3
Multiplicative Updates for Non-Negative Matrix Factorization 3
Robust Planning and Policy Learning via Minimax Regret 3
Modeling Label Dependencies in Multi-Label Learning 3
Computational Complexity as a Barrier to Election Manipulation 3
Strategyproof Resource Allocation Without Money 3
Scaling Symbolic Reasoning to Large Knowledge Bases 3
Row-Sparse Regularization for Joint Feature Selection 3
Termination Guarantees in Logic Based Negotiation 2
Confining Combinatorial Complexity with Backdoor Sets 2

Top Authors

AuthorPapers
Edith Elkind7
Qiang Yang6
Heng Huang5
Craig Boutilier4
Hong Ding4
Xiangyang Xue4
Zhi-Hua Zhou4
Ashish Kapoor3
Carla P Gomes3
Carsten Lutz3
Chengqi Zhang3
Dan Roth3
Dijun Luo3
Feiping Nie3
Frank Wolter3
Jerome Lang3
Katia P. Sycara3
Lirong Xia3
Milind Tambe3
Mitsuru Ishizuka3

Impactful Papers

Papers from IJCAI 2011 that shaped research clusters.

Foundational

Influential

Papers

Title
On Qualitative Route Descriptions: Representation and Computational Complexity
On Temporal Regulations and Commitment Protocols
On the Complexity of
On the Complexity of Dealing with Inconsistency in Description Logic Ontologies
On the Complexity of EL with Defeasible Inclusions
On the Complexity ofEL with Defeasible Inclusions
On the Complexity of the Core over Coalition Structures
On the Complexity of Voting Manipulation under Randomized Tie-Breaking
On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces
On the Decidability of HTN Planning with Task Insertion
On the Effectiveness of CNF and DNF Representations in Contingent Planning
On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions
On the Impact of Belief State Representation in Planning under Uncertainty
On the Progression of Knowledge in the Situation Calculus
On the Role of Domain Knowledge in Analogy-Based Story Generation.
On the Utility of Curricula in Unsupervised Learning of Probabilistic Grammars
On Trivial Solution and Scale Transfer Problems in Graph Regularized NMF
Open Information Extraction: The Second Generation
Optimal Partitions in Additively Separable Hedonic Games
Pairwise Decomposition for Combinatorial Optimization in Graphical Models
Parametric Properties of Ideal Semantics
Past IJCAI Conferences
Pattern Field Classification with Style Normalized Transformation
picoTrans: Using Pictures as Input for Machine Translation on Mobile Devices
Planning under Partial Observability by Classical Replanning: Theory and Experiments
Planning with SAT, Admissible Heuristics and A*
Plan Recognition in Virtual Laboratories
Point-Based Value Iteration for Constrained POMDPs
Positive Unlabeled Leaning for Time Series Classification
Predicting Epidemic Tendency through Search Behavior Analysis
Predicting Globally-Coherent Temporal Structures from Texts via Endpoint Inference and Graph Decomposition
Preface
Probabilistic Goal Markov Decision Processes
Probabilistic Satisfiability: Logic-Based Algorithms and Phase Transition
Probit Classifiers with a Generalized Gaussian Scale Mixture Prior
Program Committee
Push and Swap: Fast Cooperative Path-Finding with Completeness Guarantees
Q-Error as a Selection Mechanism in Modular Reinforcement-Learning Systems
Query Answering in the Horn Fragments of the Description Logics
Query Answering in the Horn Fragments of the Description Logics SHOIQ and SROIQ
Query Reasoning on Trees with Types, Interleaving, and Counting
Randomized Sensing in Adversarial Environments
Rational Deployment of CSP Heuristics
RCC8 Is Polynomial on Networks of Bounded Treewidth
RDFKB: A Semantic Web Knowledge Base
Read-Once Resolution for Unsatisfiability-Based Max-SAT Algorithms
Real-Time Heuristic Search with Depression Avoidance
Real-Time Opponent Modeling in Trick-Taking Card Games
Real-Time Solving of Quantified CSPs Based on Monte-Carlo Game Tree Search
Reasoning about Fuzzy Belief and Common Belief: With Emphasis on Incomparable Beliefs

« prev Page 8/11 next »