Dynamic Programming Approach for Partial Decision Rule Optimization
IF 0.4
4区 计算机科学
Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING
引用次数: 0
Abstract
This paper is devoted to the study of an extension of dynamic programming approach which allows optimization of partial decision rules relative to the length or coverage. We introduce an uncertaint...局部决策规则优化的动态规划方法
本文研究了动态规划方法的一种扩展，该方法允许部分决策规则相对于长度或覆盖范围进行优化。我们引入一个不确定的…
本文章由计算机程序翻译，如有差异，请以英文原文为准。
求助全文
约1分钟内获得全文
求助全文
来源期刊
Fundamenta Informaticae
工程技术-计算机：软件工程
CiteScore
2.00
自引率
0.00%
发文量
61
审稿时长
9.8 months
期刊介绍：
Fundamenta Informaticae is an international journal publishing original research results in all areas of theoretical computer science. Papers are encouraged contributing:
solutions by mathematical methods of problems emerging in computer science
solutions of mathematical problems inspired by computer science.
Topics of interest include (but are not restricted to):
theory of computing,
complexity theory,
algorithms and data structures,
computational aspects of combinatorics and graph theory,
programming language theory,
theoretical aspects of programming languages,
computer-aided verification,
computer science logic,
database theory,
logic programming,
automated deduction,
formal languages and automata theory,
concurrency and distributed computing,
cryptography and security,
theoretical issues in artificial intelligence,
machine learning,
pattern recognition,
algorithmic game theory,
bioinformatics and computational biology,
quantum computing,
probabilistic methods,
algebraic and categorical methods.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
