IJCAI 2003

360 papers

Top Research Directions

Research directions most represented by IJCAI 2003 papers.

Balancing Logical Expressivity and Computational Tractability 10
Managing Combinatorial Explosion in Automated Planning 9
The Empirical Validation Gap 9
Breaking Symmetry to Prune Combinatorial Search Spaces 8
Analytical Marginalization for Hybrid State Estimation 7
Extending Propositional Reasoning to Expressive Logics 6
Computational Hardness at the Threshold of Phase Transitions 6
Scaling State Space Search Under Memory Constraints 6
Scaling Sequential Decision Making Beyond the Curse of Dimensionality 5
Measurement Informed Proposals for Sequential Monte Carlo 4
Fail-First Heuristics for Efficient Combinatorial Search 4
Eliminating Redundant Search Exploration via Conflict Learning 4
Slack-Based Scheduling for Deadline-Constrained Workloads 4
Breaking the Quadratic Scaling Bottleneck in SLAM 4
Combinatorial Complexity in Multi Target Data Association 4

Top Authors

AuthorPapers
Sebastian Thrun5
Tuomas Sandholm5
Craig Boutilier4
Vincent Conitzer4
Adnan Darwiche3
Bart Selman3
Christopher D Manning3
Daphne Koller3
Fangzhen Lin3
Joseph Halpern3
Pascal Van Hentenryck3
Carla P Gomes2
Dan Klein2
Eyal Amir2
Fariba Sadri2
Francesca Toni2
Geoffrey J. Gordon2
Ian Horrocks2
Jimmy H.M. Lee2
J. Lee2

Impactful Papers

Papers from IJCAI 2003 that shaped research clusters.

Foundational

Influential

Papers

Title
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques
Reasoning about the Interaction of Knowledge, Time and Concurrent Actions in
Reasoning about the Interaction of Knowledge, Time and Concurrent Actions in the Situation Calculus
Recognizing Plan/Goal Abandonment
Recycling Computed Answers in Rewrite Systems for Abduction
Resource Temporal Networks: Definition and Complexity
Responsibility and Blame: A Structural-Model Approach
Sampling Combinatorial Spaces Using Biased Random Walks
Scenario-based Stochastic Constraint Programming
Self-reconfiguring Robots: Successes and Challenges
Semi-Supervised Learning with Explicit Misclassification Modeling
Sensible Agent Technology Improving Coordination and Communication in
Sensible Agent Technology Improving Coordination and Communication in Biosurveillance Domains
Simultaneous Adversarial Multi-Robot Learning
Skewing: An Efficient Alternative to Lookahead for Decision Tree Induction
SMDP Homomorphisms: An Algebraic Approach to Abstraction in Semi-Markov
SMDP Homomorphisms: An Algebraic Approach to Abstraction in Semi-Markov Decision Processes
Solving Constraint Optimization Problems in Anytime Contexts
Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree
Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree Search
Spaces of Theories with Ideal Refinement Operators
Sparse-Memory Graph Search
Spectral Learning
Splitting the atom: A new approach to Neighbourhood Interchangeability in
Splitting the atom: A new approach to Neighbourhood Interchangeability in Constraint Satisfaction Problems
SVMC: Single-Class Classification With Support Vector Machines
Switching Hypothesized Measurements: A Dynamic Model with Applications to
Switching Hypothesized Measurements: A Dynamic Model with Applications to Occlusion Adaptive Joint Tracking
TAGA: Travel Market Framework in Agentcities
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
Temporal Reasoning with Preferences and Uncertainty
Terminological Cycles in a Description Logic with Existential Restrictions
The Concurrent, Continuous FLUX
The Knowledge Required to Interpret Noun Compounds
The Power of Suggestion
Thin Junction Tree Filters for Simultaneous Localization and Mapping
Towards a Theoretical Framework for Ensemble Classification
Towards Cooperative Negotiation for Decentralized Resource Allocation in
Towards Cooperative Negotiation for Decentralized Resource Allocation in Autonomic Computing Systems
Towards domain-independent, task-oriented, conversational adequacy
Towards Pervasive Robotics
Tractable Pareto Optimization of Temporal Preferences
Tractable Symmetry Breaking for CSPs with Interchangeable Values
Tucking RCC in Cyc's Ontological Bed
Understanding the Power of Clause Learning
Universal Voting Protocol Tweaks to Make Manipulation Hard
Use of Off-line Dynamic Programming for Efficient Image Interpretation
Using Available Memory to Transform Graphplan's Search
Variable Resolution Particle Filter
Virtual World as Interface for Human-Robot Interaction

« prev Page 7/8 next »