全文获取类型
收费全文 | 376篇 |
免费 | 151篇 |
国内免费 | 26篇 |
出版年
2024年 | 1篇 |
2022年 | 9篇 |
2021年 | 1篇 |
2020年 | 10篇 |
2019年 | 7篇 |
2018年 | 5篇 |
2017年 | 14篇 |
2016年 | 23篇 |
2015年 | 17篇 |
2014年 | 27篇 |
2013年 | 22篇 |
2012年 | 44篇 |
2011年 | 40篇 |
2010年 | 20篇 |
2009年 | 31篇 |
2008年 | 28篇 |
2007年 | 30篇 |
2006年 | 32篇 |
2005年 | 29篇 |
2004年 | 29篇 |
2003年 | 19篇 |
2002年 | 9篇 |
2001年 | 17篇 |
2000年 | 12篇 |
1999年 | 12篇 |
1998年 | 8篇 |
1997年 | 8篇 |
1996年 | 11篇 |
1995年 | 8篇 |
1994年 | 4篇 |
1993年 | 8篇 |
1992年 | 6篇 |
1991年 | 6篇 |
1990年 | 4篇 |
1989年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有553条查询结果,搜索用时 15 毫秒
61.
研究非齐次边界条件下,含有p-Laplacian算子的微分方程的可解性,在Banach空间中应用Krasnoselskii不动点定理,得到了边值问题正解存在性结果。 相似文献
62.
63.
In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003. 相似文献
64.
Today, many products are designed and manufactured to function for a long period of time before they fail. Determining product reliability is a great challenge to manufacturers of highly reliable products with only a relatively short period of time available for internal life testing. In particular, it may be difficult to determine optimal burn‐in parameters and characterize the residual life distribution. A promising alternative is to use data on a quality characteristic (QC) whose degradation over time can be related to product failure. Typically, product failure corresponds to the first passage time of the degradation path beyond a critical value. If degradation paths can be modeled properly, one can predict failure time and determine the life distribution without actually observing failures. In this paper, we first use a Wiener process to describe the continuous degradation path of the quality characteristic of the product. A Wiener process allows nonconstant variance and nonzero correlation among data collected at different time points. We propose a decision rule for classifying a unit as normal or weak, and give an economic model for determining the optimal termination time and other parameters of a burn‐in test. Next, we propose a method for assessing the product's lifetime distribution of the passed units. The proposed methodologies are all based only on the product's initial observed degradation data. Finally, an example of an electronic product, namely contact image scanner (CIS), is used to illustrate the proposed procedure. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
65.
无线认知网络被认为是下一代无线网络的核心架构之一。该网络能解决日益增长的频谱使用需求和低下的频谱使用率之间的矛盾。通过伺机接入临时可用频谱资源,其频谱利用率能得到大幅的提高。由于频谱资源分配是影响频谱资源利用率的关键,因此如何对频谱资源进行高效的分配一直是无线认知网络的重要研究领域之一。我们证明了在异构频谱使用概率条件下的最优频谱分配是NP难的问题。为了有效解决该问题,本文提出了一种基于分布式最大加权独立集的频谱分配算法——DMWIS。该算法的时间复杂度为O(V2/2)。通过大量的仿真实验,验证了在90%以上的不同随机网络环境下算法能在3轮内收敛,并且该算法一般能获得最优解90%的性能。 相似文献
66.
针对一类具M-P型非线性信号传输函数的二元神经网络模型,提出其初值振动时系统周期解的存在性问题.利用结式技巧,结合分析方法,建立了用结式表示的保证具振动初值系统周期解存在的充分条件,并通过例子说明零阈值情形周期解的稳定性. 相似文献
67.
68.
A method is presented to locate and allocate p new facilities in relation to n existing facilities. Each of the n existing facilities has a requirement flow which must be supplied by the new facilities. Rectangular distances are assumed to exist between all facilities. The algorithm proceeds in two stages. In the first stage a set of all possible optimal new facility locations is determined by a set reduction algorithm. The resultant problem is shown to be equivalent to finding the p-median of a weighted connected graph. In the second stage the optimal locations and allocations are obtained by using a technique for solving the p-median problem. 相似文献
69.
将粗糙集理论引入到空战研究中 ,提出了一种通过属性约简提取空战决策的关键信息和战术规则的算法 ,以便对空战过程中的冗余信息进行约简 ,提高决策实时性。通过一个空战战术选择示例对该算法进行了验证 ,结果表明 :在保证空战战术分类结果不变的情况下 ,该算法可提取出对空战决策起关键作用的信息以及最小简化战术规则。 相似文献
70.
实际中的决策问题常常具有不确定性和灰色性。根据灰色系统和模糊数学的一些理论,同时考虑一个问题中的模糊性——隶属度与灰色性——灰度,将其综合起来表示为灰色模糊数的概念。在原有多属性决策(MADM)方法的基础上提出了一种灰色模糊多属性决策模型,并给出了模型的求解方法。待决策的各方案的排序是依据其到灰色模糊理想解的灰色模糊距离大小而进行的。 相似文献