全文获取类型
收费全文 | 6185篇 |
免费 | 101篇 |
国内免费 | 61篇 |
专业分类
6347篇 |
出版年
2025年 | 15篇 |
2024年 | 21篇 |
2023年 | 51篇 |
2022年 | 42篇 |
2021年 | 70篇 |
2020年 | 56篇 |
2019年 | 106篇 |
2018年 | 83篇 |
2017年 | 189篇 |
2016年 | 235篇 |
2015年 | 142篇 |
2014年 | 354篇 |
2013年 | 404篇 |
2012年 | 325篇 |
2011年 | 384篇 |
2010年 | 298篇 |
2009年 | 387篇 |
2008年 | 325篇 |
2007年 | 348篇 |
2006年 | 368篇 |
2005年 | 342篇 |
2004年 | 305篇 |
2003年 | 229篇 |
2002年 | 179篇 |
2001年 | 174篇 |
2000年 | 120篇 |
1999年 | 125篇 |
1998年 | 101篇 |
1997年 | 91篇 |
1996年 | 85篇 |
1995年 | 66篇 |
1994年 | 75篇 |
1993年 | 54篇 |
1992年 | 58篇 |
1991年 | 52篇 |
1990年 | 48篇 |
1989年 | 23篇 |
1988年 | 13篇 |
1987年 | 3篇 |
1975年 | 1篇 |
排序方式: 共有6347条查询结果,搜索用时 0 毫秒
991.
为探索信息化作战中指挥控制关键因素,提出改进作战指挥体制的对策措施,采用系统动力学理论,对协同决策的结构、参与者和信息反馈关系等关键因素进行了分析,在此基础上构建了基于系统动力学的协同决策模型并进行了模拟仿真。结果表明,增加指挥控制机构之间的信息共享可以有效提升协同决策的效率,为建立协同决策指挥控制体制提供了借鉴意义。 相似文献
992.
Finding all nondominated vectors for multi‐objective combinatorial optimization (MOCO) problems is computationally very hard in general. We approximate the nondominated frontiers of MOCO problems by fitting smooth hypersurfaces. For a given problem, we fit the hypersurface using a single nondominated reference vector. We experiment with different types of MOCO problems and demonstrate that in all cases the fitted hypersurfaces approximate all nondominated vectors well. We discuss that such an approximation is useful to find the neighborhood of preferred regions of the nondominated vectors with very little computational effort. Further computational effort can then be spent in the identified region to find the actual nondominated vectors the decision maker will prefer. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
993.
Todas information and communication network requires a design that is secure to tampering. Traditional performance measures of reliability and throughput must be supplemented with measures of security. Recognition of an adversary who can inflict damage leads toward a game‐theoretic model. Through such a formulation, guidelines for network designs and improvements are derived. We opt for a design that is most robust to withstand both natural degradation and adversarial attacks. Extensive computational experience with such a model suggests that a Nash‐equilibrium design exists that can withstand the worst possible damage. Most important, the equilibrium is value‐free in that it is stable irrespective of the unit costs associated with reliability vs. capacity improvement and how one wishes to trade between throughput and reliability. This finding helps to pinpoint the most critical components in network design. From a policy standpoint, the model also allows the monetary value of information‐security to be imputed. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
994.
995.
996.
An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
997.
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 相似文献
998.
武器系统采购费与维修费权衡的依据分析 总被引:4,自引:2,他引:2
根据武器系统寿命周期费用的理论和方法,建立了系统的费用模型,依据数学分析和优化理论,在已知可用武器系统目标数的前提下,建立了费用优化条件,确定了采购费与维修费的比例限值,用以确定武器系统采购费和维修费的最优比例,从而对系统方案确定的权衡分析提供量化依据. 相似文献
999.
1000.