全文获取类型
收费全文 | 175篇 |
免费 | 76篇 |
国内免费 | 5篇 |
出版年
2022年 | 1篇 |
2021年 | 7篇 |
2020年 | 7篇 |
2019年 | 8篇 |
2018年 | 3篇 |
2017年 | 9篇 |
2016年 | 12篇 |
2015年 | 11篇 |
2014年 | 12篇 |
2013年 | 8篇 |
2012年 | 16篇 |
2011年 | 23篇 |
2010年 | 7篇 |
2009年 | 12篇 |
2008年 | 10篇 |
2007年 | 11篇 |
2006年 | 13篇 |
2005年 | 15篇 |
2004年 | 8篇 |
2003年 | 7篇 |
2002年 | 7篇 |
2001年 | 13篇 |
2000年 | 7篇 |
1999年 | 6篇 |
1998年 | 8篇 |
1997年 | 4篇 |
1996年 | 1篇 |
1994年 | 2篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 2篇 |
排序方式: 共有256条查询结果,搜索用时 15 毫秒
241.
本文描述了任意三角域上C~1有理插值的一种组合算法,其特点是构造简单,计算方便,插值函数与文[3][4]比较,有着较高的逼近精度。最后给出了插值式的代数精度集和计算实例。 相似文献
242.
石春和 《军械工程学院学报》1993,(1)
在数据连续采集过程中,误差是一个随机的过程,有的误差数据出现“失真”,本文结合指挥仪综合检测中动态误差情况,提出一种平稳误差过程和非平稳误差过程的数据预处理方法。 相似文献
243.
在对多种模型进行研究的基础上,提出了一种快速模拟三维彩色树木的高效算法。该算法不仅合理简化了树木的几何拓扑结构和生长规律特性,而且引入了特性良好、计算简单、参数易于控制的随机函数。因此生成树木的种类较多、图形逼真、速度很快,在普通微机上达到了实时的模拟效果。 相似文献
244.
We describe the application of a decomposition based solution method to a class of network interdiction problems. The problem of maximizing the probability of sufficient disruption of the flow of information or goods in a network whose characteristics are not certain is shown to be solved effectively by applying a scenario decomposition method developed by Riis and Schultz [Comput Optim Appl 24 (2003), 267–287]. Computational results demonstrate the effectiveness of the algorithm and design decisions that result in speed improvements. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
245.
依据随机动力学、多体系统动力学和数理统计理论,借助MSC\Adams仿真软件和MATLAB工具,提出随机虚拟样机的概念。并以某型自行火炮的扭力轴为例,在建立的虚拟样机上,实现不确定性因素下从底盘整体到悬挂系统、再到扭力轴的动力仿真。 相似文献
246.
Using a birth‐and‐death process to estimate the steady‐state distribution of a periodic queue
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
If the number of customers in a queueing system as a function of time has a proper limiting steady‐state distribution, then that steady‐state distribution can be estimated from system data by fitting a general stationary birth‐and‐death (BD) process model to the data and solving for its steady‐state distribution using the familiar local‐balance steady‐state equation for BD processes, even if the actual process is not a BD process. We show that this indirect way to estimate the steady‐state distribution can be effective for periodic queues, because the fitted birth and death rates often have special structure allowing them to be estimated efficiently by fitting parametric functions with only a few parameters, for example, 2. We focus on the multiserver Mt/GI/s queue with a nonhomogeneous Poisson arrival process having a periodic time‐varying rate function. We establish properties of its steady‐state distribution and fitted BD rates. We also show that the fitted BD rates can be a useful diagnostic tool to see if an Mt/GI/s model is appropriate for a complex queueing system. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 664–685, 2015 相似文献
247.
Inventory models with nonlinear shortage costs and stochastic lead times; applications of shape properties of randomly stopped counting processes
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
In this article, we study generalizations of some of the inventory models with nonlinear costs considered by Rosling in (Oper. Res. 50 (2002) 797–809). In particular, we extend the study of both the periodic review and the compound renewal demand processes from a constant lead time to a random lead time. We find that the quasiconvexity properties of the cost function (and therefore the existence of optimal (s, S) policies), holds true when the lead time has suitable log‐concavity properties. The results are derived by structural properties of renewal delayed processes stopped at an independent random time and by the study of log‐concavity properties of compound distributions. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 345–356, 2015 相似文献
248.
In Assemble‐To‐Order (ATO) systems, situations may arise in which customer demand must be backlogged due to a shortage of some components, leaving available stock of other components unused. Such unused component stock is called remnant stock. Remnant stock is a consequence of both component ordering decisions and decisions regarding allocation of components to end‐product demand. In this article, we examine periodic‐review ATO systems under linear holding and backlogging costs with a component installation stock policy and a First‐Come‐First‐Served (FCFS) allocation policy. We show that the FCFS allocation policy decouples the problem of optimal component allocation over time into deterministic period‐by‐period optimal component allocation problems. We denote the optimal allocation of components to end‐product demand as multimatching. We solve the multi‐matching problem by an iterative algorithm. In addition, an approximation scheme for the joint replenishment and allocation optimization problem with both upper and lower bounds is proposed. Numerical experiments for base‐stock component replenishment policies show that under optimal base‐stock policies and optimal allocation, remnant stock holding costs must be taken into account. Finally, joint optimization incorporating optimal FCFS component allocation is valuable because it provides a benchmark against which heuristic methods can be compared. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 158–169, 2015 相似文献
249.
The dynamic and stochastic knapsack Problem with homogeneous‐sized items and postponement options
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
This article generalizes the dynamic and stochastic knapsack problem by allowing the decision‐maker to postpone the accept/reject decision for an item and maintain a queue of waiting items to be considered later. Postponed decisions are penalized with delay costs, while idle capacity incurs a holding cost. This generalization addresses applications where requests of scarce resources can be delayed, for example, dispatching in logistics and allocation of funding to investments. We model the problem as a Markov decision process and analyze it through dynamic programming. We show that the optimal policy with homogeneous‐sized items possesses a bithreshold structure, despite the high dimensionality of the decision space. Finally, the value (or price) of postponement is illustrated through numerical examples. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 267–292, 2015 相似文献
250.
We develop a simple, approximately optimal solution to a model with Erlang lead time and deterministic demand. The method is robust to misspecification of the lead time and has good accuracy. We compare our approximate solution to the optimal for the case where we have prior information on the lead‐time distribution, and another where we have no information, except for computer‐generated sample data. It turns out that our solution is as easy as the EOQ's, with an accuracy rate of 99.41% when prior information on the lead‐time distribution is available and 97.54–99.09% when only computer‐generated sample information is available. Apart from supplying the inventory practitioner with an easy heuristic, we gain insights into the efficacy of stochastic lead time models and how these could be used to find the cost and a near‐optimal policy for the general model, where both demand rate and lead time are stochastic. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献