首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   798篇
  免费   346篇
  国内免费   86篇
  2024年   1篇
  2023年   18篇
  2022年   9篇
  2021年   25篇
  2020年   35篇
  2019年   18篇
  2018年   9篇
  2017年   60篇
  2016年   68篇
  2015年   49篇
  2014年   63篇
  2013年   55篇
  2012年   80篇
  2011年   67篇
  2010年   41篇
  2009年   88篇
  2008年   58篇
  2007年   62篇
  2006年   70篇
  2005年   54篇
  2004年   56篇
  2003年   36篇
  2002年   37篇
  2001年   27篇
  2000年   31篇
  1999年   22篇
  1998年   23篇
  1997年   15篇
  1996年   11篇
  1995年   9篇
  1994年   9篇
  1993年   9篇
  1992年   3篇
  1991年   2篇
  1990年   8篇
  1989年   2篇
排序方式: 共有1230条查询结果,搜索用时 15 毫秒
61.
针对水下电磁探测系统对直接耦合干扰的补偿精度受限于硬件采样分辨率的问题,研究了基于自适应技术的直接耦合干扰两级补偿方法。采用高速 DSP 芯片实现直接耦合干扰补偿电路,完成直接耦合干扰的粗调补偿;提出了基于可变遗忘因子的 QRD-LS 算法,并采用基于该算法的自适应陷波器实现了直接耦合干扰的微调补偿。实验研究验证了两级补偿方法对直接耦合干扰的补偿性能。结果表明:基于可变遗忘因子的QRD-LS 算法稳定性好,收敛速度快;基于该算法的自适应两级补偿方法对直接耦合干扰的补偿精度达到10-4倍。  相似文献   
62.
In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own objective function, and both share a common processor. In the single‐machine problem studied in this article, the goal is to find a joint schedule that minimizes the total deviation of the job completion times of the first agent from a common due‐date, subject to an upper bound on the maximum deviation of job completion times of the second agent. The problem is shown to be NP‐hard even for a nonrestrictive due‐date, and a pseudopolynomial dynamic program is introduced and tested numerically. For the case of a restrictive due‐date (a sufficiently small due‐date that may restrict the number of early jobs), a faster pseudopolynomial dynamic program is presented. We also study the multiagent case, which is proved to be strongly NP‐hard. A simple heuristic for this case is introduced, which is tested numerically against a lower bound, obtained by extending the dynamic programming algorithm. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 1–16, 2014  相似文献   
63.
高斯过程(GP)的非线性特征导致其对大样本的训练时间复杂度过高,而且其超参数的选取是否适当直接影响高斯过程回归模型的预测精度。提出采用人工蜂群(ABC)算法优化改进GP以减小时间复杂度和提高预测精度。改进GP通过选取训练样本的子样本进行模型学习,以降低训练过程的时间复杂度。ABC通过优化改进GP的超参数,提升预测精度。选取训练样本的子样本构建改进GP回归(GPR)模型,采用ABC算法搜寻改进GPR的最优超参数,并用得到的超参数构建最优的改进GPR模型,输入测试样本进行预测并输出预测精度。将该模型应用于解决海上远程精确打击(LPSS)体系作战效能评估问题中,通过MATLAB仿真实验,与常见的多种优化方法相比较,验证了该模型的有效性。  相似文献   
64.
威胁环境生存突防优化策略分析   总被引:2,自引:0,他引:2  
讨论了影响飞机作战生存性的主要因素,建立了生存概率模型。根据生存概率模型确立了威胁环境生存突防优化策略。最后,为了简化计算推导了实用危险性模型  相似文献   
65.
针对利用太阳影子实现目标的定位问题,分析得到影响影子长度的参数,确立了影长与太阳高度角、目标物长度、经纬度等的函数关系,并结合最小二乘法思想,建立了以理论影长与实际影长之差的平方和最小为目标的优化模型。以直杆为例,运用粒子群优化算法快速求解得到目标的可能位置,并与实际地点进行了比较。  相似文献   
66.
为解决当样本数据不断增加时,利用传统方法反复计算样本协方差迹耗时多的缺点,提出了一种快速递推算法。理论分析和仿真试验都表明,算法的时间复杂度比传统的方法降低了一个数量级,从而大大减少了计算时间。  相似文献   
67.
We consider the problem of scheduling a set of jobs on a single machine subject to random breakdowns. We focus on the preemptive‐repeat model, which addresses the situation where, if a machine breaks down during the processing of a job, the work done on the job prior to the breakdown is lost and the job will have to be started from the beginning again when the machine resumes its work. We allow that (i) the uptimes and downtimes of the machine follow general probability distributions, (ii) the breakdown process of the machine depends upon the job being processed, (iii) the processing times of the jobs are random variables following arbitrary distributions, and (iv) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We first derive the optimal policy for a class of problems under the criterion to maximize the expected discounted reward earned from completing all jobs. The result is then applied to further obtain the optimal policies for other due date‐related criteria. We also discuss a method to compute the moments and probability distributions of job completion times by using their Laplace transforms, which can convert a general stochastic scheduling problem to its deterministic equivalent. The weighted squared flowtime problem and the maintenance checkup and repair problem are analyzed as applications. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
68.
We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding), and intermediate (work‐in‐process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two different, but closely related, Dantzig‐Wolfe reformulations, we develop heuristics to minimize the total cost. We exploit the duality between Dantzig‐Wolfe reformulation and Lagrangian relaxation to enhance our heuristics. This combined approach enables us to develop two different lower bounds on the optimal integer solution, together with intuitive approaches for obtaining near‐optimal feasible integer solutions. To the best of our knowledge, this is the first paper that applies column generation to a scheduling problem with different types of strongly ????‐hard pricing problems which are solved heuristically. The computational study demonstrates that our algorithms have a significant speed advantage over alternate methods, yield good lower bounds, and generate near‐optimal feasible integer solutions for problem instances with many machines and a realistically large number of jobs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.  相似文献   
69.
并行子空间设计是一种有效的多学科设计优化算法,但其搜索策略存在两点不足:一是寻找全局最优解能力有限,二是计算复杂。为弥补上述不足,将遗传算法应用到CSD算法中,提出了一种基于进化搜索策略的CSD算法。介绍了该算法的设计流程,应用该算法对一测试问题进行了优化,取得了满意结果。  相似文献   
70.
TSP是经典的组合优化问题。根据欧氏平面TSP最优环路的性质提出了子路径及相关的概念,利用点集凸壳设计了环路构造算法,并以点集Delaunay三角剖分图为启发信息设计了改进的遗传算法,通过中国144城市TSP等验证了算法的有效性。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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