<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Flanoc的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Flanoc</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Flanoc]]></copyright><item><title><![CDATA[[性能分析与优化]循环展开(perf + cpp)]]></title><link>https://blog.youkuaiyun.com/Flanoc/article/details/152091804</link><guid>https://blog.youkuaiyun.com/Flanoc/article/details/152091804</guid><author>Flanoc</author><pubDate>Thu, 25 Sep 2025 20:22:47 +0800</pubDate><description><![CDATA[根据以上分析可知，最主要需要分析的就是branch与branch-misses。测试以[1024]的向量乘法为例,分别对朴素实现与AVX实现尝试比较循环展开。循环展开的核心思想是减少循环迭代次数，同时在每次迭代中执行更多的操作。：更简单的控制流模式有利于预测器工作。：循环条件判断次数显著降低。：减少流水线清空和气泡。]]></description><category></category></item><item><title><![CDATA[[性能分析与优化]伪共享问题（perf + cpp)]]></title><link>https://blog.youkuaiyun.com/Flanoc/article/details/147769872</link><guid>https://blog.youkuaiyun.com/Flanoc/article/details/147769872</guid><author>Flanoc</author><pubDate>Wed, 17 Sep 2025 23:52:17 +0800</pubDate><description><![CDATA[由于cache写回内存时也是按照数据行进行写入的，导致了写回内存时并不能做到真正的共享，而是需要等待。]]></description><category></category></item><item><title><![CDATA[【强化学习】SPG DPG DDPG（DPG3）]]></title><link>https://blog.youkuaiyun.com/Flanoc/article/details/111997663</link><guid>https://blog.youkuaiyun.com/Flanoc/article/details/111997663</guid><author>Flanoc</author><pubDate>Wed, 30 Dec 2020 20:19:05 +0800</pubDate><description><![CDATA[数学公式警告
Policy Gradient
KaTeX parse error: No such environment: align at position 8: 
\begin{̲a̲l̲i̲g̲n̲}̲J(\pi_\theta)=&amp;…
ρπ(s′)=∫S∑t=1∞γt−1p1(s)p(s→s′,t,π)ds\rho^\pi(s') = \int_S \sum_{t=1}^ {\infty} \gamma^{t-1}p_1(s)p(s\to s',t,\pi)dsρπ(s′)=∫S​∑t=1∞]]></description><category></category></item><item><title><![CDATA[【强化学习】DQN (DPG2)]]></title><link>https://blog.youkuaiyun.com/Flanoc/article/details/111939938</link><guid>https://blog.youkuaiyun.com/Flanoc/article/details/111939938</guid><author>Flanoc</author><pubDate>Wed, 30 Dec 2020 00:18:09 +0800</pubDate><description><![CDATA[DQN
基础算法


网络结构
DQN与普通的Q-leaning的区别之一在于使用一个DCNN来近似Q(s,a)，在论文中的一代目DQN中使用的是三个卷积层+两个全连接层
经验重放
另外一个区别在于利用了经验回放训练强化学习的学习过程，即一个经验池保存了(s,a,R,s′,done)(s,a,R,s',done)(s,a,R,s′,done)这一种五元组，之后训练时也从经验池中取出值进行训练。
训练神经网络时，存在的假设是训练数据是独立同分布的，但是通过强化学习采集的数据之间存在着关联性，利用这些数据进行顺]]></description><category></category></item><item><title><![CDATA[【强化学习】部分基础知识（DPG 1）]]></title><link>https://blog.youkuaiyun.com/Flanoc/article/details/111877264</link><guid>https://blog.youkuaiyun.com/Flanoc/article/details/111877264</guid><author>Flanoc</author><pubDate>Mon, 28 Dec 2020 23:22:57 +0800</pubDate><description><![CDATA[Method
Value-Based(actor)
step1: 将神经网络作为actor
step2: 衡量actor的好坏
step3: 选择最好的actor
Policy-Based(Critic)
Critic: 用来评估actor
State value function(V): 在看到某一个状态state的时候预期能够得到的累积收益Estimation of V:

