全文获取类型
收费全文 | 416篇 |
免费 | 10篇 |
出版年
2021年 | 4篇 |
2019年 | 13篇 |
2018年 | 13篇 |
2017年 | 7篇 |
2016年 | 5篇 |
2015年 | 7篇 |
2014年 | 9篇 |
2013年 | 76篇 |
2012年 | 3篇 |
2010年 | 5篇 |
2009年 | 7篇 |
2008年 | 6篇 |
2005年 | 3篇 |
2004年 | 7篇 |
2003年 | 9篇 |
2002年 | 6篇 |
2001年 | 6篇 |
2000年 | 8篇 |
1998年 | 6篇 |
1997年 | 7篇 |
1996年 | 10篇 |
1995年 | 6篇 |
1994年 | 4篇 |
1993年 | 8篇 |
1992年 | 7篇 |
1991年 | 10篇 |
1990年 | 4篇 |
1989年 | 5篇 |
1988年 | 6篇 |
1986年 | 10篇 |
1985年 | 8篇 |
1984年 | 8篇 |
1983年 | 5篇 |
1982年 | 4篇 |
1981年 | 6篇 |
1980年 | 11篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1976年 | 8篇 |
1975年 | 7篇 |
1974年 | 9篇 |
1973年 | 3篇 |
1972年 | 7篇 |
1971年 | 12篇 |
1970年 | 7篇 |
1969年 | 8篇 |
1968年 | 7篇 |
1967年 | 4篇 |
1966年 | 7篇 |
排序方式: 共有426条查询结果,搜索用时 312 毫秒
71.
This article develops a robust, exact algorithm for the maximal covering problem (MCP) using dual-based solution methods and greedy heuristics in branch and bound. Based on tests using randomly generated problems with problem parameters similar to those in the existing literature, the hybrid approach developed in this work appears to be effective over a wide range of MCP model parameters. The method is further validated on problems constructed from three real-world data sets. The extensive computational study compares the new method with other existing exact methods using problems that are as big, or larger than, those used in previous work on MCP. The results show that the proposed method is effective in most instances of MCP. In particular, it is shown that bounding schemes using Lagrangian relaxation are effective on MCP as a method of obtaining both exact and heuristic solutions. © 1996 John Wiley & Sons, Inc. 相似文献
72.
We consider a multiperiod resource allocation problem, where a single resource is allocated over a finite planning horizon of T periods. Resource allocated to one period can be used to satisfy demand of that period or of future periods, but backordering of demand is not allowed. The objective is to allocate the resource as smoothly as possible throughout the planning horizon. We present two models: the first assumes that the allocation decision variables are continuous, whereas the second considers only integer allocations. Applications for such models are found, for example, in subassembly production planning for complex products in a multistage production environment. Efficient algorithms are presented to find optimal allocations for these models at an effort of O(T2). Among all optimal policies for each model, these algorithms find the one that carries the least excess resources throughout the planning horizon. © 1995 John Wiley & Sons, Inc. 相似文献
73.
A new class of nonparametric reliability models is introduced and studied. A distribution is said to be better at age s than at age t (sBt) if the residual lifetime at age s is stochastically greater than or equal to the residual lifetime at age t. Applications to various forms of replacement policies, including the cannibalization of failed systems, are noted. For fixed s < t, the problem of estimating a survival curve assumed to belong to the sBt class is addressed using recursive methods. An sBt estimator is derived in closed form, and its uniform strong consistency at an optimal rate of convergence is demonstrated. A simulation study strongly supports the claim that the sBt estimator tends to outperform the empirical survivor function in small- and moderate-size samples. © 1993 John Wiley & Sons, Inc. 相似文献
74.
We consider the problem of finding a plan that maximizes the expected discounted return when extracting a nonrenewable resource having uncertain reserves. An extraction plan specifies the rate at which the resource is extracted as a function of time until the resource is exhausted or the time horizon is reached. The return per unit of resource extracted may depend on the rate of extraction, time, and the amount of resource previously extracted. We apply a new method called the generalized search optimization technique to find qualitative features of optimal plans and to devise algorithms for the numerical calculation of optimal plans. 相似文献
75.
76.
The rise of China has been fuelled by a massive military modernisation programme relying, in large part, on the acquisition of foreign military equipment. The question of how the world’s major powers define their arms transfer policies towards China is therefore crucially important. This article makes two original contributions. First, drawing on neoclassical realism, it proposes an explanatory framework integrating international and domestic factors to explain variations in major powers’ arms transfers. Second, based on a large body of elite interviews and diplomatic cables, it offers the first comprehensive comparison of American, British, French and Russian arms transfer policies towards China since the end of the Cold War. 相似文献
77.
对设计加工研制的Tesla变压器,根据Smith建议的测量方法,解决了对紧凑Teala变压器耦合系数进行比较准确地测量的问题,实测耦合系数高达0.9,并对耦合系数稍低于理论设计值的原因进行了探讨,同时分析给出了物理原因.此外,根据Teala变压器电路在初次级初、次级短路和低电压充电情形下的实测电压波形,估算出Tesla变压器电路各参数数值.这些数值与理论计算值吻合,并能满足实际高压充电的要求. 相似文献
78.
针对单一算法对混合尺寸目标进行时域电磁分析的困难,提出一种时域伪谱(PSTD)同时域有限体积(FVTD)混合方法。FVTD可方便地分析复杂的几何结构和材料,但是难以计算电大尺寸的目标,PSTD则特别适合计算电大尺寸的规则结构,但在模拟复杂的几何结构尤其是带有曲边结构以及电大、电小共存结构时存在困难。混合方法克服了单独算法的缺点,融合各自的优势,提高了算法的求解能力和应用范围。为了减小两种算法连接边界带来的反射,采用了FVTD计算面均值的二次函数重构方法,给出了交叠网格和非交叠网格两种混合方案。数值试验表明,混合方法有较高的精度,具有时域分析混合尺寸目标电磁问题的能力。 相似文献
79.
80.
Single- and multi-facility location problems are often solved with iterative computational procedures. Although these procedures have proven to converage, in practice it is desirable to be able to compute a lower bound on the objective function at each iteration. This enables the user to stop the iterative process when the objective function is within a prespecified tolerance of the optimum value. In this article we generalize a new bounding method to include multi-facility problems with lp distances. A proof is given that for Euclidean distance problems the new bounding procedure is superior to two other known methods. Numerical results are given for the three methods. 相似文献