全文获取类型
收费全文 | 166篇 |
免费 | 6篇 |
国内免费 | 1篇 |
专业分类
化学 | 83篇 |
力学 | 4篇 |
综合类 | 1篇 |
数学 | 78篇 |
物理学 | 7篇 |
出版年
2023年 | 1篇 |
2021年 | 1篇 |
2019年 | 3篇 |
2018年 | 2篇 |
2017年 | 3篇 |
2016年 | 2篇 |
2015年 | 4篇 |
2014年 | 2篇 |
2013年 | 12篇 |
2012年 | 7篇 |
2011年 | 7篇 |
2010年 | 5篇 |
2009年 | 13篇 |
2008年 | 7篇 |
2007年 | 13篇 |
2006年 | 10篇 |
2005年 | 4篇 |
2004年 | 12篇 |
2003年 | 2篇 |
2002年 | 5篇 |
2001年 | 9篇 |
2000年 | 5篇 |
1999年 | 2篇 |
1998年 | 4篇 |
1997年 | 3篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 5篇 |
1993年 | 2篇 |
1992年 | 5篇 |
1990年 | 1篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1978年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有173条查询结果,搜索用时 421 毫秒
171.
Satoshi Kuriki 《Annals of the Institute of Statistical Mathematics》1993,45(4):731-739
The unbiased estimator of risk of the orthogonally invariant estimator of the skew-symmetric normal mean matrix is obtained, and a class of minimax estimators and their order-preserving modification are proposed. The estimators have applications in paired comparisons model. A Monte Carlo study to compare the risks of the estimators is given. 相似文献
172.
There are many variants of successive quadratic programming (SQP) algorithms. Important issues include: the choice of either line search or trust region strategies; the QP formulation to be used; and how the QP is to be solved. Here, we consider the QP's proposed by Fletcher and Powell and discuss a specialized reduced-gradient procedure for solving them. A computer implementation is described, and the various options are compared on some well-known test problems. Factors influencing robustness and speed are identified. 相似文献
173.
In just-in-time (JIT) production systems, there is both input stock in the form of parts and output stock in the form of product at each stage. These activities are controlled by production-ordering and withdrawal kanbans. This paper discusses a discrete-time optimal control problem in a multistage JIT-based production and distribution system with stochastic demand and capacity, developed to minimize the expected total cost per unit of time. The problem can be formulated as an undiscounted Markov decision process (UMDP); however, the curse of dimensionality makes it very difficult to find an exact solution. The author proposes a new neuro-dynamic programming (NDP) algorithm, the simulation-based modified policy iteration method (SBMPIM), to solve the optimal control problem. The existing NDP algorithms and SBMPIM are numerically compared with a traditional UMDP algorithm for a single-stage JIT production system. It is shown that all NDP algorithms except the SBMPIM fail to converge to an optimal control.Additionally, a new algorithm for finding the optimal parameters of pull systems is proposed. Numerical comparisons between near-optimal controls computed using the SBMPIM and optimized pull systems are conducted for three-stage JIT-based production and distribution systems. UMDPs with 42 million states are solved using the SBMPIM. The pull systems discussed are the kanban, base stock, CONWIP, hybrid and extended kanban. 相似文献