全文获取类型
收费全文 | 210篇 |
免费 | 87篇 |
国内免费 | 16篇 |
出版年
2024年 | 1篇 |
2023年 | 5篇 |
2022年 | 1篇 |
2021年 | 1篇 |
2020年 | 5篇 |
2018年 | 2篇 |
2017年 | 9篇 |
2016年 | 17篇 |
2015年 | 7篇 |
2014年 | 15篇 |
2013年 | 14篇 |
2012年 | 19篇 |
2011年 | 15篇 |
2010年 | 11篇 |
2009年 | 28篇 |
2008年 | 12篇 |
2007年 | 18篇 |
2006年 | 15篇 |
2005年 | 21篇 |
2004年 | 16篇 |
2003年 | 9篇 |
2002年 | 9篇 |
2001年 | 8篇 |
2000年 | 11篇 |
1999年 | 12篇 |
1998年 | 5篇 |
1997年 | 7篇 |
1996年 | 5篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 2篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 1篇 |
排序方式: 共有313条查询结果,搜索用时 15 毫秒
101.
由于信号模型的偏差,传统的点目标假设下的DOA估计算法对分布信号源的估计误差较大,为此建立了分布信号源的模型,提出适用于分布源信号的DIS-MUSIC算法,并分析了该算法的估计性能。仿真结果表明,所提算法对分布信号源的DOA估计性能远优于MUSIC算法。 相似文献
102.
In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
103.
Many important problems in Operations Research and Statistics require the computation of nondominated (or Pareto or efficient) sets. This task may be currently undertaken efficiently for discrete sets of alternatives or for continuous sets under special and fairly tight structural conditions. Under more general continuous settings, parametric characterisations of the nondominated set, for example through convex combinations of the objective functions or ε‐constrained problems, or discretizations‐based approaches, pose several problems. In this paper, the lack of a general approach to approximate the nondominated set in continuous multiobjective problems is addressed. Our simulation‐based procedure only requires to sample from the set of alternatives and check whether an alternative dominates another. Stopping rules, efficient sampling schemes, and procedures to check for dominance are proposed. A continuous approximation to the nondominated set is obtained by fitting a surface through the points of a discrete approximation, using a local (robust) regression method. Other actions like clustering and projecting points onto the frontier are required in nonconvex feasible regions and nonconnected Pareto sets. In a sense, our method may be seen as an evolutionary algorithm with a variable population size. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
104.
The scheduling problem addressed in this paper concerns a manufacturer who produces a variety of product types and operates in a make‐to‐order environment. Each customer order consists of known quantities of the different product types, and must be delivered as a single shipment. Periodically the manufacturer schedules the accumulated and unscheduled customer orders. Instances of this problem occur across industries in manufacturing as well as in service environments. In this paper we show that the problem of minimizing the weighted sum of customer order delivery times is unary NP‐hard. We characterize the optimal schedule, solve several special cases of the problem, derive tight lower bounds, and propose several heuristic solutions. We report the results of a set of computational experiments to evaluate the lower bounding procedures and the heuristics, and to determine optimal solutions. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
105.
106.
107.
改进BP网络的舰船装备保障资源保障能力评估 总被引:2,自引:0,他引:2
针对单独运用BP网络评估舰船装备保障资源保障能力时存在的不足,提出了一种基于改进BP网络的舰船装备保障资源保障能力评估模型。首先构建了保障能力评估的指标体系,在此基础上,采用主成分分析法对原始输入变量进行预处理,选择输入变量的主成分作为神经网络输入,一方面减少了输入变量的维数,消除了各输入变量的相关性;另一方面提高了网络的收敛性和稳定性,同时也简化了网络的结构。然后将遗传优化算法与BP网络结合,利用GA的全局搜索能力优化BP网络的结构参数。最后进行实例计算,结果表明该方法有效克服了纯BP算法局部收敛、泛化能力弱等问题,新模型采用的算法具有收敛速度快,结果精度高的优点,适用于对保障资源保障能力的分析和评估。 相似文献
108.
系统可靠性分配是可靠性设计的重要任务之一,其主要作用是为可靠性设计提供辅助决策。给出了可靠性分配流程,研究了可靠性分配模型的发展状况,重点介绍了可靠性分配问题的求解算法,指出了各类算法在分配中的应用及其需进一步解决的问题,同时分析了国内外典型的分配软件,总结了各软件中可靠性分配的主要功能,最后对可靠性分配提出了进一步的研究展望。 相似文献
109.
110.
This paper discusses a novel application of mathematical programming techniques to a regression problem. While least squares regression techniques have been used for a long time, it is known that their robustness properties are not desirable. Specifically, the estimators are known to be too sensitive to data contamination. In this paper we examine regressions based on Least‐sum of Absolute Deviations (LAD) and show that the robustness of the estimator can be improved significantly through a judicious choice of weights. The problem of finding optimum weights is formulated as a nonlinear mixed integer program, which is too difficult to solve exactly in general. We demonstrate that our problem is equivalent to a mathematical program with a single functional constraint resembling the knapsack problem and then solve it for a special case. We then generalize this solution to general regression designs. Furthermore, we provide an efficient algorithm to solve the general nonlinear, mixed integer programming problem when the number of predictors is small. We show the efficacy of the weighted LAD estimator using numerical examples. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献