全文获取类型
收费全文 | 247篇 |
免费 | 85篇 |
国内免费 | 29篇 |
出版年
2024年 | 4篇 |
2023年 | 3篇 |
2022年 | 7篇 |
2021年 | 5篇 |
2020年 | 4篇 |
2019年 | 5篇 |
2018年 | 5篇 |
2017年 | 13篇 |
2016年 | 20篇 |
2015年 | 14篇 |
2014年 | 26篇 |
2013年 | 26篇 |
2012年 | 25篇 |
2011年 | 25篇 |
2010年 | 15篇 |
2009年 | 16篇 |
2008年 | 14篇 |
2007年 | 23篇 |
2006年 | 13篇 |
2005年 | 15篇 |
2004年 | 12篇 |
2003年 | 7篇 |
2002年 | 5篇 |
2001年 | 7篇 |
2000年 | 11篇 |
1999年 | 6篇 |
1998年 | 10篇 |
1997年 | 7篇 |
1996年 | 7篇 |
1995年 | 4篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 2篇 |
排序方式: 共有361条查询结果,搜索用时 15 毫秒
311.
Andreas S. Andreou 《Defence and Peace Economics》2013,24(4):459-469
This paper looks into the Greek–Turkish arms race a decade after an earlier contribution to the issue that relied heavily on artificial neural networks. The time period between the two papers contributes to the reliability of the results derived, not just by increasing the number of observations, but also mainly by incorporating the progress made in the realm of artificial intelligence. The focus on the case of both countries unlike the paper mentioned above that dealt with just the Greek side provides ample room for comparative purposes regarding the determinants of defense expenditure on both sides. The results derived in terms of input significance estimation support the findings of the earlier research as indicated above, pointing to the leading role of the demographic preponderance of Turkey over Greece. The paper also points to the fact that 10 years later, Turkey continues to set the arms race rules against its rival by determining the defense expenditure of Greece, whereas the role of the latter in affecting the military spending of Turkey is non‐existent. 相似文献
312.
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^2\kappa)\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 相似文献
313.
We introduce an optimal stopping problem for selling an asset when the fixed but unknown distribution of successive offers is from one of n possible distributions. The initial probabilities as to which is the true distribution are given and updated in a Bayesian manner as the successive offers are observed. After receiving an offer, the seller has to decide whether to accept the offer or continue to observe the next offer. Each time an offer is observed a fixed cost is incurred. We consider both the cases where recalling a past offer is allowed and where it is not allowed. For each case, a dynamic programming model and some heuristic policies are presented. Using simulation, the performances of the heuristic methods are evaluated and upper bounds on the optimal expected return are obtained. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
314.
315.
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 相似文献
316.
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 相似文献
317.
卡尔曼滤波器对线性高斯滤波问题能提供最优解, 而对目标运动模型、观测方程等要求的非线性就不再适合,提出了一种机动目标自适应非线性粒子滤波算法-" 粒子滤波器"(Particle Filters PF)法, 这种方法不受线性化误差和高斯噪声假定的限制,适用于任何状态转换或测量模型, 分析比较了粒子滤波(PF)与扩展卡尔曼滤波算法(EKF) 的滤波精度、运算量等方面指标.给出了基于典型非线性模型的算法仿真, 仿真结果表明粒子滤波新方法优于EKF对机动目标跟踪. 相似文献
318.
J. Atsu Amegashie 《Defence and Peace Economics》2014,25(4):381-400
I study a two-period model of conflict with two combatants and a third party who is an ally of one of the combatants. The third party is fully informed about the type of her ally but not about the type of her ally’s enemy. In a signaling game, I find that if the third party is unable to give a sufficiently high assistance to her ally, then there exists a unique separating equilibrium in which the third party’s expected intervention causes her ally’s enemy to exert more effort than in the absence of third-party intervention; this worsens the conflict. 相似文献
319.
针对多目标网络中重心的抽象性及不易打击的特点,分析影响重心的关键要素及其依赖关系,提出了基于改进网络分析法的多目标网络重心模型,利用该模型分析目标相对于重心的重要度。研究了该模型涉及的两个关键技术,即改进判断矩阵以提高决策的速度和克服决策的主观性,利用协调理论确定要素之间的依赖关系。以分析某地区多目标网络的过程为例,验证了该模型的有效性和合理性。 相似文献
320.
随着互联网对现实世界的影响越来越大,战略地位越来越突出,获得网络主导权、占据网络制高点成为各国竞相努力的目标。美国在全球网络管理、网络技术、网络文化、网络军事等方面处于霸主地位。美国网络霸权对中国的政治安全、信息安全、文化安全、军事安全造成了极大的威胁。中国应综合采取各种措施,应对美国网络霸权的冲击和挑战,维护国家安全和利益。 相似文献