全文获取类型
收费全文 | 2671篇 |
免费 | 409篇 |
国内免费 | 155篇 |
出版年
2024年 | 3篇 |
2023年 | 8篇 |
2022年 | 22篇 |
2021年 | 37篇 |
2020年 | 27篇 |
2019年 | 69篇 |
2018年 | 54篇 |
2017年 | 99篇 |
2016年 | 108篇 |
2015年 | 76篇 |
2014年 | 217篇 |
2013年 | 317篇 |
2012年 | 160篇 |
2011年 | 218篇 |
2010年 | 187篇 |
2009年 | 202篇 |
2008年 | 163篇 |
2007年 | 199篇 |
2006年 | 165篇 |
2005年 | 155篇 |
2004年 | 147篇 |
2003年 | 114篇 |
2002年 | 81篇 |
2001年 | 83篇 |
2000年 | 47篇 |
1999年 | 40篇 |
1998年 | 27篇 |
1997年 | 27篇 |
1996年 | 29篇 |
1995年 | 23篇 |
1994年 | 29篇 |
1993年 | 17篇 |
1992年 | 19篇 |
1991年 | 16篇 |
1990年 | 24篇 |
1989年 | 13篇 |
1988年 | 10篇 |
1987年 | 2篇 |
1975年 | 1篇 |
排序方式: 共有3235条查询结果,搜索用时 15 毫秒
861.
虚拟战场环境生成及关键技术 总被引:6,自引:0,他引:6
虚拟战场环境是军用仿真的一个重要基础平台,分析了该环境的构成结构,提出了场景可视化的实现流程,重点探讨了其中的地形建模和简化、实体和行为建模、特殊效果生成、视点控制与切换等几项关键技术,提出了解决这些技术的主要方法和步骤,并已在PC机上完成了上述算法,为进一步研究打下了良好基础. 相似文献
862.
In this paper we present a componentwise delay measure for estimating and improving the expected delays experienced by customers in a multi‐component inventory/assembly system. We show that this measure is easily computed. Further, in an environment where the performance of each of the item delays could be improved with investment, we present a solution that aims to minimize this measure and, in effect, minimizes the average waiting time experienced by customers. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003 相似文献
863.
In this paper we study a machine repair problem in which a single unreliable server maintains N identical machines. The breakdown times of the machines are assumed to follow an exponential distribution. The server is subject to failure and the failure times are exponentially distributed. The repair times of the machine and the service times of the repairman are assumed to be of phase type. Using matrix‐analytic methods, we perform steady state analysis of this model. The time spent by a failed machine in service and the total time in the repair facility are shown to be of phase type. Several performance measures are evaluated. An optimization problem to determine the number of machines to be assigned to the server that will maximize the expected total profit per unit time is discussed. An illustrative numerical example is presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 462–480, 2003 相似文献
864.
We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
865.
Philip Kaminsky 《海军后勤学研究》2003,50(3):257-272
In the flow shop delivery time problem, a set of jobs has to be processed on m machines. Every machine has to process each one of the jobs, and every job has the same routing through the machines. The objective is to determine a sequence of the jobs on the machines so as to minimize maximum delivery completion time over all the jobs, where the delivery completion time of a job is the sum of its completion time, and the delivery time associated with that job. In this paper, we prove the asymptotic optimality of the Longest Delivery Time algorithm for the static version of this problem, and the Longest Delivery Time among Available Jobs (LDTA) algorithm for the dynamic version of this problem. In addition, we present the result of computational testing of the effectiveness of these algorithms. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
866.
The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
867.
868.
应自行武器间瞄射击的要求,提出了测定装甲机械化分队各车体方位的原则和简单方法,并对此测算方法进行了误差分析,然后以某分队为例,分别测算了指挥车和队属单车的车体方位和误差,结果表明该定位定向方法能够满足自行武器间瞄准射击的要求,可供装备自行武器的部队在射击训练时参考。 相似文献
869.
870.
针对传统优化方法不能有效考虑部队需求的问题,提出了基于质量功能展开(Quality Function Deployment,QFD)的武器装备使用需求映射方法,给出了部队需求和武器装备性能指标自相关性的处理方法,并使用松弛系数法保证了最优解集的寻求与重点需求的优先实现。结合实例对该方法的实用性和反映部队需求的准确性进行了验证。结果表明:该方法既克服了传统需求分析侧重于论证人员的推理而对实际使用方的需求考虑不足的弊端,又充分体现了"用户"为主的思想。 相似文献