<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[slicer的技术交流栈]]></title><description><![CDATA[14a&a41]]></description><link>https://blog.csdn.net/fghdvbgt</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; fghdvbgt]]></copyright><item><title><![CDATA[POJ 2015 IP Address]]></title><link>https://blog.csdn.net/fghdvbgt/article/details/52403341</link><guid>https://blog.csdn.net/fghdvbgt/article/details/52403341</guid><author>fghdvbgt</author><pubDate>Thu, 01 Sep 2016 21:11:27 +0800</pubDate><description><![CDATA[POJ 2015 IPAddress


题目链接：http://poj.org/problem?id=2105

题目类型：纯水无坑

题目描述：把二进制格式的IPv4转换成点分十进制格式，顺着读字符串就行，实在不通可以在纸上写写index。

code:


#include
#include
int main()
{
	int p;
	char s[40];
	int]]></description><category></category></item><item><title><![CDATA[蚁群算法解TSP问题]]></title><link>https://blog.csdn.net/fghdvbgt/article/details/51447171</link><guid>https://blog.csdn.net/fghdvbgt/article/details/51447171</guid><author>fghdvbgt</author><pubDate>Wed, 18 May 2016 20:42:13 +0800</pubDate><description><![CDATA[蚁群算法解TSP问题
    TSP问题(Travelling Salesman Problem)，可译为旅行商问题、货郎担问题。其问题描述简单，却具有输入规模的指数函数的计算复杂性，属于NP完全问题。

问题可描述为：
有一位商人，他想访问中国的某些城市，要求：
1. 所走路程最近
2. 每个城市只能访问一次
3. 从某城市出发，最后回到该城市

本文所解的TSP问题与上述第3条不]]></description><category></category></item><item><title><![CDATA[机器学习实战 第九章 树回归 学习笔记]]></title><link>https://blog.csdn.net/fghdvbgt/article/details/51320479</link><guid>https://blog.csdn.net/fghdvbgt/article/details/51320479</guid><author>fghdvbgt</author><pubDate>Thu, 05 May 2016 17:10:08 +0800</pubDate><description><![CDATA[机器学习实战 第九章 树回归 学习笔记
    这一章承接第三章，都是用树的方法，这里做的是回归。基本思路还是把数据集划分，做成二叉查找树的形式，然后可根据预测数据的特征在树中寻找其预测值。本章用的CART（分类回归树）算法来构树。


    这里做回归的树与前篇的不同之处就在于1、能够处理连续型数据；2、数据集的划分规则，第三章决策树用计算熵值的方法，找到熵值最高的划分方法，按此划分；]]></description><category></category></item><item><title><![CDATA[机器学习实战 第三章 决策树 学习笔记]]></title><link>https://blog.csdn.net/fghdvbgt/article/details/51318524</link><guid>https://blog.csdn.net/fghdvbgt/article/details/51318524</guid><author>fghdvbgt</author><pubDate>Thu, 05 May 2016 09:55:42 +0800</pubDate><description><![CDATA[机器学习实战 第三章 决策树 学习笔记

    第三章，决策树，主要讲了用ID3这种算法构建出决策树，并将其用于分类的方法。
    原理：假设我们有一些待分类数据，那么可先按特征的某些规律将其一分为二（就成了二叉树，一分为n，就是n叉树），再将其子节点再分，分到不能再分时，训练结束。预测时按照分类的原则去找分支，直到找到叶子节点，叶节点的值就是预测的值。
    那么就会有一个问题：以]]></description><category></category></item><item><title><![CDATA[机器学习实战 第九章 源码勘误]]></title><link>https://blog.csdn.net/fghdvbgt/article/details/51277716</link><guid>https://blog.csdn.net/fghdvbgt/article/details/51277716</guid><author>fghdvbgt</author><pubDate>Thu, 28 Apr 2016 21:42:23 +0800</pubDate><description><![CDATA[机器学习实战 第九章 源码勘误
    最近学习了《机器学习实战》这本书的第九章-树回归，发现代码运行出错，就试着改了改，跟大家分享一下。
    这一章的代码总共有两个python文件，《regTrees.py》和《treeExplore.py》，其中《regTrees.py》有两个错。
