全文获取类型
收费全文 | 392篇 |
免费 | 15篇 |
出版年
2021年 | 4篇 |
2020年 | 4篇 |
2019年 | 6篇 |
2018年 | 3篇 |
2017年 | 8篇 |
2016年 | 7篇 |
2015年 | 8篇 |
2014年 | 6篇 |
2013年 | 67篇 |
2011年 | 4篇 |
2009年 | 5篇 |
2007年 | 8篇 |
2005年 | 4篇 |
2004年 | 7篇 |
2003年 | 4篇 |
2002年 | 6篇 |
2001年 | 7篇 |
2000年 | 4篇 |
1999年 | 7篇 |
1998年 | 8篇 |
1997年 | 9篇 |
1996年 | 6篇 |
1995年 | 11篇 |
1994年 | 12篇 |
1993年 | 10篇 |
1992年 | 11篇 |
1991年 | 11篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 8篇 |
1987年 | 8篇 |
1985年 | 8篇 |
1984年 | 9篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1981年 | 10篇 |
1980年 | 6篇 |
1979年 | 11篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1976年 | 6篇 |
1975年 | 8篇 |
1974年 | 7篇 |
1973年 | 6篇 |
1972年 | 8篇 |
1971年 | 6篇 |
1970年 | 3篇 |
1969年 | 3篇 |
1968年 | 5篇 |
1967年 | 4篇 |
排序方式: 共有407条查询结果,搜索用时 15 毫秒
121.
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. 相似文献
122.
We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance. 相似文献
123.
The purpose of this research is to investigate simulation algorithms for nonhomogeneous Poisson processes with proportional intensities. Two algorithmic approaches are studied: inversion and thinning. Motivated by industrial practices, the covariate vector involved in the simulation is permitted to change after every event (or observation). The algorithms are extended to permit the simulation of general nonhomogeneous Poisson processes with possible discontinuities both in baseline intensity and covariate vector. This latter extension can be used to facilitate a wide range of failure situations that can arise with repairable systems. © 1994 John Wiley & Sons, Inc. 相似文献
124.
Michael C. Fu 《海军后勤学研究》2008,55(8):723-736
Derivatives (or gradients) are important for both sensitivity analysis and optimization, and in simulation models, these can often be estimated efficiently using various methods other than brute‐force finite differences. This article briefly summarizes the main approaches and discusses areas in which the approaches can most fruitfully be applied: queueing, inventory, and finance. In finance, the focus is on derivatives of another sort. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
125.
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. 相似文献
126.
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 相似文献
127.
128.
We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017 相似文献
129.
The Replenishment at Sea Planner (RASP) is saving the U.S. Navy millions of dollars a year by reducing fuel consumption of its Combat Logistics Force (CLF). CLF shuttle supply ships deploy from ports to rendezvous with underway U.S. combatants and those of coalition partners. The overwhelming commodity transferred is fuel, ship‐to‐ship by hoses, while other important packaged goods and spare parts are high‐lined, or helicoptered between ships. The U.S. Navy is organized in large areas of responsibility called numbered fleets, and within each of these a scheduler must promulgate a daily forecast of CLF shuttle operations. The operational planning horizon extends out several weeks, or as far into the future as we can forecast demand. We solve RASP with integer linear optimization and a purpose‐built heuristic. RASP plans Replenishment‐at‐Sea (RAS) events with 4‐hour (Navy watch) time fidelity. For five years, RASP has served two purposes: (1) it helps schedulers generate a daily schedule and animates it using Google Earth, and (2) it automates reports command‐to‐ship messages that are essential to keep this complex logistics system operating. 相似文献
130.