首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   574篇
  免费   5篇
  国内免费   7篇
  2021年   14篇
  2020年   8篇
  2019年   4篇
  2017年   11篇
  2016年   10篇
  2015年   15篇
  2014年   11篇
  2013年   61篇
  2012年   32篇
  2011年   40篇
  2010年   30篇
  2009年   27篇
  2008年   38篇
  2007年   23篇
  2006年   22篇
  2005年   15篇
  2004年   12篇
  2003年   3篇
  2002年   3篇
  2001年   7篇
  2000年   4篇
  1998年   6篇
  1997年   6篇
  1995年   5篇
  1994年   4篇
  1993年   10篇
  1992年   7篇
  1991年   6篇
  1989年   12篇
  1988年   3篇
  1987年   10篇
  1986年   10篇
  1985年   7篇
  1983年   5篇
  1982年   5篇
  1981年   8篇
  1980年   9篇
  1979年   11篇
  1978年   4篇
  1977年   6篇
  1976年   7篇
  1975年   7篇
  1974年   2篇
  1973年   2篇
  1972年   12篇
  1971年   3篇
  1970年   3篇
  1969年   9篇
  1968年   7篇
  1966年   3篇
排序方式: 共有586条查询结果,搜索用时 296 毫秒
131.
Renewal theory is used to study the effectiveness of a class of continuous sampling plans first introduced by Dodge. This approach provides a simple way of viewing and computing the long-run Average Outgoing Quality (AOQ) and its maximum AOQL. More importantly, it is used to study the average outgoing quality in a short production run through an approximation formula AOQ*(t). Formulas for AOQ and AOQ*(t) are provided. By simulation, it is found that AOQ*(t) is sufficiently accurate in situations corresponding to actual practice.  相似文献   
132.
We investigate the quality of local search heuristics for the scheduling problem of minimizing the makespan on identical parallel machines. We study exponential size neighborhoods (whose size grows exponentially with the input length) that can be searched in polynomial time, and we derive worst‐case approximation guarantees for the local optima of such neighborhoods. The so‐called split neighborhood splits a feasible schedule into two layers, and then recombines the two layers by finding a perfect matching. We show that the makespan of every local optimum for split is at most a factor of 2 away from the globally optimal makespan. We then combine the split neighborhood with two neighborhoods from the literature. The combination of split with the jump neighborhood only marginally improves the approximation guarantee, whereas the combination with the lexicographic‐jump neighborhood decreases the approximation guarantee from 2 to 3/2. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   
133.
多视图需求工程中"分而治之"的需求开发方式,必然会产生"需要集成"和"如何集成"等问题.研究了基于多视图的C<'4>ISR系统需求框架及其视图产品,并在此基础上给出了C<'4>ISR系统需求集成的概念与范围.通过建立需求信息模型,从语法、语义和语用三个层次研究构建一个需求集成框架.通过需求产品之间的关联关系,分析不同视图产品在集成中存在的问题,并给出了需求集成框架中不同需求产品的集成过程,为C<'4>ISR系统需求集成问题的解决提供一个可供参考的方法.  相似文献   
134.
左手材料的介电常数和磁导率都为负值,电场、磁场和波矢量在左手材料中表现为左手螺旋关系,相速与群速方向相反。根据传输线理论分析了波入射到分层媒质上的表面反射系数,计算了随入射波频率、涂层厚度变化情况下的左、右手材料的反射率;基于非均匀有理B样条参数曲面模拟目标的几何外形,采用物理光学法计算了涂敷左手材料目标的雷达散射截面...  相似文献   
135.
将NI Measurement Studio与Microsoft Visual Studio .NET相结合,以计算机、无线局域网、DSP与MS430数据信号盒为核心构建了装甲车辆综合信息系统检测设备.详细介绍了检测设备总体设计方案、硬件平台组成、软件界面设计,以及信号采集、串口通信、检测报表的生成与打印的实现方法.经实际检测应用表明,检测设备初步达到了预期的设计指标.  相似文献   
136.
Many logistics systems operate in a decentralized way, while most optimization models assume a centralized planner. One example of a decentralized system is in some sea cargo companies: sales agents, who share ship capacity on a network, independently accept cargo from their location and contribute to the revenue of the system. The central headquarters does not directly control the agents' decisions but can influence them through system design and incentives. In this paper, we model the firm's problem to determine the best capacity allocation to the agents such that system revenue is maximized. In the special case of a single‐route, we formulate the problem as a mixed integer program incorporating the optimal agent behavior. For the NP‐hard multiple‐route case, we propose several heuristics for the problem. Computational experiments show that the decentralized system generally performs worse when network capacity is tight and that the heuristics perform reasonably well. We show that the decentralized system may perform arbitrarily worse than the centralized system when the number of locations goes to infinity, although the choice of sales incentive impacts the performance. We develop an upper bound for the decentralized system, where the bound gives insight on the performance of the heuristics in large systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
137.
138.
A process control scheme is developed in which decisions as to the frequency of sampling are made based upon the choice of an Average Outgoing Quality Limit. The scheme utilizes plotted points on a U-control chart for defects and the theory of runs to determine when to switch among Reduced, Normal, Tightened, and 100 percent inspection. The scheme is formulated as a semi-Markov process to derive steady stale equations for the probabilities of being in Reduced, Normal, Tightened, or 100 percent inspection and for Average Outgoing Quality and Average Fraction Inspected. The resulting system and the computer programs used to derive it are discussed.  相似文献   
139.
For large numbers of perfectly reliable, optimally targeted warheads the square-root law approximates the expected fraction damage achieved on an area target. In this paper a more exact expression is derived for this damage fraction which Holds for all numbers of warheads. This expression is shown to converge to the square-root law when a large number of warheads are fired. The more exact expression is used in a procedure to calculate expected damage when warheads are unreliable, and this procedure is shown to be superior to a modified square-root approximation which has been used previously.  相似文献   
140.
In this paper, a branch-and-bound procedure is presented for treating the general knapsack problem. The fundamental notion of the procedure involves a variation of traditional branching strategies as well as the incorporation of penalties in order to improve bounds. Substantial computational experience has been obtained, the results of which would indicate the feasibility of the procedure for problems of large size.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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