码迷,mamicode.com
首页 >  
搜索关键字:finding    ( 259个结果
【分享】数据挖掘学习资料免费下载
Artificial Intelligence - Wiley - Data Mining - Concepts Models Methods and Algorithms - 2003.chm8.4 MBIEEE - Finding Patterns in Three Dimensional Gr...
分类:其他好文   时间:2014-08-16 22:24:51    阅读次数:286
【HackerRank】Closest Numbers
Sorting is often useful as the first step in many different tasks. The most common task is to make finding things easier, but there are other uses als...
分类:其他好文   时间:2014-08-15 12:45:48    阅读次数:382
POJ 1200 Crazy Search(Hash)
Description Many people like to solve hard puzzles some of which may lead them to madness. One such puzzle could be finding a hidden prime number in a given text. Such number could be the number of d...
分类:其他好文   时间:2014-08-14 23:55:56    阅读次数:329
HDU4414 Finding crosses(模拟 || DFS)
HDU4414 Finding crosses(模拟 || DFS)...
分类:其他好文   时间:2014-08-11 15:13:13    阅读次数:228
HDU 4889 Scary Path Finding Algorithm
题意: 构造一幅图  使题中给出的程序按该图执行  最终变量doge大于输入的C跳出 思路: 出题人思维简直神了!  实在是膜拜!  借题解的图: 按照图中所画  可以继续向右延伸 为何这样可以??  为何边权要这么取?? 先回答第二个问题: 取负数是为了可以不断的去更新  例如如果走了上面的-4那条边  那么它右边的所有点就又可以再更新一次  这样使更新达到了指数级...
分类:其他好文   时间:2014-07-31 00:08:45    阅读次数:300
Method for finding shortest path to destination in traffic network using Dijkstra algorithm or Floyd-warshall algorithm
A method is presented for finding a shortest path from a starting place to a destination place in a traffic network including one or more turn restric...
分类:Web程序   时间:2014-07-24 00:50:17    阅读次数:422
POJ 2524 Ubiquitous Religions
Description There are so many different religions in the world today that it is difficult to keep track of them all. You are interested in finding out how many different religions students in your ...
分类:其他好文   时间:2014-07-17 16:02:36    阅读次数:264
poj2524 Ubiquitous Religions
DescriptionThere are so many different religions in the world today that it is difficult to keep track of them all. You are interested in finding out ...
分类:其他好文   时间:2014-07-13 08:17:12    阅读次数:267
poj 3740 Easy Finding(Dancing Links)
Easy Finding Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 15668   Accepted: 4163 Description Given a M×N matrix A. Aij ∈ {0, 1} (0 ≤ i Input There ar...
分类:其他好文   时间:2014-06-30 08:35:45    阅读次数:215
基于Hama平台的并行Finding a Maximal Independent Set 算法的设计与实现
本文目的:讲解并行Finding a Maximal Independent Set(寻找最大独立集问题)算法,以及在Hama平台上如何实现该算法。该算法可方便移植到所有的Pregel-Like系统中,如Giraph、GPS (Graph Processing System)。 前言:关于Maximal Independent Set(MIS)的基础知识参考我的博客《找最大独立集问题-Finding a Maximal Independent Set》。 1. 本算法参考 Luby's classic pa...
分类:其他好文   时间:2014-06-22 14:26:16    阅读次数:265
259条   上一页 1 ... 23 24 25 26 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!