Monte-Carlo(MC): critic会观察actor π\piπ 玩游戏的整个过程, 具有不确定性，较大的方差，但结果无]]></description><category></category></item><item><title><![CDATA[【简单数论】 gcd + exgcd + 逆元]]></title><link>https://blog.youkuaiyun.com/Flanoc/article/details/106070163</link><guid>https://blog.youkuaiyun.com/Flanoc/article/details/106070163</guid><author>Flanoc</author><pubDate>Tue, 12 May 2020 10:52:01 +0800</pubDate><description><![CDATA[int gcd(int x,int y){return a%b==0? b:gcd(b,a%b);}

首先对于基础gcd，基于性质gcd(a,b)=gcd(b,a%b)


int x,y;
int exgcd(int a,int b)
{
    if(b == 0)
    {   
        x=1;
        y=0;
        return a;
    }
    int ans = exgcd(b,a%b);
    int t=y;
    y = x - a/b*t;.]]></description><category></category></item><item><title><![CDATA[Objective-C 复合学习笔记]]></title><link>https://blog.youkuaiyun.com/Flanoc/article/details/83755151</link><guid>https://blog.youkuaiyun.com/Flanoc/article/details/83755151</guid><author>Flanoc</author><pubDate>Mon, 05 Nov 2018 19:42:32 +0800</pubDate><description><![CDATA[
@interface Car : NSObject
{
	Engine *engine;
	Tire *tires[4];
}

复合既是指用多种对象组成的新的对象。


#import &amp;lt;Foundation/Foundation.h&amp;gt;


// --------------------------------------------------

@interface Tire ...]]></description><category></category></item><item><title><![CDATA[Objective-C 继承学习笔记]]></title><link>https://blog.youkuaiyun.com/Flanoc/article/details/82874548</link><guid>https://blog.youkuaiyun.com/Flanoc/article/details/82874548</guid><author>Flanoc</author><pubDate>Thu, 27 Sep 2018 23:05:00 +0800</pubDate><description><![CDATA[
// All about Triangles

@interface Triangle : Shape
{
}

@end // Triangle


@implementation Triangle

- (void) draw
{
	NSLog (@&quot;drawing a triangle at (%d %d %d %d) in %@&quot;,
		   bounds.x, bounds.y, 
	...]]></description><category></category></item><item><title><![CDATA[Objective-C 类与方法学习笔记]]></title><link>https://blog.youkuaiyun.com/Flanoc/article/details/82858003</link><guid>https://blog.youkuaiyun.com/Flanoc/article/details/82858003</guid><author>Flanoc</author><pubDate>Wed, 26 Sep 2018 19:54:43 +0800</pubDate><description><![CDATA[
@interface Shape : NSObject
{
	ShapeColor  fillColor;
	ShapeRect   bounds;
}

- (void) setFillColor: (ShapeColor) fillColor;
- (void) setBounds: (ShapeRect) bounds;
- (void) draw;

@end // Shape


