The following pages link to Artificial Intelligence (Q72340):
Displaying 50 items.
- Depth-based short-sighted stochastic shortest path problems (Q460624) (← links)
- Plan aggregation for strong cyclic planning in nondeterministic domains (Q460629) (← links)
- Finding explanations of inconsistency in multi-context systems (Q460632) (← links)
- The unbiased black-box complexity of partition is polynomial (Q460634) (← links)
- Better redistribution with inefficient allocation in multi-unit auctions (Q460636) (← links)
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (Q464615) (← links)
- Spatial reasoning with \(\mathcal{RCC} 8\) and connectedness constraints in Euclidean spaces (Q464617) (← links)
- Relations of epistemic proximity for belief change (Q464618) (← links)
- Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information (Q464622) (← links)
- kLog: a language for logical and relational learning with kernels (Q464624) (← links)
- On the input/output behavior of argumentation frameworks (Q464629) (← links)
- Belief functions on distributive lattices (Q490415) (← links)
- Qualitative constraint satisfaction problems: an extended framework with landmarks (Q490417) (← links)
- Minimal change: relevance and recovery revisited (Q490421) (← links)
- Multiple instance classification: review, taxonomy and comparative study (Q490423) (← links)
- Computing cooperative solution concepts in coalitional skill games (Q490424) (← links)
- Speeding up many-objective optimization by Monte Carlo approximations (Q490427) (← links)
- Type extension trees for feature construction and learning in relational domains (Q490428) (← links)
- End-user feature labeling: supervised and semi-supervised approaches based on locally-weighted logistic regression (Q490436) (← links)
- Local search for Boolean satisfiability with configuration checking and subscore (Q490437) (← links)
- An analysis on recombination in multi-objective evolutionary optimization (Q490439) (← links)
- Evidential reasoning rule for evidence combination (Q490440) (← links)
- On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables (Q490443) (← links)
- Approximating operators and semantics for abstract dialectical frameworks (Q490444) (← links)
- Lost in translation: language independence in propositional logic -- application to belief change (Q490446) (← links)
- CROSS cyclic resource-constrained scheduling solver (Q490449) (← links)
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
- Relating constraint answer set programming languages and algorithms (Q490456) (← links)
- Algorithms for decision problems in argument systems under preferred semantics (Q490457) (← links)
- The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
- Hidden protocols: modifying our expectations in an evolving world (Q490513) (← links)
- Weighted synergy graphs for effective team formation with heterogeneous ad hoc agents (Q490516) (← links)
- A logic for reasoning about ambiguity (Q490518) (← links)
- Concept drift detection via competence models (Q490520) (← links)
- Consequence-based and fixed-parameter tractable reasoning in description logics (Q490523) (← links)
- An event-based distributed diagnosis framework using structural model decomposition (Q490646) (← links)
- Limitations of acyclic causal graphs for planning (Q490647) (← links)
- On the tractability of minimal model computation for some CNF theories (Q490649) (← links)
- The dropout learning algorithm (Q490652) (← links)
- The configurable SAT solver challenge (CSSC) (Q502389) (← links)
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391) (← links)
- Query efficient posterior estimation in scientific experiments via Bayesian active learning (Q502395) (← links)
- On information invariants in robotics (Q504012) (← links)
- Introduction to the special issue on combining constraint solving with mining and learning (Q511749) (← links)
- MiningZinc: a declarative framework for constraint-based mining (Q511753) (← links)
- Mining top-\(k\) motifs with a SAT-based framework (Q511756) (← links)
- Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems (Q511763) (← links)
- Constrained clustering by constraint programming (Q511767) (← links)
