This paper addresses the problem of segmenting an image into regions. We defi ne a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an effi cient segment

在无线传感网络中，PEGASIS虽然不是严格的簇类协议，却延用了簇的思想。本程序在Ns2中进行模拟，使用贪心算法建立一条基于地理位置的链，即：PEGASIS中的簇。-In WSNs, PEGASIS routing protocol follows the idea of clustring though it is not a strict hierachical protocol. This program utilizes the greedy algorithm to build a l

Dijkstra算法是由E.W.Dijkstra于1959年提出,又叫迪杰斯特拉算法,它应用了贪心算法模式,是目前公认的最好的求解最短路径的方法。-Dijkstra algorithm greedy algorithm mode, is widely recognized as the best method for solving the shortest path.

multi-armed bandit多臂赌博机算法中的e-greedy贪婪算法的基本仿真代码(multi-armed bandit e-greedy simulation program)