@i...]]></description><category></category></item><item><title><![CDATA[【动态规划24】bzoj3437小P的牧场(dp+斜率优化)]]></title><link>https://blog.youkuaiyun.com/Flanoc/article/details/74892457</link><guid>https://blog.youkuaiyun.com/Flanoc/article/details/74892457</guid><author>Flanoc</author><pubDate>Sun, 09 Jul 2017 16:26:40 +0800</pubDate><description><![CDATA[斜率优化dp]]></description><category></category></item><item><title><![CDATA[【Hash】bzoj4337 BJOI2015树的同构]]></title><link>https://blog.youkuaiyun.com/Flanoc/article/details/74859185</link><guid>https://blog.youkuaiyun.com/Flanoc/article/details/74859185</guid><author>Flanoc</author><pubDate>Sun, 09 Jul 2017 13:15:24 +0800</pubDate><description><![CDATA[树的哈希]]></description><category></category></item><item><title><![CDATA[「LibreOJ NOI Round #1」接竹竿 (dp+前缀和优化)]]></title><link>https://blog.youkuaiyun.com/Flanoc/article/details/74738029</link><guid>https://blog.youkuaiyun.com/Flanoc/article/details/74738029</guid><author>Flanoc</author><pubDate>Fri, 07 Jul 2017 16:40:50 +0800</pubDate><description><![CDATA[dp+前缀和优化]]></description><category></category></item><item><title><![CDATA[【NOI2015】软件包管理器（树链剖分）]]></title><link>https://blog.youkuaiyun.com/Flanoc/article/details/74421407</link><guid>https://blog.youkuaiyun.com/Flanoc/article/details/74421407</guid><author>Flanoc</author><pubDate>Wed, 05 Jul 2017 13:54:00 +0800</pubDate><description><![CDATA[树链剖分模板题（？）]]></description><category></category></item><item><title><![CDATA[【P3384】【模板】树链剖分]]></title><link>https://blog.youkuaiyun.com/Flanoc/article/details/74418414</link><guid>https://blog.youkuaiyun.com/Flanoc/article/details/74418414</guid><author>Flanoc</author><pubDate>Wed, 05 Jul 2017 13:13:36 +0800</pubDate><description><![CDATA[树链剖分模板]]></description><category></category></item><item><title><![CDATA[【NOI2016】区间（线段树+离散化）]]></title><link>https://blog.youkuaiyun.com/Flanoc/article/details/74331717</link><guid>https://blog.youkuaiyun.com/Flanoc/article/details/74331717</guid><author>Flanoc</author><pubDate>Tue, 04 Jul 2017 15:48:04 +0800</pubDate><description><![CDATA[线段树+离散化]]></description><category></category></item><item><title><![CDATA[【动态规划23】hdu5036 Explosion(bitset优化)]]></title><link>https://blog.youkuaiyun.com/Flanoc/article/details/74295186</link><guid>https://blog.youkuaiyun.com/Flanoc/article/details/74295186</guid><author>Flanoc</author><pubDate>Tue, 04 Jul 2017 10:35:08 +0800</pubDate><description><![CDATA[bitset优化
dp]]></description><category></category></item><item><title><![CDATA[【动态规划22】LiberOJ#515. 「LibreOJ β Round #2」贪心只能过样例(bitset优化)]]></title><link>https://blog.youkuaiyun.com/Flanoc/article/details/74276015</link><guid>https://blog.youkuaiyun.com/Flanoc/article/details/74276015</guid><author>Flanoc</author><pubDate>Mon, 03 Jul 2017 20:52:25 +0800</pubDate><description><![CDATA[bitset优化]]></description><category></category></item><item><title><![CDATA[【bzoj2038】[2009国家集训队]小Z的袜子(hose) （莫队算法）]]></title><link>https://blog.youkuaiyun.com/Flanoc/article/details/74066977</link><guid>https://blog.youkuaiyun.com/Flanoc/article/details/74066977</guid><author>Flanoc</author><pubDate>Sat, 01 Jul 2017 16:21:11 +0800</pubDate><description><![CDATA[莫队算法]]></description><category></category></item><item><title><![CDATA[Codeforces Round #421 Mister B and PR Shifts（暴力瞎搞）]]></title><link>https://blog.youkuaiyun.com/Flanoc/article/details/73863710</link><guid>https://blog.youkuaiyun.com/Flanoc/article/details/73863710</guid><author>Flanoc</author><pubDate>Wed, 28 Jun 2017 20:28:52 +0800</pubDate><description><![CDATA[http://codeforces.com/contest/819/problem/B
暴力瞎搞]]></description><category></category></item><item><title><![CDATA[【动态规划21】Codeforces Round #420 821E Okabe and El Psy Kongroo（dp+矩阵快速幂）]]></title><link>https://blog.youkuaiyun.com/Flanoc/article/details/73822785</link><guid>https://blog.youkuaiyun.com/Flanoc/article/details/73822785</guid><author>Flanoc</author><pubDate>Tue, 27 Jun 2017 19:46:24 +0800</pubDate><description><![CDATA[dp+矩阵快速幂]]></description><category></category></item></channel></rss>