1975年，来自斯坦福大学的Jon Louis Bentley在ACM杂志上发表的一篇论文：Multidimensional Binary Search Trees Used for Associative Searching 中正式提出和阐述的了把空间划分为多个部分的k-d树。

最近玩 Elastic search5.0 ，国内下载x-pack很蛋疼，共享给大家

Codeblocks安装时Can't find compiler executable in your configured search path's for GNU GCC Compiler.-附件资源

基于的描述，此程序包提供了自适应大邻域搜索（ALNS）元启发式方法的一般，经过充分记录和测试的实现。 它可以按以下常规方式安装： pip install alns 如何使用 alns包提供了两个类，即ALNS和State 。 第一个可以用来运行ALNS算法，第二个可以被子类化以存储解决方案状态-它所需要的只是定义一个objective成员函数，并返回一个目标值。 必须为ALNS算法提供接受标准，以便在每次迭代时确定是否接受新的解决方案状态。 给出了通用验收标准的概述 。 在alns.criteria ，已经为您实现了几个 HillClimbing 。 最简单的接受标准是爬山，仅接受提高目标值的解决方案。 RecordToRecordTravel 。 仅当改进满足某些更新阈值时，此准则才接受解决方案。 SimulatedAnnealing 。 当标度概率大于某个随机数时，使用更新温

一个用java/mysql编写的网络搜索引擎和爬虫，全文和垂直搜索，分词系统。

The proliferation of information housed in computerized domains makes it vital to find tools to search these resources efficiently and effectively. Ordinary retrieval techniques are inadequate because sorting is simply impossible. Consequently, proximity searching has become a fundamental computation task in a variety of application areas. Similarity Search focuses on the state of the art in developing index structures for searching the metric space. Part I of the text describes major theoretical principles, and provides an extensive survey of specific techniques for a large range of applications. Part II concentrates on approaches particularly designed for searching in large collections of data. After describing the most popular centralized disk-based metric indexes, approximation techniques are presented as a way to significantly speed up search time at the cost of some imprecision in query results. Finally, the scalable and distributed metric structures are discussed.

ES-APi调用详细的postman demo

chrome_search

学习了解search搜索引擎的例子，简单的例子，便于学习入门

四种经典启发式算法求解TSP问题，包括模拟退火（Simulated annealing）、禁忌搜索（Tabu search）、遗传算法（Genetic algorithms）和蚁群算法（Ant colonies）