全文获取类型
收费全文 | 243篇 |
免费 | 6篇 |
出版年
2021年 | 2篇 |
2019年 | 6篇 |
2018年 | 5篇 |
2017年 | 4篇 |
2016年 | 9篇 |
2015年 | 4篇 |
2013年 | 60篇 |
2012年 | 2篇 |
2011年 | 2篇 |
2009年 | 3篇 |
2008年 | 2篇 |
2007年 | 8篇 |
2006年 | 3篇 |
2005年 | 6篇 |
2004年 | 2篇 |
2002年 | 8篇 |
1999年 | 5篇 |
1998年 | 3篇 |
1997年 | 2篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 4篇 |
1991年 | 6篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1987年 | 6篇 |
1986年 | 6篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1982年 | 3篇 |
1981年 | 2篇 |
1980年 | 4篇 |
1979年 | 2篇 |
1978年 | 7篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1974年 | 4篇 |
1973年 | 7篇 |
1972年 | 3篇 |
1971年 | 6篇 |
1970年 | 2篇 |
1969年 | 1篇 |
1968年 | 1篇 |
1967年 | 4篇 |
1966年 | 6篇 |
1949年 | 1篇 |
排序方式: 共有249条查询结果,搜索用时 890 毫秒
91.
The article considers a two-person zero-sum game in which a searcher with b bombs wishes to destroy a mobile hider. The players are restricted to move on a straight line with maximum speeds v and u satisfying v > u > 0; neither player can see the other but each knows the other's initial position. The bombs all have destructive radius R and there is a time lag T between the release of a bomb and the bomb exploding. The searcher gets 1 unit if the hider is destroyed and 0 if he survives. A solution is given for b = 1, and extended to b > 1 when the time lag is small. Various applications of the game are discussed. 相似文献
92.
93.
There is often a call in any organization to make the system ‘more efficient’. This document describes a novel framework for measuring organizational efficiency at the microeconomic level. We show how this framework can be used to monitor an organization using data typically available in extant performance management frameworks. This is most useful in large organizations with eclectic outputs where resources may be too constrained to perform industry-level analyses, such as data envelope analysis, to infer efficiency. This method helps illuminate how the factors of an organization’s internal practices can affect its efficient use of resources. 相似文献
94.
95.
Colin F. Jackson 《战略研究杂志》2016,39(5-6):820-846
ABSTRACTWhile many militaries have tried to capitalize on the potential of information operations in internal war, few have succeeded. I argue that military information campaigns fall short of expectations for two reasons. First, the theory of influence militaries generally embrace – communications as a non-lethal weapons system – is largely invalid. While treating information as a weapons system makes it easier to integrate it into the existing military planning system, this overstates the independent effects of communications on behavior and understates the importance of interactive effects of what commercial marketing theory refers to as the “marketing mix” – product, price, promotion, and placement. It would be more appropriate to treat military information operations as a form of marketing: a composite effort to induce a specific behavior in a target audience by applying a combination of material and ideational instruments. The marketing model suggests that the efficacy of information operations will depend not simply on the message and its delivery (promotion) but on the behavior the sender seeks to induce (the product), the costs of that behavior (the price), and the opportunities available for such behavior (the placement). 相似文献
96.
Branch‐and‐price‐and‐cut for the manpower routing problem with synchronization constraints 下载免费PDF全文
In this article, we propose a branch‐and‐price‐and‐cut (BPC) algorithm to exactly solve the manpower routing problem with synchronization constraints (MRPSC). Compared with the classical vehicle routing problems (VRPs), the defining characteristic of the MRPSC is that multiple workers are required to work together and start at the same time to carry out a job, that is, the routes of the scheduling subjects are dependent. The incorporation of the synchronization constraints increases the difficulty of the MRPSC significantly and makes the existing VRP exact algorithm inapplicable. Although there are many types of valid inequalities for the VRP or its variants, so far we can only adapt the infeasible path elimination inequality and the weak clique inequality to handle the synchronization constraints in our BPC algorithm. The experimental results at the root node of the branch‐and‐bound tree show that the employed inequalities can effectively improve the lower bound of the problem. Compared with ILOG CPLEX, our BPC algorithm managed to find optimal solutions for more test instances within 1 hour. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 138–171, 2016 相似文献
97.
We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
98.
We consider a system that depends on a single vital component. If this component fails, the system life will terminate. If the component is replaced before its failure then the system life may be extended; however, there are only a finite number of spare components. In addition, the lifetimes of these spare components are not necessarily identically distributed. We propose a model for scheduling component replacements so as to maximize the expected system survival. We find the counterintuitive result that when comparing components' general lifetime distributions based on stochastic orderings, not even the strongest ordering provides an a priori guarantee of the optimal sequencing of components. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
99.
100.
This work continues to develop the 'netwar' concept that the authors introduced in 1993 and have expanded upon in their various RAND and other writings ever since. Deeper understanding of the nature, strengths and vulnerabilities of networks will prove useful in combating terrorism and transnational crime, but also in understanding militant social activism, both of the violently disruptive sort and that which aims at fostering the rise of a global civil society. This essay also assesses recent US performance in the terror war, and concludes by raising concerns over the possible rise of a new form of network-based fascism. 相似文献