首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3460篇
  免费   124篇
  国内免费   5篇
  2021年   41篇
  2019年   91篇
  2018年   53篇
  2017年   88篇
  2016年   82篇
  2015年   69篇
  2014年   85篇
  2013年   737篇
  2012年   36篇
  2010年   38篇
  2009年   43篇
  2008年   54篇
  2007年   58篇
  2006年   39篇
  2005年   47篇
  2004年   59篇
  2003年   45篇
  2002年   64篇
  1999年   46篇
  1998年   51篇
  1997年   55篇
  1996年   62篇
  1995年   43篇
  1994年   60篇
  1993年   63篇
  1992年   59篇
  1991年   74篇
  1990年   39篇
  1989年   72篇
  1988年   78篇
  1987年   68篇
  1986年   74篇
  1985年   64篇
  1984年   37篇
  1983年   42篇
  1982年   43篇
  1981年   46篇
  1980年   51篇
  1979年   45篇
  1978年   49篇
  1977年   45篇
  1976年   45篇
  1975年   46篇
  1974年   52篇
  1973年   50篇
  1972年   52篇
  1971年   43篇
  1970年   40篇
  1969年   40篇
  1967年   34篇
排序方式: 共有3589条查询结果,搜索用时 15 毫秒
181.
The general problem we are concerned with here is the estimation of Pθ(C) where C is some fixed event and Pθ is unknown in some class. The various available estimation procedures seem to involve the choice of some random probability measure. In particular we consider this problem when C is a disk in R2 centered at o and Pθ is restricted to be bivariate normal. Details concerning the implementation of the estimation procedures and a Monte Carlo study are discussed for this case. This particular problem arises when we are concerned with assessing the accuracy of a targeting procedure.  相似文献   
182.
The problem is to protect a set of t targets by n perfect interceptors against an attack by m perfect weapons. If the defender solves for an optimal preallocated preferential defense and associated game value assuming m1 attackers, and the attacker knows the assumption of the defender and utilizes m2 attackers, he may be able to achieve significantly more damage than had the defender assumed that there would be m2 attackers. The article treats the robustness of preallocated preferential defense to assumptions about the size of the attack and presents results of an alternative approach.  相似文献   
183.
Calculations for large Markovian finite source, finite repair capacity two-echelon repairable item inventory models are shown to be feasible using the randomization technique and a truncated state space approach. More complex models (involving transportation pipelines, multiple-item types and additional echelon levels) are also considered.  相似文献   
184.
185.
186.
文中为解决超长帧编码系统中联合帧数过多导致LSP参数量化性能下降这个问题,将多项式拟合引入超长帧编码系统中,利用多项式拟合压缩LSP参数矩阵,以降低量化时实际联合的帧数。再用分裂矩阵量化器进行量化。仿真结果表明,在120 bps的参数量化速率下,此算法的量化性能优于矩阵量化算法(MQ),平均谱失真比MQ算法降低了0.0719 dB,平均分段信噪比提高了0.1971 dB。  相似文献   
187.
介绍了数字自动增益控制(AGC)技术在数字中频接收机中的实现方法’,提出了利用 DSP Builder模型库设计的一种实用的数字自动增益控制电路,所设计的电路在数字中频接收机系统内工作良好。该数字 AGC具有快速收敛、结构简单、性能稳定和成本低等特点。占用 Altera StratixⅡ FPGA 片上163个自适应逻辑单元(ALUTs)。  相似文献   
188.
Multiple Objectives Optimization is much seen in combination with linear functions and even with linear programming, together with an adding of the objectives by using weights. With distance functions, normalization instead of weights is used. It is also possible that together with an additive direct influence of the objectives on the utility function a mutual utility of the objectives exists under the form of a multiplicative representation. A critical comment is brought on some representations of this kind. A full‐multiplicative form may offer other opportunities, which will be discussed at length in an effort to exclude weights and normalization. This theoretical approach is followed by an application for arms procurement. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 327–340, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10014  相似文献   
189.
190.
The “gold‐mining” decision problem is concerned with the efficient utilization of a delicate mining equipment working in a number of different mines. Richard Bellman was the first to consider this type of a problem. The solution found by Bellman for the finite‐horizon, continuous‐time version of the problem with two mines is not overly realistic since he assumed that fractional parts of the same mining equipment could be used in different mines and this fraction could change instantaneously. In this paper, we provide some extensions to this model in order to produce more operational and realistic solutions. Our first model is concerned with developing an operational policy where the equipment may be switched from one mine to the other at most once during a finite horizon. In the next extension we incorporate a cost component in the objective function and assume that the horizon length is not fixed but it is the second decision variable. Structural properties of the optimal solutions are obtained using nonlinear programming. Each model and its solution is illustrated with a numerical example. The models developed here may have potential applications in other areas including production of items requiring the same machine or choosing a sequence of activities requiring the same resource. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 186–203, 2002; DOI 10.1002/nav.10008  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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