全文获取类型
收费全文 | 666篇 |
免费 | 20篇 |
出版年
2019年 | 14篇 |
2018年 | 8篇 |
2017年 | 12篇 |
2016年 | 9篇 |
2015年 | 12篇 |
2014年 | 10篇 |
2013年 | 112篇 |
2010年 | 7篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2007年 | 7篇 |
2004年 | 11篇 |
2003年 | 9篇 |
2002年 | 8篇 |
2001年 | 10篇 |
2000年 | 8篇 |
1999年 | 7篇 |
1998年 | 12篇 |
1997年 | 13篇 |
1996年 | 14篇 |
1995年 | 15篇 |
1994年 | 15篇 |
1993年 | 14篇 |
1992年 | 17篇 |
1991年 | 18篇 |
1990年 | 10篇 |
1989年 | 12篇 |
1988年 | 16篇 |
1987年 | 15篇 |
1986年 | 9篇 |
1985年 | 14篇 |
1984年 | 15篇 |
1983年 | 8篇 |
1982年 | 9篇 |
1981年 | 14篇 |
1980年 | 14篇 |
1979年 | 14篇 |
1978年 | 11篇 |
1977年 | 9篇 |
1976年 | 11篇 |
1975年 | 13篇 |
1974年 | 11篇 |
1973年 | 8篇 |
1972年 | 12篇 |
1971年 | 12篇 |
1970年 | 7篇 |
1969年 | 8篇 |
1968年 | 10篇 |
1967年 | 9篇 |
1966年 | 8篇 |
排序方式: 共有686条查询结果,搜索用时 15 毫秒
221.
Thomas C. Bruneau 《Defense & Security Analysis》2018,34(4):345-364
ABSTRACTThe article argues that current conceptual approaches in civil-military relations are deeply flawed resulting in its irrelevance in analyzing major issues including war and the collapse of democracy. After highlighting major flaws in the work of the late Samuel Huntington and those who follow his approach, the article argues that other conceptual approaches, including Security Sector Reform, are also flawed, or in the case of the “military effectiveness” literature, largely irrelevant. In explaining the main causes of the flawed conceptual literature, the article highlights the absence of good data and challenges in methodology. While arguing that military forces are very unlikely to engage in armed combat, it highlights the roles and missions which in the world today are implanted by these forces. As it is virtually impossible to prove effectiveness of the armed forces in these roles and missions, the article proposes a conceptual approach based on requirements. 相似文献
222.
Stephen D. Wrage 《Defense & Security Analysis》2003,19(2):101-109
223.
224.
Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003. 相似文献
225.
The machine scheduling literature does not consider the issue of tool change. The parallel literature on tool management addresses this issue but assumes that the change is due only to part mix. In practice, however, a tool change is caused most frequently by tool wear. That is why we consider here the problem of scheduling a set of jobs on a single CNC machine where the cutting tool is subject to wear; our objective is to minimize the total completion time. We first describe the problem and discuss its peculiarities. After briefly reviewing available theoretical results, we then go on to provide a mixed 0–1 linear programming model for the exact solution of the problem; this is useful in solving problem instances with up to 20 jobs and has been used in our computational study. As our main contribution, we next propose a number of heuristic algorithms based on simple dispatch rules and generic search. We then discuss the results of a computational study where the performance of the various heuristics is tested; we note that the well‐known SPT rule remains good when the tool change time is small but deteriorates as this time increases and further that the proposed algorithms promise significant improvement over the SPT rule. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
226.
T.C. Edwin Cheng Qing Ding Mikhail Y. Kovalyov Aleksander Bachman Adam Janiak 《海军后勤学研究》2003,50(6):531-554
We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003 相似文献
227.
Hanif D. Sherali 《海军后勤学研究》1987,34(3):399-416
This paper is concerned with a modification of a recently proposed variant of Karmarkar's algorithm for solving linear programming problems. In analyzing this variant, we exhibit interesting and useful relationships of these types of algorithms with barrier function methods, and subgradient optimization procedures involving space dilation techniques, which subsume the well-known ellipsoidal type of algorithms. Convergence of this variant is established under certain regularity conditions. We also provide remarks on how to obtain dual variables or Lagrange multipliers at optimality. 相似文献
228.
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. 相似文献
229.
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. 相似文献
230.