先贴上原版的《regTrees.py》

'''
Created on Feb 4, 2011
T]]></description><category></category></item><item><title><![CDATA[hdu 2602 Bone Collector【遗传算法解01背包】]]></title><link>https://blog.csdn.net/fghdvbgt/article/details/51151976</link><guid>https://blog.csdn.net/fghdvbgt/article/details/51151976</guid><author>fghdvbgt</author><pubDate>Thu, 14 Apr 2016 16:13:34 +0800</pubDate><description><![CDATA[hdu 2602 Bone Collector
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2602
题目分析：01背包水无坑，由于本篇是用GA解，学习ACM中01背包问题解法的同学请移步 
原链接 。

对遗传算法的认识：对生物界遗传过程进行模拟来解决问题的一种算法，大体流程如下：遗传(指定generation数){计算适应度->选择-]]></description><category></category></item><item><title><![CDATA[hdu   1754   I Hate It]]></title><link>https://blog.csdn.net/fghdvbgt/article/details/40047593</link><guid>https://blog.csdn.net/fghdvbgt/article/details/40047593</guid><author>fghdvbgt</author><pubDate>Mon, 13 Oct 2014 16:59:14 +0800</pubDate><description><![CDATA[hdu   1754   I Hate It
题目]]></description><category></category></item><item><title><![CDATA[Live Archive  6705  Little Tiger vs. Deep Monkey]]></title><link>https://blog.csdn.net/fghdvbgt/article/details/39958229</link><guid>https://blog.csdn.net/fghdvbgt/article/details/39958229</guid><author>fghdvbgt</author><pubDate>Fri, 10 Oct 2014 10:57:54 +0800</pubDate><description><![CDATA[Regional 2013::Asia - Changchun C    Live Arc]]></description><category></category></item><item><title><![CDATA[PHP开发环境&MySQL下载安装及配置流程]]></title><link>https://blog.csdn.net/fghdvbgt/article/details/38151315</link><guid>https://blog.csdn.net/fghdvbgt/article/details/38151315</guid><author>fghdvbgt</author><pubDate>Sun, 27 Jul 2014 01:37:23 +0800</pubDate><description><![CDATA[PHP开发环境&MySQL下载安装及配置流程]]></description><category></category></item><item><title><![CDATA[POJ   3761   Bubble Sort]]></title><link>https://blog.csdn.net/fghdvbgt/article/details/38085129</link><guid>https://blog.csdn.net/fghdvbgt/article/details/38085129</guid><author>fghdvbgt</author><pubDate>Thu, 24 Jul 2014 15:31:26 +0800</pubDate><description><![CDATA[POJ   3761   Bubble Sort                   ti]]></description><category></category></item><item><title><![CDATA[POJ   3751   时间日期格式转换]]></title><link>https://blog.csdn.net/fghdvbgt/article/details/38037781</link><guid>https://blog.csdn.net/fghdvbgt/article/details/38037781</guid><author>fghdvbgt</author><pubDate>Tue, 22 Jul 2014 11:06:48 +0800</pubDate><description><![CDATA[POJ   3751   时间日期格式转换           timlj]]></description><category></category></item><item><title><![CDATA[POJ&&HDU 1579  ZOJ 1168   Function Run Fun]]></title><link>https://blog.csdn.net/fghdvbgt/article/details/38025151</link><guid>https://blog.csdn.net/fghdvbgt/article/details/38025151</guid><author>fghdvbgt</author><pubDate>Mon, 21 Jul 2014 22:37:12 +0800</pubDate><description><![CDATA[POJ&&HDU 1579  ZOJ 1168   Function Run Fun            题目链接：]]></description><category></category></item><item><title><![CDATA[POJ   3750   小孩报数问题]]></title><link>https://blog.csdn.net/fghdvbgt/article/details/38021017</link><guid>https://blog.csdn.net/fghdvbgt/article/details/38021017</guid><author>fghdvbgt</author><pubDate>Mon, 21 Jul 2014 17:38:20 +0800</pubDate><description><![CDATA[POJ   3750   小孩报数问题]]></description><category></category></item><item><title><![CDATA[POJ   3748   位操作]]></title><link>https://blog.csdn.net/fghdvbgt/article/details/38014183</link><guid>https://blog.csdn.net/fghdvbgt/article/details/38014183</guid><author>fghdvbgt</author><pubDate>Mon, 21 Jul 2014 12:00:14 +0800</pubDate><description><![CDATA[POJ   3748   位操作                题目链接：]]></description><category></category></item><item><title><![CDATA[POJ   1007   DNA Sorting]]></title><link>https://blog.csdn.net/fghdvbgt/article/details/38013445</link><guid>https://blog.csdn.net/fghdvbgt/article/details/38013445</guid><author>fghdvbgt</author><pubDate>Mon, 21 Jul 2014 11:30:09 +0800</pubDate><description><![CDATA[POJ   1007   DNA Sorting                   题目链接：]]></description><category></category></item><item><title><![CDATA[codeforces   446A   DZY Loves Sequences]]></title><link>https://blog.csdn.net/fghdvbgt/article/details/37930845</link><guid>https://blog.csdn.net/fghdvbgt/article/details/37930845</guid><author>fghdvbgt</author><pubDate>Fri, 18 Jul 2014 16:56:37 +0800</pubDate><description><![CDATA[codeforces   446A   DZY Loves Sequences             DP]]></description><category></category></item><item><title><![CDATA[topcoder   SRM 348 Div.1   LostParentheses]]></title><link>https://blog.csdn.net/fghdvbgt/article/details/37740029</link><guid>https://blog.csdn.net/fghdvbgt/article/details/37740029</guid><author>fghdvbgt</author><pubDate>Sun, 13 Jul 2014 17:58:41 +0800</pubDate><description><![CDATA[Problem Statement 



 

We have an arithmetic expression made up of positive integers, the + and - operators and parentheses. All the parentheses, however, have been erased by the cleaning staf]]></description><category></category></item><item><title><![CDATA[【topcoder第二弹】SRM 526 Div.1   DucksAlignment]]></title><link>https://blog.csdn.net/fghdvbgt/article/details/37739367</link><guid>https://blog.csdn.net/fghdvbgt/article/details/37739367</guid><author>fghdvbgt</author><pubDate>Sun, 13 Jul 2014 15:51:06 +0800</pubDate><description><![CDATA[Problem Statement
    
Mr. Dengklek has a rectangular farm conveniently divided into a grid of unit squares. At this moment, each unit square contains at most one duck. Moreover, each row and column]]></description><category></category></item><item><title><![CDATA[【topcoder第一弹】  SRM 144 Div.2   whatTime]]></title><link>https://blog.csdn.net/fghdvbgt/article/details/37737683</link><guid>https://blog.csdn.net/fghdvbgt/article/details/37737683</guid><author>fghdvbgt</author><pubDate>Sun, 13 Jul 2014 11:55:10 +0800</pubDate><description><![CDATA[Problem Statement 



 
Computers tend to store dates and times as single numbers which represent the number of seconds or milliseconds since a particular date. Your task in this problem is to wr]]></description><category></category></item><item><title><![CDATA[MIME理解]]></title><link>https://blog.csdn.net/fghdvbgt/article/details/28633625</link><guid>https://blog.csdn.net/fghdvbgt/article/details/28633625</guid><author>fghdvbgt</author><pubDate>Thu, 05 Jun 2014 15:55:28 +0800</pubDate><description><![CDATA[自己对android中MIME类型的理解]]></description><category></category></item></channel></rss>