IJCAI 2001

216 papers

Top Research Directions

Research directions most represented by IJCAI 2001 papers.

The Incompleteness of Stochastic Local Search 2
Non-linear Causal Discovery via Functional Constraints 2
Multi-Attribute Glyph Encoding for High-Dimensional Data 1
Propagating the Indirect Effects of Actions 1
Problem Solving by Retrieving and Adapting Past Experiences 1
Context-Specific Independence in Probabilistic Graphical Models 1
Tangible Interaction for Seamless Physical Digital Integration 1
The Stability Performance Tradeoff in Multiagent Learning 1
Mining Specialized Jargon and Terminology from Unstructured Corpora 1
Simulating Autonomy Through Wizard of Oz Prototyping 1
Performance Sensitive Learning Rate Adaptation 1
Evaluating Text Quality via Language Model Likelihood 1
Overcoming the Feature Engineering Bottleneck in Reinforcement Learning 1
Causal Explanations Beyond Feature Saliency 1
Extracting Symbolic Rules from Neural Networks 1

Top Authors

AuthorPapers
Moshe Tennenholtz3
Thomas Eiter3
Alessandro Cimatti2
Chitta Baral2
Craig Boutilier2
Daphne Koller2
Joseph Halpern2
Marco Roveri2
Piergiorgio Bertoli2
Subhash Suri2
Tuomas Sandholm2
Adnan Darwiche1
Alain Dutech1
Alberto Finzi1
Alessandro Sperduti1
Alexander G. Hauptmann1
Andrew Gilpin1
Bart Selman1
Ben Taskar1
Bob Price1

Impactful Papers

Papers from IJCAI 2001 that shaped research clusters.

Foundational

Influential

Papers

Title
Partitioning Activities for Agents
Perceptual Anchoring of Symbols for Action
Perceptual Texture Space Improves Perceptual Consistency of Computational Features
Phase Transitions of PP-Complete Satisfiability Problems
Planning as Model Checking for Extended Goals in Non-deterministic Domains
Planning in Nondeterministic Domains under Partial Observability via Symbolic Model Checking
Planning with Resources and Concurrency: A Forward Chaining Approach
Plausibility Measures: A General Approach For Representing Uncertainty
Preference-Based Configuration of Web Page Content
Probabilistic Classification and Clustering in Relational Data
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001, Seattle, Washington, USA, August 4-10, 2001
Qualitative Simulation of Genetic Regulatory Networks: Method and Application
Rational and Convergent Learning in Stochastic Games
Rational Competitive Analysis
Real-Time Auditory and Visual Multiple-Object Tracking for Humanoids
Reasoning about Categories in Conceptual Spaces
Reasoning with infinite stable models
Refining the Basic Constraint Propagation Algorithm
Refining the Structure of a Stochastic Context-Free Grammar
Reflective Negotiating Agents for Real-Time Multisensor Target Tracking
Reinforcement Learning in Distributed Domains: Beyond Team Games
Relational Learning via Propositional Algorithms: An Information Extraction Case Study
Representing Sentence Structure in Hidden Markov Models for Information Extraction
Resolving Ambiguities to Create a Natural Computer-Based Sketching Environment
Resource-bounded inference from inconsistent belief bases
Reviving Partial Order Planning
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
Robotics and Perception
Robot Weightlifting By Direct Policy Search
Robust Multi-unit Auction Protocol against False-name Bids
Robust Translation of Spontaneous Speech: A Multi-Engine Approach
Satisficing and Learning Cooperation in the Prisoner s Dilemma
Search on High Degree Graphs
Search, Satisfiability, and Constraint Satisfaction Problems
Sensitivity Analysis of Multilayer Perceptron
Sequentially finding the N-Best List in Hidden Markov Models
Simulating the Formation of Color Categories
SiN: Integrating Case-based Reasoning with Task Decomposition
Solving Factored MDPs via Non-Homogeneous Partitioning
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search
Splitting Without Backtracking
Stable Strategies for Sharing Information among Agents
Symbolic Dynamic Programming for First-Order MDPs
Temporal Constraint Reasoning With Preferences
Temporal Decision Trees or the lazy ECU vindicated
Temporal Difference Learning Applied to a High-Performance Game-Playing Program
The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming
The Foundations of Cost-Sensitive Learning
The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding
Theorem Proving with Structured Theories

« prev Page 4/5 next »