Entity usage
From MaRDI portal
This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.
Showing below up to 50 results in range #1 to #50.
- Scalable distributed algorithms for size-constrained submodular maximization in the MapReduce and adaptive complexity models: Label: en
- The RL/LLM taxonomy tree: reviewing synergies between reinforcement learning and large language models: Label: en
- Achieving zero constraint violation for concave utility constrained reinforcement learning via primal-dual approach: Label: en
- On expected value strong controllability: Label: en
- Graphmax for text generation: Label: en
- A survey of learning criteria going beyond the usual risk: Label: en
- Generalizing group fairness in machine learning via utilities: Label: en
- Efficiently explaining CSPs with unsatisfiable subset optimization: Label: en
- On the parallel parameterized complexity of MaxSAT variants: Label: en
- Actor prioritized experience replay: Label: en
- Maximisation of admissible multi-objective heuristics: Label: en
- Scalable neural-probabilistic answer set programming: Label: en
- Maintenance of plan libraries for case-based planning: offline and online policies: Label: en
- Asymptotics of K-fold cross validation: Label: en
- How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\): Label: en
- Non-crossing anonymous MAPF for tethered robots: Label: en
- A comprehensive survey on deep graph representation learning methods: Label: en
- Embedding ontologies in the description logic \(\mathcal{ALC}\) by axis-aligned cones: Label: en
- Clustering what matters: optimal approximation for clustering with outliers: Label: en
- Sequence-oriented diagnosis of discrete-event systems: Label: en
- A benchmark study on knowledge graphs enrichment and pruning methods in the presence of noisy relationships: Label: en
- Exploiting functional constraints in automatic dominance breaking for constraint optimization: Label: en
- Automatically finding the right probabilities in Bayesian networks: Label: en
- Optimality guarantees for particle belief approximation of POMDPs: Label: en
- Certified dominance and symmetry breaking for combinatorial optimisation: Label: en
- Classes of hard formulas for QBF resolution: Label: en
- Qualitative reasoning about 2D cardinal directions using answer set programming: Label: en
- Dynamic controllability of temporal plans in uncertain and partially observable environments: Label: en
- Program synthesis with best-first bottom-up search: Label: en
- Complexity of computing the Shapley value in partition function form games: Label: en
- Hierarchical decompositions and termination analysis for generalized planning: Label: en
- Mimicking behaviors in separated domains: Label: en
- A model to support collective reasoning: formalization, analysis and computational assessment: Label: en
- Information lattice learning: Label: en
- Equivalence in argumentation frameworks with a claim-centric view: classical results with novel ingredients: Label: en
- Your college dorm and dormmates: fair resource sharing with externalities: Label: en
- The Jiminy advisor: moral agreements among stakeholders based on norms and argumentation: Label: en
- First-order context-specific likelihood weighting in hybrid probabilistic logic programs: Label: en
- On dynamics in structured argumentation formalisms: Label: en
- Stackelberg security games with contagious attacks on a network: reallocation to the rescue: Label: en
- The complexity of matching games: a survey: Label: en
- Contract scheduling with predictions: Label: en
- On centralized critics in multi-agent reinforcement learning: Label: en
- Semiring reasoning frameworks in AI and their computational complexity: Label: en
- Exploiting action impact regularity and exogenous state variables for offline reinforcement learning: Label: en
- Object-agnostic affordance categorization via unsupervised learning of graph embeddings: Label: en
- Optimal scheduling of contract algorithms for anytime problem-solving: Label: en
- Reasoning about topological and cardinal direction relations between 2-dimensional spatial objects: Label: en
- Push and rotate: a complete multi-agent pathfinding algorithm: Label: en
- Scoring functions based on second level score for \(k\)-SAT with long clauses: Label: en