﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>博客园-临渊羡鱼,不如退而结网-文章分类-算法</title><link>http://www.cnblogs.com/noahsky/category/121325.html</link><description /><language>zh-cn</language><lastBuildDate>Tue, 03 Jun 2008 08:54:38 GMT</lastBuildDate><pubDate>Tue, 03 Jun 2008 08:54:38 GMT</pubDate><ttl>60</ttl><item><title>一个比较牛的加密算法 </title><link>http://www.cnblogs.com/noahsky/articles/1052979.html</link><dc:creator>noahsky</dc:creator><author>noahsky</author><pubDate>Fri, 25 Jan 2008 05:16:00 GMT</pubDate><guid>http://www.cnblogs.com/noahsky/articles/1052979.html</guid><wfw:comment>http://www.cnblogs.com/noahsky/comments/1052979.html</wfw:comment><comments>http://www.cnblogs.com/noahsky/articles/1052979.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/noahsky/comments/commentRss/1052979.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/noahsky/services/trackbacks/1052979.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 一个加密算法据说此加密算法每次加密的结果都不同，但解密的结果相同usingSystem;namespacetest001{&nbsp;/**&nbsp;&nbsp;...&nbsp;&nbsp;<a href='http://www.cnblogs.com/noahsky/articles/1052979.html'>阅读全文</a><img src ="http://www.cnblogs.com/noahsky/aggbug/1052979.html?type=2" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://noahsky.cnblogs.com/" target="_blank">noahsky</a> 2008-01-25 13:16 <a href="http://www.cnblogs.com/noahsky/articles/1052979.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>加密网络数据 </title><link>http://www.cnblogs.com/noahsky/articles/1052974.html</link><dc:creator>noahsky</dc:creator><author>noahsky</author><pubDate>Fri, 25 Jan 2008 05:15:00 GMT</pubDate><guid>http://www.cnblogs.com/noahsky/articles/1052974.html</guid><wfw:comment>http://www.cnblogs.com/noahsky/comments/1052974.html</wfw:comment><comments>http://www.cnblogs.com/noahsky/articles/1052974.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/noahsky/comments/commentRss/1052974.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/noahsky/services/trackbacks/1052974.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 网络数据加密需要解决三个问题：完整：数据不被篡改；安全：数据不被截获，或者截获也无法得到明文；可靠：数据从真正的发送方而来，其他人无法伪造一个数据来欺骗接受方；下面例子只解决了...&nbsp;&nbsp;<a href='http://www.cnblogs.com/noahsky/articles/1052974.html'>阅读全文</a><img src ="http://www.cnblogs.com/noahsky/aggbug/1052974.html?type=2" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://noahsky.cnblogs.com/" target="_blank">noahsky</a> 2008-01-25 13:15 <a href="http://www.cnblogs.com/noahsky/articles/1052974.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>DES加密/解密的应用 </title><link>http://www.cnblogs.com/noahsky/articles/1052975.html</link><dc:creator>noahsky</dc:creator><author>noahsky</author><pubDate>Fri, 25 Jan 2008 05:15:00 GMT</pubDate><guid>http://www.cnblogs.com/noahsky/articles/1052975.html</guid><wfw:comment>http://www.cnblogs.com/noahsky/comments/1052975.html</wfw:comment><comments>http://www.cnblogs.com/noahsky/articles/1052975.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/noahsky/comments/commentRss/1052975.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/noahsky/services/trackbacks/1052975.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 加解密usingSystem.Security.Cryptography;privatestaticbyte[]DESKey=newbyte[]{11,23,93,102,...&nbsp;&nbsp;<a href='http://www.cnblogs.com/noahsky/articles/1052975.html'>阅读全文</a><img src ="http://www.cnblogs.com/noahsky/aggbug/1052975.html?type=2" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://noahsky.cnblogs.com/" target="_blank">noahsky</a> 2008-01-25 13:15 <a href="http://www.cnblogs.com/noahsky/articles/1052975.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>常用算法大全－动态规划算法 </title><link>http://www.cnblogs.com/noahsky/articles/1052972.html</link><dc:creator>noahsky</dc:creator><author>noahsky</author><pubDate>Fri, 25 Jan 2008 05:13:00 GMT</pubDate><guid>http://www.cnblogs.com/noahsky/articles/1052972.html</guid><wfw:comment>http://www.cnblogs.com/noahsky/comments/1052972.html</wfw:comment><comments>http://www.cnblogs.com/noahsky/articles/1052972.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/noahsky/comments/commentRss/1052972.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/noahsky/services/trackbacks/1052972.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 3.1算法思想和贪婪算法一样，在动态规划中，可将一个问题的解决方案视为一系列决策的结果。不同的是，在贪婪算法中，每采用一次贪婪准则便做出一个不可撤回的决策，而在动态规划中，还要考察每个最优决策序...&nbsp;&nbsp;<a href='http://www.cnblogs.com/noahsky/articles/1052972.html'>阅读全文</a><img src ="http://www.cnblogs.com/noahsky/aggbug/1052972.html?type=2" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://noahsky.cnblogs.com/" target="_blank">noahsky</a> 2008-01-25 13:13 <a href="http://www.cnblogs.com/noahsky/articles/1052972.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>常用算法大全－分而治之算法 </title><link>http://www.cnblogs.com/noahsky/articles/1052970.html</link><dc:creator>noahsky</dc:creator><author>noahsky</author><pubDate>Fri, 25 Jan 2008 05:12:00 GMT</pubDate><guid>http://www.cnblogs.com/noahsky/articles/1052970.html</guid><wfw:comment>http://www.cnblogs.com/noahsky/comments/1052970.html</wfw:comment><comments>http://www.cnblogs.com/noahsky/articles/1052970.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/noahsky/comments/commentRss/1052970.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/noahsky/services/trackbacks/1052970.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 本章给出了用来分析分而治之算法复杂性的数学方法，并通过推导最小最大问题和排序问题的复杂性下限来证明分而治之算法对于求解这两种问题是最优的（因为算法的复杂性与下限一致）。2.1算法思想分...&nbsp;&nbsp;<a href='http://www.cnblogs.com/noahsky/articles/1052970.html'>阅读全文</a><img src ="http://www.cnblogs.com/noahsky/aggbug/1052970.html?type=2" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://noahsky.cnblogs.com/" target="_blank">noahsky</a> 2008-01-25 13:12 <a href="http://www.cnblogs.com/noahsky/articles/1052970.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>常用算法大全－分枝定界</title><link>http://www.cnblogs.com/noahsky/articles/1052968.html</link><dc:creator>noahsky</dc:creator><author>noahsky</author><pubDate>Fri, 25 Jan 2008 05:11:00 GMT</pubDate><guid>http://www.cnblogs.com/noahsky/articles/1052968.html</guid><wfw:comment>http://www.cnblogs.com/noahsky/comments/1052968.html</wfw:comment><comments>http://www.cnblogs.com/noahsky/articles/1052968.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/noahsky/comments/commentRss/1052968.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/noahsky/services/trackbacks/1052968.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 任何美好的事情都有结束的时候。现在我们学习的是本书的最后一章。幸运的是，本章用到的大部分概念在前面各章中已作了介绍。类似于回溯法，分枝定界法在搜索解空间时，也经常使用树形结构来组织解空间（常用的树结构...&nbsp;&nbsp;<a href='http://www.cnblogs.com/noahsky/articles/1052968.html'>阅读全文</a><img src ="http://www.cnblogs.com/noahsky/aggbug/1052968.html?type=2" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://noahsky.cnblogs.com/" target="_blank">noahsky</a> 2008-01-25 13:11 <a href="http://www.cnblogs.com/noahsky/articles/1052968.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>常用算法大全－贪婪算法 </title><link>http://www.cnblogs.com/noahsky/articles/1052961.html</link><dc:creator>noahsky</dc:creator><author>noahsky</author><pubDate>Fri, 25 Jan 2008 05:10:00 GMT</pubDate><guid>http://www.cnblogs.com/noahsky/articles/1052961.html</guid><wfw:comment>http://www.cnblogs.com/noahsky/comments/1052961.html</wfw:comment><comments>http://www.cnblogs.com/noahsky/articles/1052961.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/noahsky/comments/commentRss/1052961.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/noahsky/services/trackbacks/1052961.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;本章首先引入最优化的概念，然后介绍一种直观的问题求解方法：贪婪算法。最后，应用该算法给出货箱装船问题、背包问题、拓扑排序问题、二分覆盖问题、最短路径问题、最小代价生成树等问题...&nbsp;&nbsp;<a href='http://www.cnblogs.com/noahsky/articles/1052961.html'>阅读全文</a><img src ="http://www.cnblogs.com/noahsky/aggbug/1052961.html?type=2" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://noahsky.cnblogs.com/" target="_blank">noahsky</a> 2008-01-25 13:10 <a href="http://www.cnblogs.com/noahsky/articles/1052961.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>常用算法大全－回溯算法 </title><link>http://www.cnblogs.com/noahsky/articles/1052964.html</link><dc:creator>noahsky</dc:creator><author>noahsky</author><pubDate>Fri, 25 Jan 2008 05:10:00 GMT</pubDate><guid>http://www.cnblogs.com/noahsky/articles/1052964.html</guid><wfw:comment>http://www.cnblogs.com/noahsky/comments/1052964.html</wfw:comment><comments>http://www.cnblogs.com/noahsky/articles/1052964.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/noahsky/comments/commentRss/1052964.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/noahsky/services/trackbacks/1052964.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 寻找问题的解的一种可靠的方法是首先列出所有候选解，然后依次检查每一个，在检查完所有或部分候选解后，即可找到所需要的解。理论上，当候选解数量有限并且通过检查所有或部分候选解能够得到所需解时，上述方法是可...&nbsp;&nbsp;<a href='http://www.cnblogs.com/noahsky/articles/1052964.html'>阅读全文</a><img src ="http://www.cnblogs.com/noahsky/aggbug/1052964.html?type=2" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://noahsky.cnblogs.com/" target="_blank">noahsky</a> 2008-01-25 13:10 <a href="http://www.cnblogs.com/noahsky/articles/1052964.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>