首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   353篇
  免费   177篇
  国内免费   27篇
  2024年   3篇
  2023年   6篇
  2022年   5篇
  2021年   4篇
  2020年   13篇
  2019年   7篇
  2018年   7篇
  2017年   20篇
  2016年   32篇
  2015年   26篇
  2014年   33篇
  2013年   26篇
  2012年   22篇
  2011年   20篇
  2010年   18篇
  2009年   34篇
  2008年   27篇
  2007年   27篇
  2006年   40篇
  2005年   26篇
  2004年   23篇
  2003年   16篇
  2002年   13篇
  2001年   20篇
  2000年   13篇
  1999年   10篇
  1998年   9篇
  1997年   10篇
  1996年   8篇
  1995年   5篇
  1994年   2篇
  1993年   6篇
  1992年   7篇
  1991年   6篇
  1990年   9篇
  1989年   3篇
  1988年   1篇
排序方式: 共有557条查询结果,搜索用时 7 毫秒
81.
针对采用H∞控制设计方法需求解难度很大的偏微分方程,而导致工程实现难度大的问题,提出了采用小波神经网络进行无人攻击机(UCAV)飞行控制系统设计的方法,该方法集小波变换和神经网络的优点于一身,简化了网络训练,避免了系统达到局部最优解,使得系统具有更好的逼近精度。通过仿真实验表明,利用小波神经网络进行UCAV控制律设计,使系统具有较好的跟踪性和鲁棒性,避免了精确模型的建立,便于分析系统的稳定性。  相似文献   
82.
远程反舰导弹弹道规划研究   总被引:5,自引:0,他引:5  
以保证远程反舰导弹迅速捕捉目标为出发点,以远程反舰导弹的作战需求为牵引,论述了对远程反舰导弹进行弹道规划的重要意义;从战术和技术两个方面探索了对远程反舰导弹进行弹道规划的主要依据、基本原则、规划思路和基本方法。  相似文献   
83.
In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000  相似文献   
84.
利用Laplace方程的基本解,将变系数非齐次Helmholtz偏微分方程的边值问题化为积分方程问题。再用边界无法进行离散,并对区域结点及边界结点的方程耦合求解。文末算例表明本文方法能够达到较高精度。  相似文献   
85.
We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998  相似文献   
86.
针对高超声速飞行器参数不确定弹性体模型,提出了一种基于非线性干扰观测器的自适应反演控制器设计方法。将曲线拟合模型表示为严格反馈形式,采用反演方法设计控制器。采用动态面方法获取虚拟控制量的导数,避免了传统反演控制"微分项膨胀"问题。为了增强控制器的鲁棒性,基于二阶跟踪-微分器设计了一种新型非线性干扰观测器,以此对模型不确定项进行自适应估计和补偿。仿真结果表明,控制器对模型不确定性和气动弹性影响具有强鲁棒性,且能实现对速度和高度参考指令的稳定跟踪。  相似文献   
87.
We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005  相似文献   
88.
一类非线性动力系统的时滞反馈分叉控制   总被引:1,自引:0,他引:1       下载免费PDF全文
对时滞控制作用下的参数激励van der Pol-Duffing方程进行了研究,着重研究了时滞参数对该类参数激励系统的1/2亚谐共振-主参数共振分叉响应控制。首先采用摄动法从理论上推导出时滞动力系统的分叉响应方程,再采用数值模拟的方法研究了时滞参数对系统分叉响应的影响。研究结果表明,适当选取时滞参数,不仅可以改变分叉响应曲线的拓扑形态,还可以平移分叉响应曲线,即使其分叉提前或滞后,还能同时满足这两种要求。  相似文献   
89.
This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011  相似文献   
90.
讨论了一类含脉冲的时滞抛物型方程解的振动性,利用格林公式以及Jensen不等式,得出了该方程在一类边界条件下解的振动准则。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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