全文获取类型
收费全文 | 898篇 |
免费 | 402篇 |
国内免费 | 66篇 |
出版年
2024年 | 1篇 |
2023年 | 21篇 |
2022年 | 7篇 |
2021年 | 23篇 |
2020年 | 33篇 |
2019年 | 24篇 |
2018年 | 14篇 |
2017年 | 74篇 |
2016年 | 82篇 |
2015年 | 60篇 |
2014年 | 86篇 |
2013年 | 78篇 |
2012年 | 91篇 |
2011年 | 66篇 |
2010年 | 49篇 |
2009年 | 91篇 |
2008年 | 60篇 |
2007年 | 66篇 |
2006年 | 71篇 |
2005年 | 54篇 |
2004年 | 58篇 |
2003年 | 39篇 |
2002年 | 38篇 |
2001年 | 31篇 |
2000年 | 25篇 |
1999年 | 22篇 |
1998年 | 21篇 |
1997年 | 18篇 |
1996年 | 14篇 |
1995年 | 10篇 |
1994年 | 10篇 |
1993年 | 9篇 |
1992年 | 5篇 |
1991年 | 2篇 |
1990年 | 9篇 |
1989年 | 4篇 |
排序方式: 共有1366条查询结果,搜索用时 975 毫秒
31.
基于Faddeeva算法可以实现各种矩阵运算 ,并且可以方便地映射到心动阵列结构上这一事实 ,提出了一种基于Faddeeva算法的卡尔曼滤波心动阵列实现方法 ,并在此基础上设计了两种处理器拓扑结构。分析结果表明 ,这两种处理器结构具有效率高、规整性好和易于扩展等特点。 相似文献
32.
多目标广义指派问题的模糊匈牙利算法求解 总被引:5,自引:0,他引:5
提出和讨论了两类多目标的广义指派决策问题,分别给出了它们的多目标整数线性规划数学模型,并结合模糊理论与解决传统指派问题的匈牙利方法提出了一种新的求解算法:模糊匈牙利法.最后给出了一个数值例子. 相似文献
33.
34.
网络图式军用文书是战时通用装备保障文书中通常采用的文书形式之一,给出装备保障文书辅助生成系统的总体结构,将网络分析方法引入通用装备保障文书辅助生成系统的研究,在此基础上阐述了网络图式文书生成子系统的功能、数学模型及网络计算、网络优化的部分算法。 相似文献
35.
A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem
The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
36.
We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
37.
38.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
39.
MUSIC方法是空间谱估计中经典的子空间方法。提出了一种构造参考信号的预处理模型,提出了一种适合于MUSIC方法的多级维纳滤波结构。新方法避免了采样数据二阶统计的特征值分解,降低了运算量。仿真结果证明了方法的有效性。 相似文献
40.