全文获取类型
| 收费全文 | 324篇 |
| 免费 | 34篇 |
| 国内免费 | 4篇 |
专业分类
| 362篇 |
出版年
| 2025年 | 1篇 |
| 2024年 | 3篇 |
| 2022年 | 5篇 |
| 2021年 | 1篇 |
| 2020年 | 4篇 |
| 2019年 | 8篇 |
| 2018年 | 2篇 |
| 2017年 | 9篇 |
| 2016年 | 20篇 |
| 2015年 | 7篇 |
| 2014年 | 15篇 |
| 2013年 | 15篇 |
| 2012年 | 30篇 |
| 2011年 | 16篇 |
| 2010年 | 19篇 |
| 2009年 | 23篇 |
| 2008年 | 22篇 |
| 2007年 | 29篇 |
| 2006年 | 31篇 |
| 2005年 | 13篇 |
| 2004年 | 20篇 |
| 2003年 | 10篇 |
| 2002年 | 6篇 |
| 2001年 | 7篇 |
| 2000年 | 6篇 |
| 1999年 | 5篇 |
| 1998年 | 3篇 |
| 1997年 | 3篇 |
| 1996年 | 10篇 |
| 1995年 | 5篇 |
| 1994年 | 5篇 |
| 1992年 | 3篇 |
| 1991年 | 2篇 |
| 1990年 | 2篇 |
| 1989年 | 2篇 |
排序方式： 共有362条查询结果，搜索用时 0 毫秒
211.
本文研究了部分参数不确定的线性系统在有界能量噪声作用下的控制问题,即参数鲁棒性控制问题。具有准确模型的飞机在不准确气动参数信息条件下的飞行控制就是一个典型例子。我们先把它简化为一个带正参数的Ｈ∞控制问题,然后采用Ｊ无损分解方法,推导了调节问题的可解性条件和动态反馈控制器的全部显式通解。 相似文献
212.
研究不确定条件下的通信干扰任务分配优化问题具有重要的军事意义。基于干扰效益因子的概念,剖析了影响通信干扰任务分配的不确定性因素,建立了基于双层随机机会约束规划的通信干扰任务分配优化模型,设计了遗传蚁群智能算法,实例计算得到了通信干扰任务分配的最佳策略。 相似文献
213.
针对具有固定物品总和、多最优解特征的组合优化问题,以固定总和实数子集问题和购买鸡翅问题为例,给出了这类多最优解组合优化问题的形式化表示。在分析枚举等经典算法基础上,提出了基于整数状态表示和实数状态表示的0-1决策递归搜索多最优解动态规划算法。针对该算法在最优解数量较大时,时间复杂度趋向O(mn)的问题,提出了基于相同决策路径合并和基于0-x决策的两种改进算法。实验中两种改进算法的计算时间基本符合与O(nb+nm)的正比关系,表明对于这类多最优解组合优化问题具有良好的求解性能。 相似文献
214.
215.
216.
张先剑 《国防科技大学学报》2019,41(2):185-190
大规模作战具有高动态、非完全信息和不确定性,在分析归纳目前解决动态武器目标分配问题的一系列方法的基础上,尝试构建基于双方动态博弈的攻防对抗综合数学模型,并利用纳什均衡和帕累托最优算法进行分阶段求解。结果表明,该数学模型和博弈论方法结合能够有效解决武器目标动态分配问题。 相似文献
217.
This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm. 相似文献
218.
219.
We study a knapsack problem with an additional minimum filling constraint, such that the total weight of selected items cannot be less than a given threshold. The problem has several applications in shipping, e‐commerce, and transportation service procurement. When the threshold equals the knapsack capacity, even finding a feasible solution to the problem is NP‐hard. Therefore, we consider the case when the ratio α of threshold to capacity is less than 1. For this case, we develop an approximation scheme that returns a feasible solution with a total profit not less than (1 ‐ ε) times the total profit of an optimal solution for any ε > 0, and with a running time polynomial in the number of items, 1/ε, and 1/(1‐α). © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
220.
This article presents a flexible days‐on and days‐off scheduling problem and develops an exact branch and price (B&P) algorithm to find solutions. The main objective is to minimize the size of the total workforce required to cover time‐varying demand over a planning horizon that may extend up to 12 weeks. A new aspect of the problem is the general restriction that the number of consecutive days on and the number of consecutive days off must each fall within a predefined range. Moreover, the total assignment of working days in the planning horizon cannot exceed some maximum value. In the B&P framework, the master problem is stated as a set covering‐type problem whose columns are generated iteratively by solving one of three different subproblems. The first is an implicit model, the second is a resource constrained shortest path problem, and the third is a dynamic program. Computational experiments using both real‐word and randomly generated data show that workforce reductions up to 66% are possible with highly flexible days‐on and days‐off patterns. When evaluating the performance of the three subproblems, it was found that each yielded equivalent solutions but the dynamic program proved to be significantly more efficient. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 678–701, 2013 相似文献