全文获取类型
收费全文 | 826篇 |
免费 | 22篇 |
出版年
2019年 | 17篇 |
2018年 | 8篇 |
2017年 | 23篇 |
2016年 | 16篇 |
2015年 | 20篇 |
2014年 | 16篇 |
2013年 | 166篇 |
2011年 | 9篇 |
2010年 | 8篇 |
2009年 | 16篇 |
2008年 | 8篇 |
2007年 | 8篇 |
2006年 | 11篇 |
2005年 | 15篇 |
2004年 | 17篇 |
2003年 | 9篇 |
2002年 | 12篇 |
2000年 | 10篇 |
1999年 | 10篇 |
1998年 | 14篇 |
1997年 | 8篇 |
1996年 | 14篇 |
1994年 | 21篇 |
1993年 | 17篇 |
1992年 | 12篇 |
1991年 | 25篇 |
1990年 | 9篇 |
1989年 | 19篇 |
1988年 | 17篇 |
1987年 | 21篇 |
1986年 | 23篇 |
1985年 | 24篇 |
1984年 | 11篇 |
1983年 | 9篇 |
1982年 | 8篇 |
1981年 | 9篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 14篇 |
1977年 | 7篇 |
1976年 | 11篇 |
1975年 | 7篇 |
1974年 | 12篇 |
1973年 | 9篇 |
1972年 | 16篇 |
1971年 | 9篇 |
1970年 | 16篇 |
1969年 | 10篇 |
1968年 | 7篇 |
1967年 | 11篇 |
排序方式: 共有848条查询结果,搜索用时 15 毫秒
711.
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. 相似文献
712.
Mediators increase the effectiveness of negotiation processes. The art of mediation includes interpersonal skills, ability to convince, and proficiency in argumentation. The science of mediation represents an analytical approach to problem solving, a systematic analysis of the process, of players' positions, and of their goals, aspirations, and concessions. Analytical tools for mediation can be used by mediators, but these tools can also support negotiators in their analysis, verification of their positions, and choices. The knowledge of effective and safe alternatives, of sets of compromises, and the knowledge of the possible outcomes of concessions may be used to develop an effective strategy and to increase a negotiator's bargaining power. Models to analyze alternatives, to verify concessions made by the opponents, to determine effective alternatives, and to search for solutions that yield mutual gains, to aggregate opponents' proposals, to look for coalition members, and to simulate some of the actions of a mediator are discussed in the article. 相似文献
713.
A carrier battle group is operating in an area where it is subject to attack by enemy aircraft. It is anticipated that air raids will occur in large waves. The uncertain time between raids is available for the replenishment of supplies. We consider the problem of how best to schedule ammunition replenishment during this period. The theory of Gittins indices provides the technical background to the development of a range of models which yield a hierarchy of index-based heuristics for replenishment. One such heuristic is assessed computationally in a more realistic scenario than is explicitly allowed for by the models. 相似文献
714.
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. 相似文献
715.
716.
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. 相似文献
717.
718.
719.
Resource-constrained project scheduling with cash flows occurs in many settings, ranging from research and development to commercial and residential construction. Although efforts have been made to develop efficient optimal procedures to maximize the net present value of cash flows for resource-constrained projects, the inherent intractability of the problem has led to the development of a variety of heuristic methods to aid in the development of near-optimal schedules for large projects. This research focuses on the use of insights gained from the solution of a relaxed optimization model in developing heuristic procedures to schedule projects with multiple constrained resources. It is shown that a heuristic procedure with embedded priority rules that uses information from the revised solution of a relaxed optimization model increases project net present value. The heuristic procedure and nine different embedded priority rules are tested in a variety of project environments that account for different network structures, levels of resource constrainedness, and cash-flow parameters. Extensive testing with problems ranging in size from 21 to 1000 activities shows that the new heuristic procedures dominate heuristics using information from the critical path method (CPM), and in most cases outperform heuristics from previous research. The best performing heuristic rules classify activities into priority and secondary queues according to whether they lead to immediate progress payments, thus front loading the project schedule. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 365–381, 1997 相似文献
720.
Previous studies criticize the general use of the normal approximation of lead-time demand on the grounds that it can lead to serious errors in safety stock. We reexamine this issue for the distribution of fast-moving finished goods. We first determine the optimal reorder points and quantities by using the classical normal-approximation method and a theoretically correct procedure. We then evaluate the misspecification error of the normal approximation solution with respect to safety stock, logistics-system costs, total costs (logistics costs, including acquisition costs), and fill rates. The results provide evidence that the normal approximation is robust with respect to both cost and service for seven major industry groups. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 165–186, 1997 相似文献