全文获取类型
收费全文 | 273篇 |
免费 | 81篇 |
国内免费 | 18篇 |
出版年
2024年 | 4篇 |
2023年 | 3篇 |
2022年 | 10篇 |
2021年 | 7篇 |
2020年 | 13篇 |
2019年 | 9篇 |
2018年 | 12篇 |
2017年 | 16篇 |
2016年 | 22篇 |
2015年 | 20篇 |
2014年 | 22篇 |
2013年 | 30篇 |
2012年 | 22篇 |
2011年 | 21篇 |
2010年 | 15篇 |
2009年 | 23篇 |
2008年 | 18篇 |
2007年 | 18篇 |
2006年 | 17篇 |
2005年 | 15篇 |
2004年 | 15篇 |
2003年 | 4篇 |
2002年 | 5篇 |
2001年 | 5篇 |
2000年 | 2篇 |
1999年 | 5篇 |
1998年 | 5篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1992年 | 3篇 |
1990年 | 4篇 |
1989年 | 2篇 |
排序方式: 共有372条查询结果,搜索用时 328 毫秒
41.
42.
利用矩阵求极大相容类的一种方法 总被引:1,自引:0,他引:1
寻找相容关系的极大相容类和简单图的极大完全子图,在解决二元关系与数据挖掘和管理决策中的具体问题时有重要作用。利用相容关系的极大相容类与简单图的极大完全子图之间的对应关系,对极大完全子图的路径长度进行分析,得到了关于极大完全子图路径长度的一个定理。并根据该定理构造了一个用矩阵的路径长度搜索简单图的极大完全子图的方法,进而利用该方法找出了对应相容关系的极大相容类。 相似文献
43.
44.
紧急条件下武警部队快速机动最优路径,是一个多目标多约束随机动态交通网络寻优问题。在分析交通网络拓扑化特点及最短路模型前提下,着重研究道路通行能力带给复杂公路网络道路寻优问题的影响,并结合GIS系统利用改进的Dijkstra算法求解。 相似文献
45.
Nowadays, Chemical-Biological-Radiological-Nuclear-explosive (CBRNe) risks are one of the world's main safety concerns. The radiological disasters of Fukushima and Chernobyl, the chemical events of Seveso or the release of Sarin in the Tokyo Subway, the biological emergencies such as the H1N1 flu or the recent Ebola outbreak, and recent news about the availability of non-conventional weapons acquired by fundamentalist organisations represent evidence of potential future threats. CBRNe risks are a real and global threat. The University of Rome, Tor Vergata, in collaboration with the most important Italian and international bodies working in the field of CBRNe safety and security, and supported by the North Atlantic Treaty Organisation and the Organisation for the Prohibition of Chemical Weapons, organises International Masters Courses on the Protection against CBRNe events. Within this framework, a Table-Top Exercise was planned, in collaboration with the Italian Ministry of Interior and Ministry of Defence. The scenario, the logistic organisation, on-going adjustments during the exercise and the outcomes are presented here and analysed. 相似文献
46.
We present the green telecommunication network planning problem with switchable base stations, where the location and configuration of the base stations are optimized, while taking into account uncertainty and variability of demand. The problem is formulated as a two‐stage stochastic program under demand uncertainty with integers in both stages. Since solving the presented problem is computationally challenging, we develop the corresponding Dantzig‐Wolfe reformulation and propose a solution approach based on column generation. Comprehensive computational results are provided for instances of varying characteristics. The results show that the joint location and dynamic switching of base stations leads to significant savings in terms of energy cost. Up to 30% reduction in power consumption cost is achieved while still serving all users. In certain cases, allowing dynamic configurations leads to more installed base stations and higher user coverage, while having lower total energy consumption. The Dantzig‐Wolfe reformulation provides solutions with a tight LP‐gap eliminating the need for a full branch‐and‐price scheme. Furthermore, the proposed column generation solution approach is computationally efficient and outperforms CPLEX on the majority of the tested instances. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 351–366, 2016 相似文献
47.
We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
48.
谢政 《国防科技大学学报》1989,11(2):33-39
本文讨论了分段线性凸费用网络流问题,推广了线性费用网络流中的负回路方法和最小费用路方法,从而得到了求分段线性凸费用网络的最小费用流的两个算法。 相似文献
49.
吴颖瑜 《国防科技大学学报》1990,12(3):102-105
本文把马尔可夫过程和目标规划结合起来,提出人才结构系统分析的单项控制和多项控制,并在单项控制模型的基础上发展成了多项控制模型,加强了模型的可信度和通用性。 相似文献
50.
常规的向量场方法在处理无人机曲线路径跟踪问题时很容易受非定常风扰的影响而使得跟踪误差增加,因此很多方法采用用无人机的惯性坐标系(地速和方位角)替代机体坐标系(空速和偏航角)的方式来提高抗风性能。但是,这种方式只能处理大小和方向均恒定的风扰,这在实际飞行中是过于理想的假设。为了克服这些不足,提出了一种采用侧偏距的积分来主动抵消非定常风扰的积分向量场方法用于固定翼无人机曲线路径跟踪控制。根据期望路径的曲率及路径角,结合无人机自身的状态信息设计了曲线路径跟踪策略,并且使用李雅普诺夫理论证明了提出的方法能够确保闭环系统的全局渐进稳定。最后,使用高性能半实物仿真系统验证了提出方法的抗风跟踪性能。 相似文献