全文获取类型
收费全文 | 686篇 |
免费 | 127篇 |
国内免费 | 14篇 |
出版年
2023年 | 4篇 |
2022年 | 6篇 |
2021年 | 11篇 |
2020年 | 14篇 |
2019年 | 32篇 |
2018年 | 17篇 |
2017年 | 53篇 |
2016年 | 50篇 |
2015年 | 38篇 |
2014年 | 44篇 |
2013年 | 107篇 |
2012年 | 37篇 |
2011年 | 43篇 |
2010年 | 40篇 |
2009年 | 41篇 |
2008年 | 33篇 |
2007年 | 48篇 |
2006年 | 34篇 |
2005年 | 29篇 |
2004年 | 33篇 |
2003年 | 19篇 |
2002年 | 22篇 |
2001年 | 20篇 |
2000年 | 21篇 |
1999年 | 7篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有827条查询结果,搜索用时 15 毫秒
71.
为了提高智能协同空战攻击决策算法性能,将变异策略引入到DPSO(Discrete Particle Swarm Optimization)协同空战攻击决策算法中,提出了一种新的基于变异离散粒子群(Mutation Discrete Particle Swarm Optimization,MDPSO)的协同空战攻击决策算法。基于典型空战想定背景,仿真验证了算法的有效性。采用对比实验方法,基于准确性、可靠性和快速性等关键性能指标,分析比较了基于MDPSO协同空战攻击决策算法与多种智能决策算法,验证了基于MDPSO的协同空战攻击决策算法有着较好的综合性能。 相似文献
72.
根据研究实际需求,本文基于作战能力评估理论对水下潜器自导搜索策略仿真平台进行了开发设计,并结合建立的多指标评估体系和相应的评估方法,借助均匀设计法,将其成功应用于水下潜器自导搜索策略的设计优化中。文中首先分析了仿真平台的系统需求,进而确定了其总体构架,并针对自导搜索策略研究的特点确定了相应的人机交互界面。最后给出了进行自导搜索策略仿真优化的基本思路和方法,并通过水下潜器最优自导搜索策略方案仿真研究的实例表明,本文设计的仿真平台和研究方法不仅完全能够满足水下潜器的自导搜索策略仿真研究需求,还能有效节省科研成本,具有重要的工程应用价值。 相似文献
73.
多星协同观测可以最大化卫星的整体效能,如何对多星进行部署是一个设计空间大、设计变量多的优化问题.对此,提出了基于Kriging模型的改进广义模式搜索算法.在算法的搜索步,通过代理模型最优和最大期望提高在当前网格内进行选点,避免选择的盲目性;在筛选步,利用代理模型预测筛选集中各点提高的比例并排序,减少不必要的仿真分析.最后,采用该算法对多星部署方案进行优化,通过对比发现,算法性能优于STK-Analyzer,证明了算法的可行性和有效性. 相似文献
74.
75.
This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
76.
We consider a make‐to‐order manufacturer facing random demand from two classes of customers. We develop an integrated model for reserving capacity in anticipation of future order arrivals from high priority customers and setting due dates for incoming orders. Our research exhibits two distinct features: (1) we explicitly model the manufacturer's uncertainty about the customers' due date preferences for future orders; and (2) we utilize a service level measure for reserving capacity rather than estimating short and long term implications of due date quoting with a penalty cost function. We identify an interesting effect (“t‐pooling”) that arises when the (partial) knowledge of customer due date preferences is utilized in making capacity reservation and order allocation decisions. We characterize the relationship between the customer due date preferences and the required reservation quantities and show that not considering the t‐pooling effect (as done in traditional capacity and inventory rationing literature) leads to excessive capacity reservations. Numerical analyses are conducted to investigate the behavior and performance of our capacity reservation and due date quoting approach in a dynamic setting with multiple planning horizons and roll‐overs. One interesting and seemingly counterintuitive finding of our analyses is that under certain conditions reserving capacity for high priority customers not only improves high priority fulfillment, but also increases the overall system fill rate. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
77.
冷战结束后,欧美多数军工企业在军转民的过程中采取多元化的经营战略,壮大企业规模并寻求进一步的发展。随着我国军民融合战略的深入实施,军工企业不再是封闭独立的单一军品生产基地,而是顺时应势逐步实现军品和民品同步多元化发展的战略转型。通过分析我国军工企业军转民的历史进程与国际经验,结合多元化战略的特点,考察军工企业在军转民过程中实施多元化战略的动因,构建军工企业多元化战略的选择函数。本文认为,军工企业选择多元化战略应考虑企业自身实际情况,积极响应国家政策,培育核心竞争力;同时,军转民过程作为军民融合深度发展的重要一环,会促使军工企业往多元化的方向发展,而多元化战略的实施也会加快军民融合深度发展的进程。 相似文献
78.
79.
In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017 相似文献
80.
The nucleolus solution for cooperative games in characteristic function form is usually computed numerically by solving a sequence of linear programing (LP) problems, or by solving a single, but very large‐scale, LP problem. This article proposes an algebraic method to compute the nucleolus solution analytically (i.e., in closed‐form) for a three‐player cooperative game in characteristic function form. We first consider cooperative games with empty core and derive a formula to compute the nucleolus solution. Next, we examine cooperative games with nonempty core and calculate the nucleolus solution analytically for five possible cases arising from the relationship among the value functions of different coalitions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献