Search - heuristics

Search - heuristics - List

[Game Program] HeuristicBoxman DL : 0: 使用启发式算法编写的推箱子游戏,有图形界面,可以自动演示最优步骤-use heuristics prepared by the RSS games, graphics interface, automatic optimal demonstration steps
Date : 2008-10-13 Size : 14.86kb User : 阮珏
[Other resource] dossier DL : 0: For the incomplete methods, we kept the representation of the queens by a table and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems than the representation by a matrix. heuristics: descent. Tests: 100 queens in less than 1 second and 67 iterations. 500 queens in 1 second and 257 iterations. 1000 queens in 11 seconds and 492 iterations. heuristics: Simulated annealing. Tests: 100 queens in less than 1 second and 47 iterations. 500 queens in 5 seconds and 243 iterations. 1000 queens in 13 seconds and 497 iterations. heuristics: based on Simulated Annealing. Tests: 100 queens in less than 1 second and 60 iterations. 500 queens in 1 second and 224 iterations. 1000 queens in 5 seconds and 459 iterations. 10 000 queens in 20 minutes 30 seconds and 4885 iterations. -For the incomplete methods, we kept the representation of the queens by a tab le and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems th an the representation by a matrix. heuristics : descent. Tests : 100 queens in less than a second and 67 iteration s. 500 queens in a second and 257 iterations. 100 queens 0 in 11 seconds and 492 iterations. heuri stics : Simulated annealing. Tests : 100 queens in less than a second and 47 iteration s. 500 queens in 5 seconds and 243 iterations. 10 00 queens in 13 seconds and 497 iterations. heur istics : based on Simulated Annealing. Tests : 100 queens in less than a second and 60 iteration s. 500 queens in a second and 224 iterations. 100 0 queens in 5 seconds and 459 iterations. q 1
Date : 2008-10-13 Size : 51.35kb User : ZHU
[CSharp] qifa DL : 0: 启发式算法DOC文本,复制到C++中可直接运行.-heuristics DOC text copied to the C can be directly run.
Date : 2008-10-13 Size : 3.77kb User : dqs
[Other resource] AddisonWesleyObject-OrientedDesignHeuristics DL : 0: Object-Oriented Design Heuristics By Arthur J. Riel Publisher : Addison Wesley Pub Date : April 30, 1996 经典的面向对象设计书籍
Date : 2008-10-13 Size : 3.2mb User : wang xiaobo
[WEB Code] ONTOLOGY_BASED DL : 0: A FRAMEWORK FOR EXTRACTION PLANS AND HEURISTICS IN AN ONTOLOGY-BASED DATA-EXTRACTION SYSTEM
Date : 2008-10-13 Size : 398.64kb User : math
[Game Program] HeuristicBoxman DL : 0: 使用启发式算法编写的推箱子游戏,有图形界面,可以自动演示最优步骤-use heuristics prepared by the RSS games, graphics interface, automatic optimal demonstration steps
Date : 2025-07-13 Size : 15kb User : 阮珏
[AI-NN-PR] dossier DL : 0: For the incomplete methods, we kept the representation of the queens by a table and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems than the representation by a matrix. heuristics: descent. Tests: 100 queens in less than 1 second and 67 iterations. 500 queens in 1 second and 257 iterations. 1000 queens in 11 seconds and 492 iterations. heuristics: Simulated annealing. Tests: 100 queens in less than 1 second and 47 iterations. 500 queens in 5 seconds and 243 iterations. 1000 queens in 13 seconds and 497 iterations. heuristics: based on Simulated Annealing. Tests: 100 queens in less than 1 second and 60 iterations. 500 queens in 1 second and 224 iterations. 1000 queens in 5 seconds and 459 iterations. 10 000 queens in 20 minutes 30 seconds and 4885 iterations. -For the incomplete methods, we kept the representation of the queens by a tab le and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems th an the representation by a matrix. heuristics : descent. Tests : 100 queens in less than a second and 67 iteration s. 500 queens in a second and 257 iterations. 100 queens 0 in 11 seconds and 492 iterations. heuri stics : Simulated annealing. Tests : 100 queens in less than a second and 47 iteration s. 500 queens in 5 seconds and 243 iterations. 10 00 queens in 13 seconds and 497 iterations. heur istics : based on Simulated Annealing. Tests : 100 queens in less than a second and 60 iteration s. 500 queens in a second and 224 iterations. 100 0 queens in 5 seconds and 459 iterations. q 1
Date : 2025-07-13 Size : 51kb User : ZHU
[CSharp] qifa DL : 1: 启发式算法DOC文本,复制到C++中可直接运行.-heuristics DOC text copied to the C can be directly run.
Date : 2025-07-13 Size : 4kb User : dqs
[Software Engineering] AddisonWesleyObject-OrientedDesignHeuristics DL : 0: Object-Oriented Design Heuristics By Arthur J. Riel Publisher : Addison Wesley Pub Date : April 30, 1996 经典的面向对象设计书籍 -Object-Oriented Design Heuristics By Arthur J. Riel Publisher: Addison Wesley Pub Date: April 30, 1996 classic object-oriented design books
Date : 2025-07-13 Size : 3.2mb User : wang xiaobo
[Documents] ONTOLOGY_BASED DL : 0: A FRAMEWORK FOR EXTRACTION PLANS AND HEURISTICS IN AN ONTOLOGY-BASED DATA-EXTRACTION SYSTEM
Date : 2025-07-13 Size : 398kb User : math
[Other] SICOMPvolume-060206041 DL : 0: Daniel K.Rosenkrantz. Richard E.Stearns. 关于旅行商问题的集中启发式算法的分析-Daniel K. Rosenkrantz. Richard E. Stearns. The focus on the traveling salesman problem heuristics analysis
Date : 2025-07-13 Size : 1.83mb User : phil
[Software Engineering] PSOBPlunwen DL : 1: 基于PSO的BP训练算法论文：在BP训练算法中，关于变权值、学习速率、步长的问题已被广泛地研究，几种基于启发式改进的技术也表明具有改善训练时间以及避免陷入局部最小的明显效果。这里BP训练过程由基于PSO同时优化log—Sigmoid函数与网络权值的新算法(PSO。GainBP)实现。实验结果表明，PSO—GainBP比传统基于PSO的BP算法在网络训练方面具有更好的性能。-PSO based on the BP training algorithm Papers: In the BP training algorithm, on the right to change the value of learning rate, step length of the question has been widely studied, several heuristics based on improved technology also shows that to improve the training time and avoid falling into local the smallest tangible results. Here BP training process at the same time by the PSO-based optimization of log-Sigmoid function and the network weights of the new algorithm (PSO. GainBP) to achieve. The experimental results show that, PSO-GainBP than the traditional PSO based on the BP algorithm in network training has a better performance.
Date : 2025-07-13 Size : 147kb User : ekin
[Books] HOTI_99 DL : 0: 流算法中的一种：Packet Classification using Hierarchical Intelligent Cuttings-Internet routers that operate as firewalls, or provide a variety of service classes, perform different operations on different flows. A flow is defined to be all the packets sharing common header characteristics for example a flow may be defined as all the packets between two specific IP addresses. In order to classify a packet, a router consults a table (or classifier) using one or more fields from the packet header to search for the corresponding flow. The classifier is a list of rules that identify each flow and the actions to be performed on each. With the increasing demands on router performance, there is a need for algorithms that can classify packets quickly with minimal storage requirements and allow new flows to be frequently added and deleted. In the worst case, packet classification is hard requiring routers to use heuristics that exploit structure present in the classifiers. This paper presents such a heuristic, called HiCuts, (hierarchical intelligent cutti
Date : 2025-07-13 Size : 49kb User : Reguse
[Books] p213-singh DL : 0: 流分类中的一种算法：Packet Classification Using Multidimensional Cutting-This paper introduces a classification algorithm called HyperCuts. Like the previously best known algorithm, HiCuts, HyperCuts is based on a decision tree structure. Unlike HiCuts, however, in which each node in the decision tree represents a hyperplane, each node in the HyperCuts decision tree represents a k− dimensional hypercube. Using this extra degree off reedom and a new set of heuristics to find optimal hypercubes for a given amount of storage, Hyper- Cuts can provide an order ofma gnitude improvement over existing classification algorithms. HyperCuts uses 2 to 10 times less memory than HiCuts optimized for memory, while the worst case search time ofH yperCuts is 50− 500 better than that ofH iCuts optimized for speed. Compared with another recent scheme, EGT-PC, HyperCuts uses 1.8 − 7 times less memory space while the worst case search time is up to 5 times smaller. More importantly, unlike EGT-PC, HyperCuts can be fully pipelined to provide one
Date : 2025-07-13 Size : 211kb User : Reguse
[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
Date : 2025-07-13 Size : 261kb User : it
[Software Engineering] heuristics DL : 0: CSC 550: Introduction to Artificial Intelligence Fall 2004 heuristics & informed search heuristics hill-climbing bold + informed search potential dangers, variants best first search tentative + informed search best-first search vs. DFS vs. BFS-CSC 550: Introduction to Artificial Intelligence Fall 2004 heuristics & informed search heuristics hill-climbing bold+ informed search potential dangers, variants best first search tentative+ informed search best-first search vs. DFS vs. BFS
Date : 2025-07-13 Size : 168kb User : it
[Mathimatics-Numerical algorithms] nQueens DL : 0: 人工智能课程实验：使用启发式搜索求解皇后问题。启发式搜索是利用度量作为指南的一种搜索方法。皇后问题是计算机界的经典问题，n皇后问题为把n个皇后放入一个n*n的棋盘中，使皇后两两不在同一行，同一列以及同一斜线中。求解n皇后问题的算法众多，主要有回溯法，构造法，概率算法以及本实验所用的启发式搜索方法等。方法不同，求解问题所产生的时间效率也大不相同，本实验主要对比构造法与启发式搜索方法的效率。 -Artificial Intelligence Curriculum Experiment: Using heuristic search for solving the queens problem. Heuristic search is used as a guide to measure a search method. Queens problem is a computer industry classic problem, n queens problem is the n-queen into a chessboard of n* n, so that the Queen is not in the same row 22, and the same diagonal in the same column. N queens algorithm for solving a number of mainly retrospective method, construction method, probabilistic algorithms and heuristics used in this study search methods. Methods, to solve problems arising from the time efficiency of very different construction method for this study primarily compared with the efficiency of heuristic search method.
Date : 2025-07-13 Size : 2mb User : 夏雪
[Windows Develop] Simple-Heuristics DL : 0: 本书内容包括:研究的总体框架、基本无知的决策制定、单一理由决策制定、超越选择——记忆、估计和分类等-Simple Heuristics That Make Us Smart invites readers to embark on a new journey into a land of rationality that differs from the familiar territory of cognitive science and economics. Traditional views of rationality tend to see decision makers as possessing superhuman powers of reason, limitless knowledge, and all of eternity in which to ponder choices. To understand decisions in the real world, we need a different, more psychologically plausible notion of rationality, and this book provides it. It is about fast and frugal heuristics--simple rules for making decisions when time is pressing and deep thought an unaffordable luxury. These heuristics can enable both living organisms and artificial systems to make smart choices, classifications, and predictions by employing bounded rationality.
Date : 2025-07-13 Size : 19.36mb User : 王杰
[Industry research] Heuristics DL : 0: Heuristics algorithm course
Date : 2025-07-13 Size : 610kb User : 2k
[Other] How-to-Solve-It--Modern-Heuristics DL : 0: 介绍启发式算法的设计思想和技巧,本书堪称算法设计领域里的经典之作-How to Solve It:Modern Heuristics.
Date : 2025-07-13 Size : 6.11mb User : 王波

« 12 3 4 5 »