全文获取类型
收费全文 | 670篇 |
免费 | 14篇 |
国内免费 | 5篇 |
专业分类
689篇 |
出版年
2025年 | 5篇 |
2024年 | 2篇 |
2023年 | 8篇 |
2022年 | 8篇 |
2021年 | 9篇 |
2020年 | 12篇 |
2019年 | 12篇 |
2018年 | 8篇 |
2017年 | 24篇 |
2016年 | 22篇 |
2015年 | 15篇 |
2014年 | 38篇 |
2013年 | 34篇 |
2012年 | 43篇 |
2011年 | 45篇 |
2010年 | 31篇 |
2009年 | 55篇 |
2008年 | 42篇 |
2007年 | 39篇 |
2006年 | 39篇 |
2005年 | 31篇 |
2004年 | 34篇 |
2003年 | 29篇 |
2002年 | 23篇 |
2001年 | 12篇 |
2000年 | 11篇 |
1999年 | 11篇 |
1998年 | 6篇 |
1997年 | 7篇 |
1996年 | 8篇 |
1995年 | 7篇 |
1994年 | 2篇 |
1993年 | 4篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1990年 | 4篇 |
1989年 | 4篇 |
排序方式: 共有689条查询结果,搜索用时 0 毫秒
91.
92.
93.
94.
95.
We consider the integrated problem of optimally maintaining an imperfect, deteriorating sensor and the safety‐critical system it monitors. The sensor's costless observations of the binary state of the system become less informative over time. A costly full inspection may be conducted to perfectly discern the state of the system, after which the system is replaced if it is in the out‐of‐control state. In addition, a full inspection provides the opportunity to replace the sensor. We formulate the problem of adaptively scheduling full inspections and sensor replacements using a partially observable Markov decision process (POMDP) model. The objective is to minimize the total expected discounted costs associated with system operation, full inspection, system replacement, and sensor replacement. We show that the optimal policy has a threshold structure and demonstrate the value of coordinating system and sensor maintenance via numerical examples. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 399–417, 2017 相似文献
96.
军人心理训练,作为一种将心理训练与战斗力相结合的新型训练模式,是军人提升心理能力、培育素质素养的重要途径。通过概述军人心理训练的内涵和方法,梳理实证研究的研究现状,为拓展军人心理训练领域研究、深化训练应用实效提出思考。 相似文献
97.
彭玲 《中国人民武装警察部队学院学报》2007,23(12):8-11
对隧道防火涂料的组成、工作原理、生产工艺流程及技术指标等作了简要阐述,并对近年来国内外隧道防火涂料研究中存在的问题及今后的发展方向进行了探讨与展望,认为隧道防火涂料既要满足隧道防火设计的要求,又要具有较高的性价比及环保性。 相似文献
98.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
99.
100.
We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding), and intermediate (work‐in‐process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two different, but closely related, Dantzig‐Wolfe reformulations, we develop heuristics to minimize the total cost. We exploit the duality between Dantzig‐Wolfe reformulation and Lagrangian relaxation to enhance our heuristics. This combined approach enables us to develop two different lower bounds on the optimal integer solution, together with intuitive approaches for obtaining near‐optimal feasible integer solutions. To the best of our knowledge, this is the first paper that applies column generation to a scheduling problem with different types of strongly ????‐hard pricing problems which are solved heuristically. The computational study demonstrates that our algorithms have a significant speed advantage over alternate methods, yield good lower bounds, and generate near‐optimal feasible integer solutions for problem instances with many machines and a realistically large number of jobs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献