Similar Items: Exact and Approximate Determinization of Discounted-Sum Automata
- Discounted-Sum Automata with Multiple Discount Factors
- Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
- Integrity Constraints Revisited: From Exact to Approximate Implication
- Exact and Approximate Algorithms for Polytree Learning
- On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering
- An Objective Improvement Approach to Solving Discounted Payoff Games