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
Information Extraction from Web Documents Based on Local Unranked Tree
Information Extraction from Web Documents Based on Local Unranked Tree Automaton Inference
Integrating Background Knowledge Into Text Classification
Integrating Multiple Internet Directories by Instance-based Learning
Integrity and Change in Modular Ontologies
Intelligent Multimedia Indexing and Retrieval through Multi-source
Intelligent Multimedia Indexing and Retrieval through Multi-source Information Extraction and Merging
Intelligent Multimodal Stream Processing
Intelligent Systems in Travel and Tourism
Interactive Spoken Simulation Control and Conversational Tutoring
In the quest of the best form of local consistency for Weighted CSP
Inverse Circumscription
Item Selection Strategies for Collaborative Filtering
Keys, Nominals, and Concrete Domains
LADDER: A Language to Describe Drawing, Display, and Editing in Sketch
LADDER: A Language to Describe Drawing, Display, and Editing in Sketch Recognition
Last-Branch and Speculative Pruning Algorithms for Max
Last-Branch and Speculative Pruning Algorithms for Maxn
Layered Mereotopology
Learning Algorithms for Software Agents in Uncertain and Untrusted Market
Learning Algorithms for Software Agents in Uncertain and Untrusted Market Environments
Learning Consumer Photo Categories for Semantic Retrieval
Learning Minesweeper with Multinational Learning
Learning Minesweeper with Multirelational Learning
Learning to Classify Texts Using Positive and Unlabeled Data
Learning to Compete in Heterogeneous Web Search Environments
Learning Value Predictors for the Speculative Execution of Information
Learning Value Predictors for the Speculative Execution of Information Gathering Plans
Least Common Subsumers and Most Specific Concepts in a Description Logic with
Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles
Local-Effect Games
Logical Filtering
Logic Programs for Consistently Querying Data Integration Systems
Lookahead Pathologies for Single Agent Search
Making Markets and Democracy Work: A Story of Incentives and Computing
Making the Breakout Algorithm Complete Using Systematic Search
Maximizing Flexibility: A Retraction Heuristic for Oversubscribed Scheduling
Maximizing Flexibility: A Retraction Heuristic for Oversubscribed Scheduling Problems
Minimal Change and Maximal Coherence for Epistemic Logic Program Updates
Minimally intrusive negotiating agents for resource sharing
Mining Video Associations for Efficient Database Management
Model-based Diagnosis of Hybrid Systems
Modular self-organization for a long-living autonomous agent
Monte Carlo Theory as an Explanation of Bagging and Boosting
Multiagent Planning with Partially Ordered Temporal Plans
Multiple Agents Moving Target Search
Multiple-Goal Reinforcement Learning with Modular Sarsa(0)
Multiple-Goal Reinforcement Learning with Modular Sarsa(O)
Multi-prototype Support Vector Machine
Multiset Ordering Constraints

« prev Page 5/8 next »