全文获取类型
| 收费全文 | 335篇 |
| 免费 | 4篇 |
| 国内免费 | 1篇 |
专业分类
| 340篇 |
出版年
| 2023年 | 5篇 |
| 2022年 | 1篇 |
| 2021年 | 1篇 |
| 2020年 | 3篇 |
| 2019年 | 6篇 |
| 2018年 | 2篇 |
| 2017年 | 13篇 |
| 2016年 | 19篇 |
| 2015年 | 12篇 |
| 2014年 | 24篇 |
| 2013年 | 18篇 |
| 2012年 | 26篇 |
| 2011年 | 27篇 |
| 2010年 | 17篇 |
| 2009年 | 24篇 |
| 2008年 | 14篇 |
| 2007年 | 12篇 |
| 2006年 | 16篇 |
| 2005年 | 17篇 |
| 2004年 | 17篇 |
| 2003年 | 9篇 |
| 2002年 | 5篇 |
| 2001年 | 6篇 |
| 2000年 | 10篇 |
| 1999年 | 6篇 |
| 1998年 | 5篇 |
| 1997年 | 1篇 |
| 1996年 | 1篇 |
| 1995年 | 6篇 |
| 1994年 | 2篇 |
| 1993年 | 3篇 |
| 1992年 | 1篇 |
| 1991年 | 4篇 |
| 1990年 | 7篇 |
排序方式： 共有340条查询结果，搜索用时 0 毫秒
231.
232.
提出一种编码感知的机会路由算法——CAR.它利用机会传输增加编码机会,并通过引入一系列参数衡量"机会"好坏,创造性地解决了交叉数据流下机会路由转发节点的选取问题,解决了流间网络编码和机会路由算法结合时数据包上下跳节点"已知"与"未知"的矛盾.CAR算法能够最大化每次编码传输中原始数据包的个数,仿真表明,它能够显著提高可靠传输协议以及整个网络的传输性能.通过机会传输实现多用户分集,可显著增加流间网络编码机会,引入的转发延时也可增加流间网络编码机会. 相似文献
233.
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. 相似文献
234.
我国海军执行远海护航与南海领海巡航任务已成常态化,同时随着\"一带一路\"国家战略的稳步实施,海军舰船必将走得更远,为经济建设与世界和平、地区稳定保驾护航。为了科学地构建我国远海舰船维修保障体系,本文分析总结美英国家海军舰船远海维修保障体系基本模式、特点及利弊,并在合理界定远海及远海维修保障概念的基础上,提出构建我国海军舰船远海维修保障体系的基本策略。 相似文献
235.
We study joint preventive maintenance (PM) and production policies for an unreliable production‐inventory system in which maintenance/repair times are non‐negligible and stochastic. A joint policy decides (a) whether or not to perform PM and (b) if PM is not performed, then how much to produce. We consider a discrete‐time system, formulating the problem as a Markov decision process (MDP) model. The focus of the work is on the structural properties of optimal joint policies, given the system state comprised of the system's age and the inventory level. Although our analysis indicates that the structure of optimal joint policies is very complex in general, we are able to characterize several properties regarding PM and production, including optimal production/maintenance actions under backlogging and high inventory levels, and conditions under which the PM portion of the joint policy has a control‐limit structure. In further special cases, such as when PM set‐up costs are negligible compared to PM times, we are able to establish some additional structural properties. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
236.
Philip Cho Vivek Farias John Kessler Retsef Levi Thomas Magnanti Eric Zarybnisky 《海军后勤学研究》2015,62(1):60-80
In this article, we focus on relatively new maintenance and operational scheduling challenges that are faced by the United States Air Force concerning low‐observable (LO) or stealth aircraft. The LO capabilities of an aircraft degrade stochastically as it flies, making it difficult to make maintenance scheduling decisions. Maintainers can address these damages, but must decide, which aircraft should be put into maintenance, and for how long. Using data obtained from an active duty Air Force F‐22 wing and interviews with Air Force maintainers and program specialists, we model this problem as a generalization of the well‐known restless multiarmed bandit superprocess. Specifically, we use an extension of the traditional model to allow for actions that require varying lengths of time, and generate two separate index policies from a single model; one for maintenance actions and one for the flying action. These index policies allow maintenance schedulers to intuitively, quickly, and effectively rank a fleet of aircraft based on each aircraft's LO status and decide, which aircraft should enter into LO maintenance and for how long, and which aircraft should be used to satisfy daily sortie requirements. Finally, we present extensive data‐driven, detailed simulation results, where we compare the performance of the index policies against policies currently used by the Air Force, as well as some other possible more naive heuristics. The results indicate that the index policies significantly outperform existing policies in terms of fully mission capable (FMC) rates. In particular, the experiments highlight the importance of coordinated maintenance and flying decisions. © 2015 Wiley Periodicals, Inc. 62:60–80, 2015 相似文献
237.
238.
We study a problem of scheduling a maintenance activity on parallel identical machines, under the assumption that all the machines must be maintained simultaneously. One example for this setting is a situation where the entire system must be stopped for maintenance because of a required electricity shut‐down. The objective is minimum flow‐time. The problem is shown to be NP‐hard, and moreover impossible to approximate unless P = NP. We introduce a pseudo‐polynomial dynamic programming algorithm, and show how to convert it into a bicriteria FPTAS for this problem. We also present an efficient heuristic and a lower bound. Our numerical tests indicate that the heuristic provides in most cases very close‐to‐optimal schedules. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
239.
240.