全文获取类型
收费全文 | 1186篇 |
免费 | 505篇 |
国内免费 | 121篇 |
出版年
2024年 | 6篇 |
2023年 | 12篇 |
2022年 | 17篇 |
2021年 | 24篇 |
2020年 | 23篇 |
2019年 | 27篇 |
2018年 | 30篇 |
2017年 | 54篇 |
2016年 | 84篇 |
2015年 | 75篇 |
2014年 | 98篇 |
2013年 | 75篇 |
2012年 | 93篇 |
2011年 | 89篇 |
2010年 | 75篇 |
2009年 | 114篇 |
2008年 | 80篇 |
2007年 | 92篇 |
2006年 | 103篇 |
2005年 | 80篇 |
2004年 | 83篇 |
2003年 | 55篇 |
2002年 | 57篇 |
2001年 | 56篇 |
2000年 | 42篇 |
1999年 | 42篇 |
1998年 | 36篇 |
1997年 | 37篇 |
1996年 | 29篇 |
1995年 | 12篇 |
1994年 | 21篇 |
1993年 | 20篇 |
1992年 | 22篇 |
1991年 | 16篇 |
1990年 | 20篇 |
1989年 | 10篇 |
1988年 | 3篇 |
排序方式: 共有1812条查询结果,搜索用时 15 毫秒
861.
采用SPH方法模拟了流体界面的Rayleigh Taylor不稳定性,给出了界面初始扰动的发展过程,得到了蘑菇状的扰动图像,并对两种不同初始分布的扰动过程进行了比较。分析表明,计算结果合理,SPH方法适合于界面不稳定性的模拟。 相似文献
862.
Harold P. Benson 《海军后勤学研究》2004,51(4):467-476
The construction of convex and concave envelopes of real‐valued functions has been of interest in mathematical programming for over 3 decades. Much of this interest stems from the fact that convex and concave envelopes can play important roles in algorithms for solving various discrete and continuous global optimization problems. In this article, we use a simplicial subdivision tool to present and validate the formula for the concave envelope of a monomial function over a rectangle. Potential algorithmic applications of this formula are briefly indicated. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
863.
Kyle Y. Lin 《海军后勤学研究》2004,51(4):501-521
Consider a sequential dynamic pricing model where a seller sells a given stock to a random number of customers. Arriving one at a time, each customer will purchase one item if the product price is lower than her personal reservation price. The seller's objective is to post a potentially different price for each customer in order to maximize the expected total revenue. We formulate the seller's problem as a stochastic dynamic programming model, and develop an algorithm to compute the optimal policy. We then apply the results from this sequential dynamic pricing model to the case where customers arrive according to a continuous‐time point process. In particular, we derive tight bounds for the optimal expected revenue, and develop an asymptotically optimal heuristic policy. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
864.
We study linear programming models that contain transportation constraints in their formulation. Typically, these models have a multistage nature and the transportation constraints together with the associated flow variables are used to achieve consistency between consecutive stages. We describe how to reformulate these models by projecting out the flow variables. The reformulation can be more desirable since it has fewer variables and can be solved faster. We apply these ideas to reformulate two well‐known workforce staffing and scheduling problems: the shift scheduling problem and the tour scheduling problem. We also present computational results. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
865.
J. J. Glen 《海军后勤学研究》2004,51(4):575-596
Classification models, whether generated by statistical techniques or mathematical programming (MP) discriminant analysis methods, are often simplified by ad hoc formation of dichotomous categorical variables from the original variables with, for example, a dichotomous variable taking value 1 if the original variable is above a threshold level and 0 otherwise. In this paper an MP discriminant analysis method is developed for forming dichotomous categorical variables in problems with discriminant functions that are monotone in the original variables. For each of the original variables from which dichotomous variables may be formed, a set of possible threshold levels for dichotomous variable formation is defined. An MP model is then used to determine both the threshold level for forming each dichotomous variable and the associated discriminant function coefficient. The proposed MP approach is applied to a published problem and a number of simulated problem sets. It is shown that the discriminant functions in dichotomous categorical variables generated by this new MP approach can in some cases outperform the functions generated by standard MP discriminant analysis models using the original variables. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
866.
Design reliability at the beginning of a product development program is typically low, and development costs can account for a large proportion of total product cost. We consider how to conduct development programs (series of tests and redesigns) for one‐shot systems (which are destroyed at first use or during testing). In rough terms, our aim is to both achieve high final design reliability and spend as little of a fixed budget as possible on development. We employ multiple‐state reliability models. Dynamic programming is used to identify a best test‐and‐redesign strategy and is shown to be presently computationally feasible for at least 5‐state models. Our analysis is flexible enough to allow for the accelerated stress testing needed in the case of ultra‐high reliability requirements, where testing otherwise provides little information on design reliability change. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
867.
868.
介绍了粒子滤波及随机分布的代表点理论,将统计学中的数论方法应用于粒子滤波,使用随机分布的均方差代表点,对粒子滤波中关键的初始粒子生成、重点密度采样及再采样过程给出了相应的代表点算法,得到了一个包含最少随机操作的、使用非等权值粒子的确定性粒子滤波算法。仿真结果表明,确定性粒子滤波算法不仅是可行的,而且其滤波性能及计算效率均有不同程度的提高。 相似文献
869.
小子样条件下,不同状态的多源信息融合是可靠性工程领域的一个热门问题。综述了小子样条件下可靠性试验信息的融合方法。在一定的假设条件之下,利用分离可交换量模型对不同环境下的可靠性信息融合方法进行了研究,仿真算例说明这种融合方法充分利用了信息,评估结论更为合理。 相似文献
870.