全文获取类型
收费全文 | 252篇 |
免费 | 94篇 |
国内免费 | 13篇 |
出版年
2023年 | 4篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 8篇 |
2019年 | 7篇 |
2018年 | 1篇 |
2017年 | 13篇 |
2016年 | 18篇 |
2015年 | 16篇 |
2014年 | 19篇 |
2013年 | 17篇 |
2012年 | 15篇 |
2011年 | 12篇 |
2010年 | 14篇 |
2009年 | 25篇 |
2008年 | 17篇 |
2007年 | 21篇 |
2006年 | 25篇 |
2005年 | 14篇 |
2004年 | 17篇 |
2003年 | 9篇 |
2002年 | 8篇 |
2001年 | 12篇 |
2000年 | 8篇 |
1999年 | 5篇 |
1998年 | 5篇 |
1997年 | 6篇 |
1996年 | 6篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 6篇 |
1992年 | 4篇 |
1991年 | 5篇 |
1990年 | 9篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有359条查询结果,搜索用时 15 毫秒
321.
322.
323.
参考高斯变异算子和柯西变异算子,提出了基于学生概率分布变异的进化规划算法。学生概率分布能够衔接高斯分布和柯西分布,其性能通过改变参数n来获得。通过仿真得到了学生概率分布变异的规律。仿真表明,基于学生概率分布变异的进化算法具有较好的性能。 相似文献
324.
Extended warranties provide “piece of mind” to a consumer in that product failures which occur after the base warranty expires are rectified at little or no cost. They also provide an additional source of revenue for manufacturers or third‐party providers, such as retailers or insurance providers, and help cultivate consumer loyalty. In this article, we analyze a number of extended warranty contracts which differ in design, including restrictions on deferrals and renewals. With the use of dynamic programming, we compute the optimal strategy for a consumer with perfect information and determine the optimal pricing policy for the provider given the consumer's risk characterization. We also provide insight into when different contracts should be issued. Finally, we illustrate how profits can be dramatically increased by offering menus of warranty contracts, as opposed to stand alone contracts, with the use of integer programming. Surprisingly, risk‐taking consumers provide the greatest benefit to offering menus. These insights can help a company develop a comprehensive warranty planning strategy for given products or product lines. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
325.
326.
信息中心网络(Information-Centric Networking, ICN)“泛在缓存”的特性,引发数据副本率过高、缓存空间不能充分利用等问题。为了解决上述问题,分别从用户、服务提供商和网络运营商的角度出发,以最小化网络流量与网络费用开销为优化目标建立两个单目标优化模型,并将二者结合为帕累托模型;基于帕累托求解方法中数学规划法的思想,详细描述缓存节点位置选择算法。仿真结果表明:在流量性价比方面,所提缓存节点选择算法优于ICN的默认缓存机制;在网络费用开销方面,所提算法更适用于只有少数内容较为流行的网络中,而在所有内容都流行的情况下,ICN中默认的“遍地缓存”机制更为适宜。 相似文献
327.
In this article, we present an algorithm for the valuation and optimal operation of natural gas storage facilities. Real options theory is used to derive nonlinear partial‐integro‐differential equations (PIDEs), the solution of which give both valuation and optimal operating strategies for these facilities. The equations are designed to incorporate a wide class of spot price models that can exhibit the same time‐dependent, mean‐reverting dynamics, and price spikes as those observed in most energy markets. Particular attention is paid to the operational characteristics of real storage units. These characteristics include working gas capacities, variable deliverability and injection rates, and cycling limitations. We illustrate the model with a numerical example of a salt cavern storage facility that clearly shows how a gas storage facility is like a financial straddle with both put and call properties. Depending on the amount of gas in storage the relative influence of the put and call components vary. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
328.
Dimitri P. Bertsekas 《海军后勤学研究》2019,66(1):15-37
In this article, we consider shortest path problems in a directed graph where the transitions between nodes are subject to uncertainty. We use a minimax formulation, where the objective is to guarantee that a special destination state is reached with a minimum cost path under the worst possible instance of the uncertainty. Problems of this type arise, among others, in planning and pursuit‐evasion contexts, and in model predictive control. Our analysis makes use of the recently developed theory of abstract semicontractive dynamic programming models. We investigate questions of existence and uniqueness of solution of the optimality equation, existence of optimal paths, and the validity of various algorithms patterned after the classical methods of value and policy iteration, as well as a Dijkstra‐like algorithm for problems with nonnegative arc lengths.© 2016 Wiley Periodicals, Inc. Naval Research Logistics 66:15–37, 2019 相似文献
329.
流体系结构技术发展探讨 总被引:1,自引:0,他引:1
以流计算模型为基础的流体系结构,是面向未来的单片上集成超10亿只晶体管和上千ALU时代的新型体系结构,正成为微处理器体系结构研究关注的前沿焦点之一.首先分析流计算的背景;总结现有的具有代表性的流体系结构,并对它们的结构、执行模式、并行性、片上存储使用方式和应用目标等方面进行了比较;然后归纳流程序设计及其环境,讨论当前流编译研究的热点方向;最后探讨流处理器设计的发展趋势. 相似文献
330.