全文获取类型
收费全文 | 887篇 |
免费 | 19篇 |
出版年
2021年 | 11篇 |
2019年 | 18篇 |
2018年 | 8篇 |
2017年 | 19篇 |
2016年 | 17篇 |
2015年 | 16篇 |
2014年 | 19篇 |
2013年 | 165篇 |
2012年 | 8篇 |
2010年 | 9篇 |
2009年 | 14篇 |
2007年 | 16篇 |
2006年 | 9篇 |
2005年 | 10篇 |
2004年 | 13篇 |
2003年 | 11篇 |
2002年 | 14篇 |
2000年 | 8篇 |
1999年 | 9篇 |
1998年 | 17篇 |
1997年 | 15篇 |
1996年 | 13篇 |
1995年 | 7篇 |
1994年 | 21篇 |
1993年 | 23篇 |
1992年 | 16篇 |
1991年 | 21篇 |
1990年 | 15篇 |
1989年 | 28篇 |
1988年 | 25篇 |
1987年 | 23篇 |
1986年 | 26篇 |
1985年 | 19篇 |
1984年 | 11篇 |
1983年 | 10篇 |
1982年 | 15篇 |
1981年 | 14篇 |
1980年 | 11篇 |
1979年 | 16篇 |
1978年 | 18篇 |
1977年 | 7篇 |
1976年 | 11篇 |
1975年 | 9篇 |
1974年 | 15篇 |
1973年 | 10篇 |
1972年 | 12篇 |
1971年 | 11篇 |
1970年 | 14篇 |
1969年 | 10篇 |
1967年 | 10篇 |
排序方式: 共有906条查询结果,搜索用时 109 毫秒
741.
This article describes an algorithm for solving the static electric utility capacity expansion problem. The advantages of this algorithm are twofold. First, it is simpler and yet more efficient than previous algorithms for the same problem. Second, by making simplifying but realistic assumptions on plant sizes it is possible to use this algorithm for the case where one does not allow fractional plant additions. While the model has n variables, it has a clear two-dimensional geometric representation for understanding its properties, developing an algorithm, and interpreting the optimal solution. This algorithm has been implemented in the Intermediate Future Forecasting (IFFS) capacity expansion model at the Department of Energy. 相似文献
742.
Andrew J. Gawthorpe 《战略研究杂志》2018,41(1-2):301-325
Harvard professor Samuel P. Huntington has frequently been considered a Vietnam War hawk. His observation that ‘forced-draft urbanization’ might help the United States win the war has come to define his engagement in contemporary strategic debates. This essay argues that both Huntington’s academic work and his private policy advice to the U.S. Government in fact urged a political settlement to the conflict. It argues that in spite of this, Huntington refused to break publicly with the U.S. policy because of his wider concern over what he saw as a crisis of authority in the U.S. foreign policy and governing institutions in the era. 相似文献
743.
Kirstin J. H. Brathwaite 《Defence Studies》2018,18(1):1-18
How do we understand combat effectiveness – soldiers’ performance in battle? Despite the broad consensus that understanding combat effectiveness is important both for scholars and policymakers, there is widespread disagreement about what combat effectiveness is. More specifically, studies of effectiveness tend to focus on either the skill of soldiers in battle, or their will to fight. Yet both skill and will are essential components of an effective fighting force. This article argues that understanding combat effectiveness requires understanding both of these key components of effectiveness. In other words, combat effectiveness requires both the skill and will to engage the enemy in an organized manner. It then demonstrates the usefulness of this conceptualization by applying it to the cases of British, Indian, and Australian forces fighting the Japanese during the Second World War. Only when scholars are talking about the same concept will our understanding of the conditions under which militaries are effective in battle progress. By comparing different units fighting the same opponent under the same material conditions, I demonstrate that units vary both in their combat skill and their will to fight, and that understanding their effectiveness in battle requires analyzing both of these key factors. 相似文献
744.
Queueing systems with multiple servers are commonly used to model telecommunications systems. But, in general, the service rate of each of the servers is not the same. This fact is indeed true in a communication network where one path (server) may be a terrestrial link and the other (server) a satellite link with its inherent propagation delay. In this article we consider a two-server system where arriving customers are first placed in the queue for the faster server until that queue size reaches a certain threshold, whereupon they are diverted to the slower server. Additional arriving customers are assigned to the slower server until the faster server's queue drops to another lower threshold, at which point arrivals are reassigned to the faster server. We develop an exact mathematical model of the steady-state behavior of each queueing system and a simple analytic approximation. 相似文献
745.
We examine the static sequencing problem of ordering the processing of jobs on a single machine so as to minimize the average weighted flow time. It is assumed that all jobs have zero ready times, and that the jobs are grouped into classes with the property that setup tasks are only required when processing switches from jobs of one class to jobs of another class. The time required for each setup task is given by the sum of a setdown time from the previous class and a setup time for the new class. We show that an algorithm presented in the literature for solving a special case of this problem gives suboptimal solutions. A number of properties of the optimal solution are derived, and their use in algorithms is evaluated. Computational results are presented for both a branch-and-bound procedure and a simpler depth-first search. 相似文献
746.
747.
748.
We present a family of tests to detect the presence of a transient mean in a simulation process. These tests compare variance estimators from different parts of a simulation run, and are based on the methods of batch means and standardized time series. Our tests can be viewed as natural generalizations of some previously published work. We also include a power analysis of the new tests, as well as some illustrative examples. © 1994 John Wiley & Sons, Inc. 相似文献
749.
This article presents the application of a simulated annealing heuristic to an NP-complete cyclic staff-scheduling problem. The new heuristic is compared to branch-and-bound integer programming algorithms, as well as construction and linear programming-based heuristics. It is designed for use in a continuously operating scheduling environment with the objective of minimizing the number of employees necessary to satisfy forecast demand. The results indicate that the simulated annealing-based method tends to dominate the branch-and-bound algorithms and the other heuristics in terms of solution quality. Moreover, the annealing algorithm exhibited rapid convergence to a low-cost solution. The simulated annealing heuristic is executed in a single program and does not require mathematical programming software. © 1993 John Wiley & Sons, Inc. 相似文献
750.
This article formulates an analytic model of just-in-time purchasing contracts and compares the minimum cost solution with the cost attainable through vertical integration. The models use standard inventory theory cost parameters and decision variables. The results quantify the increase in cost of buying an item rather than making it. Optimal incentives are characterized when JIT purchasing contracts are used. When JIT purchasing is implemented, buffer inventories are typically reduced. This inventory reduction makes on-time delivery critical to the buyer; yet timeliness is controlled by the supplier. As an incentive to provide on-time delivery, the buyer offers the supplier a bonus for on-time delivery. The supplier chooses a flow time allowance based upon the bonus offered. First- and second-order conditions are characterized in general, and examples are provided for exponentially and uniformly distributed flow times. The delivery timeliness obtainable in a vertically integrated firm is determined and compared with timeliness obtainable between separate firms. This comparison indicates that buyers who choose to purchase materials from a separate firm are more likely to experience late deliveries. The relationship between the value of the bonus and the proportion of on-time deliveries is also considered. The bonus required to achieve the same probability of on-time delivery as under vertical integration is also determined. © 1993 John Wiley & Sons, Inc. 相似文献