Search - WORD - CodeBus

Search - WORD - List

[Data structs] 数据结构(冯毅主编) DL : 0: 这是一本好教案落-This is a good lesson plans down
Date : 2025-12-19 Size : 967kb User : 石明华
[Data structs] 表达式类型的实现 DL : 0: 数据结构表达式求值详细算法（包括WORD文档）-data structure expression evaluates detailed algorithm (including Word document)
Date : 2025-12-19 Size : 4kb User : 林明
[Data structs] PATTREE DL : 0: pat-tree中文抽词,中文字词搜寻演算法.-pat-pumping tree Chinese words, the Chinese word search algorithms.
Date : 2025-12-19 Size : 320kb User : peter
[Data structs] dsproject3 DL : 0: 解决一个加权遍历的问题。文件包含一个word文档，作为原问题。还有一个c文件，解决遍历。-solve a weighted traversal issue. Document contains a word document, as the original question. There is also a c document traversal solution.
Date : 2025-12-19 Size : 9kb User : 本本
[Data structs] jeromel DL : 0: 利用Hash技术统计单词的频度。扫描一个C源程序，用Hash表存储该程序中出现的关键字，并统计该程序中的关键字出现的频度。用线性探测法解决Hash冲突。设Hash函数为：Hash(Key)=[(Key的首字母序号)*100+(Key的尾字母序号)] Mod 41 -use statistical word frequency. Scanning a C source files, using the hash table storage procedures of the keyword statistics and the proceedings of the keyword frequency. Linear Hash detection solution for the conflict. Hash functions located : Hash (Key) = [(the first letters Key serial number)* 100 (Key tail alphabetical serial number)] Mo d 41
Date : 2025-12-19 Size : 21kb User : 芦林飞
[Data structs] Hugeint DL : 0: 巨型整形实现,长度不受windows机器字长限制,实现了基本的加减乘除等运行.-giant plastic realization length from windows machine word limit, realize the basic arithmetic and other operations.
Date : 2025-12-19 Size : 87kb User :
[Data structs] literature_research.ZIP DL : 0: 一个文本分析程序。实现分析一段文本中字母，N个字母的单词和具体单词出现的次数。-a text analysis program. Implementation Analysis section of the text of letters, the N-word letter word and the specific number.
Date : 2025-12-19 Size : 1kb User : 金琦
[Data structs] myKbest_0513 DL : 0: 中文分词, N-最短路径算法 ICTCLAS研究学习组 http://groups.google.com/group/ictclas?msg=subscribe-Chinese word segmentation, N-shortest path algorithm ICTCLAS Studies Group http :// groups.google.com/group/sub ictclas msg = scribe
Date : 2025-12-19 Size : 71kb User : Jian Ye
[Data structs] JosephusProblem DL : 0: 據說著名猶太歷史學家 Josephus有過以下的故事：在羅馬人佔領喬塔帕特後，39 個猶太人與Josephus及他的朋友躲到一個洞中，39個猶太人決定寧願死也不要被敵人到，於是決定了一個自殺方式，41個人排成一個圓圈，由第1個人開始報數，每報數到第3人該人就必須自殺，然後再由下一個重新報數，直到所有人都自殺身亡為止。然而Josephus 和他的朋友並不想遵從，Josephus要他的朋友先假裝遵從，他將朋友與自己安排在第16個與第31個位置，於是逃過了這場死亡遊戲。-It is said that the famous Jewish historian Josephus has the following story: In the Roman occupation of乔塔帕特after 39 Jews and Josephus and his friends hid in a cave, 39 Jewish spiritual sense of the word should not be decided by the enemy that decided a means of suicide, 41 individuals formed a circle, from one individual to start off, each reported a few to the first 3 people to be the person to commit suicide, and then re-reported by the next number until all committed suicide so far. However, Josephus and his friends do not want to comply, Josephus to his friends to pretend to follow, he will be friends with their own arrangements in section 16 with the first 31 positions, so escaped the death game.
Date : 2025-12-19 Size : 4kb User : 王凌云
[Data structs] expression DL : 0: 需求分析 (1) 任何一个表达式都是由操作数、运算符和界限符组成的,我们称之为单词. (2) 表达式求值首先要符合四则运算规则: ① 先乘除,后加减 ② 从左到右进行运算 ③ 先括号内,后括号外 (3) 功能实现: ① 若当前单词为数字串,则压入数值栈 ② 若当前单词为运算符并大于运算栈的栈顶符号,则进栈 ③ 若当前单词为运算符并等于运算栈的栈顶符号,去括号,输出 ④ 若当前单词为运算符并小于运算栈的栈顶符号,则进行运算 -Needs analysis (1) an expression by any operand, operator, and at the composition of the boundaries, we call words. (2) the expression for the value of the first four operations to comply with the rules: ① first multiplication and division, after From left to right to conduct operations by ② ③ first brackets, the brackets after the outside (3) functions: ① If the current word number string, then pressed into numerical stack ② If the current word is greater than for the operator and operator of Top-stack symbols, then into the stack word ③ If the current operator and is equivalent to computing the Top-stack symbols, to brackets, output ④ If the current word for the operator and less than computing the Top-stack symbols, were carried out in computing
Date : 2025-12-19 Size : 106kb User : 马巧英
[Data structs] SVM DL : 0: 这是一个讲解机器学习与SVM的课件，讲的深入浅出，非常不错。-err
Date : 2025-12-19 Size : 822kb User : paul
[Data structs] nhuanghou DL : 0: 八皇后问题是大数学家高斯于1850年提出来的。该问题是在8×8的国际象棋棋盘上放置8个皇后，使得没有一个皇后能"吃掉"任何其他一个皇后，即没有任何两个皇后被放置在棋盘的同一行、同一列或同一斜线上。要求编一个程序求出该问题的所有解。骑士游历问题是放在8×8的国际象棋棋盘上的一个马，按照马走"日"字的规则是否能够不重复地走遍棋盘的每个格。要求编一个程序求出该问题的一个解。-Eight Queen s question is the main mathematician Gauss was put forward in 1850. The problem is in the 8 × 8 chess board to place eight queen, making no one s able to eat any other a queen, that is, no two queen was placed in the chessboard of the same line, the same row or the same oblique online. Asked for a procedure to derive all the solutions of the problem. The problem is Cavalier traveled on 8 × 8 chess board on a horse, in accordance with the horse to the Day of the rules of the word can not be repeated for each cell traveled chessboard. Asked for a procedure to derive a solution of the problem.
Date : 2025-12-19 Size : 2kb User : 夏鑫
[Data structs] SentenceSplitter DL : 0: .NET写的中文分词组件，适用于小型搜索引擎中文分词。-. NET to write the Chinese word segmentation components, applicable to small search engine in Chinese word segmentation.
Date : 2025-12-19 Size : 54kb User : 白水
[Data structs] DataStructureAndArithmetic DL : 0: 《数据结构及应用算法教程》配书光盘 1. 算法一览是由HTML页面形式的文件组织的，使用时系统需要安装Microsoft IE 5.0、Office 2000 Word和PowerPoint。读者可以从“算法一览”文件夹下的index.htm文件开始浏览。2. “程序设计示例”文件夹下汇集了本书第10章中八个示例的源代码。读者可以在配有Microsoft Visual C++5.0以上版本的环境中，通过重新建立工程文件来编译和运行。具体的细节步骤，可继续阅读“程序设计示例”文件夹下的Readme.doc文件。
Date : 2025-12-19 Size : 689kb User : 刘真
[Data structs] word DL : 0: 模仿word对英文字符的操作，输入一篇英文文章，可以对其段落进行剪切、复制、粘贴等操作，并可以计算其单词数和段落数-Word of English characters to imitate the operation, enter an English article, you can carry out their paragraphs cut, copy, paste and other operations, and can calculate the number of its words and paragraphs of a few
Date : 2025-12-19 Size : 303kb User : ly
[Data structs] data_struct DL : 0: 400多页的数据结构PPT, 从线性表到图全部涵盖,最后还有几个实例算法. 写的非常好!! 请用WORD 2003/WORD 2007 /wps以只读方式打开.-400 pages of data structures PPT, from linear table to map all the covers and, finally, several examples of algorithms. Was very good!! Please use WORD 2003/WORD 2007/wps open read-only.
Date : 2025-12-19 Size : 7.33mb User : Zy
[Data structs] word-counting DL : 0: 统计文章中每一个单词出现次数的程序，是C语言中字符串处理的经典教学例子-Article statistics the number of occurrences of each word in the process, the C language teaching in a classic example of string handling
Date : 2025-12-19 Size : 406kb User : wangfuwei
[Data structs] Word-frequency-analyzer DL : 0: 词频分析器。包含了文件读入功能。输入文本记录单词出现频率-Word frequency analyzer. Contains the file is read into function.
Date : 2025-12-19 Size : 2kb User : 薛晓旭
[Data structs] word-analysis DL : 0: 词法分析可以分析输入的语法，我们可以任意定义词法-word analysis
Date : 2025-12-19 Size : 3kb User : liuyuanfeng
[Data structs] Word-Ladder DL : 0: 给定两个词(beginWord和endWord)和字典的单词列表,找到所有最短转换序列(s)beginWord endWord,这样: 一次只能改变一个字母；每个中间必须存在于词列表-Given two words (beginWord and endWord), and a dictionary s word list, find all shortest transformation sequence(s) beginWord to endWord, such that: Only one letter can be changed at a time Each intermediate word must exist in the word list For example, Given: beginWord = hit endWord = cog wordList = [ hot , dot , dog , lot , log ] Return
Date : 2025-12-19 Size : 1kb User : 胡延旭

« 12 3 4 5 6 7 8 9 10 »