全文获取类型
收费全文 | 235篇 |
免费 | 3篇 |
出版年
2020年 | 5篇 |
2019年 | 5篇 |
2018年 | 4篇 |
2017年 | 9篇 |
2016年 | 6篇 |
2015年 | 3篇 |
2014年 | 4篇 |
2013年 | 67篇 |
2011年 | 3篇 |
2010年 | 3篇 |
2009年 | 3篇 |
2008年 | 2篇 |
2007年 | 2篇 |
2006年 | 2篇 |
2005年 | 4篇 |
2004年 | 2篇 |
2003年 | 2篇 |
2002年 | 2篇 |
2001年 | 3篇 |
2000年 | 2篇 |
1999年 | 2篇 |
1998年 | 3篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1995年 | 6篇 |
1994年 | 4篇 |
1993年 | 3篇 |
1992年 | 7篇 |
1991年 | 9篇 |
1989年 | 4篇 |
1988年 | 2篇 |
1987年 | 6篇 |
1986年 | 4篇 |
1985年 | 6篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1980年 | 4篇 |
1979年 | 1篇 |
1978年 | 4篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1975年 | 3篇 |
1974年 | 6篇 |
1973年 | 4篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1970年 | 4篇 |
1969年 | 1篇 |
1968年 | 2篇 |
1967年 | 2篇 |
排序方式: 共有238条查询结果,搜索用时 15 毫秒
181.
Until recently, fast algorithms for the maximum flow problem have typically proceeded by constructing layered networks and establishing blocking flows in these networks. However, in recent years, new distance-directed algorithms have been suggested that do not construct layered networks but instead maintain a distance label with each node. The distance label of a node is a lower bound on the length of the shortest augmenting path from the node to the sink. In this article we develop two distance-directed augmenting path algorithms for the maximum flow problem. Both the algorithms run in O(n2m) time on networks with n nodes and m arcs. We also point out the relationship between the distance labels and layered networks. Using a scaling technique, we improve the complexity of our distance-directed algorithms to O(nm log U), where U denotes the largest arc capacity. We also consider applications of these algorithms to unit capacity maximum flow problems and a class of parametric maximum flow problems. 相似文献
182.
A system of iid Bernoulli components is the starting point in the statistical theory of reliability. This simplification allows for the development of a rich, though elementary, theory for the structure of the system. Two representations play a prominent role in the study of structural reliability. One is the minimal path set representation and the other is the signature representation. By combining the two representations with the Gibbs measure for the state of components, one obtains terms that can be interpreted as the complexity of the system structure. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
183.
184.
185.
186.
187.
188.
This contribution reflects on the state of strategic studies today and the criticism it has received in recent years, as being outdated and irrelevant. The authors formulate some premises for reinvigorating this field of inquiry by widening its scope and research agenda to do more justice to the wide variety of actors, perspectives and practices observable in the enterprise of strategy in our contemporary globalised world. 相似文献
189.
190.
James Char 《战略研究杂志》2016,39(5-6):608-636
ABSTRACTSince emerging as China’s top leader following the 18th Party Congress, Xi Jinping has moved swiftly to consolidate his formal authority as Central Military Commission chairman over the Chinese People’s Liberation Army. In redressing the civil-military imbalance wrought by Dengist economic reforms, the commander-in-chief has combined institutional mechanisms with the use of fear to impose authoritative civilian control over the military. This paper proposes that a combination of changes to the Chinese strategic environment has contributed to Xi’s utility of the anti-corruption campaign to purge the regime’s coercive forces of its previous underpinnings, and advances that the war on military malfeasance has given rise to a new set of dynamics in civil-military relations in post-Reform China. 相似文献