全文获取类型
收费全文 | 375篇 |
免费 | 80篇 |
国内免费 | 80篇 |
出版年
2024年 | 1篇 |
2023年 | 4篇 |
2022年 | 5篇 |
2021年 | 8篇 |
2020年 | 10篇 |
2019年 | 8篇 |
2018年 | 7篇 |
2017年 | 24篇 |
2016年 | 29篇 |
2015年 | 9篇 |
2014年 | 24篇 |
2013年 | 28篇 |
2012年 | 26篇 |
2011年 | 32篇 |
2010年 | 21篇 |
2009年 | 44篇 |
2008年 | 28篇 |
2007年 | 28篇 |
2006年 | 40篇 |
2005年 | 37篇 |
2004年 | 29篇 |
2003年 | 8篇 |
2002年 | 10篇 |
2001年 | 11篇 |
2000年 | 11篇 |
1999年 | 8篇 |
1998年 | 5篇 |
1997年 | 8篇 |
1996年 | 4篇 |
1995年 | 6篇 |
1994年 | 3篇 |
1993年 | 2篇 |
1992年 | 7篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 2篇 |
排序方式: 共有535条查询结果,搜索用时 15 毫秒
391.
392.
基于多属性目标决策的威胁评估排序模型 总被引:2,自引:0,他引:2
针对当前海战中对舰艇编队构成威胁的空中目标的特点,运用目标多属性理论探索对空中目标的威胁排序问题.提出了一种对空中目标进行威胁评估和排序的方法,并通过示例介绍了威胁评估和排序的求解过程.该方法有效地解决了目标威胁评估与排序问题,提高了舰艇编队防空作战能力. 相似文献
393.
We investigate operations impacts of consumer‐initiated group buying (CGB), whereby consumers voluntarily form buying groups to negotiate bulk deals with retailers. This differs from regular purchasing whereby consumers visit retailers individually and pay posted prices. Upon the visit by group consumers, a retailer decides to forgo or satisfy their demand in its entirety. Turned down by a retailer, group consumers continue to visit other retailers. In the case where their group effort fails to conclude a deal, some group consumers switch to individual purchasing provided they receive a non‐negative utility by doing so. Even after a successful group event, the group consumers who forgo the event out of utility concern may switch to individual purchasing as well. Retailer competition, group size, and the chance that group consumers switch to individual purchasing upon unsatisfaction are crucial to how retailers adjust operations to deal with CGB. With retailer competition, the rise of CGB results in every consumer paying the same reduced price when group size is small but makes group consumers pay more than by purchasing individually when group size is large. This has mixed consequences on the profits for retailers in both absolute and relative terms. 相似文献
394.
We consider the problem of optimally maintaining a stochastically degrading, single‐unit system using heterogeneous spares of varying quality. The system's failures are unannounced; therefore, it is inspected periodically to determine its status (functioning or failed). The system continues in operation until it is either preventively or correctively maintained. The available maintenance options include perfect repair, which restores the system to an as‐good‐as‐new condition, and replacement with a randomly selected unit from the supply of heterogeneous spares. The objective is to minimize the total expected discounted maintenance costs over an infinite time horizon. We formulate the problem using a mixed observability Markov decision process (MOMDP) model in which the system's age is observable but its quality must be inferred. We show, under suitable conditions, the monotonicity of the optimal value function in the belief about the system quality and establish conditions under which finite preventive maintenance thresholds exist. A detailed computational study reveals that the optimal policy encourages exploration when the system's quality is uncertain; the policy is more exploitive when the quality is highly certain. The study also demonstrates that substantial cost savings are achieved by utilizing our MOMDP‐based method as compared to more naïve methods of accounting for heterogeneous spares. 相似文献
395.
This article provides conditions under which total‐cost and average‐cost Markov decision processes (MDPs) can be reduced to discounted ones. Results are given for transient total‐cost MDPs with transition rates whose values may be greater than one, as well as for average‐cost MDPs with transition probabilities satisfying the condition that there is a state such that the expected time to reach it is uniformly bounded for all initial states and stationary policies. In particular, these reductions imply sufficient conditions for the validity of optimality equations and the existence of stationary optimal policies for MDPs with undiscounted total cost and average‐cost criteria. When the state and action sets are finite, these reductions lead to linear programming formulations and complexity estimates for MDPs under the aforementioned criteria.© 2017 Wiley Periodicals, Inc. Naval Research Logistics 66:38–56, 2019 相似文献
396.
397.
复杂系统性质决定了复杂系统管理的特殊性,而兵棋推演可以为复杂系统管理提供更加符合其特性的决策辅助支持。讨论了复杂系统的性质及其影响,研究了兵棋推演用于复杂系统管理的原因和方法,并结合战争兵棋推演,介绍了兵棋工程建设中系统研发、推演组织和工程管理方面的创新与实践问题。最后,给出了未来发展的趋势。 相似文献
398.
399.
装备器材保障资源调度问题是一个非常复杂的问题,根据其优化目标要求,从保障时间最短、保障耗费最低、安全性最高3个方面建立了该问题的多目标优化模型,并通过目标优先度决策将其转化为单目标模型;接着,采用两阶段法进行求解,将其分为最优路径决策、器材分配决策两个阶段进行决策优化,在明确资源点到需求点之间的最优路径后再进行器材资源的分配;并分别采用基于小生境的自适应遗传算法和基于生成树的遗传算法进行求解。通过实例分析,求解结果能够满足装备器材保障的要求,表明所构建的决策模型和算法是有效的。 相似文献
400.
在群决策专家聚类赋权过程中,可能出现专家给出的判断矩阵一致性比率与排序向量信息熵都相等但专家意见不同,却被赋予了相同权重的情况。针对上述问题,提出一种基于偏差熵的专家聚类赋权方法。该方法采用聚类分析的思想,基于比例构建相似系数,实现对专家群的分类;引入专家判断矩阵的一致性权重,并综合类容量构建权重指标来反映类别间的差异,确定专家类间权重;最后,在各专家类中建立偏差熵模型,依据类中专家达成一致性意见的贡献程度确定专家的类内权重,并得到专家的总体权重。具体算例表明,该方法可行有效。 相似文献