全文获取类型
收费全文 | 437篇 |
免费 | 15篇 |
出版年
2020年 | 5篇 |
2019年 | 7篇 |
2018年 | 4篇 |
2017年 | 8篇 |
2016年 | 7篇 |
2015年 | 9篇 |
2014年 | 7篇 |
2013年 | 78篇 |
2011年 | 4篇 |
2010年 | 4篇 |
2009年 | 5篇 |
2007年 | 6篇 |
2005年 | 4篇 |
2004年 | 8篇 |
2003年 | 5篇 |
2002年 | 7篇 |
2001年 | 7篇 |
2000年 | 4篇 |
1999年 | 7篇 |
1998年 | 9篇 |
1997年 | 9篇 |
1996年 | 6篇 |
1995年 | 12篇 |
1994年 | 15篇 |
1993年 | 10篇 |
1992年 | 12篇 |
1991年 | 12篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 11篇 |
1987年 | 8篇 |
1986年 | 5篇 |
1985年 | 9篇 |
1984年 | 11篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1981年 | 9篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 6篇 |
1977年 | 7篇 |
1976年 | 7篇 |
1975年 | 10篇 |
1974年 | 7篇 |
1973年 | 8篇 |
1972年 | 9篇 |
1971年 | 6篇 |
1969年 | 4篇 |
1968年 | 6篇 |
1967年 | 4篇 |
排序方式: 共有452条查询结果,搜索用时 15 毫秒
181.
We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016 相似文献
182.
In this article we present and test two heuristics for the economic lot scheduling problem. The first heuristic was developed by one of us (P.C. Geng) during Ph.D. research, while the other is a convergent implementation of an algorithm due to Doll and Whybark. We study the performance of these heuristics on a large set of test problems constructed using a new form of problem generation that yields random problems within an experimental design. 相似文献
183.
A problem often arising in applied linear regression modeling is determining the appropriate weight to attach to each observation. In the extreme, the problem extends to the deletion of observations from a data base. Since the choice of weights, fitting criteria, and estimation procedure depend on the specific objectives of the modeling, universally applicable guidelines are virtually nonexistent. However, the sensitivity of analytic conclusions to weights assigned to “suspect” observations can be conveniently assessed using a graphical display. This report develops such a display based on a modeling of outliers which leads naturally to estimators based on a weighted least-squares criterion, and a data-analytic method for determining how much downweighting to impose on a specific subset of observations. This technique is illustrated with several examples, including one relating air pollution to human mortality. 相似文献
184.
185.
186.
以双轴T型结构的超精密金刚石车床的伺服进给系统为研究对象,采用自构造神经网络技术,建立了系统的非线性动态数学模型,为系统非线性控制与补偿提供参考模型 相似文献
187.
C. J. Ancker Jr. 《海军后勤学研究》1984,31(3):363-371
The fundamental stochastic duel considers two opponents who fire at each other at either random continuous or fixed-time intervals with a constant hit probability on each round fired. Each starts with an unloaded weapon, unlimited ammunition, and unlimited time. The first to hit wins. In this article we extend the theory to the case where hit probabilities are functions of the time since the duel began. First, the marksman firing at a passive target is considered and the characteristic function of the time to a hit is developed. Then, the probability of a given side winning the duel is derived. General solutions for a wide class of hit probability functions are derived. Specific examples of both the marksman and the duel problem are given. 相似文献
188.
189.
The individual and social optimum control policies for entry to an M/M//1 queue serving several classes of customers have been shown to be control-limit policies. The technique of policy iteration provides the social optimum policy for such a queue in a straightforward manner. In this article, the problem of finding the optimal control policy for the M/Ek/1 system is solved, thereby expanding the potential applicability of the solutions developed. The Markovian nature of the queueing system is preserved by considering the service as having k sequential phases, each with independent, identically distributed, exponential service times, through which a customer must pass to be serviced. The optimal policy derived by policy iteration for such a system is likely to be difficult to use because it requires knowledge of the number of phases rather than customers in the system when an arrival occurs. To circumvent this difficulty, a heuristic is used to find a good usable (implementable) solution. In addition, a mixed-integer program is developed which yields the optimal implementable solution when solved. 相似文献
190.
George C. Canavos 《海军后勤学研究》1983,30(3):465-470
A mean-squared error comparison of smooth empirical Bayes and Bayes estimators for the Weibull and gamma scale parameters is studied based on a computer simulation. The smooth empirical Bayes estimators are determined as functions of up to 15 past estimates of the parameter of interest. Results indicate that at best the mean-squared errors of the empirical Bayes estimators are about 20–40% larger than those of the corresponding squared-error optimal Bayes estimators. 相似文献