Pages that link to "Item:Q110835"

The following pages link to Journal of Artificial Intelligence Research (Q110835):

Displaying 50 items.

• When do Numbers Really Matter? (Q110838) (← links)
• LexRank: Graph-based Lexical Centrality as Salience in Text Summarization (Q146304) (← links)
• Iterative Plan Construction for the Workflow Satisfiability Problem (Q2938473) (← links)
• No Agent Left Behind: Dynamic Fair Division of Multiple Resources (Q2938474) (← links)
• The Complexity of Answering Conjunctive and Navigational Queries over OWL 2 EL Knowledge Bases (Q2938475) (← links)
• On Minimum Representations of Matched Formulas (Q2938476) (← links)
• Tutorial on Structured Continuous-Time Markov Processes (Q2938477) (← links)
• BDD Ordering Heuristics for Classical Planning (Q2938478) (← links)
• An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information (Q2938479) (← links)
• Coherent Predictive Inference under Exchangeability with Imprecise Probabilities (Q2940590) (← links)
• Deterministic Oversubscription Planning as Heuristic Search: Abstractions and Reformulations (Q2940591) (← links)
• Agnostic Pointwise-Competitive Selective Classification (Q2940592) (← links)
• Clause Elimination for SAT and QSAT (Q2941732) (← links)
• Using Machine Translation to Provide Target-Language Edit Hints in Computer Aided Translation Based on Translation Memories (Q2941734) (← links)
• Probabilistic Inference Techniques for Scalable Multiagent Decision Making (Q2941735) (← links)
• Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization (Q2941736) (← links)
• Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms (Q2941737) (← links)
• Approximate Value Iteration with Temporally Extended Actions (Q2941739) (← links)
• Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates (Q2941740) (← links)
• Satsisfiability and Systematicity (Q2941741) (← links)
• ITSAT: An Efficient SAT-Based Temporal Planner (Q2941742) (← links)
• Placement of Loading Stations for Electric Vehicles: No Detours Necessary! (Q2941743) (← links)
• Evolutionary Dynamics of Multi-Agent Learning: A Survey (Q2941744) (← links)
• Tree-Width and the Computational Complexity of MAP Approximations in Bayesian Networks (Q2941745) (← links)
• Goal Probability Analysis in Probabilistic Planning: Exploring and Enhancing the State of the Art (Q2953929) (← links)
• Effective Heuristics for Suboptimal Best-First Search (Q2953931) (← links)
• Scrubbing During Learning In Real-time Heuristic Search (Q2953932) (← links)
• A Primer on Neural Network Models for Natural Language Processing (Q2953934) (← links)
• Embarrassingly Parallel Search in Constraint Programming (Q2953936) (← links)
• ProMoca: Probabilistic Modeling and Analysis of Agents in Commitment Protocols (Q2953937) (← links)
• Convergence of Iterative Scoring Rules (Q2953938) (← links)
• P-SyncBB: A Privacy Preserving Branch and Bound DCOP Algorithm (Q2953939) (← links)
• Probabilistic Description Logics for Subjective Uncertainty (Q2953940) (← links)
• Tie-Breaking Strategies for Cost-Optimal Best First Search (Q2956545) (← links)
• Subset Selection Via Implicit Utilitarian Voting (Q2956546) (← links)
• Controlled School Choice with Soft Bounds and Overlapping Types (Q2962569) (← links)
• Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity (Q2962570) (← links)
• DESPOT: Online POMDP Planning with Regularization (Q2962572) (← links)
• Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function (Q2962573) (← links)
• Computational Aspects of Nearly Single-Peaked Electorates (Q2962574) (← links)
• A Model-Theoretic View on Qualitative Constraint Reasoning (Q2974510) (← links)
• The Computational Complexity of Structure-Based Causality (Q2974511) (← links)
• New Canonical Representations by Augmenting OBDDs with Conjunctive Decomposition (Q2974513) (← links)
• A Probabilistic Formalization of the Appraisal for the OCC Event-Based Emotions (Q2974516) (← links)
• Combinatorial Multi-armed Bandits for Real-Time Strategy Games (Q2974517) (← links)
• A Neural Probabilistic Structured-Prediction Method for Transition-Based Natural Language Processing (Q2974520) (← links)
• Managing Different Sources of Uncertainty in a BDI Framework in a Principled Way with Tractable Fragments (Q2974522) (← links)
• Some Properties of Batch Value of Information in the Selection Problem (Q2974524) (← links)
• Randomized Social Choice Functions Under Metric Preferences (Q2985108) (← links)
• Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning (Q2985109) (← links)