Search - grow - CodeBus

[Other resource] Java_Open_Source_Programming

Description: In today’s IT environment, Java is a leading technology in the world of enterprise development. As management demands more from technology, complexity in infrastructure seems to grow exponentially, leaving many unable to keep up with the demands of such a fast-paced world. These complexities can be seen in the over-evolving Java 2 Enterprise Edition (J2EE) specifications. This unnecessary complexity drove us to discover ways of simplifying development.-In today's IT environment, Java is a leading technology in the world of enterprise development. As management demands more from technology, in infrastructure complexity seems to grow exponentially, leaving many unable to keep up with the demands of such a fast-paced world. These complexities can be seen in the over-evolving Java 2 Enterprise Edition (J2EE) specifications. This unnecessary complexity drove us to discover ways of simplifying development.
Platform: | Size: 1996593 | Author: 李力 | Hits:

[Windows Develop] CacheSetSource

Description: CacheSet is an applet that allows you to manipulate the working-set parameters of the system file cache. Unlike CacheMan, CacheSet runs on all versions of NT and will work without modifications on new Service Pack releases. In addition to providing you the ability to control the minimum and maximum working set sizes, it also allows you to reset the Cache s working set, forcing it to grow as necessary from a minimal starting point. Also unlike CacheMan, changes made with CacheSet have an immediate effect on the size of the Cache. Full source code is included. -CacheSet is an applet that allows you to man ipulate the working-set parameters of the syst em file cache. Unlike CacheMan. CacheSet runs on all versions of NT and will work without modifications on new Service Pack Rele ases. In addition to providing you the ability t o control the minimum and maximum working set si CENTER, it also allows you to reset the Cache s working se t, forcing it to grow as necessary from a minimal st arting point. Also unlike CacheMan. changes made with CacheSet have an immediate ef Ocean on the size of the Cache. Full source code is included.
Platform: | Size: 61259 | Author: 李杰 | Hits:

[Button control] dynamic_splitter&cursor

Description: 新的问题出现了：对于一般的最大最小搜索，即使每一步只有很少的下法，搜索位置的数目也会随着搜索深度呈级数级增长。在大多数的中局棋形中，每步平均有十种下法，假设电脑搜索九步(程序术语称为搜索深度为九)，就要搜索十亿个位置(十的九次方)，这样极大地限制了电脑的棋力：我们总不能忍受电脑棋手一年才下一步棋。减少搜索结点的最简单的方法是减小搜索深度，但这大大影响了电脑棋手的棋力。是否有办法在不减小搜索深度的前提下将需要搜索的结点减小一些？幸运的是，可以证明，程序不需要考虑所有的位置而找到最佳点，于是人们采用了一个方法，叫\"alpha-beta剪枝\"，它大为减少了检测的数目，-new problem has arisen : the biggest smallest general search, even if only a small step in the purgation, Search position as the number will search depth grow exponentially. In most of the middle-game, every step, an average of 10 purgation, Assuming the computer search nine-step (search procedure, technically known as a depth of nine), it is necessary to search 1 billion location (10 to nine), this greatly limits the computer chess : We can not put up with the computer players will move next year. Reduce node search of the most simple way is to reduce the search depth, but greatly affected the computer players in the spotlight. If there are ways to reduce the search in depth under the premise of the need to search nodes decreased? Fortunately, evidence, procedures need not consider all th
Platform: | Size: 70386 | Author: 晓亮 | Hits:

[Button control] gk

Description: 新的问题出现了：对于一般的最大最小搜索，即使每一步只有很少的下法，搜索位置的数目也会随着搜索深度呈级数级增长。在大多数的中局棋形中，每步平均有十种下法，假设电脑搜索九步(程序术语称为搜索深度为九)，就要搜索十亿个位置(十的九次方)，这样极大地限制了电脑的棋力：我们总不能忍受电脑棋手一年才下一步棋。减少搜索结点的最简单的方法是减小搜索深度-new problem has arisen : the biggest smallest general search, even if only a small step in the purgation, Search position as the number will search depth grow exponentially. In most of the middle-game, every step, an average of 10 purgation, Assuming the computer search nine-step (search procedure, technically known as a depth of nine), it is necessary to search 1 billion location (10 to nine), this greatly limits the computer chess : We can not put up with the computer players will move next year. Reduce node search of the most simple way is to reduce the depth of search
Platform: | Size: 27033 | Author: 晓亮 | Hits:

