<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[xiaocong1990的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/xiaocong1990</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; xiaocong1990]]></copyright><item><title><![CDATA[基于DEAP库的Python进化算法从入门到入土--(一)进化算法的基本操作与实现]]></title><link>https://blog.youkuaiyun.com/xiaocong1990/article/details/142719660</link><guid>https://blog.youkuaiyun.com/xiaocong1990/article/details/142719660</guid><author>xiaocong1990</author><pubDate>Sat, 05 Oct 2024 21:53:17 +0800</pubDate><description><![CDATA[基于DEAP库的Python进化算法从入门到入土--(一)进化算法的基本操作与实现 - 简书]]></description><category></category></item><item><title><![CDATA[二分图匹配算法]]></title><link>https://blog.youkuaiyun.com/xiaocong1990/article/details/142683158</link><guid>https://blog.youkuaiyun.com/xiaocong1990/article/details/142683158</guid><author>xiaocong1990</author><pubDate>Wed, 02 Oct 2024 17:42:57 +0800</pubDate><description><![CDATA[二分图匹配算法-优快云博客]]></description><category></category></item><item><title><![CDATA[TTC算法与GS算法]]></title><link>https://blog.youkuaiyun.com/xiaocong1990/article/details/142682512</link><guid>https://blog.youkuaiyun.com/xiaocong1990/article/details/142682512</guid><author>xiaocong1990</author><pubDate>Wed, 02 Oct 2024 16:29:44 +0800</pubDate><description><![CDATA[获得诺奖的稳定匹配理论之TTC算法与GS算法 - 简书]]></description><category></category></item><item><title><![CDATA[数学建模运筹优化——规划问题Python版（线性、非线性、整数、0/1）]]></title><link>https://blog.youkuaiyun.com/xiaocong1990/article/details/142550975</link><guid>https://blog.youkuaiyun.com/xiaocong1990/article/details/142550975</guid><author>xiaocong1990</author><pubDate>Thu, 26 Sep 2024 11:06:39 +0800</pubDate><description><![CDATA[数学建模运筹优化——规划问题Python版（线性、非线性、整数、0/1）_python 运筹优化‘-优快云博客]]></description><category></category></item><item><title><![CDATA[初识滴滴交易策略]]></title><link>https://blog.youkuaiyun.com/xiaocong1990/article/details/141870004</link><guid>https://blog.youkuaiyun.com/xiaocong1990/article/details/141870004</guid><author>xiaocong1990</author><pubDate>Tue, 03 Sep 2024 19:40:50 +0800</pubDate><description><![CDATA[初识滴滴交易策略之一：交易市场_效率_技术_服务初识滴滴交易策略之二：司乘匹配_乘客_问题_双边初识滴滴交易策略之三：供需调节_市场_关系_变化]]></description><category></category></item><item><title><![CDATA[匈牙利算法]]></title><link>https://blog.youkuaiyun.com/xiaocong1990/article/details/141868732</link><guid>https://blog.youkuaiyun.com/xiaocong1990/article/details/141868732</guid><author>xiaocong1990</author><pubDate>Tue, 03 Sep 2024 18:29:13 +0800</pubDate><description><![CDATA[运筹优化（十五）--应用模型之分配问题_广义分配问题-优快云博客]]></description><category></category></item><item><title><![CDATA[RAG.]]></title><link>https://blog.youkuaiyun.com/xiaocong1990/article/details/140921126</link><guid>https://blog.youkuaiyun.com/xiaocong1990/article/details/140921126</guid><author>xiaocong1990</author><pubDate>Mon, 05 Aug 2024 10:47:54 +0800</pubDate><description><![CDATA[提升RAG——选择最佳Embedding和重新排名模型 | 我的学习笔记 | 土猛的员外]]></description><category></category></item><item><title><![CDATA[多模态.]]></title><link>https://blog.youkuaiyun.com/xiaocong1990/article/details/140714599</link><guid>https://blog.youkuaiyun.com/xiaocong1990/article/details/140714599</guid><author>xiaocong1990</author><pubDate>Fri, 26 Jul 2024 14:20:34 +0800</pubDate><description><![CDATA[https://blog.51cto.com/u_15060460/2674821]]></description><category></category></item><item><title><![CDATA[大模型微调]]></title><link>https://blog.youkuaiyun.com/xiaocong1990/article/details/140664041</link><guid>https://blog.youkuaiyun.com/xiaocong1990/article/details/140664041</guid><author>xiaocong1990</author><pubDate>Wed, 24 Jul 2024 15:16:03 +0800</pubDate><description><![CDATA[超详细LLama2+Lora微调实战_llama lora-优快云博客
]]></description><category></category></item><item><title><![CDATA[[leetcode]maximum-binary-tree 最大二叉树]]></title><link>https://blog.youkuaiyun.com/xiaocong1990/article/details/140346643</link><guid>https://blog.youkuaiyun.com/xiaocong1990/article/details/140346643</guid><author>xiaocong1990</author><pubDate>Thu, 11 Jul 2024 11:11:55 +0800</pubDate><description><![CDATA[【代码】[leetcode]maximum-binary-tree 最大二叉树。]]></description><category></category></item><item><title><![CDATA[[leetcode]subarray-product-less-than-k 乘积小于K的子数组]]></title><link>https://blog.youkuaiyun.com/xiaocong1990/article/details/140333980</link><guid>https://blog.youkuaiyun.com/xiaocong1990/article/details/140333980</guid><author>xiaocong1990</author><pubDate>Wed, 10 Jul 2024 21:00:42 +0800</pubDate><description><![CDATA[【代码】[leetcode]subarray-product-less-than-k 乘积小于K的子数组。]]></description><category></category></item><item><title><![CDATA[[leetcode] shortest-subarray-with-sum-at-least-k 和至少为 K 的最短子数组]]></title><link>https://blog.youkuaiyun.com/xiaocong1990/article/details/140333616</link><guid>https://blog.youkuaiyun.com/xiaocong1990/article/details/140333616</guid><author>xiaocong1990</author><pubDate>Wed, 10 Jul 2024 20:35:45 +0800</pubDate><description><![CDATA[【代码】[leetcode] shortest-subarray-with-sum-at-least-k 和至少为 K 的最短子数组。]]></description><category></category></item><item><title><![CDATA[[leetcode]circular-array-loop 环形数组是否存在循环]]></title><link>https://blog.youkuaiyun.com/xiaocong1990/article/details/140332953</link><guid>https://blog.youkuaiyun.com/xiaocong1990/article/details/140332953</guid><author>xiaocong1990</author><pubDate>Wed, 10 Jul 2024 19:59:41 +0800</pubDate><description><![CDATA[【代码】[leetcode]circular-array-loop 环形数组是否存在循环。]]></description><category></category></item><item><title><![CDATA[[leetcode]kth-smallest-element-in-a-sorted-matrix 有序矩阵中第k小元素]]></title><link>https://blog.youkuaiyun.com/xiaocong1990/article/details/140327295</link><guid>https://blog.youkuaiyun.com/xiaocong1990/article/details/140327295</guid><author>xiaocong1990</author><pubDate>Wed, 10 Jul 2024 16:21:20 +0800</pubDate><description><![CDATA[【代码】[leetcode]kth-smallest-element-in-a-sorted-matrix 有序矩阵中第k小元素。]]></description><category></category></item><item><title><![CDATA[[leetcode]partition-list 分隔链表]]></title><link>https://blog.youkuaiyun.com/xiaocong1990/article/details/140325006</link><guid>https://blog.youkuaiyun.com/xiaocong1990/article/details/140325006</guid><author>xiaocong1990</author><pubDate>Wed, 10 Jul 2024 15:20:53 +0800</pubDate><description><![CDATA[【代码】[leetcode]partition-list 分隔链表。]]></description><category></category></item><item><title><![CDATA[[leetcode]minimum-cost-to-reach-destination-in-time 规定时间内到达终点的最小费用]]></title><link>https://blog.youkuaiyun.com/xiaocong1990/article/details/140322952</link><guid>https://blog.youkuaiyun.com/xiaocong1990/article/details/140322952</guid><author>xiaocong1990</author><pubDate>Wed, 10 Jul 2024 14:23:58 +0800</pubDate><description><![CDATA[【代码】[leetcode]minimum-cost-to-reach-destination-in-time 规定时间内到达终点的最小费用。]]></description><category></category></item><item><title><![CDATA[[leetcode] car-pooling 拼车]]></title><link>https://blog.youkuaiyun.com/xiaocong1990/article/details/140316936</link><guid>https://blog.youkuaiyun.com/xiaocong1990/article/details/140316936</guid><author>xiaocong1990</author><pubDate>Wed, 10 Jul 2024 10:34:59 +0800</pubDate><description><![CDATA[【代码】[leetcode] car-pooling 拼车。]]></description><category></category></item><item><title><![CDATA[[leetcode] largest-divisible-subset 最大整除子集]]></title><link>https://blog.youkuaiyun.com/xiaocong1990/article/details/140316130</link><guid>https://blog.youkuaiyun.com/xiaocong1990/article/details/140316130</guid><author>xiaocong1990</author><pubDate>Wed, 10 Jul 2024 10:15:48 +0800</pubDate><description><![CDATA[【代码】[leetcode] largest-divisible-subset 最大整除子集。]]></description><category></category></item><item><title><![CDATA[[leetcode]minimum-absolute-difference-in-bst 二叉搜索树的最小绝对差]]></title><link>https://blog.youkuaiyun.com/xiaocong1990/article/details/140107515</link><guid>https://blog.youkuaiyun.com/xiaocong1990/article/details/140107515</guid><author>xiaocong1990</author><pubDate>Mon, 01 Jul 2024 18:23:55 +0800</pubDate><description><![CDATA[【代码】[leetcode]minimum-absolute-difference-in-bst 二叉搜索树的最小绝对差。]]></description><category></category></item><item><title><![CDATA[[leetcode]max-consecutive-ones 最大连续1的个数]]></title><link>https://blog.youkuaiyun.com/xiaocong1990/article/details/140102519</link><guid>https://blog.youkuaiyun.com/xiaocong1990/article/details/140102519</guid><author>xiaocong1990</author><pubDate>Mon, 01 Jul 2024 15:32:14 +0800</pubDate><description><![CDATA[【代码】[leetcode]max-consecutive-ones 最大连续1的个数。]]></description><category></category></item></channel></rss>