全文获取类型
| 收费全文 | 265篇 |
| 免费 | 16篇 |
| 国内免费 | 2篇 |
专业分类
| 283篇 |
出版年
| 2025年 | 4篇 |
| 2024年 | 4篇 |
| 2023年 | 6篇 |
| 2022年 | 4篇 |
| 2021年 | 6篇 |
| 2020年 | 3篇 |
| 2019年 | 2篇 |
| 2018年 | 4篇 |
| 2017年 | 8篇 |
| 2016年 | 20篇 |
| 2015年 | 13篇 |
| 2014年 | 20篇 |
| 2013年 | 21篇 |
| 2012年 | 19篇 |
| 2011年 | 23篇 |
| 2010年 | 12篇 |
| 2009年 | 10篇 |
| 2008年 | 10篇 |
| 2007年 | 13篇 |
| 2006年 | 11篇 |
| 2005年 | 14篇 |
| 2004年 | 6篇 |
| 2003年 | 3篇 |
| 2002年 | 3篇 |
| 2001年 | 1篇 |
| 2000年 | 8篇 |
| 1999年 | 4篇 |
| 1998年 | 11篇 |
| 1997年 | 6篇 |
| 1996年 | 5篇 |
| 1995年 | 3篇 |
| 1992年 | 2篇 |
| 1991年 | 2篇 |
| 1990年 | 2篇 |
排序方式： 共有283条查询结果，搜索用时 15 毫秒
241.
Steven J. Childs 《Defense & Security Analysis》2012,28(4):343-359
With the burgeoning influence of emerging markets in Asia, a tectonic shift is taking place in the global security landscape. Asian states are concomitantly arming as their economic clout grows. In light of these developments, security analysts would benefit from a formal means of placing these arms acquisitions in a structural context. Are arms acquisitions on par with the expectations of Asian states, given their structural dispositions, or are recent acquisitions beyond anticipated levels? By using a dynamic panel regression of 187 states from 1950 to 2011, this research predicts arms import volume using the degree of interstate arms linkages, the size of a state's military, and its level of economic development. The technique offers analysts a formal means of distinguishing orthodox behavior in importing conventional weapons from extraneous security motivations. The article concludes by generating near-term forecasts of Asian arms imports and discussing the implications of the technique. 相似文献
242.
神经网络的应用是神经网络研究的三大主要领域之一。神经网络的应用与其所具备的能力是紧密相关的。本文中,我们从介绍神经网络的基本能力开始,概括地介绍了当前的神经网络主要应用领域。并从神经网络的能力出发,讨论了神经网络的潜在的应用领域。 相似文献
243.
基于复杂网络的武器装备重要度评估方法 总被引：2，自引：0，他引：2
针对现有武器装备重要度评估方法存在的缺点和不足,基于复杂网络中改进的节点重要度评估指标和方法,建立了武器装备重要度评估模型。该方法不仅描述了武器装备在装备体系中的重要程度,也反映了武器装备失效后的修复情况。最后通过一评估示例,说明了方法的有效性和适应性。 相似文献
244.
针对多目标网络中重心的抽象性及不易打击的特点,分析影响重心的关键要素及其依赖关系,提出了基于改进网络分析法的多目标网络重心模型,利用该模型分析目标相对于重心的重要度。研究了该模型涉及的两个关键技术,即改进判断矩阵以提高决策的速度和克服决策的主观性,利用协调理论确定要素之间的依赖关系。以分析某地区多目标网络的过程为例,验证了该模型的有效性和合理性。 相似文献
245.
Mustapha Bouhtou Alexander Grigoriev Stan van Hoesel Anton F. van der Kraaij Frits C.R. Spieksma Marc Uetz 《海军后勤学研究》2007,54(4):411-420
We consider a pricing problem in directed, uncapacitated networks. Tariffs must be defined by an operator, the leader, for a subset of m arcs, the tariff arcs. Costs of all other arcs in the network are assumed to be given. There are n clients, the followers, and after the tariffs have been determined, the clients route their demands independent of each other on paths with minimal total cost. The problem is to find tariffs that maximize the operator's revenue. Motivated by applications in telecommunication networks, we consider a restricted version of this problem, assuming that each client utilizes at most one of the operator's tariff arcs. The problem is equivalent to pricing bridges that clients can use in order to cross a river. We prove that this problem is APX‐hard. Moreover, we analyze the effect of uniform pricing, proving that it yields both an m approximation and a (1 + lnD)‐approximation. Here, D is upper bounded by the total demand of all clients. In addition, we consider the problem under the additional restriction that the operator must not reject any of the clients. We prove that this problem does not admit approximation algorithms with any reasonable performance guarantee, unless P = NP, and we prove the existence of an n‐approximation algorithm. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
246.
Designing Code Division Multiple Access networks includes determining optimal locations of radio towers and assigning customer markets to the towers. In this paper, we describe a deterministic model for tower location and a stochastic model to optimize revenue given a set of constructed towers. We integrate these models in a stochastic integer programming problem with simple recourse that optimizes the location of towers under demand uncertainty. We develop algorithms using Benders' reformulation, and we provide computational results. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
247.
John S. Hollywood 《海军后勤学研究》2005,52(6):590-605
We develop an approximate planning model for a distributed computing network in which a control system oversees the assignment of information flows and tasks to a pool of shared computers, and describe several optimization applications using the model. We assume that the computers are multithreaded, and have differing architectures leading to varying and inconsistent processing rates. The model is based on a discrete‐time, continuous flow model developed by Graves [Oper Res 34 (1986), 522–533] which provides the steady‐state moments of production and work‐in‐queue quantities. We make several extensions to Graves' model to represent distributed computing networks. First, we approximately model control rules that are nonlinear functions of the work‐in‐queue at multiple stations through a linearization approach. Second, we introduce an additional noise term on production and show its use in modeling the discretization of jobs. Third, we model groups of heterogeneous computers as aggregate, “virtual computing cells” that process multiple tasks simultaneously, using a judiciously selected control rule. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
248.
We study the problem of recovering a production plan after a disruption, where the disruption may be caused by incidents such as power failure, market change, machine breakdown, supply shortage, worker no‐show, and others. The new recovery plan we seek after has to not only suit the changed environment brought about by the disruption, but also be close to the initial plan so as not to cause too much customer unsatisfaction or inconvenience for current‐stage and downstream operations. For the general‐cost case, we propose a dynamic programming method for the problem. For the convex‐cost case, a general problem which involves both cost and demand disruptions can be solved by considering the cost disruption first and then the demand disruption. We find that a pure demand disruption is easy to handle; and for a pure cost disruption, we propose a greedy method which is provably efficient. Our computational studies also reveal insights that will be helpful to managing disruptions in production planning. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
249.
In this article, we study deterministic dynamic lot‐sizing problems with a service‐level constraint on the total number of periods in which backlogs can occur over a finite planning horizon. We give a natural mixed integer programming formulation for the single item problem (LS‐SL‐I) and study the structure of its solution. We show that an optimal solution to this problem can be found in begin{align*}mathcal O(n^2kappa)end{align*} time, where n is the planning horizon and begin{align*}kappa=mathcal O(n)end{align*} is the maximum number of periods in which demand can be backlogged. Using the proposed shortest path algorithms, we develop alternative tight extended formulations for LS‐SL‐I and one of its relaxations, which we refer to as uncapacitated lot sizing with setups for stocks and backlogs. {We show that this relaxation also appears as a substructure in a lot‐sizing problem which limits the total amount of a period's demand met from a later period, across all periods.} We report computational results that compare the natural and extended formulations on multi‐item service‐level constrained instances. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
250.