全文获取类型
收费全文 | 288篇 |
免费 | 64篇 |
国内免费 | 67篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 5篇 |
2021年 | 5篇 |
2020年 | 8篇 |
2019年 | 5篇 |
2018年 | 6篇 |
2017年 | 15篇 |
2016年 | 25篇 |
2015年 | 12篇 |
2014年 | 20篇 |
2013年 | 16篇 |
2012年 | 22篇 |
2011年 | 21篇 |
2010年 | 18篇 |
2009年 | 36篇 |
2008年 | 18篇 |
2007年 | 23篇 |
2006年 | 29篇 |
2005年 | 30篇 |
2004年 | 25篇 |
2003年 | 7篇 |
2002年 | 5篇 |
2001年 | 10篇 |
2000年 | 9篇 |
1999年 | 7篇 |
1998年 | 6篇 |
1997年 | 6篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 2篇 |
1992年 | 7篇 |
1991年 | 3篇 |
1990年 | 3篇 |
排序方式: 共有419条查询结果,搜索用时 187 毫秒
21.
张存位 《中国人民武装警察部队学院学报》2009,25(2):23-25
阐述了生物突发事件的重大危害性和建立生物突发事件辅助决策系统的主要目的和意义。从生物突发事件应急救援工作的实际需求出发,对辅助决策系统软件的设计进行了研究,应用Access数据库和VB6.0,编制出消防部队处置生物突发事件辅助决策系统,并对该软件的相关功能进行了必要的说明。 相似文献
22.
MADM中不同属性的规范化研究 总被引:3,自引:0,他引:3
不同属性值的规范化是多属性决策问题中的重要过程.提出了一种属性值作为点到优区间和劣区间的距离的定义,依据该定义得到了属性值规范化新方法,并通过实例证明了新规范化方法的有效性. 相似文献
23.
24.
25.
26.
戚远羲 《武警工程学院学报》2010,(6):41-43
武警财务辅助决策系统是武警部队财务信息化建设的重要内容,在优化财务决策中发挥着不可估量的作用。OLAP技术具有为数据使用对象提供多维度视角和分析的特征,为财务辅助决策系统提供了重要的技术保障。通过对武警财务辅助决策系统的功能分析,提出运用OLAP技术构建武警部队财务决策系统的初步构想。 相似文献
27.
前景理论(Prospect Theory,PT)描述了个体在不确定条件下的决策规律,较好地刻画了决策者的风险偏好。分析表明,PT在作战决策建模中具有一定的适用性和可行性。提出了一种基于PT的计算机生成兵力(Computer Generated Forces,CGF)Agent决策建模方法,给出了CGF Agent的建模框架,对CGF Agent决策过程中方案选择的具体步骤和算法进行了详细阐述。实验表明,所提出的方法在一定程度上提高了CGF Agent决策行为的真实性,证明了所提出方法的有效性。 相似文献
28.
Todas information and communication network requires a design that is secure to tampering. Traditional performance measures of reliability and throughput must be supplemented with measures of security. Recognition of an adversary who can inflict damage leads toward a game‐theoretic model. Through such a formulation, guidelines for network designs and improvements are derived. We opt for a design that is most robust to withstand both natural degradation and adversarial attacks. Extensive computational experience with such a model suggests that a Nash‐equilibrium design exists that can withstand the worst possible damage. Most important, the equilibrium is value‐free in that it is stable irrespective of the unit costs associated with reliability vs. capacity improvement and how one wishes to trade between throughput and reliability. This finding helps to pinpoint the most critical components in network design. From a policy standpoint, the model also allows the monetary value of information‐security to be imputed. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
29.
Finding all nondominated vectors for multi‐objective combinatorial optimization (MOCO) problems is computationally very hard in general. We approximate the nondominated frontiers of MOCO problems by fitting smooth hypersurfaces. For a given problem, we fit the hypersurface using a single nondominated reference vector. We experiment with different types of MOCO problems and demonstrate that in all cases the fitted hypersurfaces approximate all nondominated vectors well. We discuss that such an approximation is useful to find the neighborhood of preferred regions of the nondominated vectors with very little computational effort. Further computational effort can then be spent in the identified region to find the actual nondominated vectors the decision maker will prefer. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
30.
We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献