首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   145篇
  免费   50篇
  国内免费   7篇
  2023年   1篇
  2022年   2篇
  2021年   1篇
  2020年   8篇
  2019年   7篇
  2018年   2篇
  2017年   12篇
  2016年   7篇
  2015年   8篇
  2014年   8篇
  2013年   14篇
  2012年   13篇
  2011年   5篇
  2010年   6篇
  2009年   11篇
  2008年   5篇
  2007年   6篇
  2006年   10篇
  2005年   8篇
  2004年   9篇
  2003年   8篇
  2002年   2篇
  2001年   7篇
  2000年   7篇
  1999年   5篇
  1998年   2篇
  1997年   5篇
  1996年   2篇
  1995年   1篇
  1994年   2篇
  1993年   1篇
  1992年   7篇
  1991年   3篇
  1990年   4篇
  1989年   3篇
排序方式: 共有202条查询结果,搜索用时 500 毫秒
151.
在填写"建立计量标准技术报告"时,要求报告中所涉及的内容要准确、可靠,对所测的数据及实验结果要实事求是。其重要目的是应根据分析结果直接判断计量标准是否符合国家检定系统表和国家计量检定规程的要求,做出计量标准是否可以开展所申请项目的检定校准工作的结论。就不确定度的评定做了详尽的分析,并给出了相应的算法。  相似文献   
152.
对计算流体力学(CFD)程序CNS提出一种Offload模式下基于内外子区域划分的异构并行算法,结合结构化网格下有限差分计算和四阶龙格库塔方法的特点,引入ghost网格点区域,设计了一种ghost区域收缩计算策略,显著降低了异构计算资源之间的数据传输开销,负载均衡时CPU端的计算与MPI通信完全和加速器端的计算重叠,提高了异构协同并行性。推导了保证计算正确性的ghost区域的参数,分析了负载均衡的条件。在“CPU(Intel Haswell Xeon E5-2670 12 cores ×2)+加速器(Xeon Phi 7120A ×2)”的服务器上测得该算法较直接将任务子块整体迁至加速器端计算的异构算法性能平均提升5.9倍,较MPI/OpenMP两级并行算法使用24个纯CPU核的性能,该算法使用单加速器时加速1.27倍,使用双加速器加速1.45倍。讨论和分析了性能瓶颈与存在的问题。  相似文献   
153.
This article provides conditions under which total‐cost and average‐cost Markov decision processes (MDPs) can be reduced to discounted ones. Results are given for transient total‐cost MDPs with transition rates whose values may be greater than one, as well as for average‐cost MDPs with transition probabilities satisfying the condition that there is a state such that the expected time to reach it is uniformly bounded for all initial states and stationary policies. In particular, these reductions imply sufficient conditions for the validity of optimality equations and the existence of stationary optimal policies for MDPs with undiscounted total cost and average‐cost criteria. When the state and action sets are finite, these reductions lead to linear programming formulations and complexity estimates for MDPs under the aforementioned criteria.© 2017 Wiley Periodicals, Inc. Naval Research Logistics 66:38–56, 2019  相似文献   
154.
This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm.  相似文献   
155.
We present a new deterministic linear program for the network revenue management problem with customer choice behavior. The novel aspect of our linear program is that it naturally generates bid prices that depend on how much time is left until the time of departure. Similar to the earlier linear program used by van Ryzin and Liu (2004), the optimal objective value of our linear program provides an upper bound on the optimal total expected revenue over the planning horizon. In addition, the percent gap between the optimal objective value of our linear program and the optimal total expected revenue diminishes in an asymptotic regime where the leg capacities and the number of time periods in the planning horizon increase linearly with the same rate. Computational experiments indicate that when compared with the linear program that appears in the existing literature, our linear program can provide tighter upper bounds, and the control policies that are based on our linear program can obtain higher total expected revenues. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
156.
Decision-making in defense acquisition programs in the Republic of Korea (ROK) has been problematic, especially in highly advanced complex systems. The highly disputed force modernization program for the ROK Air Force’s fifth-generation fighter, dubbed the Fighter eXperiment, went through extreme turbulence during the type selection phase. The gist of the turbulence became evident through poor institutional coordination within the defense acquisition authorities that eventually forced them to rescind the decision generated from their own yearlong efforts, thus basically shooting themselves on the foot. The paper highlights the background of the program and reviews the institutional elements that influenced the decision-making process, and conclude that the absence of an effective coordination mechanism has made decision-making in complex defense programs even more troublesome.  相似文献   
157.
We present a time decomposition for inventory routing problems. The methodology is based on valuing inventory with a concave piecewise linear function and then combining solutions to single‐period subproblems using dynamic programming techniques. Computational experiments show that the resulting value function accurately captures the inventory's value, and solving the multiperiod problem as a sequence of single‐period subproblems drastically decreases computational time without sacrificing solution quality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   
158.
针对在混响声场发动机辐射噪声识别困难的问题,提出用统计能量分析法对船艇机舱发动机进行噪声源分析。建立了机舱发动机噪声源识别模型,计算了发动机各表面的辐射声功率大小及频率特性。应用表面振动测量法对机舱发动机各表面辐射噪声进行识别,其结果与统计能量分析法的对比表明:统计能量分析法考虑声场的反射和叠加,能更好地识别复杂声场环境下发动机辐射噪声。  相似文献   
159.
通过分析牛顿环实验的系统误差,给出了用牛顿环测量曲率半径实验时条纹级数的取值范围.  相似文献   
160.
多自治空间数据源的k邻近查询处理   总被引:1,自引:0,他引:1       下载免费PDF全文
多自治空间数据源的k邻近查询处理在空间信息领域具有广泛的应用。综合分析比较现有的查询处理算法,研究并提出了多自治空间数据源环境下k邻近查询处理框架及其实现算法。实验结果表明,所提出的算法能有效地减少k邻近查询处理系统的数据传输量,减少了系统响应时间。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号