全文获取类型
收费全文 | 673篇 |
免费 | 73篇 |
国内免费 | 14篇 |
出版年
2022年 | 11篇 |
2021年 | 24篇 |
2020年 | 21篇 |
2019年 | 7篇 |
2018年 | 7篇 |
2017年 | 23篇 |
2016年 | 27篇 |
2015年 | 21篇 |
2014年 | 36篇 |
2013年 | 73篇 |
2012年 | 59篇 |
2011年 | 55篇 |
2010年 | 40篇 |
2009年 | 33篇 |
2008年 | 51篇 |
2007年 | 28篇 |
2006年 | 19篇 |
2005年 | 11篇 |
2004年 | 8篇 |
2003年 | 7篇 |
2002年 | 8篇 |
2001年 | 3篇 |
2000年 | 3篇 |
1999年 | 3篇 |
1998年 | 7篇 |
1997年 | 6篇 |
1995年 | 6篇 |
1994年 | 5篇 |
1993年 | 12篇 |
1992年 | 4篇 |
1991年 | 4篇 |
1989年 | 7篇 |
1986年 | 10篇 |
1985年 | 7篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1973年 | 2篇 |
1972年 | 12篇 |
1971年 | 3篇 |
1970年 | 3篇 |
1969年 | 9篇 |
1968年 | 7篇 |
1966年 | 3篇 |
排序方式: 共有760条查询结果,搜索用时 315 毫秒
91.
指纹细节点的提取对于指纹识别系统的性能至关重要,文中在二值细化指纹图像的细节点提取算法基础上,对细节点提取范围进行了算法改进,用C++语言实现了一种限制提取范围的算法和一种去除伪细节点的算法。实验表明,改进算法提取细节点的速度和精度都有了明显改进,相对原始的未加限制和去除伪细节点的算法,文中算法耗时减少了约2/3,细节点有效性提升了约3/4。 相似文献
92.
93.
In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008 相似文献
94.
提出并研究了布尔函数的Walsh谱绝对值分布.指出布尔函数Walsh谱绝对值分布在仿射变换下的不变性,计算了n(n≤5)元布尔函数的Walsh谱绝对值分布,研究了Walsh谱绝对值分布与Walsh谱支撑和Walsh谱中非零取值个数以及其他一些密码学难题的联系,最后研究了布尔函数的Walsh谱绝对值分布的大小. 相似文献
95.
This paper considers the production of two products with known demands over a finite set of periods. The production and inventory carrying costs for each product are assumed to be concave. We seek the minimum cost production schedule meeting all demands, without backlogging, assuming that at most one of the two products can be produced in any period. The optimization problem is first stated as a nonlinear programming problem, which allows the proof of a result permitting the search for the optimal policy to be restricted to those which produce a product only when its inventory level is zero. A dynamic programming formulation is given and the model is then formulated as a shortest route problem in a specially constructed network. 相似文献
96.
This paper gives a new organization of the theoretical results of the Generalized Transportation Problem with capacity constraints. A graph-theoretic approach is utilized to define the basis as a one-forest consisting of one-trees (a tree with an extra edge). Algorithmic development of the pivot-step is presented by the representation of a two-tree (a tree with two extra edges). Constructive procedures and proofs leading to an efficient computer code are provided. The basic definition of an operator theory which leads to the discussion of various operators is also given. In later papers we will present additional results on the operator theory for the generalized transportation problem based on the results in the present paper. 相似文献
97.
This paper investigates the effect on the optimum solution of a (capacitated) transportation problem when the data of the problem (the rim conditions-i. e., the warehouse supplies and market demands-the per unit transportation costs and the upper bounds) are continuously varied as a (linear) function of a single parameter. An operator theory is developed and algorithms provided for applying rim and cost operators that effect the transformation of optimum solution associated with changes in rim conditions and unit costs. Bound operators that effect changes in upper bounds are shown to be equivalent to rim operators. The discussion in this paper is limited to basis preserving operators for which the changes in the data are such that the optimum basis structures are preserved. 相似文献
98.
This paper describes a linear programming model used to perform cost-effectiveness analysis to determine the requirements for military strategic mobility resources. Expenditures for three classes of economic alternatives are considered: purchase of transportation resources; prepositioning of material; and augmentation of port facilities. The mix of economic alternatives that maximizes the effectiveness of the resultant transportation system is determined for a given investment level. By repeating the analysis for several levels of investment, a cost-effectiveness tradeoff curve can be developed. 相似文献
99.
100.