全文获取类型
收费全文 | 368篇 |
免费 | 127篇 |
国内免费 | 43篇 |
出版年
2024年 | 3篇 |
2023年 | 9篇 |
2022年 | 4篇 |
2021年 | 6篇 |
2020年 | 7篇 |
2019年 | 3篇 |
2018年 | 5篇 |
2017年 | 31篇 |
2016年 | 39篇 |
2015年 | 21篇 |
2014年 | 23篇 |
2013年 | 19篇 |
2012年 | 32篇 |
2011年 | 28篇 |
2010年 | 19篇 |
2009年 | 31篇 |
2008年 | 18篇 |
2007年 | 43篇 |
2006年 | 30篇 |
2005年 | 29篇 |
2004年 | 25篇 |
2003年 | 11篇 |
2002年 | 14篇 |
2001年 | 10篇 |
2000年 | 13篇 |
1999年 | 13篇 |
1998年 | 11篇 |
1997年 | 9篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1993年 | 5篇 |
1992年 | 9篇 |
1991年 | 6篇 |
1989年 | 2篇 |
排序方式: 共有538条查询结果,搜索用时 15 毫秒
61.
62.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015 相似文献
63.
64.
65.
码相位鉴别器作为延迟锁定环的主要组成部分,其性能直接影响了接收机伪码的跟踪精度。针对输入信号有限字长效应对鉴相器性能的影响,提出一种新的基于信号统计特性的分析方法,分析了归一化早迟幅度鉴相器输入信号有限字长对输出性能的影响。理论分析和仿真结果表明,字长效应在输入信号高信噪比下比低信噪比时明显,随着信噪比的增加,由有限字长导致的伪码跟踪精度损失将增加,而当输入信号采用4bit以上的量化时,字长效应对伪码跟踪性能的影响将可忽略。该结论可用于指导接收机低功耗小型化设计。 相似文献
66.
67.
68.
We develop the first approximation algorithm with worst‐case performance guarantee for capacitated stochastic periodic‐review inventory systems with setup costs. The structure of the optimal control policy for such systems is extremely complicated, and indeed, only some partial characterization is available. Thus, finding provably near‐optimal control policies has been an open challenge. In this article, we construct computationally efficient approximate optimal policies for these systems whose demands can be nonstationary and/or correlated over time, and show that these policies have a worst‐case performance guarantee of 4. We demonstrate through extensive numerical studies that the policies empirically perform well, and they are significantly better than the theoretical worst‐case guarantees. We also extend the analyses and results to the case with batch ordering constraints, where the order size has to be an integer multiple of a base load. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 304–319, 2014 相似文献
69.
序列图像中运动点目标轨迹的实时检测算法,是目标识别、实时跟踪处理系统中的关键算法之一。在分析不同层次处理方法的基础上,给出了一种基于预测、窗口匹配的点轨迹预测—匹配检测算法,并根据仿真实验的效果,指出此算法可有效地对低信噪比序列图像运动点目标轨迹进行实时检测,具有多目标轨迹检测能力。 相似文献
70.
针对目标发生快速、运动不规则及遮挡等情况下的跟踪问题,提出了一种分层核采样策略。首先通过先验转移和后验转移分别预测2组粒子来建立联合分布,利用聚类算法近似联合分布粒子集的混合高斯分布;然后对每个聚类进行采样;最后采用均值漂移算法将粒子移动到后验密度的局部极值处。实验结果表明:算法在目标发生快速机动情况时,跟踪性能优于传统粒子滤波、核粒子滤波及分层粒子滤波,且对遮挡具有较好的鲁棒性。 相似文献