全文获取类型
收费全文 | 116篇 |
免费 | 39篇 |
国内免费 | 10篇 |
专业分类
165篇 |
出版年
2023年 | 1篇 |
2022年 | 1篇 |
2021年 | 1篇 |
2020年 | 4篇 |
2019年 | 4篇 |
2018年 | 2篇 |
2017年 | 1篇 |
2016年 | 6篇 |
2015年 | 3篇 |
2014年 | 11篇 |
2013年 | 8篇 |
2012年 | 13篇 |
2011年 | 13篇 |
2010年 | 5篇 |
2009年 | 6篇 |
2008年 | 5篇 |
2007年 | 7篇 |
2006年 | 9篇 |
2005年 | 9篇 |
2004年 | 8篇 |
2003年 | 4篇 |
2002年 | 9篇 |
2001年 | 7篇 |
2000年 | 5篇 |
1999年 | 4篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 4篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1990年 | 6篇 |
1989年 | 1篇 |
排序方式: 共有165条查询结果,搜索用时 15 毫秒
41.
针对未来战场对弹药需求动态、突发、受任务冲击影响等特点,提出弹药生产响应能力概念,建立了任务冲击条件下弹药生产响应能力影响因素的指标体系。运用网络分析法,建立典型结构的弹药生产响应能力影响因素的网络模型,得出弹药生产响应能力的关键影响因素,为弹药生产响应能力分析与提高提供了科学研究方法。 相似文献
42.
基于Markov状态转移的动态可靠性分析 总被引:1,自引:0,他引:1
基于系统的马尔可夫性假设,对系统状态进行适当的离散化处理,利用状态转移方法来描述系统的动态随机过程.在求得状态转移矩阵后,再建立离散动态事件树,来求得系统故障概率.用此方法具体分析了水位调节系统. 相似文献
43.
44.
基于马尔可夫过程,研究电介质分别在阶跃电场、方波电场和交变电场条件下的极化过程,并给出了介电函数的一般表达式. 相似文献
45.
Queuing models have been extensively used in the literature for obtaining performance measures and developing staffing policies. However, most of this work has been from a pure probabilistic point of view and has not addressed issues of statistical inference. In this article, we consider Bayesian queuing models with impatient customers with particular emphasis on call center operations and discuss further extensions. We develop the details of Bayesian inference for queues with abandonment such as the M/M/s + M model (Erlang‐A). In doing so, we discuss the estimation of operating characteristics and its implications on staffing. We illustrate the implementation of the Bayesian models using actual arrival, service, and abandonment data from call centers. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
46.
In this paper we consider networks that consist of components operating under a randomly changing common environment. Our work is motivated by power system networks that are subject to fluctuating weather conditions over time that affect the performance of the network. We develop a general setup for any network that is subject to such environment and present results for network reliability assessment under two repair scenarios. We also present Bayesian analysis of network failure data and illustrate how reliability predictions can be obtained for the network. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 574–591, 2003 相似文献
47.
Firing multiple artillery rounds from the same location has two main benefits: a high rate of fire at the enemy and improved accuracy as the shooter's aim adjusts to previous rounds. However, firing repeatedly from the same location carries significant risk that the enemy will detect the artillery's location. Therefore, the shooter may periodically move locations to avoid counter‐battery fire. This maneuver is known as the shoot‐and‐scoot tactic. This article analyzes the shoot‐and‐scoot tactic for a time‐critical mission using Markov models. We compute optimal move policies and develop heuristics for more complex and realistic settings. Spending a reasonable amount of time firing multiple shots from the same location is often preferable to moving immediately after firing an initial salvo. Moving frequently reduces risk to the artillery, but also limits the artillery's ability to inflict damage on the enemy. 相似文献
48.
We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound. 相似文献
49.
We consider the decision‐making problem of dynamically scheduling the production of a single make‐to stock (MTS) product in connection with the product's concurrent sales in a spot market and a long‐term supply channel. The spot market is run by a business to business (B2B) online exchange, whereas the long‐term channel is established by a structured contract. The product's price in the spot market is exogenous, evolves as a continuous time Markov chain, and affects demand, which arrives sequentially as a Markov‐modulated Poisson process (MMPP). The manufacturer is obliged to fulfill demand in the long‐term channel, but is able to rein in sales in the spot market. This is a significant strategic decision for a manufacturer in entering a favorable contract. The profitability of the contract must be evaluated by optimal performance. The current problem, therefore, arises as a prerequisite to exploring contracting strategies. We reveal that the optimal strategy of coordinating production and sales is structured by the spot price dependent on the base stock and sell‐down thresholds. Moreover, we can exploit the structural properties of the optimal strategy to conceive an efficient algorithm. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
50.
We consider the optimal control of a production inventory‐system with a single product and two customer classes where items are produced one unit at a time. Upon arrival, customer orders can be fulfilled from existing inventory, if there is any, backordered, or rejected. The two classes are differentiated by their backorder and lost sales costs. At each decision epoch, we must determine whether or not to produce an item and if so, whether to use this item to increase inventory or to reduce backlog. At each decision epoch, we must also determine whether or not to satisfy demand from a particular class (should one arise), backorder it, or reject it. In doing so, we must balance inventory holding costs against the costs of backordering and lost sales. We formulate the problem as a Markov decision process and use it to characterize the structure of the optimal policy. We show that the optimal policy can be described by three state‐dependent thresholds: a production base‐stock level and two order‐admission levels, one for each class. The production base‐stock level determines when production takes place and how to allocate items that are produced. This base‐stock level also determines when orders from the class with the lower shortage costs (Class 2) are backordered and not fulfilled from inventory. The order‐admission levels determine when orders should be rejected. We show that the threshold levels are monotonic (either nonincreasing or nondecreasing) in the backorder level of Class 2. We also characterize analytically the sensitivity of these thresholds to the various cost parameters. Using numerical results, we compare the performance of the optimal policy against several heuristics and show that those that do not allow for the possibility of both backordering and rejecting orders can perform poorly.© 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010 相似文献