全文获取类型
收费全文 | 353篇 |
免费 | 177篇 |
国内免费 | 27篇 |
出版年
2024年 | 3篇 |
2023年 | 6篇 |
2022年 | 5篇 |
2021年 | 4篇 |
2020年 | 13篇 |
2019年 | 7篇 |
2018年 | 7篇 |
2017年 | 20篇 |
2016年 | 32篇 |
2015年 | 26篇 |
2014年 | 33篇 |
2013年 | 26篇 |
2012年 | 22篇 |
2011年 | 20篇 |
2010年 | 18篇 |
2009年 | 34篇 |
2008年 | 27篇 |
2007年 | 27篇 |
2006年 | 40篇 |
2005年 | 26篇 |
2004年 | 23篇 |
2003年 | 16篇 |
2002年 | 13篇 |
2001年 | 20篇 |
2000年 | 13篇 |
1999年 | 10篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 8篇 |
1995年 | 5篇 |
1994年 | 2篇 |
1993年 | 6篇 |
1992年 | 7篇 |
1991年 | 6篇 |
1990年 | 9篇 |
1989年 | 3篇 |
1988年 | 1篇 |
排序方式: 共有557条查询结果,搜索用时 312 毫秒
31.
32.
33.
34.
大整数乘除运算在PC机上的实现 总被引:3,自引:0,他引:3
大整数在要求高精度的应用中非常有用.特别是大质数和一般大整数有一个极为重要的应用,就是关于计算机数据加密.在计算机数据加密技术中,常会遇到大整数的算术运算问题.由于所使用的机器和所用语言的限制,大整数的"乘""模"两种运算很难运用高级语言中的"乘""除"运算.提出了一种逐位存储、按字节运算的方法,并用C 实现了大整数的十进制乘除法运算,之后将提出的算法与类似算法的时间复杂度进行了比较,最后给出了算法的运行时间. 相似文献
35.
小波网络为非线性系统辨识研究提供了一种有效的方法,但目前用于小波网络学习的进化算法易陷入局部极小等缺陷.结合生物免疫系统的概念和理论,在非线性系统辨识中引入基于免疫算法的小波网络.该算法中抗体通过浓度相互作用的机制来促进或抑制抗体的生成,借此保持抗体的多样性,并产生了高亲和力的抗体对种群进行不断的更新,提高了算法的全局搜索能力和收敛速度.最后,把基于免疫算法的小波网络用于一个非线性系统辨识的标准实例中,仿真结果验证了该算法的有效性. 相似文献
36.
卫星任务规划与调度是空间资源管理的重要内容之一,其目的在于为卫星系统的任务计划编制提供科学合理的决策手段与依据。卫星任务调度问题的重要特点在于,调度任务存在可见时间窗口约束。只有在可见时间窗口内,调度任务才可能执行并完成。在进行合理假设的基础上,建立卫星任务调度问题的约束规划模型。对基本禁忌搜索算法进行改进,提出了模型求解的变邻域禁忌搜索算法。应用结果表明,约束规划模型的建立与求解是合理的。 相似文献
37.
In this paper, a condition-based maintenance model for a multi-unit production system is proposed and analyzed using Markov renewal theory. The units of the system are subject to gradual deterioration, and the gradual deterioration process of each unit is described by a three-state continuous time homogeneous Markov chain with two working states and a failure state. The production rate of the system is influenced by the deterioration process and the demand is constant. The states of the units are observable through regular inspections and the decision to perform maintenance depends on the number of units in each state. The objective is to obtain the steady-state characteristics and the formula for the long-run average cost for the controlled system. The optimal policy is obtained using a dynamic programming algorithm. The result is validated using a semi-Markov decision process formulation and the policy iteration algorithm. Moreover, an analytical expression is obtained for the calculation of the mean time to initiate maintenance using the first passage time theory. 相似文献
38.
We study a periodic-review assemble-to-order (ATO) system with multiple components and multiple products, in which the inventory replenishment for each component follows an independent base-stock policy and stochastic product demands are satisfied according to a First-Come-First-Served rule. We assume that the replenishment for various component suffers from lead time uncertainty. However, the decision maker has the so-called advance supply information (ASI) associated with the lead times and thus can take advantage of the information for system optimization. We propose a multistage stochastic integer program that incorporates ASI to address the joint optimization of inventory replenishment and component allocation. The optimal base-stock policy for the inventory replenishment is determined using the sample average approximation algorithm. Also, we provide a modified order-based component allocation (MOBCA) heuristic for the component allocation. We additionally consider a special case of the variable lead times where the resulting two-stage stochastic programming model can be characterized as a single-scenario case of the proposed multistage model. We carry out extensive computational studies to quantify the benefits of integrating ASI into joint optimization and to explore the possibility of employing the two-stage model as a relatively efficient approximation scheme for the multistage model. 相似文献
39.
Martijn van Ee 《海军后勤学研究》2020,67(2):147-158
We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability pi: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete. 相似文献
40.
为了实现利用船舶静态电场对船舶进行跟踪的目的,针对传统卡尔曼滤波算法中存在的问题,设计一种新的非线性滤波器。建立船舶的状态空间模型,分析传统卡尔曼滤波算法在船舶跟踪中存在的问题;依据渐进贝叶斯思想,利用连续白噪声与离散白噪声序列噪声协方差之间的关系,设计一种新的渐进更新扩展卡尔曼滤波器。仿真结果表明,该滤波器能有效地抑制由于初始误差较大而造成的滤波性能下降和滤波发散,能够有效地跟踪船舶,具有较高的实用价值。 相似文献