首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   571篇
  免费   18篇
  国内免费   3篇
  592篇
  2025年   1篇
  2024年   6篇
  2023年   8篇
  2022年   3篇
  2021年   16篇
  2020年   14篇
  2019年   17篇
  2018年   11篇
  2017年   31篇
  2016年   30篇
  2015年   26篇
  2014年   31篇
  2013年   22篇
  2012年   36篇
  2011年   35篇
  2010年   23篇
  2009年   27篇
  2008年   27篇
  2007年   24篇
  2006年   24篇
  2005年   26篇
  2004年   22篇
  2003年   13篇
  2002年   17篇
  2001年   21篇
  2000年   11篇
  1999年   12篇
  1998年   12篇
  1997年   9篇
  1996年   7篇
  1994年   2篇
  1993年   5篇
  1992年   9篇
  1991年   4篇
  1990年   4篇
  1989年   3篇
  1988年   3篇
排序方式: 共有592条查询结果,搜索用时 0 毫秒
331.
    
Operational processes are usually studied in terms of stochastic processes. The main information measure used for predictability of stochastic processes is the entropy rate, which is asymptotic conditional entropy, thus not suitable for application over a finite horizon. We use the conditional entropy to study the predictability of stochastic processes over the finite horizon. It is well‐known that the conditional entropies of stationary processes decrease as the processes evolve, implying that, on average, their pasts become more informative about prediction of their future outcomes. Some important operational processes such as martingale, models for maintenance policies, nonhomogeneous Poisson, and mixed Poisson processes are nonstationary. We show that as a nonstationary process evolves, it may provide more information or less information about the future state of the system. We develop results for comparing the predictability of stochastic processes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   
332.
    
We consider a stochastic counterpart of the well-known earliness-tardiness scheduling problem with a common due date, in which n stochastic jobs are to be processed on a single machine. The processing times of the jobs are independent and normally distributed random variables with known means and known variances that are proportional to the means. The due dates of the jobs are random variables following a common probability distribution. The objective is to minimize the expectation of a weighted combination of the earliness penalty, the tardiness penalty, and the flow-time penalty. One of our main results is that an optimal sequence for the problem must be V-shaped with respect to the mean processing times. Other characterizations of the optimal solution are also established. Two algorithms are proposed, which can generate optimal or near-optimal solutions in pseudopolynomial time. The proposed algorithms are also extended to problems where processing times do not satisfy the assumption in the model above, and are evaluated when processing times follow different probability distributions, including general normal (without the proportional relation between variances and means), uniform, Laplace, and exponential. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44, 531–557, 1997.  相似文献   
333.
    
This paper deals with an inspection game of customs and a smuggler. The customs can take two options of assigning a patrol or not. The smuggler has two strategies of shipping its cargo of contraband or not. Two players have several opportunities to take actions during a limited number of days. When both players do, there are some possibilities that the customs captures the smuggler and, simultaneously, the smuggler possibly makes a success of the smuggling. If the smuggler is captured or there remain no days for playing the game, the game ends. In this paper, we formulate the problem into a multi‐stage two‐person zero‐sum stochastic game and investigate some characteristics of the equilibrium solution, some of which are given in a closed form in a special case. There have been some studies so far on the inspection game. However, some consider the case that the smuggler has only one opportunity of smuggling or the perfect‐capture case that the customs can certainly arrest the smuggler on patrol, and others think of a recursive game without the probabilities of fulfilling the players' purposes. In this paper, we consider the inspection game taking account of the fulfillment probabilities of the players' aims. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
334.
    
In this paper, we study the on‐line parameter estimation problem for a partially observable system subject to deterioration and random failure. The state of the system evolves according to a continuous time homogeneous Markov process with a finite state space. The system state is not observable, except for the failure state. The information related to the system state is available at discrete times through inspections. A recursive maximum likelihood (RML) algorithm is proposed for the on‐line parameter estimation of the model. The RML algorithm proposed in the paper is considerably faster and easier to apply than other RML algorithms in the literature, because it does not require projection into the constraint domain and calculation of the gradient on the surface of the constraint manifolds. The algorithm is illustrated by an example using real vibration data. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
335.
    
We consider an EOQ model with multiple suppliers that have random capacities, which leads to uncertain yield in orders. A given order is fully received from a supplier if the order quantity is less than the supplier's capacity; otherwise, the quantity received is equal to the available capacity. The optimal order quantities for the suppliers can be obtained as the unique solution of an implicit set of equations in which the expected unsatisfied order is the same for each supplier. Further characterizations and properties are obtained for the uniform and exponential capacity cases with discussions on the issues related to diversification among suppliers. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
336.
    
One of the major problems in modeling production systems is how to treat the job arrival process. Restrictive assumptions such as Markovian arrivals do not represent real world systems, especially if the arrival process is generated by job departures from upstream workstations. Under these circumstances, cost‐effective policies that are robust with respect to the nature of the arrival process become of interest. In this paper, we focus on minimizing the expected total holding and setup costs in a two‐stage produce‐to‐order production system operated by a cross‐trained worker. We will show that if setup times are insignificant in comparison with processing times, then near‐optimal policies can be generated with very robust performances with respect to the arrival process. We also present conditions under which these near‐optimal policies can be obtained by using only the arrival and service rates. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.  相似文献   
337.
    
We present a stochastic programming approach to capacity planning under demand uncertainty in semiconductor manufacturing. Given multiple demand scenarios together with associated probabilities, our aim is to identify a set of tools that is a good compromise for all these scenarios. More precisely, we formulate a mixed‐integer program in which expected value of the unmet demand is minimized subject to capacity and budget constraints. This is a difficult two‐stage stochastic mixed‐integer program which cannot be solved to optimality in a reasonable amount of time. We instead propose a heuristic that can produce near‐optimal solutions. Our heuristic strengthens the linear programming relaxation of the formulation with cutting planes and performs limited enumeration. Analyses of the results in some real‐life situations are also presented. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.  相似文献   
338.
再入目标质阻比估计算法研究   总被引:5,自引:0,他引:5  
再入段目标识别的核心问题是快速高精度地估计出目标的质阻比。针对再入过程的非线性问题,重点研究了样条卡尔曼滤波器、扩展卡尔曼滤波器和一种基于\"无损传输\"的扩展卡尔曼滤波器,仿真实验从质阻比的估计精度和收敛速度以及计算量等方面比较了各滤波算法的性能。仿真结果表明基于无损传输的扩展卡尔曼滤波器的估计精度最高,收敛速度最快。  相似文献   
339.
低阶高精度单元的发展   总被引:2,自引:1,他引:1  
综述了四节点等参单元存在的问题,以及提高其精度的途径,并对这些方法略做评述,且探讨了发展高精度单元的方法。  相似文献   
340.
为了评估炮兵对有生力量压制效果,应用离散事件仿真方法建立了炮兵射击有生力量仿真模型,提出一种炮兵对有生力量压制比的仿真计算方法。首先,给出了压制比的概念与模型。然后,建立了基于离散事件仿真的炮兵射击有生力量模型。最后,结合实例验证了仿真计算方法的正确性。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号