全文获取类型
收费全文 | 241篇 |
免费 | 62篇 |
国内免费 | 16篇 |
出版年
2024年 | 1篇 |
2023年 | 4篇 |
2022年 | 4篇 |
2021年 | 4篇 |
2020年 | 7篇 |
2019年 | 6篇 |
2018年 | 6篇 |
2017年 | 18篇 |
2016年 | 24篇 |
2015年 | 16篇 |
2014年 | 29篇 |
2013年 | 22篇 |
2012年 | 25篇 |
2011年 | 17篇 |
2010年 | 12篇 |
2009年 | 22篇 |
2008年 | 17篇 |
2007年 | 17篇 |
2006年 | 20篇 |
2005年 | 10篇 |
2004年 | 9篇 |
2003年 | 6篇 |
2002年 | 5篇 |
2001年 | 6篇 |
2000年 | 1篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 2篇 |
排序方式: 共有319条查询结果,搜索用时 296 毫秒
11.
Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
12.
区域防空导弹反导火力分配研究 总被引:1,自引:0,他引:1
分析了传统防空导弹火力分配模型的不足,考虑到编队内各舰艇近程防空作战能力的不同,结合装备性能特点,建立了基于机会约束规划的区域防空导弹火力分配优化模型。给出了基于遗传算法和BP神经网络的混合智能算法,该算法在精度和速度上均能满足防空作战的要求。 相似文献
13.
We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation. 相似文献
14.
15.
16.
Eyal Pecht 《Defence and Peace Economics》2017,28(3):367-399
This study develops a dynamic model that integrates military intelligence into the defense capability of the country and the optimal allocation of its government budget. We assert that the effectiveness of the country’s military intelligence is contingent on the quality of its human capital, which, in turn, implies a long-term positive relationship between the government’s various civilian expenditures and its capacity to achieve a cost-effective intelligence and, hence, military capability. This relationship is developed within a multiple-period arms race model between two rivals. Using this model and stylized data for the Israeli–Syrian arms race, we show that an appropriate budget shift from defense to civilian expenditures during the initial periods of the planning horizon will gradually (over a decade, say) increase the quality of human capital in the country and, thus, the effectiveness of its intelligence, which, in turn, will increase the country’s future security and welfare. 相似文献
17.
对两台船舶主柴油机润滑油进行了长期监测,应用原子发射光谱仪对采集的36个油样进行了测试。采用基于熵权法的模糊综合评价对各元素进行了权重赋值,并依据权重选取11个元素中的5个主要作用元素进行了数据综合评价,按照正常、注意、警告、异常4个状态对装备磨损状态进行了分类。研究结果表明:所提出的油液原子发射光谱数据综合评价方法能够客观、准确地获取装备磨损状态,其评价结果与实际磨损状态相符,为装备的使用与维护提供了有效的技术依据。 相似文献
18.
19.
A learning tabu search for a truck allocation problem with linear and nonlinear cost components 下载免费PDF全文
The two‐level problem studied in this article consists of optimizing the refueling costs of a fleet of locomotives over a railway network. The goal consists of determining: (1) the number of refueling trucks contracted for each yard (truck assignment problem denoted TAP) and (2) the refueling plan of each locomotive (fuel distribution problem denoted FDP). As the FDP can be solved efficiently with existing methods, the focus is put on the TAP only. In a first version of the problem (denoted (P1)), various linear costs (e.g., fuel, fixed cost associated with each refueling, weekly operating costs of trucks) have to be minimized while satisfying a set of constraints (e.g., limited capacities of the locomotives and the trucks). In contrast with the existing literature on this problem, two types of nonlinear cost components will also be considered, based on the following ideas: (1) if several trucks from the same fuel supplier are contracted for the same yard, the supplier is likely to propose discounted prices for that yard (Problem (P2)); (2) if a train stops too often on its route, a penalty is incurred, which represents the dissatisfaction of the clients (Problem (P3)). Even if exact methods based on a mixed integer linear program formulation are available for (P1), they are not appropriate anymore to tackle (P2) and (P3). Various methods are proposed for the TAP: a descent local search, a tabu search, and a learning tabu search (LTS). The latter is a new type of local search algorithm. It involves a learning process relying on a trail system, and it can be applied to any combinatorial optimization problem. Results are reported and discussed for a large set of instances (for (P1), (P2), and (P3)), and show the good performance of LTS. © 2014 Wiley Periodicals, Inc. 62:32–45, 2015 相似文献
20.