<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>https://ecency.com</link><image><url>https://ecency.com/logo512.png</url><title>RSS Feed</title><link>https://ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Tue, 18 Aug 2026 17:24:25 GMT</lastBuildDate><atom:link href="https://ecency.com/created/dynamic-programming/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[AI学习笔记——动态规划(Dynamic Programming)解决MDP(2)]]></title><description><![CDATA[求解最优MDP实际上就是找到最佳策略(Policy)π来最大化来最大化V函数(Value Function)。 1. 策略估算(Policy Evaluation) 在MDP问题中，如何评估一个策略的好坏呢？那我们就计算这个策略的V函数（值函数），这里我们又要用到之前文章中提到的Bellman Equation了。 这个等式可以通过下一个状态的值函数来求得当前状态的值函数。如果我们对上面这个Bellman]]></description><link>https://ecency.com/@hongtao/ai-dynamic-programming-mdp-2</link><guid isPermaLink="true">https://ecency.com/@hongtao/ai-dynamic-programming-mdp-2</guid><category><![CDATA[ai]]></category><dc:creator><![CDATA[hongtao]]></dc:creator><pubDate>Wed, 03 Oct 2018 22:13:54 GMT</pubDate><enclosure url="https://i.ecency.com/p/C3TZR1g81UNaPs7vzNXHueW5ZM76DSHWEY7onmfLxcK2iPKH8neAGpmoFpDxznzjhPCUPkHQtqZBetVadnrTfJwWBGkJpcraN25EKSfpGK6nV4Priyb5fxS?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[AI学习笔记——动态规划(Dynamic Programming)解决MDP(1)]]></title><description><![CDATA[我们介绍过MDP(Markov Decision Processes马可夫决策过程)以及什么是最优MDP，甚至从强化学习的角度介绍了DQN，Q-learning, Sarsa 等求解最优MDP方法，但是要深入理解强化学习，必须了解背后支持的理论基础。动态规划(Dynamic programming)就是这些算法为什么能够求解最优MDP的理论基础。]]></description><link>https://ecency.com/@hongtao/ai-dynamic-programming-mdp-1</link><guid isPermaLink="true">https://ecency.com/@hongtao/ai-dynamic-programming-mdp-1</guid><category><![CDATA[ai]]></category><dc:creator><![CDATA[hongtao]]></dc:creator><pubDate>Mon, 01 Oct 2018 08:39:45 GMT</pubDate><enclosure url="https://i.ecency.com/p/C3TZR1g81UNaPs7vzNXHueW5ZM76DSHWEY7onmfLxcK2iQHYFZZGJq9Z4wgogdqXJEPzCmKqZzSgFPtJc6W5fBFb6KByUVhrXzquuqAzRb8ZjnVJqMByNmU?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Real-time implementation of optimal control considering gear shifting and engine starting for parallel hybrid electric vehicle based on dynamic programming]]></title><description><![CDATA[By a News Reporter-Staff News Editor at Journal of Engineering -- Investigators publish new report on Dynamic Programming. According to news reporting originating in Luoyang, People’s Republic of China,]]></description><link>https://ecency.com/@newsrx/real-time-implementation-of-optimal-control-considering-gear-shifting-and-engine-starting-for-parallel-hybrid-electric-vehicle-based-on-dynamic-programming</link><guid isPermaLink="true">https://ecency.com/@newsrx/real-time-implementation-of-optimal-control-considering-gear-shifting-and-engine-starting-for-parallel-hybrid-electric-vehicle-based-on-dynamic-programming</guid><category><![CDATA[news]]></category><dc:creator><![CDATA[newsrx]]></dc:creator><pubDate>Mon, 09 Apr 2018 16:53:42 GMT</pubDate><enclosure url="https://i.ecency.com/p/C3TZR1g81UNchGPKLQuxAL7oEwDJ42cT977qXjChVMhaeqjkhM6ie2vMiBpKiUBYV9fZZrKKxzEynaGmjDDXm6pSo8RCVXm3fzhBet7bKZqfMGyAQbiqYx6?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Software Engineer Interview Question – How to Improve Dynamic Programming Space Complexity?  进一步改进动态规化的空间复杂度]]></title><description><![CDATA[In yesterday's post, we present the final ‘optimized’ solution using Dynamic Programming, which is implemented using a 2 dimensional array with iteration. Let’s review this code:  昨天发了这个帖子讲到动态规化的2种改进,]]></description><link>https://ecency.com/@justyy/software-engineer-interview-question-how-to-improve-dynamic-programming-space-complexity</link><guid isPermaLink="true">https://ecency.com/@justyy/software-engineer-interview-question-how-to-improve-dynamic-programming-space-complexity</guid><category><![CDATA[cn]]></category><dc:creator><![CDATA[justyy]]></dc:creator><pubDate>Mon, 07 Aug 2017 18:11:18 GMT</pubDate><enclosure url="https://i.ecency.com/p/368La1qZAv72NCBo3HWH3CcMFSfMzNP7EXr8B5dnUpkbLcyDjiX1UqDBkQKdmuY1LbKcdCvvbSDHv6qyKCgK243Y?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Software Engineer Interview Question - How Many Ways from A to C via B? 软件工程师面试技巧之 从A到B再到C有多少种方法?]]></title><description><![CDATA[Let’s see this question: If @kenchung starts at A, and he can only travels one move at a time to the north or east, and he cannot go back. If he needs to travel through B, and finally reach C, how many]]></description><link>https://ecency.com/@justyy/software-engineer-interview-question-how-many-ways-from-a-to-c-via-b-a-b-c</link><guid isPermaLink="true">https://ecency.com/@justyy/software-engineer-interview-question-how-many-ways-from-a-to-c-via-b-a-b-c</guid><category><![CDATA[cn]]></category><dc:creator><![CDATA[justyy]]></dc:creator><pubDate>Sun, 06 Aug 2017 22:09:30 GMT</pubDate><enclosure url="https://i.ecency.com/p/3HaJVw3AYyXBEpcZfJ6rUiRsoPNoXsn5Fp6uwoRHiwo6vZVvzJJhfsZNbbdxz67EBofPPD33VL7ggJWKLF3F6Gu1jE6vT37fJweDzF8?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Software Engineer Interview Question - Dynamic Programming - Integer Break 软件工程师面试技巧之 动态规化 - 整数拆分]]></title><description><![CDATA[Dynamic Programming (DP)  is one of the very important algorithm in Computer Science. Here is the simplest example of demonstrating the concept of DP if you want to tell you 5-year-old son. Give 5]]></description><link>https://ecency.com/@justyy/software-engineer-interview-question-dynamic-programming-integer-break</link><guid isPermaLink="true">https://ecency.com/@justyy/software-engineer-interview-question-dynamic-programming-integer-break</guid><category><![CDATA[cn]]></category><dc:creator><![CDATA[justyy]]></dc:creator><pubDate>Sun, 06 Aug 2017 15:37:33 GMT</pubDate><enclosure url="https://i.ecency.com/p/B69zEgfimpHMsEPzuu75TRccjWwsqHR2abWVijurZ33AGNTWsxkDpjtBNKTiE91iNFb2L1wUSM9CJfXk7Bpuwm7MUFwWo6aim2ij7E1c?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[错位排列 的 R语言实现]]></title><description><![CDATA[ 递归终止条件: F(1) = 0, F(2) = 1. 具体的推导可以看这里.英文: Derangement Permutation Implementation using R Programming    XXX原文::]]></description><link>https://ecency.com/@justyy/r</link><guid isPermaLink="true">https://ecency.com/@justyy/r</guid><category><![CDATA[cn]]></category><dc:creator><![CDATA[justyy]]></dc:creator><pubDate>Sat, 20 Aug 2016 20:54:57 GMT</pubDate></item></channel></rss>