Thu, 25 Jun 2009 20:31:00 GMThttp://blog.csdn.net/denghui0815/http://blog.csdn.net/denghui0815/archive/2009/06/25/4298667.aspxhttp://blog.csdn.net/denghui0815/comments/4298667.aspx0http://blog.csdn.net/denghui0815/comments/commentRss/4298667.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=42986672009 英特尔® 线程挑战赛—背包问题 实现了动态规划和分支限界算法 <img src ="http://blog.csdn.net/denghui0815/aggbug/4298667.aspx" width = "1" height = "1" /><img src="http://www1.feedsky.com/t1/237164351/denghui0815/csdn.net/s.gif?r=http://blog.csdn.net/denghui0815/archive/2009/06/25/4298667.aspx" border="0" height="0" width="0" style="position:absolute" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/denghui0815/237164351/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/denghui0815/237164351/art01.gif" onerror="this.style.display='none'" /></a></p>Fri, 26 Jun 2009 04:31:00 +0800denghui0815http://blog.csdn.net/denghui0815/archive/2009/06/25/4298667.aspx#Feedbackhttp://blog.csdn.net/denghui0815/archive/2009/06/25/4298667.aspxdenghui0815http://blog.csdn.net/denghui0815/archive/2009/06/25/4298667.aspxhttp://blog.csdn.net/denghui0815/feed.aspxcsdn.net/denghui0815/~7390852/237164351/5500370http://blog.csdn.net/denghui0815/archive/2009/06/09/4255653.aspxhttp://blog.csdn.net/denghui0815/comments/4255653.aspx0http://blog.csdn.net/denghui0815/comments/commentRss/4255653.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=42556532009 英特尔® 线程挑战赛—字符串匹配使用tbb结合OpenMP进行了并行优化 实现了KMP BM WM算法<img src ="http://blog.csdn.net/denghui0815/aggbug/4255653.aspx" width = "1" height = "1" /><img src="http://www1.feedsky.com/t1/237164372/denghui0815/csdn.net/s.gif?r=http://blog.csdn.net/denghui0815/archive/2009/06/09/4255653.aspx" border="0" height="0" width="0" style="position:absolute" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/denghui0815/237164372/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/denghui0815/237164372/art01.gif" onerror="this.style.display='none'" /></a></p>Wed, 10 Jun 2009 04:10:00 +0800denghui0815http://blog.csdn.net/denghui0815/archive/2009/06/09/4255653.aspx#Feedbackhttp://blog.csdn.net/denghui0815/archive/2009/06/09/4255653.aspxdenghui0815http://blog.csdn.net/denghui0815/archive/2009/06/09/4255653.aspxhttp://blog.csdn.net/denghui0815/feed.aspxcsdn.net/denghui0815/~7390852/237164372/5500370http://blog.csdn.net/denghui0815/archive/2009/05/26/4218537.aspxhttp://blog.csdn.net/denghui0815/comments/4218537.aspx0http://blog.csdn.net/denghui0815/comments/commentRss/4218537.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=42185372009 英特尔®线程挑战赛—查找 使用tbb结合OpenMP进行了并行优化 包含二分查找 hashmap查找<img src ="http://blog.csdn.net/denghui0815/aggbug/4218537.aspx" width = "1" height = "1" /><img src="http://www1.feedsky.com/t1/237164386/denghui0815/csdn.net/s.gif?r=http://blog.csdn.net/denghui0815/archive/2009/05/26/4218537.aspx" border="0" height="0" width="0" style="position:absolute" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/denghui0815/237164386/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/denghui0815/237164386/art01.gif" onerror="this.style.display='none'" /></a></p>Wed, 27 May 2009 05:11:00 +0800denghui0815http://blog.csdn.net/denghui0815/archive/2009/05/26/4218537.aspx#Feedbackhttp://blog.csdn.net/denghui0815/archive/2009/05/26/4218537.aspxdenghui0815http://blog.csdn.net/denghui0815/archive/2009/05/26/4218537.aspxhttp://blog.csdn.net/denghui0815/feed.aspxcsdn.net/denghui0815/~7390852/237164386/5500370http://blog.csdn.net/denghui0815/archive/2009/05/11/4168892.aspxhttp://blog.csdn.net/denghui0815/comments/4168892.aspx0http://blog.csdn.net/denghui0815/comments/commentRss/4168892.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=41688922009 英特尔® 线程挑战赛—3SAT 使用tbb结合OpenMP进行了并行优化<img src ="http://blog.csdn.net/denghui0815/aggbug/4168892.aspx" width = "1" height = "1" /><img src="http://www1.feedsky.com/t1/237164400/denghui0815/csdn.net/s.gif?r=http://blog.csdn.net/denghui0815/archive/2009/05/11/4168892.aspx" border="0" height="0" width="0" style="position:absolute" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/denghui0815/237164400/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/denghui0815/237164400/art01.gif" onerror="this.style.display='none'" /></a></p>Tue, 12 May 2009 04:14:00 +0800denghui0815http://blog.csdn.net/denghui0815/archive/2009/05/11/4168892.aspx#Feedbackhttp://blog.csdn.net/denghui0815/archive/2009/05/11/4168892.aspxdenghui0815http://blog.csdn.net/denghui0815/archive/2009/05/11/4168892.aspxhttp://blog.csdn.net/denghui0815/feed.aspxcsdn.net/denghui0815/~7390852/237164400/5500370http://blog.csdn.net/denghui0815/archive/2009/04/26/4125972.aspxhttp://blog.csdn.net/denghui0815/comments/4125972.aspx6http://blog.csdn.net/denghui0815/comments/commentRss/4125972.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=41259722009 英特尔® 线程挑战赛—基数排序 使用tbb进行了并行优化 速度很快<img src ="http://blog.csdn.net/denghui0815/aggbug/4125972.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/denghui0815/237164402/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/denghui0815/237164402/art01.gif" onerror="this.style.display='none'" /></a></p>Mon, 27 Apr 2009 01:12:00 +0800denghui0815http://blog.csdn.net/denghui0815/archive/2009/04/26/4125972.aspx#Feedbackhttp://blog.csdn.net/denghui0815/archive/2009/04/26/4125972.aspxdenghui0815http://blog.csdn.net/denghui0815/archive/2009/04/26/4125972.aspxhttp://blog.csdn.net/denghui0815/feed.aspxcsdn.net/denghui0815/~7390852/237164402/5500370http://blog.csdn.net/denghui0815/archive/2009/04/09/4060837.aspxhttp://blog.csdn.net/denghui0815/comments/4060837.aspx3http://blog.csdn.net/denghui0815/comments/commentRss/4060837.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=4060837英特尔® 线程挑战赛—数独实现了数独的快速求解算法。使用OpenMP和TBB分别进行并行处理，提高程序效率。<img src ="http://blog.csdn.net/denghui0815/aggbug/4060837.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/denghui0815/237164405/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/denghui0815/237164405/art01.gif" onerror="this.style.display='none'" /></a></p>Fri, 10 Apr 2009 06:20:00 +0800denghui0815http://blog.csdn.net/denghui0815/archive/2009/04/09/4060837.aspx#Feedbackhttp://blog.csdn.net/denghui0815/archive/2009/04/09/4060837.aspxdenghui0815http://blog.csdn.net/denghui0815/archive/2009/04/09/4060837.aspxhttp://blog.csdn.net/denghui0815/feed.aspxcsdn.net/denghui0815/~7390852/237164405/5500370