全文获取类型
收费全文 | 7763篇 |
免费 | 231篇 |
出版年
2020年 | 82篇 |
2019年 | 126篇 |
2018年 | 425篇 |
2017年 | 385篇 |
2016年 | 395篇 |
2015年 | 141篇 |
2014年 | 138篇 |
2013年 | 2092篇 |
2012年 | 152篇 |
2011年 | 289篇 |
2010年 | 326篇 |
2009年 | 177篇 |
2008年 | 195篇 |
2007年 | 233篇 |
2006年 | 99篇 |
2005年 | 115篇 |
2004年 | 98篇 |
2003年 | 100篇 |
2002年 | 88篇 |
2001年 | 88篇 |
2000年 | 98篇 |
1999年 | 114篇 |
1998年 | 90篇 |
1997年 | 81篇 |
1996年 | 60篇 |
1995年 | 56篇 |
1994年 | 63篇 |
1993年 | 56篇 |
1992年 | 57篇 |
1991年 | 50篇 |
1990年 | 54篇 |
1989年 | 47篇 |
1988年 | 50篇 |
1987年 | 59篇 |
1986年 | 48篇 |
1985年 | 75篇 |
1984年 | 73篇 |
1983年 | 94篇 |
1982年 | 75篇 |
1981年 | 62篇 |
1980年 | 79篇 |
1979年 | 70篇 |
1978年 | 69篇 |
1977年 | 68篇 |
1976年 | 63篇 |
1975年 | 63篇 |
1974年 | 59篇 |
1973年 | 33篇 |
1972年 | 32篇 |
1970年 | 41篇 |
排序方式: 共有7994条查询结果,搜索用时 31 毫秒
71.
72.
The p-median problem is a powerful tool in analyzing facility location options when the goal of the location scheme is to minimize the average distance that demand must traverse to reach its nearest facility. It may be used to determine the number of facilities to site, as well as the actual facility locations. Demand data are frequently aggregated in p-median location problems to reduce the computational complexity of the problem. Demand data aggregation, however, results in the loss of locational information. This loss may lead to suboptimal facility location configurations (optimality errors) and inaccurate measures of the resulting travel distances (cost errors). Hillsman and Rhoda (1978) have identified three error components: Source A, B, and C errors, which may result from demand data aggregation. In this article, a method to measure weighted travel distances in p-median problems which eliminates Source A and B errors is proposed. Test problem results indicate that the proposed measurement scheme yields solutions with lower optimality and cost errors than does the traditional distance measurement scheme. 相似文献
73.
74.
David M. Mark 《Geographical analysis》1987,19(3):264-272
A new and recursive algorithm for determining proximal polygons is based on quadtree concepts. The algorithm can use any distance metric, and produces a quadtree of the image of the proximal polygons. This can be converted to vector form, or be incorporated directly into a quadtree-based geographic information system, in order to solve a number of closest-point problems. The algorithm can also produce the Delaunay triangulation, which is the dual of the proximal polygons. Empirically, the running time of the algorithm is proportional to the number of centers raised to the 1.6 power. 相似文献
75.
Two contexts from the Colombian sites, Yotoco Ferry and Moralba, had been linked by archaeological similarities in pottery style, and dated by association with ware from other sites at circaa.d. 1000. However, radiocarbon dating of those contexts set Moralba at circa 800 b.c. , some 2000 yr older than Yotoco Ferry. Thermoluminescent dating of pottery from Yotoco Ferry dated it at circaa.d. 900, and pottery from Moralba was dated at circaa.d. 870. In addition a metal-smelting pottery crucible, thought to be prehispanic, was studied by thermoluminescence and dated, on the contrary, at less than 120 yr old. 相似文献
76.
77.
78.
Geographical Variances 总被引:1,自引:0,他引:1
79.
80.