全文获取类型
收费全文 | 431篇 |
免费 | 126篇 |
国内免费 | 38篇 |
专业分类
595篇 |
出版年
2024年 | 5篇 |
2023年 | 6篇 |
2022年 | 15篇 |
2021年 | 10篇 |
2020年 | 13篇 |
2019年 | 4篇 |
2018年 | 6篇 |
2017年 | 14篇 |
2016年 | 31篇 |
2015年 | 17篇 |
2014年 | 30篇 |
2013年 | 30篇 |
2012年 | 38篇 |
2011年 | 38篇 |
2010年 | 27篇 |
2009年 | 31篇 |
2008年 | 29篇 |
2007年 | 27篇 |
2006年 | 38篇 |
2005年 | 29篇 |
2004年 | 22篇 |
2003年 | 16篇 |
2002年 | 19篇 |
2001年 | 9篇 |
2000年 | 14篇 |
1999年 | 10篇 |
1998年 | 17篇 |
1997年 | 13篇 |
1996年 | 11篇 |
1995年 | 13篇 |
1994年 | 4篇 |
1993年 | 1篇 |
1992年 | 4篇 |
1991年 | 2篇 |
1990年 | 2篇 |
排序方式: 共有595条查询结果,搜索用时 0 毫秒
71.
In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
72.
In this paper we propose some non‐greedy heuristics and develop an Augmented‐Neural‐Network (AugNN) formulation for solving the classical open‐shop scheduling problem (OSSP). AugNN is a neural network based meta‐heuristic approach that allows integration of domain‐specific knowledge. The OSSP is framed as a neural network with multiple layers of jobs and machines. Input, output and activation functions are designed to enforce the problem constraints and embed known heuristics to generate a good feasible solution fast. Suitable learning strategies are applied to obtain better neighborhood solutions iteratively. The new heuristics and the AugNN formulation are tested on several benchmark problem instances in the literature and on some new problem instances generated in this study. The results are very competitive with other meta‐heuristic approaches, both in terms of solution quality and computational times. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
73.
74.
75.
从网络科学的观点出发对作战指挥机构进行研究,建立了指挥关系网络和通信网络,以及在两者基础上的指挥信息网络拓扑模型,分析了指挥信息网络的度分布特性,提出了描述指挥信息网络的特征参量,进行了针对指挥信息网络的体系破击仿真实验,得出了与战争实际相符的结论,为利用复杂网络知识研究信息化条件下的体系对抗进行了积极地尝试和探索。 相似文献
76.
77.
78.
79.
80.
针对水面舰艇对海作战网络的特点,基于复杂网络"反社区"性质,将对海作战网络描述成"反社区"有向赋权图。结合传统可靠性分析方法,提出了一种新的可靠性评价指标,进一步扩展了传统可靠性指标的4个特性,并通过实例仿真,证明了该指标的有效性。该方法将传统可靠性理论与复杂网络理论有效地结合起来,将进一步扩大复杂网络的适用范围。 相似文献