Search - greedy search

Search - greedy search - List

[Other resource] tanxin DL : 0: 这是一个贪心算法的c程序。贪心算法（也叫贪婪算法）不是某种特定的算法，而是一类抽象的算法，或者说只是一种思想，它的具体表现在，对解空间进行搜索时，不是机械地搜索，而是对局部进行择优选取，贪心算法的目的不是为了找到全部解，也当然找不出最优解，而只是找出一种可行解，这样就会得到惊人的高效性。因此，贪心算法也叫启发式搜索，这种启发就是所谓的“贪心策略”。-This is a greedy algorithm c procedures. Greedy algorithm (also known as the greedy algorithm) is not a specific algorithm, but a kind of abstract algorithm, or just a thought, it is specifically manifested in the solution space search, the search is not mechanical, but the partial merit selection, greedy algorithm not for the purpose of to find all the solutions are, of course, unable to find the optimal solution, but only to find out a feasible solution, and this can be alarming efficiency. Therefore, the greedy algorithm is called heuristic search, which inspired the so-called "greedy strategy."
Update : 2008-10-13 Size : 1.14kb Publisher : 王卫红
[Other resource] icsiboost-0.3.tar DL : 0: Boosting is a meta-learning approach that aims at combining an ensemble of weak classifiers to form a strong classifier. Adaptive Boosting (Adaboost) implements this idea as a greedy search for a linear combination of classifiers by overweighting the examples that are misclassified by each classifier. icsiboost implements Adaboost over stumps (one-level decision trees) on discrete and continuous attributes (words and real values). See http://en.wikipedia.org/wiki/AdaBoost and the papers by Y. Freund and R. Schapire for more details [1]. This approach is one of most efficient and simple to combine continuous and nominal values. Our implementation is aimed at allowing training from millions of examples by hundreds of features in a reasonable time/memory.
Update : 2008-10-13 Size : 113.95kb Publisher : njustyw
[Other] ArithmeticDesignMethod DL : 0: 此文章的算法有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法等等，有用的的人可以-This article has iteration of the algorithm, exhaustive search method, the recursive method, greedy method, backtracking, sub-rule method, dynamic programming, etc., can be useful
Update : 2025-02-17 Size : 66kb Publisher : 周健
[AI-NN-PR] SuanFa DL : 0: 各种数值算法，包括：二叉树、贪心算法、搜索算法、遗传算法、模拟退火算法、分治策略等等。-A variety of numerical algorithms, including: binary tree, greedy algorithm, search algorithm, genetic algorithm, simulated annealing algorithm, sub-rule tactics and so on.
Update : 2025-02-17 Size : 174kb Publisher : 张光炜
[Data structs] search_method DL : 0: 搜索算法——包含回溯法、分枝定界和贪心法-Search algorithm- includes backtracking, branch and bound and the greedy method
Update : 2025-02-17 Size : 6kb Publisher : chen
[AI-NN-PR] icsiboost-0.3.tar DL : 0: Boosting is a meta-learning approach that aims at combining an ensemble of weak classifiers to form a strong classifier. Adaptive Boosting (Adaboost) implements this idea as a greedy search for a linear combination of classifiers by overweighting the examples that are misclassified by each classifier. icsiboost implements Adaboost over stumps (one-level decision trees) on discrete and continuous attributes (words and real values). See http://en.wikipedia.org/wiki/AdaBoost and the papers by Y. Freund and R. Schapire for more details [1]. This approach is one of most efficient and simple to combine continuous and nominal values. Our implementation is aimed at allowing training from millions of examples by hundreds of features in a reasonable time/memory.
Update : 2025-02-17 Size : 114kb Publisher : njustyw
[Data structs] suanfabaogao DL : 0: 算法设计与分析试验报告，含全部实验源代码，包括贪心法、回溯法、深度优先搜索、分治法等，内容详尽。-Algorithm design and analysis of the test report, containing all the experimental source code, including the greedy method, backtracking, depth-first search, sub-rule law, as detailed.
Update : 2025-02-17 Size : 119kb Publisher : Diana
[Data structs] AlgorithmUsingJava DL : 0: <算法导论>第二版大部分算法实现. 1. 各类排序和顺序统计学相关 2. 数据结构 2.1 基本数据结构 2.2 散列表 2.3 二叉查找树 2.4 红黑树 2.5 数据结构基于红黑树的扩张 3. 高级涉及和分析技术 3.1 动态规划相关 3.2 贪心算法相关 3.3 用于不相交集合的数据结构 4. 部分图算法.-<Introduction to Algorithms> Algorithms realize most of the second edition of .1. All kinds of sorting and order statistics related to 2. Data Structure 2.1 Basic Data Structure 2.2 Hash Table 2.3 Binary search Tree 2.5 Tree 2.4 red and black red and black tree-based data structure the expansion of 3. High and analytical techniques involving dynamic programming related 3.1 Greedy Algorithm 3.2 for the relevant 3.3 Disjoint Set Data Structure 4. part of Fig algorithm.
Update : 2025-02-17 Size : 317kb Publisher : QJGui
[Data structs] C DL : 0: 本文档容括了C（C＋＋）所有算法，分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theory, algorithm, knapsack algorithm, sorting algorithm, high-precision algorithms, tree traversal, binary conversion, the whole arrangement and combination of generation, search algorithm, greedy , backtracking framework, DFS framework, BFS framework, data structure-correlation algorithm. And examples of source
Update : 2025-02-17 Size : 15kb Publisher : 海霞
[matlab] GreedyRandomizedSearch DL : 0: Matlab Implementation of Greedy Randomized Search Algorithm
Update : 2025-02-17 Size : 3kb Publisher : balatas
[Game Program] queens DL : 0: 一个使用greedy search算法实现的N个queen排列的程序。用星号代表国际象棋中的queen。随机生成布局后，显示每次移动，最后使queen不能互相攻击。即都不在相同的行，列和对角线。-A greedy search algorithm using the N-a queen arranged procedure. Behalf of the international chess with an asterisk in the queen. Randomly generated layout, display each move, the final result is queen can not attack each other. That is not in the same row, column and diagonal.
Update : 2025-02-17 Size : 12kb Publisher : 刘洋
[Industry research] m4-heuristics DL : 0: Best-first search Greedy best-first search A* search Heuristics Local search algorithms Hill-climbing search Simulated annealing search Local beam search Genetic algorithms
Update : 2025-02-17 Size : 261kb Publisher : it
[Other] CommonAlgorithmDesign DL : 0: 常用的算法设计方法集合，主要有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法-Algorithm commonly used method of collection, mainly iterative, exhaustive search methods, recursion, greedy method, backtracking, divide and conquer, dynamic programming
Update : 2025-02-17 Size : 66kb Publisher : YuMy
[Data structs] matlabyiqunsuanfa DL : 1: 蚁群算法是一种用来在图中寻找优化路径的机率型算法。是一种求解组合最优化问题的新型通用启发式方法，该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型，基于故障过电流的配电网故障定位变为一种非线性全局寻优问题。-Ant colony algorithm is a method used to find optimal path in the graph the probability-based algorithm. Is a combination of optimization problems to solve new general heuristic method, which has a positive feedback, distributed computing and constructive and the greedy heuristic search features. Through the establishment of an appropriate mathematical model, over-current fault-based distribution network fault location into a nonlinear global optimization problem.
Update : 2025-02-17 Size : 3kb Publisher : prince
[matlab] GRASP DL : 0: 贪婪随机自适应搜索法(GRASP)，使用随机化的最小最小完成时间算法来产生问题的初始解,再通过变邻域下降算法来改进这个解。-Greedy randomized adaptive search method (GRASP), the minimum use of randomized algorithm to generate the minimum completion time of the initial solutions of the problem, and through the variable neighborhood descent algorithm to improve the solution.
Update : 2025-02-17 Size : 5kb Publisher : sunling
[matlab] random_search DL : 0: demonstration of various solutions of TSA problem using randsom search methods, including exhaustive search (for 8 or fewer cities), genetic algorithm (using tsa_ga.m), random-search, heurstic greedy search, simulated annealing algorithm
Update : 2025-02-17 Size : 3kb Publisher : anis
[CSharp] search-the-tree DL : 0: 贪心算法对于找零钱的实现，时间效率高，准确，谢谢使用-Greedy algorithm for the realization of looking for change, time efficient, accurate, thanks to use
Update : 2025-02-17 Size : 1kb Publisher : 张辉辉
[matlab] greedy DL : 0: greedy search for signal processing
Update : 2025-02-17 Size : 2kb Publisher : www
[matlab] ypea103-ant-colony-optimization DL : 0: colony optimization, It is a population based approach that uses the exploration of positive feedback as well as greedy search. The proposed method was inspired natural behavior of the ant colonies on how they find the food source and bring them back to their nest by building the unique trail formation.-colony optimization, It is a population based approach that uses the exploration of positive feedback as well as greedy search. The proposed method was inspired natural behavior of the ant colonies on how they find the food source and bring them back to their nest by building the unique trail formation.
Update : 2025-02-17 Size : 20kb Publisher : Izaque Souza
[Other] grasp DL : 0: GRASP (greedy randomized adaptive search Procedure) is an algorithm commonly applied to problems of combinatorial optimization. As various construction methods, the application of grasp is to create an initial solution and then perform a local search to improve the quality of the solution. Your differential to other methods is the generation of initial solution, based on the first three stages of its acronym in English: greedy (Greedy), random (trial) and adaptive (Adaptive).
Update : 2025-02-17 Size : 1kb Publisher : wesleymagasat

« 12 3 »