Search - longest

Search - longest - List

[Software Engineering] zixulie DL : 0: 一个求最长子序列的辕马~~~ 要的自己下!~~ 我也是无奈啊-a son for the longest sequence of shaft horse ~ ~ ~ themselves to the next! ~ ~ I was helpless ah
Date : 2025-12-26 Size : 1kb User : 陈健东
[Software Engineering] LCS(c++) DL : 0: LCS Algorithm, this is a c++ code for lcs(Longest Common Subsequence)
Date : 2025-12-26 Size : 8kb User : 劉逸
[Software Engineering] Clock DL : 0: 用于体育比赛的数字秒表，计时器能显示 0.01ｓ的时间，最长计时时间为 24ｈ。-The number of sports competitions for the stopwatch timer can display the time 0.01s, the longest time to time 24h.
Date : 2025-12-26 Size : 77kb User : 王易飞
[Software Engineering] zuichang1 DL : 0: 计算一个数组中最长子序列，功能其实很简单。-An array of computing the longest sequence, function is actually very simple.
Date : 2025-12-26 Size : 1kb User : LHY
[Software Engineering] ac DL : 0: 最长上升子序列非常经典的问题。给定的整数序列，请求出其最长上升子序列的长度。有多个测试用例。每个测试用例由一个行整数组成，其中第一个是一个整数 n (1 ≤ n ≤ 10000)，表示给定序列的长度。然后是 n 个 32-bits 带符号整数表示序列中的元素。输入直至没有数据或者遇到长度 n 是非正数为止。 -Increase in the longest sequence is a classic problem. A given integer sequence, request an increase of its maximum length sequence. There are a number of test cases. Each test case by a line integral of the first of which is an integer n (1 ≤ n ≤ 10000), said that the length of a given sequence. Then the n-32-bits signed integer element of that sequence. Until there is no data input length n, or encountered a non-positive so far.
Date : 2025-12-26 Size : 5kb User : 霍小明
[Software Engineering] longest DL : 0: lcm all possible numbers
Date : 2025-12-26 Size : 512kb User : anand
[Software Engineering] parser DL : 0: Elimination of left factoring in the given grammar For each nonterminal A find the longest prefix (alpha) common to two or more of its alternatives.If alpha is not equal epsilon,i.e..,there is a nontrivial common prefix,replace all the A productions Aàalpha beta1|alpha beta2|…|alpha betan|gamma where gamma represents all alternatives that donot begin with alpha by AàalphaA’|gamma A’àbeta1|beta2|…..|betan Here A’ is the new terminal.. Repeatedly apply this transformation until no two alternatives for a nonterminal have a common prefix.-Elimination of left factoring in the given grammar For each nonterminal A find the longest prefix (alpha) common to two or more of its alternatives.If alpha is not equal epsilon,i.e..,there is a nontrivial common prefix,replace all the A productions Aàalpha beta1|alpha beta2|…|alpha betan|gamma where gamma represents all alternatives that donot begin with alpha by AàalphaA’|gamma A’àbeta1|beta2|…..|betan Here A’ is the new terminal.. Repeatedly apply this transformation until no two alternatives for a nonterminal have a common prefix.
Date : 2025-12-26 Size : 8kb User : mahi
[Software Engineering] 111 DL : 0: 最长公共子序列求解一个给定序列的子序列是在该序列中删去若干元素后得到的序列。给定两个序列X和Y，当另一序列Z既是X的子序列又是Y的子序列时，称Z是序列X和Y的公共子序列。最长公共子序列就是求给定两个序列的一个最长公共子序列。动态规划可以有效的解决此问题。由最长公共子序列问题的子序列的最优子结构性质，可以建立子问题最优的递归关系。用c[i][j]记录序列Xi和Yi的最长公共子序列的长度-Solving the longest common subsequence for a given sequence of sub-sequence is the sequence obtained by deleting a number of elements in the sequence. Given two sequences X and Y, while another sequence Z is X, Y promoter sequence is a sub-sequence, said sequence of X and Y Z is the common subsequence. Longest common subsequence is the sequence of the given one of the two longest common subsequence. Dynamic programming can effectively solve this problem. Longest common subsequence problem by the sub-optimal sequence of sub-structural nature of the problem can create sub-optimal recursive relationship. With c [i] [j] records series Xi and Yi, the length of the longest common subsequence
Date : 2025-12-26 Size : 2kb User : 1111
[Software Engineering] kmp_Ext DL : 0: 运用扩展KMP算法求出某一字符串与另一字符串的所有最长公共前缀-KMP algorithm the extended use of a string with another string of all longest common prefix
Date : 2025-12-26 Size : 1kb User : wrs
[Software Engineering] DailyReport DL : 0: 一个系统基于javaweb 开发非常好的一个系统希望下载-A systemAsked how managing to put them back on would feel, 29.1 per cent said it would be better than sex, 28.9 per cent thought it would beat a promotion, 20.6 per cent believed it would top a best friend s wedding, 20.3 per cent said it would feel better than a lottery win and 11.1 per cent thought it would beat a marriage proposal.The survey showed that on average women own five pairs of jeans, with 10 per cent of women claiming their jeans have outlasted their longest relationship.
Date : 2025-12-26 Size : 713kb User : 辛
[Software Engineering] 111 DL : 0: 用GAL16V8设计可变长度序列信号发生器，在掌握伪随机序列性质的基础上，设计给定长度的伪随机序列信号发生器，也即设计给定n后（n为移位寄存器的级数）最长线性反馈移位寄存器序列。并在给定n产生的最长序列的基础上，截短出课题给出的序列长度，并用FM软件对可编程器件GAL16V8进行编程，以实现长度不同的序列信号发生器。-GAL16V8 design variable-length sequence signal generator based on the master pseudo-random sequence nature, the design of a given length pseudo-random sequence Signal generator, designed for the series) up to linear feedback shift register sequences given n (n is the shift register. And given n Sequence length given by the subject on the basis of the longest sequence, truncated, and FM software for programming the programmable device GAL16V8, in order to achieve Different length of the sequence signal generator.
Date : 2025-12-26 Size : 383kb User : 乔嘉麒
[Software Engineering] dsfdsgvfdsgfvsd DL : 0: 1) 采用先来先服务（FCFS）调度算法，即按作业到达的先后次序进行调度。总是首先调度在系统中等待时间最长的作业。 2) 短作业优先 (SJF) 调度算法，优先调度要求运行时间最短的作业。 3) 响应比高者优先(HRRN)调度算法，为每个作业设置一个优先权(响应比)，调度之前先计算各作业的优先权，优先数高者优先调度。RP (响应比)＝作业周转时间 / 作业运行时间每个作业由一个作业控制块JCB表示，JCB可以包含以下信息：作业名、提交（到达）时间、所需的运行时间、所需的资源、作业状态、链指针等等。作业的状态可以是等待W（Wait）、运行R（Run）和完成F（Finish）三种之一。每个作业的最初状态都是等待W。-1) first-come-first-served (FCFS) scheduling algorithm, that is the priority job arrives scheduling. Always the first to wait for the longest time job scheduling system. 2) short operating priority (SJF) scheduling algorithm, priority scheduling requirements of the job with the shortest running time. 3) response than the high priority (HRRN) scheduling algorithm, set a priority for each job (Response Ratio), calculated for various jobs before scheduling priority, priority number of high-priority scheduling. RP (response ratio) = the operating turnaround time/job run time for each job by a job control block JCB JCB can contain the following information: job name, submitted (arrival) time, the running time required, the necessary resources, job status, and chain pointers. The status of the job can be waiting for W (Wait), one of three run R (Run) and the completion of F (Finish). The initial state of each job is waiting for W.
Date : 2025-12-26 Size : 30kb User : 张志刚
[Software Engineering] aaa DL : 0: 算法设计与分析中的最长公共子序列的c++代码，很好的解决了此算法-Longest common subsequence algorithm design and analysis c++ code, a good solution to this algorithm
Date : 2025-12-26 Size : 1kb User : ding
[Software Engineering] the-art-of-computer-programming_1 DL : 0: 本册揭开了计算机程序设计艺术目前最长一章的序幕，而论述组合算法的这章将包括完整的3卷。非正式地说，组合算法是对量非常大的对象，如alan或图元素，进行高速处理的技术。组合模式或排列技术可解决大量的现实问题，而处理这些问题的现代方法比起以前所采用的直接过程快上千倍。本册是后面章节的基础，这里首先讨论的是组合学的本质，接着介绍在计算机内部如何有效处理0和1的基本思想，包括布尔基础和布尔求值等内容。并且，为了强化作者的阐述，书中包括了大量细心组织、包括使用说明和详细解答的新的习题。-The album opened Art of Computer Programming is the longest chapter of the prelude, this chapter discusses the combination algorithm will include the full 3 volumes. Informally, said the combination algorithm is a very large amount of objects, such as alan or diagram elements, high-speed processing technology. Combined mode or arrange to resolve a large number of practical problems, and modern methods to deal with these issues is thousands of times faster than the direct process previously. This volume is the basis of the later chapters, first discussed here is the essence of combinatorics, then introduced inside the computer how to effectively deal with the basic idea of 0 and 1, including the content of the Boolean basis and Boolean value. And, in order to strengthen the elaboration of the author, the book includes a lot of careful organization, including instructions for use and detailed answers to exercises.
Date : 2025-12-26 Size : 40.24mb User : lichong
[Software Engineering] the-art-of-computer-programming_2 DL : 0: 本册揭开了计算机程序设计艺术目前最长一章的序幕，而论述组合算法的这章将包括完整的3卷。非正式地说，组合算法是对量非常大的对象，如alan或图元素，进行高速处理的技术。组合模式或排列技术可解决大量的现实问题，而处理这些问题的现代方法比起以前所采用的直接过程快上千倍。本册是后面章节的基础，这里首先讨论的是组合学的本质，接着介绍在计算机内部如何有效处理0和1的基本思想，包括布尔基础和布尔求值等内容。并且，为了强化作者的阐述，书中包括了大量细心组织、包括使用说明和详细解答的新的习题。-The album opened Art of Computer Programming is the longest chapter of the prelude, this chapter discusses the combination algorithm will include the full 3 volumes. Informally, said the combination algorithm is a very large amount of objects, such as alan or diagram elements, high-speed processing technology. Combined mode or arrange to resolve a large number of practical problems, and modern methods to deal with these issues is thousands of times faster than the direct process previously. This volume is the basis of the later chapters, first discussed here is the essence of combinatorics, then introduced inside the computer how to effectively deal with the basic idea of 0 and 1, including the content of the Boolean basis and Boolean value. And, in order to strengthen the elaboration of the author, the book includes a lot of careful organization, including instructions for use and detailed answers to exercises.
Date : 2025-12-26 Size : 43.09mb User : lichong
[Software Engineering] the-art-of-computer-programming_3 DL : 0: 本册揭开了计算机程序设计艺术目前最长一章的序幕，而论述组合算法的这章将包括完整的3卷。非正式地说，组合算法是对量非常大的对象，如alan或图元素，进行高速处理的技术。组合模式或排列技术可解决大量的现实问题，而处理这些问题的现代方法比起以前所采用的直接过程快上千倍。本册是后面章节的基础，这里首先讨论的是组合学的本质，接着介绍在计算机内部如何有效处理0和1的基本思想，包括布尔基础和布尔求值等内容。并且，为了强化作者的阐述，书中包括了大量细心组织、包括使用说明和详细解答的新的习题。-The album opened Art of Computer Programming is the longest chapter of the prelude, this chapter discusses the combination algorithm will include the full 3 volumes. Informally, said the combination algorithm is a very large amount of objects, such as alan or diagram elements, high-speed processing technology. Combined mode or arrange to resolve a large number of practical problems, and modern methods to deal with these issues is thousands of times faster than the direct process previously. This volume is the basis of the later chapters, first discussed here is the essence of combinatorics, then introduced inside the computer how to effectively deal with the basic idea of 0 and 1, including the content of the Boolean basis and Boolean value. And, in order to strengthen the elaboration of the author, the book includes a lot of careful organization, including instructions for use and detailed answers to exercises.
Date : 2025-12-26 Size : 41.99mb User : lichong
[Software Engineering] Needleman-Wunsch DL : 0: 本文介绍基于最长公共子串的文本比较算法——Needleman/Wunsch算法。-In this paper, the text comparison algorithm based on the longest common substring Needleman/Wunsch algorithm
Date : 2025-12-26 Size : 18kb User : 李浩
[Software Engineering] verilog DL : 0: 最长的那个句子，求sum的赋值语句就是FIR滤波器的计算过程，将二进制乘法转化为移位运算。对于小数点后的乘数是向左移，小数点前的乘数是往右移位。 -The longest sentence, find the sum of the assignment statement is the calculation of the FIR filter, the binary multiplication into shift operation. Multiplier after the decimal point to the left, in front of the decimal point multiplier is shifted to the right.
Date : 2025-12-26 Size : 1kb User : jee
[Software Engineering] zuichangzifuzichuan DL : 0: 本资料在于解决数据结构问题中的最长字符子串问题，适用于初学者。-This information is to solve the problem in the data structure of the longest character substring problem for beginners.
Date : 2025-12-26 Size : 1kb User : sceleryhuang
[Software Engineering] iris DL : 0: 基于眼睛图像的集合特征，提出了一种基于最长弦的瞳孔定位算法，算法与传统瞳孔定位算法相比，在准确度和速度方面具有优势-Based on the eye image collection features, this paper proposes a pupil location algorithm based on the longest string, algorithm is compared with the traditional pupil localization algorithm, has advantages in terms of accuracy and speed
Date : 2025-12-26 Size : 247kb User : machaoyu

« 12 »