Policy Iteration-Based Conditional Termination and Ranking Functions

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-54013-4_25
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Conflict-Driven Conditional Termination

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Policy Iteration Based on a Learned Transition Model

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Iteration Functions Re-Visited

Journal of Computational and Applied Mathematics
Computational MathematicsApplied Mathematics
2017English

Learning Conditional Independence Tree for Ranking

English

Preference-Based Policy Iteration: Leveraging Preference Learning for Reinforcement Learning

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Active Evaluation of Ranking Functions Based on Graded Relevance

Machine Learning
Artificial IntelligenceSoftware
2013English

Termination of Isabelle Functions via Termination of Rewriting

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Eventual Linear Ranking Functions

2013English

A Complexity Tradeoff in Ranking-Function Termination Proofs

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy