全文获取类型
收费全文 | 226篇 |
免费 | 85篇 |
国内免费 | 18篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 7篇 |
2019年 | 5篇 |
2018年 | 1篇 |
2017年 | 13篇 |
2016年 | 17篇 |
2015年 | 15篇 |
2014年 | 18篇 |
2013年 | 15篇 |
2012年 | 13篇 |
2011年 | 11篇 |
2010年 | 10篇 |
2009年 | 23篇 |
2008年 | 17篇 |
2007年 | 20篇 |
2006年 | 24篇 |
2005年 | 13篇 |
2004年 | 17篇 |
2003年 | 8篇 |
2002年 | 6篇 |
2001年 | 10篇 |
2000年 | 8篇 |
1999年 | 4篇 |
1998年 | 4篇 |
1997年 | 6篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 6篇 |
1992年 | 4篇 |
1991年 | 5篇 |
1990年 | 9篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有329条查询结果,搜索用时 296 毫秒
231.
We consider the optimal wagers to be made by a gambler who starts with a given initial wealth. The gambler faces a sequence of two-outcome games, i.e., “win” vs. “lose,” and wishes to maximize the expected value of his terminal utility. It has been shown by Kelly, Bellman, and others that if the terminal utility is of the form log x, where x is the terminal wealth, then the optimal policy is myopic, i.e., the optimal wager is always to bet a constant fraction of the wealth provided that the probability of winning exceeds the probability of losing. In this paper we provide a critique of the simple logarithmic assumption for the utility of terminal wealth and solve the problem with a more general utility function. We show that in the general case, the optimal policy is not myopic, and we provide analytic expressions for optimal wager decisions in terms of the problem parameters. We also provide conditions under which the optimal policy reduces to the simple myopic case. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 639–654, 1997 相似文献
232.
建立了助推—滑翔式弹道中段的无量纲运动方程。采用非线性规划方法实现弹道优化。首先求解不同初始速度、速度倾角和最大升阻比的最大射程弹道,然后考虑驻点热流、过载约束,求解总气动加热最小和射程最大的最优弹道。基于前者的计算结果分析了初始条件对最大射程弹道的影响。将考虑约束的再入滑翔弹道与弹道式再入的特征参数比较,表明再入滑翔弹道的峰值热流较小,而总气动加热增加,但再入滑翔飞行时间在一般锥形体再入机动飞行器的热防护系统可承受的时间范围内。 相似文献
233.
分析了传统的统一调度下和电力市场环境下发电厂机组检修计划的不同,在此基础上提出不同于以往的检修计划方法。以检修费用、电价收益损失和违约金之和最小为目标函数,然后采用0-1整数规划的直接枚举法求解。最后通过算例论证了该方法的可行性。 相似文献
234.
专用字符集译码逻辑的程序优化设计 总被引:1,自引:0,他引:1
提出了一种组合逻辑译码电路优化设计的基本原则 ,给出了基于该优化设计原则的程序设计所涉及的关键数据结构和算法 ,并利用现有中小规模译码驱动电路 744 8系列芯片和门电路等实现了工程实践中需要的特殊字符集译码优化设计的参考电路 . 相似文献
235.
Joseph C. Hartman 《海军后勤学研究》2000,47(1):40-56
A generalized parallel replacement problem is considered with both fixed and variable replacement costs, capital budgeting, and demand constraints. The demand constraints specify that a number of assets, which may vary over time, are required each period over a finite horizon. A deterministic, integer programming formulation is presented as replacement decisions must be integer. However, the linear programming relaxation is shown to have integer extreme points if the economies of scale binary variables are fixed. This allows for the efficient computation of large parallel replacement problems as only a limited number of 0–1 variables are required. Examples are presented to provide insight into replacement rules, such as the “no‐splitting‐rule” from previous research, under various demand scenarios. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 40–56, 2000 相似文献
236.
通过一个计数器的分布对象设计及Orbix实现,阐明了先进的分布对象技术标准CORBA的核心概念以及符合CORBA2.0标准的中间件产品Orbix的分布对象设计和实现过程,通过计算比较并分析了Orbix在单机和网络分布环境下实现效率的差异,并提出了用单机模拟网络环境下分布对象实现效率的方法. 相似文献
237.
Patrick H. Liu 《海军后勤学研究》2000,47(6):479-499
This paper studies three tool replacement/operation sequencing strategies for a flexible manufacturing system over a finite time horizon: (1) failure replacement—replace the tool only upon failure, (2) optimal preventive tool replacement for a fixed sequence of operations, and (3) joint scheduling of the optimal preventive tool replacement times and the optimal sequence of operations. Stochastic dynamic decision models are used for strategies 2 and 3. The optimization criterion for strategies 2 and 3 is the minimization of the total expected cost over the finite time horizon. We will show through numerical studies that, with the same amount of information, the total expected costs can be reduced considerably by choosing an optimal strategy. Our conclusion is that in flexible manufacturing, optimal tool replacement and optimal operations sequencing are not separate issues. They should be considered jointly to minimize the expected total cost. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 479–499, 2000 相似文献
238.
在对潜搜索中,针对搜索兵力武器装备战技性能的优劣、指挥人员的军政素质的高低、水文气象条件的好坏等因素均会随着时间的推移而发生变化的特点,为了取得最佳的搜潜效果,需要根据时间变化给不同的作战单元分派不同的作战任务.将整数规划与灰色模型相结合,建立了对潜搜索的灰色整数规划模型,给出了检验方法和求解步骤,并举例分析说明.经验证,该模型精度等级较高,且能使各作战单元的搜索效率达到最佳,因此,可资对潜搜索兵力分配时借鉴. 相似文献
239.
240.
In hinterland container transportation the use of barges is getting more and more important. We propose a real‐life operational planning problem model from an inland terminal operating company, in which the number of containers shipped per barge is maximized and the number of terminals visited per barge is minimized. This problem is solved with an integer linear program (ILP), yielding strong cost reductions, about 20%, compared to the method used currently in practice. Besides, we develop a heuristic that solves the ILP in two stages. First, it decides for each barge which terminals to visit and second it assigns containers to the barges. This heuristic produces almost always optimal solutions and otherwise near‐optimal solutions. Moreover, the heuristic runs much faster than the ILP, especially for large‐sized instances. 相似文献