Pasadena, California, USA
Edited by Craig Boutilier
No papers match this filter.
Papers
Nonmanipulable Selections from a Tournament
Pages 27–31
Planning Games
Pages 73–77
Simple Coalitional Games with Beliefs
Pages 85–89
Compiling the Votes of a Subelectorate
Pages 97–101
Learning Graphical Game Models
Pages 116–120
Multimode Control Attacks on Elections
Pages 128–132
On the Complexity of Compact Coalitional Games
Pages 147–151
Iterated Regret Minimization: A New Solution Concept
Pages 153–157
Multi-Step Multi-Sensor Hider-Seeker Games
Pages 159–165
A Kernel Method for Market Clearing
Pages 208–212
Strategyproof Classification with Shared Inputs
Pages 220–224
Thou Shalt Covet Thy Neighbor's Cake
Pages 239–243
Modeling Agents through Bounded Rationality Theories
Pages 264–270
Investigations of Continual Computation
Pages 285–290
Dynamic Configuration of Agent Organizations
Pages 305–310
Interruptible Algorithms for Multi-Problem Solving
Pages 380–385
Towards Industrial-Like Random SAT Instances
Pages 387–391
On Solving Boolean Multilevel Optimization Problemse
Pages 393–397
TBA*: Time-Bounded A*
Pages 431–435
Canadian Traveler Problem with Remote Sensing
Pages 437–441
Experiments with Massively Parallel Constraint Solving
Pages 443–447
Best-First Heuristic Search for Multi-Core Machines
Pages 449–454
Nested Monte-Carlo Search
Pages 456–460
Reasoning with Lines in the Euclidean Space
Pages 462–466
Local Search: Is Brute-Force Avoidable?
Pages 486–490
Control-Based Clause Sharing in Parallel SAT Solving
Pages 499–503
Solving 8x8 Hex
Pages 505–509
New Improvements in Optimal Rectangle Packing
Pages 511–515
Set Branching in Constraint Optimization
Pages 532–536
Multi-Way Number Partitioning
Pages 538–542
Variety Reasoning for Multiset Constraint Propagation
Pages 552–557
A Soft Global Precedence Constraint
Pages 566–570
Open Contractible Global Constraints
Pages 578–582
Evaluating Strategies for Running from the Cops
Pages 584–588
Russian Doll Search with Tree Decomposition
Pages 603–607
Memory-Based Heuristics for Explicit State Spaces
Pages 609–613
Efficient Incremental Search for Moving Target Search
Pages 615–619
A* Search with Inconsistent Heuristics
Pages 634–638
Mixing Search Strategies for Multi-Player Games
Pages 646–651
A Logic for Coalitions with Bounded Resources
Pages 659–663
Repairing Preference-Based Argumentation Frameworks
Pages 665–669
Which Semantics for Neighbourhood Semantics?
Pages 671–675
An Argumentation-Based Interpreter for Golog Programs
Pages 690–694
Next Steps in Propositional Horn Contraction
Pages 702–706
Diagnosing Multiple Persistent and Intermittent Faults
Pages 733–737
Answer-Set Programming with Bounded Treewidth
Pages 816–821
A Logic for Reasoning about Counterfactual Emotions
Pages 867–871
Composition of ConGolog Programs
Pages 904–909
Automated Theorem Proving for General Game Playing
Pages 911–915
Nominals for Everyone
Pages 917–921
Effective Query Rewriting with Ontologies over DBoxes
Pages 923–924
Knowing More - From Global to Local Correspondence
Pages 955–959
Exponential Family Hybrid Semi-Supervised Learning
Pages 974–978
Adaptive Cluster Ensemble Selection
Pages 992–996
Angluin-Style Learning of NFA
Pages 1004–1008
Locality Preserving Nonnegative Matrix Factorization
Pages 1010–1014
Bayesian Extreme Components Analysis
Pages 1022–1026
Knowledge Driven Dimension Reduction for Clustering
Pages 1034–1038
Search Techniques for Fourier-Based Learning
Pages 1040–1044
Local Learning Regularized Nonnegative Matrix Factorization
Pages 1046–1050
Learning Optimal Subsets with Implicit User Preferences
Pages 1052–1056
Graph Embedding with Constraints
Pages 1065–1069
Bootstrap Voting Experts
Pages 1071–1075
Linear Dimensionality Reduction for Multi-label Classification
Pages 1077–1081
Semi-Supervised Classification on Evolutionary Data
Pages 1083–1087
Local Query Mining in a Probabilistic Prolog
Pages 1095–1099
Unsupervised Rank Aggregation with Domain-Specific Expertise
Pages 1101–1105
Exploiting Multi-Modal Interactions: A Unified Framework
Pages 1120–1124
Relation Regularized Matrix Factorization
Pages 1126–1130
Learning the Optimal Neighborhood Kernel for Classification
Pages 1144–1148
Spectral Kernel Learning for Semi-Supervised Classification
Pages 1150–1154
Large Margin Boltzmann Machines
Pages 1156–1161
Spectral Embedded Clustering
Pages 1181–1185
Domain Adaptation via Transfer Component Analysis
Pages 1187–1191
Expanding Domain Sentiment Lexicon through Double Propagation
Pages 1199–1203
Streamed Learning: One-Pass SVMs
Pages 1211–1215
Semi-Supervised Metric Learning Using Pairwise Constraints
Pages 1217–1221
Predictive Projections
Pages 1223–1228
Succinct Approximate Counting of Skewed Data
Pages 1243–1247
Maintaining Predictions over Time without a Model
Pages 1249–1253
On Multiple Kernel Learning with Multiple Labels
Pages 1255–1259
Multi-Class Classifiers and their Underlying Shared Structure
Pages 1267–1271
Manifold Alignment without Correspondence
Pages 1273–1277
Generalized Cluster Aggregation
Pages 1279–1283
Preference Learning with Extreme Examples
Pages 1285–1289
Knowledge Transfer on Hybrid Graph
Pages 1291–1295
Early Prediction on Time Series: A Nearest Neighbor Approach
Pages 1297–1301
Multi-Relational Learning with Gaussian Processes
Pages 1309–1313
Robust Distance Metric Learning with Auxiliary Knowledge
Pages 1327–1331
Fast Active Tabu Search and its Application to Image Retrieval
Pages 1333–1337
M3IC: Maximum Margin Multiple Instance Clustering
Pages 1339–1343
Non-Metric Label Propagation
Pages 1357–1361
Multiclass Probabilistic Kernel Discriminant Analysis
Pages 1363–1367
Multiple Information Sources Cooperative Learning
Pages 1369–1375
Analysis of a Winning Computational Billiards Player
Pages 1377–1381
Generalized Clustergrams for Overlapping Biclusters
Pages 1383–1387
Suggesting Email View Filters for Triage and Search
Pages 1414–1418
Topic Tracking Model for Analyzing Consumer Purchase Behavior
Pages 1427–1431
Interpreting Written How-To Instructions
Pages 1433–1437
Is It Enough to Get the Behavior Right?
Pages 1439–1443
Expressive Power-Based Resource Allocation for Data Centers
Pages 1451–1455
A Visual Approach to Sketched Symbol Recognition
Pages 1463–1467
Representation and Synthesis of Melodic Expression
Pages 1475–1479
Learning to Follow Navigational Route Instructions
Pages 1488–1492
Web-Scale N-gram Models for Lexical Disambiguation
Pages 1507–1511
Reading Between the Lines
Pages 1525–1529
Improving Morphology Induction by Learning Spelling Rules
Pages 1531–1535
On the Tip of My Thought: Playing the Guillotine Game
Pages 1543–1547
Context-Based Approach for Pivot Translation Services
Pages 1555–1560
Probabilistic Counting with Randomized Storage
Pages 1574–1578
On-line Evolutionary Exponential Family Mixture
Pages 1610–1614
Word Sense Disambiguation for All Words without Hard Labor
Pages 1616–1621
A Translation-Based Approach to Contingent Planning
Pages 1623–1627
Goal Recognition with Variable-Order Markov Models
Pages 1635–1639
Solving POMDPs: RTDP-Bel vs. Point-based Algorithms
Pages 1641–1645
Completeness and Optimality Preserving Reduction for Planning
Pages 1659–1663
Stratified Planning
Pages 1665–1669
Temporal Planning in Domains with Linear Processes
Pages 1671–1675
Topological Order Planner for POMDPs
Pages 1684–1688
Optimal Symbolic Planning with Action Costs and Preferences
Pages 1690–1694
Activity Recognition with Intended Actions
Pages 1696–1700
Abnormal Activity Recognition Based on HDP-HMM Models
Pages 1715–1719
Cost-Optimal Planning with Landmarks
Pages 1728–1732
Monte-Carlo Exploration for Deterministic Planning
Pages 1766–1770
Planning with Partial Preference Models
Pages 1772–1776
Plan Recognition as Planning
Pages 1778–1782
Bayesian Real-Time Dynamic Programming
Pages 1784–1788
HTN Planning with Preferences
Pages 1790–1796
A Context Driven Approach for Workflow Mining
Pages 1798–1802
Adversarial Uncertainty in Multi-Robot Patrol
Pages 1811–1816
Incremental Phi*: Incremental Any-Angle Path Planning on Grids
Pages 1824–1829
Information-Lookahead Planning for AUV Mapping
Pages 1831–1835
Learning Kinematic Models for Articulated Objects
Pages 1851–1855
Domain-Guided Novelty Detection for Autonomous Exploration
Pages 1864–1868
Tractable Multi-Agent Path Planning on Grid Maps
Pages 1870–1874
Markov Network Based Ontology Matching
Pages 1884–1888
Fast Recommendations using GAI Models
Pages 1896–1900
Multiobjective Optimization using GAI Models
Pages 1902–1906
Greedy Algorithms for Sequential Sensing Decisions
Pages 1908–1914
Learning Conditional Preference Networks with Queries
Pages 1930–1934
CTPPL: A Continuous Time Probabilistic Programming Language
Pages 1943–1949
Testing Edges by Truncations
Pages 1957–1962
Variable and Value Ordering for MPE Search
Pages 1964–1968
Learning a Value Analysis Tool for Agent Evaluation
Pages 1976–1980
A General Approach to Environment Design with One Agent
Pages 2002–2013
Sketching Techniques for Collaborative Filtering
Pages 2016–2020
Spatial Processes for Recommender Systems
Pages 2022–2026
Improving Search in Social Networks by Agent Based Mining
Pages 2034–2038
Consequence-Driven Reasoning for Horn SHIQ Ontologies
Pages 2040–2044
Using Web Photos for Measuring Video Frame Interestingness
Pages 2058–2062
A Content-Based Method to Enhance Tag Recommendation
Pages 2064–2068
Towards Ontology Learning from Folksonomies
Pages 2089–2093
Streamlining Attacks on CAPTCHAs with a Computer Game
Pages 2095–2099
Incorporating User Behaviors in New Word Detection
Pages 2101–2105
Front matter, copyright and publication details
Front matter
- Preface / vi
- IJCAI-09 Conference Organization / vii
- IJCAI-09 Sponsorship / xvi
- IJCAI-09 Awards and Distinguished Papers / xvii
- IJCAI-09 Keynote and Invited Speakers / xix
- Events Colocated with IJCAI-09 / xxi
- IJCAI Organization / xxii
- AAAI Organization / xxiv
- Past IJCAI Conferences / xxvi
- Plausible Repairs for Inconsistent Requirements / 791 Alexander Felfernig, Gerhard Friedrich, Monika Schubert, Monika Mandl, Markus Mairitsch, Erich Teppan Abstract
- Dialectical Abstract Argumentation: A Characterization of the Marking Criterion
- Active Policy Iteration: Efficient Exploration through Active Learning for Value Function Approximation in Reinforcement Learning / 980 Takayuki Akiyama, Hirotaka Hachiya, Masashi Sugiyama Abstract
- Efficient Skill Learning using Abstraction Selection
- Efficient Abstraction and Refinement for Behavioral Description Based Web Service Composition
