全文获取类型
收费全文 | 453篇 |
免费 | 231篇 |
国内免费 | 52篇 |
出版年
2024年 | 6篇 |
2023年 | 9篇 |
2022年 | 13篇 |
2021年 | 10篇 |
2020年 | 18篇 |
2019年 | 17篇 |
2018年 | 11篇 |
2017年 | 39篇 |
2016年 | 51篇 |
2015年 | 26篇 |
2014年 | 54篇 |
2013年 | 30篇 |
2012年 | 52篇 |
2011年 | 46篇 |
2010年 | 31篇 |
2009年 | 50篇 |
2008年 | 31篇 |
2007年 | 27篇 |
2006年 | 52篇 |
2005年 | 35篇 |
2004年 | 21篇 |
2003年 | 15篇 |
2002年 | 15篇 |
2001年 | 10篇 |
2000年 | 8篇 |
1999年 | 12篇 |
1998年 | 10篇 |
1997年 | 1篇 |
1996年 | 6篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1990年 | 5篇 |
1989年 | 5篇 |
排序方式: 共有736条查询结果,搜索用时 15 毫秒
621.
介绍了C2组织的信息交互结构及其设计约束,讨论了C2组织鲁棒性信息交互结构的设计问题。提出了基于启发式嵌套遗传算法的鲁棒性信息交互结构设计方法:外层遗传算法对信息交互结构的拓扑及链路容量进行优化搜索;内层嵌套遗传算法依据对路由的搜索优化出多个使命邻域下最小延时集合,将其依概率平均化后返回外层来对链路容量的鲁棒性进行评价。案例分析和对比试验表明该方法可以实现鲁棒性较强的组织信息交互结构。 相似文献
622.
We present, analyze, and compare three random search methods for solving stochastic optimization problems with uncountable feasible regions. Our adaptive search with resampling (ASR) approach is a framework for designing provably convergent algorithms that are adaptive and may consequently involve local search. The deterministic and stochastic shrinking ball (DSB and SSB) approaches are also convergent, but they are based on pure random search with the only difference being the estimator of the optimal solution [the DSB method was originally proposed and analyzed by Baumert and Smith]. The three methods use different techniques to reduce the effects of noise in the estimated objective function values. Our ASR method achieves this goal through resampling of already sampled points, whereas the DSB and SSB approaches address it by averaging observations in balls that shrink with time. We present conditions under which the three methods are convergent, both in probability and almost surely, and provide a limited computational study aimed at comparing the methods. Although further investigation is needed, our numerical results suggest that the ASR approach is promising, especially for difficult problems where the probability of identifying good solutions using pure random search is small. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
623.
Covering models assume that a point is covered if it is within a certain distance from a facility and not covered beyond that distance. In gradual cover models it is assumed that a point is fully covered within a given distance from a facility, then cover gradually declines, and the point is not covered beyond a larger distance. Gradual cover models address the discontinuity in cover which may not be the correct approach in many situations. In the stochastic gradual cover model presented in this article it is assumed that the short and long distances employed in gradual cover models are random variables. This refinement of gradual cover models provides yet a more realistic depiction of actual behavior in many situations. The maximal cover model based on the new concept is analyzed and the single facility location cover problem in the plane is solved. Computational results illustrating the effectiveness of the solution procedures are presented. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
624.
为对天地测控资源调度进行高效求解,设计了两阶段递进遗传算法对其进行优化调度。鉴于问题的目标具有一定的可分性,以时间为依据将被调度弧段划分成两个部分,在对第一部分形成种群并作进化求解的基础上,将其最优解与第二部分弧段组合,并作进一步的进化求解。为了缓解两阶段优化的局部搜索特性,在第一阶段个体适应度计算中,以一定概率设定虚拟弧段,保留具有潜在全局优势的个体。仿真表明该方法能在确保求解质量的前提下明显减少运算时间。 相似文献
625.
在对模拟退火遗传算法改进的基础上,结合建立的通信装备维修资源分配模型,给出了该算法的实现过程,并利用此算法对模型进行了最优化求解。实例的计算结果表明该算法对于模型的求解具有较好的收敛性。 相似文献
626.
维修保障费用是影响装甲装备使用可用度的重要因素之一。要在有限的保障经费下实现高可用度要求,就必须建立装甲装备的使用可用度与维修保障费用的优化模型。根据装甲装备实际维修特点,在分析装甲装备预防性维修过程中故障类型多样的基础上,构建了装甲装备在给定维修周期内的使用可用度模型和维修保障费用模型,进而建立了使用可用度与维修保障费用的优化模型,提出了模型的解法和模型的改进建议。 相似文献
627.
This article develops a mathematical model and heuristic algorithm to design recreational boating mooring fields. The boating industry is important to the Florida economy, and boat storage is becoming a concern among those in the industry. The mooring field design problem is formulated to maximize the total number of boat feet moored in the mooring field. In the model, we allow two adjacent moorings to overlap, which introduces a risk that under certain conditions the boats on these moorings could contact each other. We identify the conditions when contact is possible and quantify the probability of contact. The mooring field design problem is formulated as a nonlinear mixed‐integer programming problem. To solve the problem, we decompose it into two separate models, a mooring radii assignment model and a mooring layout model, which are solved sequentially. The first is solved via exhaustive enumeration and the second via a depth‐first search algorithm. Two actual mooring fields are evaluated, and in both cases our model leads to better layouts than ones experts developed manually. The mooring field design model rationalizes the mooring field design and shows that in one case by increasing the risk from 0 to 1%, the mooring efficiency increases from 74.8% to 96.2%. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
628.
629.
基于所提出的火力分配方案,使用数值积分方法将对均匀分布集群目标射击的火力分配优化问题转化为由多变量初等函数表示的积分和函数在单位多面正方体内的最小值求解问题,火力分配优化的瞄准点坐标可以尝试利用成熟的Matlab优化计算软件来直接求解,算例说明所给出方法对于火力分配优化问题的深入研究是有裨益的. 相似文献
630.