[Windows Develop] Cell-grow

Description: 用vc＋＋模拟细胞的成长、死亡和分裂，自动图形显示过程-with vc + + simulation cell growth, death and division. Graphics automatically process
Platform: | Size: 122448 | Author: 何 | Hits:

[Windows Develop] niudun

Description: 图是用牛顿法求方程z3-1=0的根所得到的“项链”。以上程序采用浮点运算，速度是比较慢的。如果每迭代一次就计算一次距离，则速度会更慢。为了使不同吸引区域有不同的颜色，并且能够表现收敛速度，必须做更多的距离计算，但得到的图形也更美丽。特别是将分界处的“项链”放大来看，会得到精致的结构。-Fig Newton method is used Equation z3-1 = 0 has been the root of the "necklace." The procedure is used floating-point operations, speed is relatively slow. If every iteration on a calculated distance, it would grow more slowly. In order to attract different regions have different colors, and be able to demonstrate the convergence rate and must do more distance, but the graphics are more beautiful. In particular, the boundaries of the "necklace" to enlarge it, will be refined structure.
Platform: | Size: 2093 | Author: 刁轩 | Hits:

[OpenGL program] rainrainrainrainrain

Description: 雨滴程序，很漂亮，怦然心动就是这种感觉快乐中学习，美丽中成长-raindrop procedures, is very beautiful, is the most exciting feeling happy to learn, grow beautiful
Platform: | Size: 339401 | Author: 李明月 | Hits:

[SourceCode] grow-cut MATLAB代码

Description: growcut的MATLAB源代码，可以跑通
Platform: | Size: 94314 | Author: qianxinxiuxing_0921@126.com | Hits:

[matlab] RegionGrow

Description: 区域生长的matlab源码 region grow-Matlab source of regional growth region grow
Platform: | Size: 1024 | Author: guoyaomc | Hits:

[Special Effects] regiongrow

Description: 区域增长速算法的C++编程实现代码，带有编程注释。-region grow c++ code for image processing
Platform: | Size: 1024 | Author: 张建宏 | Hits:

[Software Engineering] reg_grow

Description: region grow sirve para separa una region de una imagen dependiendo del nivel de griss que tenga los valores de entrada que es el punto a evaluar
Platform: | Size: 30720 | Author: jovhy | Hits:

[matlab] Segment

Description: Image Segmentation Algorithm Using modified Region-Grow implemented in matlab
Platform: | Size: 499712 | Author: 刘宝渊 | Hits:

[JSP/Java] grow

Description: 一个十分简单的小型JAVA程序，用一只海龟作图-A very simple small JAVA program, with a sea turtle mapping
Platform: | Size: 11264 | Author: BOYU | Hits:

[Graph program] imagesegment

Description: 此M文件主要利用区域生长和边缘检测进行图像分割-image segment by region grow
Platform: | Size: 1024 | Author: mayun | Hits:

[Special Effects] REGIONGROW

Description: 從一種子像素開始，透過平均灰階度、色彩等性質檢視，將類似性質的像素逐一納入所考慮區域中，逐漸長成一個性質相似的影像區塊。-Starting from a sub-pixel by the average degree of gray-scale, color and other properties to view, each pixel of a similar nature will be included in the region considered, and gradually grow into an image block of a similar nature.
Platform: | Size: 1024 | Author: Luo | Hits:

Category

Source Code

Web/Internet

Develop Tools

Document

Other

Search in results

OS

Platform

Language

File Type

Search list