intruduction of distributed systems - 北京大学网 .ppt

http://www.dcs.bbk.ac.uk/webDyn2/proceedings/pant_topic_driven_crawlers.pdf The issue of exploitation versus exploration is a universal one in machine learning and artifcial intelligence, since it presents itself in any task where search is guided by quality estimations. Under some regularity assumption, one can assume that a measure of quality at one point in the search space provides some information on the quality of nearby points. A greedy algorithm can then exploit this information by concentrating the search in the vicinity of the most promising points. However, this strategy can lead to missing other equally good or even better points, for two reasons: first, the estimates may be noisy; and second, the search space may have local optima that trap the algorithm and keep it from locating global optima. In other words, it may be necessary to visit some “bad“ points in order to arrive at the best ones. At the other extreme, algorithms that completely disregard quality estimates and continue to explore in a uniform or random fashion do not risk getting stuck at local optima, but they do not use the available information to bias the search and thus may spend most of their time exploring suboptimal areas. A balance between exploitation and exploration of clues is obviously called for in heuristic search algorithms, but the optimal compromise point is unknown unless the topology of the search space is well understood --which is typically not the case. * /modules/meanmode.htm Mean, Median, Mode, and Range Mean, median, and mode are three kinds of averages. There are many averages in statistics, but these are, I think, the three most common, and are certainly the three you are most likely to encounter in your pre-statistics courses, if the topic comes up at all. The mean is the average youre used to, where you add up all the numbers and then divide by the number of numbers. The median is the middle value in the list of numbers. To find the median, your numbers ha