全文获取类型
收费全文 | 494篇 |
免费 | 213篇 |
国内免费 | 37篇 |
出版年
2024年 | 2篇 |
2023年 | 5篇 |
2022年 | 9篇 |
2021年 | 4篇 |
2020年 | 20篇 |
2019年 | 16篇 |
2018年 | 17篇 |
2017年 | 42篇 |
2016年 | 38篇 |
2015年 | 31篇 |
2014年 | 35篇 |
2013年 | 39篇 |
2012年 | 40篇 |
2011年 | 33篇 |
2010年 | 30篇 |
2009年 | 45篇 |
2008年 | 29篇 |
2007年 | 33篇 |
2006年 | 43篇 |
2005年 | 35篇 |
2004年 | 26篇 |
2003年 | 24篇 |
2002年 | 18篇 |
2001年 | 22篇 |
2000年 | 14篇 |
1999年 | 19篇 |
1998年 | 13篇 |
1997年 | 14篇 |
1996年 | 5篇 |
1995年 | 6篇 |
1994年 | 7篇 |
1993年 | 6篇 |
1992年 | 6篇 |
1991年 | 6篇 |
1990年 | 4篇 |
1989年 | 7篇 |
1988年 | 1篇 |
排序方式: 共有744条查询结果,搜索用时 0 毫秒
341.
Dimitrios G. Pandelis 《海军后勤学研究》2014,61(6):435-446
We consider two‐stage tandem queueing systems with dedicated servers in each station and a flexible server that is trained to serve both stations. We assume no arrivals, exponential service times, and linear holding costs for jobs present in the system. We study the optimal dynamic assignment of servers to jobs assuming a noncollaborative work discipline with idling and preemptions allowed. For larger holding costs in the first station, we show that (i) nonidling policies are optimal and (ii) if the flexible server is not faster than the dedicated servers, the optimal server allocation strategy has a threshold‐type structure. For all other cases, we provide numerical results that support the optimality of threshold‐type policies. Our numerical experiments also indicate that when the flexible server is faster than the dedicated server of the second station, the optimal policy may have counterintuitive properties, which is not the case when a collaborative service discipline is assumed. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 435–446, 2014 相似文献
342.
Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014 相似文献
343.
基于BWRS方程的压缩空气压缩因子计算 总被引:1,自引:0,他引:1
使用压缩空气作为介质进行流体计算时,为保证计算精度须考虑压缩因子的影响。为了精确得到压缩空气的压缩因子,对压缩因子的计算方法进行了研究。将空气简化为氮气与氧气的混合气体,通过3个真实气体状态方程计算压缩因子,并与已有数据进行比较,验证了将空气模型简化,再计算其压缩因子的方法是可行的。BWRS方程计算出的压缩因子精度较高,但在不同压力下的计算误差有较大差距。为进一步提高计算精度,考虑了偏心因子的影响,通过计算分析、经验修正,得到了精度较高的压缩因子计算算法,并进行了试验验证。结果表明:不同压力下改变偏心因子的数值对计算结果有不同程度的影响;改进后的BWRS方程计算精度得到了提高,从而验证了BWRS方程改进算法计算压缩因子的有效性和可行性。 相似文献
344.
针对不同作战平台上多个武器单元对一批目标进行射击时的武器目标分配问题,建立了该问题的数学模型。采用混沌人工鱼群算法对动态条件下的武器目标分配问题进行求解,并设计一个实例进行仿真实验。仿真结果表明,在时间约束条件下该算法较遗传算法更具优越性,验证了混沌人工鱼群算法用于动态武器目标分配的有效性。 相似文献
345.
蔡畅宇 《中国人民武装警察部队学院学报》2004,20(2):27-29
通过分析人的素质、行为和能动作用 ,揭示人类防御火灾意识偏低的原因 ,指出人类要实现人与自然协调发展 ,减少火灾的侵袭 ,就必须提高人的素质 ,规范人的行为 ,发挥人的主观能动作用。 相似文献
346.
给出了一种软件项目的随机调度模型.它明确地把调度策略作为输入,一旦调度策略确定,模型就可以输出关于项目的完成时间或成本的一个概率分布.利用随机最优化技术,能够计算出软件项目的一个调度策略,它使得项目在人员给定的情况下开发时间和成本最小. 相似文献
347.
基于ADAMS的齿轮传动系统动态特性仿真 总被引:8,自引:0,他引:8
介绍了齿轮传动系统的特点,建立了齿轮传动系统动力学仿真模型。基于ADAMS对街轮传动系统的动力特性进行了仿真,结果表明该模型与齿轮传动箱的动力学特性吻合。本模型和仿真方法为齿轮载荷获取、疲劳寿命预测提供了新的途径。 相似文献
348.
Kyle Y. Lin 《海军后勤学研究》2004,51(4):501-521
Consider a sequential dynamic pricing model where a seller sells a given stock to a random number of customers. Arriving one at a time, each customer will purchase one item if the product price is lower than her personal reservation price. The seller's objective is to post a potentially different price for each customer in order to maximize the expected total revenue. We formulate the seller's problem as a stochastic dynamic programming model, and develop an algorithm to compute the optimal policy. We then apply the results from this sequential dynamic pricing model to the case where customers arrive according to a continuous‐time point process. In particular, we derive tight bounds for the optimal expected revenue, and develop an asymptotically optimal heuristic policy. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
349.
We consider queueing systems with multiple classes of customers and heterogeneous servers where customers have the flexibility of being processed by more than one server and servers possess the capability of processing more than one customer class. We provide a unified framework for the modeling and analysis of these systems under arbitrary customer and server flexibility and for a rich set of control policies that includes customer/server‐specific priority schemes for server and customer selection. We use our models to generate several insights into the effect of system configuration and control policies. In particular, we examine the relationship between flexibility, control policies and throughput under varying assumptions for system parameters. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
350.
Design reliability at the beginning of a product development program is typically low, and development costs can account for a large proportion of total product cost. We consider how to conduct development programs (series of tests and redesigns) for one‐shot systems (which are destroyed at first use or during testing). In rough terms, our aim is to both achieve high final design reliability and spend as little of a fixed budget as possible on development. We employ multiple‐state reliability models. Dynamic programming is used to identify a best test‐and‐redesign strategy and is shown to be presently computationally feasible for at least 5‐state models. Our analysis is flexible enough to allow for the accelerated stress testing needed in the case of ultra‐high reliability requirements, where testing otherwise provides little information on design reliability change. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献