全文获取类型
收费全文 | 62篇 |
免费 | 32篇 |
出版年
2022年 | 1篇 |
2021年 | 2篇 |
2020年 | 8篇 |
2019年 | 4篇 |
2018年 | 2篇 |
2017年 | 1篇 |
2016年 | 4篇 |
2015年 | 1篇 |
2014年 | 4篇 |
2013年 | 1篇 |
2012年 | 3篇 |
2011年 | 8篇 |
2010年 | 2篇 |
2009年 | 2篇 |
2008年 | 4篇 |
2007年 | 4篇 |
2006年 | 7篇 |
2005年 | 5篇 |
2004年 | 5篇 |
2003年 | 2篇 |
2002年 | 3篇 |
2001年 | 3篇 |
2000年 | 2篇 |
1999年 | 2篇 |
1998年 | 6篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1989年 | 1篇 |
排序方式: 共有94条查询结果,搜索用时 15 毫秒
21.
Sunkyo Kim 《海军后勤学研究》2005,52(5):399-408
In this paper, we present the heavy‐traffic bottleneck phenomenon under multiclass deterministic routing and discuss how it can be addressed by decomposition approximation. Examples show that Bitran and Tirupati's method and Whitt's enhancements for deterministic routing may not properly account for this phenomenon. We propose refinements to these methods based on Whitt's variability functions. Results of numerical experiments on simple networks and semiconductor manufacturing process show significant improvement in the approximation of expected waiting time at bottleneck stations. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
22.
针对医学领域诊断规则挖掘算法中时间和空间复杂性问题,提出一种基于邻域系统的决策表近似算法,用于医疗诊断数据挖掘预处理阶段的数据压缩.该方法以代表元素代替若干相近元素,有效地压缩了原始决策表的对象个数,同时保证决策表本身的判断能力基本不变.实例仿真表明,该算法具有比传统聚类算法更优的性能. 相似文献
23.
采用以黎曼解描述粒子间相互作用的接触算法,模拟一维情况下包含间断的流场。在弱间断的条件下,采用弱波近似的黎曼解来描述粒子间的相互作用;在强间断的条件下,则引入非迭代黎曼解来描述粒子间的相互作用。并引入Taylor展开思想,提高了接触算法在自由边界的计算精度。该算法无需引入人为粘性,程序结构简洁。数值计算表明,改进后的接触算法能很好地描述强间断,并有效改善了原始接触算法在自由面的计算缺陷。 相似文献
24.
We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is required if a machine switches over from one job to another. Each order is released at time zero and has a positive weight. Preemptions are not allowed. The completion time of an order is the time at which all jobs of that order have been completed. The objective is to minimize the total weighted completion time of the orders. The problem is NP‐hard for any fixed number (≥2) of machines. Because of this, we focus our attention on two classes of heuristics, which we refer to as sequential two‐phase heuristics and dynamic two‐phase heuristics. We perform a worst case analysis as well as an empirical analysis of nine heuristics. Our analyses enable us to rank these heuristics according to their effectiveness, taking solution quality as well as running time into account. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
25.
26.
给出了用椭圆弧及双椭圆弧自适应逼近平面NURBS曲线的算法。算法所得到的椭圆样条能够G1连续 ,双椭圆样条还能够保形。与现行的圆弧逼近算法相比 ,本算法不需要求解非线性方程组 ,而是由给定的插补误差自动计算参数增量 ,得到椭圆曲线的特征点 ,还可以将误差控制在预期的范围之内 ;与现行的直线插补方法相比 ,不需要额外的时间和空间 ,也适用于CNC环境。本算法在腔体加工、二维轮廓加工等方面有特别的实用价值。 相似文献
27.
谢政 《国防科技大学学报》1989,11(2):33-39
本文讨论了分段线性凸费用网络流问题,推广了线性费用网络流中的负回路方法和最小费用路方法,从而得到了求分段线性凸费用网络的最小费用流的两个算法。 相似文献
28.
In this article, we consider the performance evaluation of a multicomponent, multiproduct assemble‐to‐order (ATO) system. Each component is managed independently using a base‐stock policy at a supply facility with limited production capacity and an infinite buffer. The arrivals of demands follow a multivariate Poisson process and unfilled demands are backlogged. Because exact analysis of the proposed system is not feasible, we propose two approximation methods which provide upper and lower bounds for various performance measures such as fill rate, average waiting time, and average number of backorders of the proposed system. Our computational experiments demonstrate the effectiveness of the two approximation methods under various system settings. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
29.
In the classical multiprocessor scheduling problem independent jobs must be assigned to parallel, identical machines with the objective of minimizing the makespan. This article explores the effect of assignment restrictions on the jobs for multiprocessor scheduling problems. This means that each job can only be processed on a specific subset of the machines. Particular attention is given to the case of processing times restricted to one of two values, 1 and λ, differing by at most 2. A matching based polynomial time ε‐approximation algorithm is developed that has a performance ratio tending to . This algorithm is shown to have the best possible performance, tending to 3/2, for processing times 1 and 2. For the special case of nested processing sets, i.e., when the sets of machines upon which individual jobs may be assigned are non‐overlapping, the behavior of list scheduling algorithms is explored. Finally, for assignment restrictions determined by just one characteristic of the machines, such as disc storage or memory constraint in the case of high performance computing, we contribute an algorithm that provides a 3/2 worst case bound and runs in time linear in the number of jobs. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
30.
火炮射表数据处理方法评述 总被引:1,自引:0,他引:1
主要介绍火炮射表数据处理方法,对国内目前较为流行的两种射表逼近方法进行了全面、系统的分析与比较,指出了逐步回归射表逼近方法存在的缺陷和不足。对国外近几年采用的插值法文中也进行了比较详细的讨论,并指出了未来的研究问题。 相似文献