全文获取类型
收费全文 | 21291篇 |
免费 | 4336篇 |
国内免费 | 1578篇 |
出版年
2024年 | 69篇 |
2023年 | 153篇 |
2022年 | 410篇 |
2021年 | 795篇 |
2020年 | 759篇 |
2019年 | 260篇 |
2018年 | 324篇 |
2017年 | 756篇 |
2016年 | 354篇 |
2015年 | 784篇 |
2014年 | 1107篇 |
2013年 | 1863篇 |
2012年 | 1789篇 |
2011年 | 1918篇 |
2010年 | 1983篇 |
2009年 | 2036篇 |
2008年 | 2040篇 |
2007年 | 1830篇 |
2006年 | 1479篇 |
2005年 | 1281篇 |
2004年 | 919篇 |
2003年 | 469篇 |
2002年 | 524篇 |
2001年 | 604篇 |
2000年 | 384篇 |
1999年 | 292篇 |
1998年 | 173篇 |
1997年 | 132篇 |
1996年 | 186篇 |
1995年 | 157篇 |
1994年 | 151篇 |
1993年 | 106篇 |
1992年 | 132篇 |
1991年 | 86篇 |
1990年 | 85篇 |
1989年 | 79篇 |
1988年 | 77篇 |
1987年 | 58篇 |
1986年 | 56篇 |
1985年 | 45篇 |
1984年 | 30篇 |
1983年 | 40篇 |
1982年 | 36篇 |
1980年 | 36篇 |
1979年 | 33篇 |
1978年 | 32篇 |
1976年 | 29篇 |
1975年 | 29篇 |
1974年 | 30篇 |
1972年 | 29篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
921.
922.
New concepts of partial stochastic orderings are introduced, and the relations among them and the classical partial orderings are shown. Relevance of these partial orderings in aging properties classification is discussed, and new classes of life distributions, based on them, are proposed. An application to stochastic comparison between Poisson shock models is proposed. © 1993 John Wiley & Sons, Inc. 相似文献
923.
Assessing the effects of changes in weapons systems or battle tactics is difficult because of the variations in battles and the resulting instability of measures of combat effectiveness. Even under the relatively stable conditions of designed combat exercises, traditional measures may fail to reflect important battle events and dynamics. This variation in results makes the design, conduct, and evaluation of combat experiments, combat simulations, and combat training exercises a challenging endeavor, indeed. We develop and examine a combat measure of effectiveness, based on Lanchester models, which we call the battle trace. The battle trace is a measure of ongoing battle results, measured as a function of time into the battle. We describe how such measures might contribute to assessing effects of changing certain battle parameters. We suggest applications of these ideas to developing combat simulations and to enhancing combat training exercises. 相似文献
924.
A branch-and-bound algorithm is proposed for global minimization of indefinite quadratic functions subject to box constraints. Branching is done according to the sign of first-order derivatives. New tests based on the compatibility of signs of several first-order derivatives and on various bounding procedures, allow curtailment of the search. Computational experiments are reported. Comparison is made with an interval arithmetic implementation. © 1993 John Wiley & Sons, Inc. 相似文献
925.
In this article we investigate situations where the buyer is offered discounted price schedules from alternative vendors. Given various discount schedules, the buyer must make the best buying decision under a variety of constraints, such as limited storage space and restricted inventory budgets. Solutions to this problem can be utilized by the buyer to improve profitability. EOQ models for multiple products with all-units discounts are readily solvable in the absence of constraints spanning the products. However, constrained discounted EOQ models lack convenient mathematical properties. Relaxing the product-spanning constraints produces a dual problem that is separable, but lack of convexity and smoothness opens the door for duality gaps. In this research we present a set of algorithms that collectively find the optimal order vector. Finally, we present numerical examples using actual data. to illustrate the application of the algorithms. © 1993 John Wiley & Sons, Inc. 相似文献
926.
In this article we consider a project scheduling problem where there are cash flows throughout the life of the project and where shorter activity durations can be attained by incurring greater direct costs. In particular, the objective of this problem is to determine the activity durations and a schedule of activity start times so that the net present value of cash flows is maximized. We formulate this problem as a mixed-integer nonlinear program which is amenable to solution using the generalized Benders decomposition technique developed by Geoffrion. We test the algorithm on 140 project scheduling problems, the largest of which contains 30 nodes and 64 activities. Our computational results are quite encouraging inasmuch as 123 of the 140 problems require less than 1 CPU second of solution time. © 1993 John Wiley & Sons, Inc. 相似文献
927.
针对无人自主水下航行器(Autonomous Underwater Vehicle,AUV)在复杂海战场环境中路径规划时环境模型复杂、约束条件多的情况,建立了包括战场地形、敌方威胁、障碍物和海流场等在内的比较完善的海战场环境模型.以AUV航行时间、威胁时间最短为优化目标,给出了一种基于振荡型入侵野草优化(Invasiv... 相似文献
928.
This article introduces a new conceptual and methodological framework for the use of decision makers and their interactions with the computer in bicriterion decision making. The new method, called the multirun interactive method, attempts to estimate the prior of the decision maker on his uncertain preference nature using the minimum cross-entropy principle. A computational study is performed with four hypothesized prior distributions under various interaction conditions. Other important aspects related to the method, such as implementation of the method, decision making under certainty, decision making with multiple decision makers, and bicriterion integer programming, are also discussed. 相似文献
929.
We show that the deterministic nonpreemptive scheduling problem with earliness and tardiness penalties can be solved in polynomial time for certain forms of an objective function provided that a certain optimization problem can be solved. We give instances where this problem has a solution and show that this generalizes several results from the literature. These results do not require symmetric penalization and the penalty functions need only be lower semicontinuous. 相似文献
930.
This article studies (nQ, r) inventory policies, under which the order quantity is restricted to be an integer multiple of a base lot size Q. Both Q and r are decision variables. Assuming the one-period expected holding and backorder cost function is unimodal, we develop an efficient algorithm to compute the optimal Q and r. The algorithm is facilitated by simple observations about the cost function and by tight upper bounds on the optimal Q. The total number of elementary operations required by the algorithm is linear in these upper bounds. By using the algorithm, we compare the performance of the optimal (nQ, r) policy with that of the optimal (s, S) policy through a numerical study, and our results show that the difference between them is small. Further analysis of the model shows that the cost performance of an (nQ, r) policy is insensitive to the choice of Q. These results establish that (nQ, r) models are potentially useful in many settings where quantized ordering is beneficial. 相似文献