首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   329篇
  免费   89篇
  国内免费   26篇
  2023年   2篇
  2022年   2篇
  2021年   6篇
  2020年   7篇
  2019年   5篇
  2018年   1篇
  2017年   15篇
  2016年   25篇
  2015年   18篇
  2014年   26篇
  2013年   27篇
  2012年   23篇
  2011年   20篇
  2010年   19篇
  2009年   29篇
  2008年   27篇
  2007年   30篇
  2006年   27篇
  2005年   15篇
  2004年   20篇
  2003年   12篇
  2002年   6篇
  2001年   12篇
  2000年   13篇
  1999年   6篇
  1998年   4篇
  1997年   6篇
  1996年   5篇
  1995年   5篇
  1994年   2篇
  1993年   7篇
  1992年   4篇
  1991年   6篇
  1990年   9篇
  1989年   2篇
  1988年   1篇
排序方式: 共有444条查询结果,搜索用时 31 毫秒
231.
通过对无人战斗机低空进入敌防区面临的各种威胁进行分析,建立了适用于圆切线算法的威胁场模型;由于可行方向法对威胁圆叠加时规划出的航路效果不理想,提出了圆的切线算法理论作为此航路规划方法的改进,采用随机产生威胁场的方法来模拟多变的战场环境,并且进行了理论分析,最后得出仿真结果.仿真证明,将两种方法结合规划出的飞行航线在航程上是比较理想的,而且路径规则的效果也得到了很大的提高.  相似文献   
232.
本文应用多目标决策原理和计算机技术,在分析用户需求的基础上,建立了科研任务项目的预测评价和经费分配模型,并分析了有关模型的关系和解决性质。根据这些模型和决策的特点,简要叙述了该系统的主要功能。我们相信。该系统的应用,将给管理人员提供方便,且使管理进一步科学化,让有限的经费发挥更大的作用。  相似文献   
233.
课程建设需要把握的几个问题   总被引:2,自引:0,他引:2  
课程建设是一项系统工程,影响课程建设的因素很多,目前院校的课程建设尚存在一些问题,在一定程度上影响着教学质量的提高。文章主要针对学院新一轮课程建设的有关问题进行探讨。  相似文献   
234.
We present an algorithm for solving a specially structured nonlinear integer resource allocation problem. This problem was motivated by a capacity planning study done at a large Health Maintenance Organization in Texas. Specifically, we focus on a class of nonlinear resource allocation problems that involve the minimization of a convex function over one general convex constraint, a set of block diagonal convex constraints, and bounds on the integer variables. The continuous variable problem is also considered. The continuous problem is solved by taking advantage of the structure of the Karush‐Kuhn‐Tucker (KKT) conditions. This method for solving the continuous problem is then incorporated in a branch and bound algorithm to solve the integer problem. Various reoptimization results, multiplier bounding results, and heuristics are used to improve the efficiency of the algorithms. We show how the algorithms can be extended to obtain a globally optimal solution to the nonconvex version of the problem. We further show that the methods can be applied to problems in production planning and financial optimization. Extensive computational testing of the algorithms is reported for a variety of applications on continuous problems with up to 1,000,000 variables and integer problems with up to 1000 variables. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 770–792, 2003.  相似文献   
235.
We consider a simple two‐stage supply chain with a single retailer facing i.i.d. demand and a single manufacturer with finite production capacity. We analyze the value of information sharing between the retailer and the manufacturer over a finite time horizon. In our model, the manufacturer receives demand information from the retailer even during time periods in which the retailer does not order. To analyze the impact of information sharing, we consider the following three strategies: (1) the retailer does not share demand information with the manufacturer; (2) the retailer does share demand information with the manufacturer and the manufacturer uses the optimal policy to schedule production; (3) the retailer shares demand information with the manufacturer and the manufacturer uses a greedy policy to schedule production. These strategies allow us to study the impact of information sharing on the manufacturer as a function of the production capacity, and the frequency and timing in which demand information is shared. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003  相似文献   
236.
In this paper we address the problem of how to decide when to terminate the testing/modification process and to release the software during the development phase. We present a Bayesian decision theoretic approach by formulating the optimal release problem as a sequential decision problem. By using a non‐Gaussian Kalman filter type model, proposed by Chen and Singpurwalla (1994), to track software reliability, we are able to obtain tractable expressions for inference and determine a one‐stage look ahead stopping rule under reasonable conditions and a class of loss functions. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003  相似文献   
237.
实践表明,对影响VB程序设计课程教学中存在的突出问题进行认真分析,充分利用网络教学平台,改革课堂教学方法、抓好上机实践环节。此举有效地激发了学生的学习兴趣,提高学生的编程能力,同时也有助于提高教学质量和效果。  相似文献   
238.
随着新课程改革的逐步实施,人们逐渐意识到,在新课程环境下促使教师理念与行为的变革,将是课程改革取得成功的前提和保证。本文以新课程理念为指导,以地理课程的特殊性质和功能为基础,阐述了当代地理教师从事地理教育教学应该具备的专业技能,构建了基于新课程的地理教师专业结构。探讨在新课程标准下教师专业技能发展,对于改革师范教育,优化培养模式,加强教师队伍的现代化建设和提高质量具有重要意义。  相似文献   
239.
针对随机条件下动态规划模型的主要特点,运用智能算法混合编程理论,设计了一种探索多阶段决策问题的智能混合算法.该算法首先将问题转化成一族同类型的一步决策子问题,然后利用随机模拟和遗传算法,依据训练样本形成的训练神经元网络,在单步决策中寻求最优策略和最优目标值,逐个求解,再据初始状态逆序求出最优策略序列和最优目标值.仿真结果表明,该算法具有一定的通用性,初始设计点可以随机产生,其计算精度不因函数的非线性强弱而受影响,对目标和约束的限制较少,可应用于多种形式的随机多阶段决策优化问题,较好地满足了随机动态规划模型求解和优化的要求.  相似文献   
240.
We consider a scenario with two firms determining which products to develop and introduce to the market. In this problem, there exists a finite set of potential products and market segments. Each market segment has a preference list of products and will buy its most preferred product among those available. The firms play a Stackelberg game in which the leader firm first introduces a set of products, and the follower responds with its own set of products. The leader's goal is to maximize its profit subject to a product introduction budget, assuming that the follower will attempt to minimize the leader's profit using a budget of its own. We formulate this problem as a multistage integer program amenable to decomposition techniques. Using this formulation, we develop three variations of an exact mathematical programming method for solving the multistage problem, along with a family of heuristic procedures for estimating the follower solution. The efficacy of our approaches is demonstrated on randomly generated test instances. This article contributes to the operations research literature a multistage algorithm that directly addresses difficulties posed by degeneracy, and contributes to the product variety literature an exact optimization algorithm for a novel competitive product introduction problem. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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