全文获取类型
收费全文 | 811篇 |
免费 | 345篇 |
国内免费 | 63篇 |
出版年
2024年 | 3篇 |
2023年 | 18篇 |
2022年 | 10篇 |
2021年 | 20篇 |
2020年 | 35篇 |
2019年 | 15篇 |
2018年 | 15篇 |
2017年 | 60篇 |
2016年 | 70篇 |
2015年 | 49篇 |
2014年 | 67篇 |
2013年 | 53篇 |
2012年 | 77篇 |
2011年 | 59篇 |
2010年 | 43篇 |
2009年 | 88篇 |
2008年 | 58篇 |
2007年 | 61篇 |
2006年 | 73篇 |
2005年 | 48篇 |
2004年 | 48篇 |
2003年 | 38篇 |
2002年 | 39篇 |
2001年 | 29篇 |
2000年 | 28篇 |
1999年 | 21篇 |
1998年 | 18篇 |
1997年 | 18篇 |
1996年 | 13篇 |
1995年 | 9篇 |
1994年 | 8篇 |
1993年 | 9篇 |
1992年 | 6篇 |
1991年 | 2篇 |
1990年 | 8篇 |
1989年 | 3篇 |
排序方式: 共有1219条查询结果,搜索用时 31 毫秒
101.
利用粒子群优化算法和最小二乘支持向量机,建立地球静止轨道高能电子通量在线预测模型。针对粒子群优化算法,提出一种新的粒子群多样性测度计算方法,有效改善其早熟收敛现象。运用改进的粒子群优化算法优化最小二乘支持向量机的正则化参数和核参数。利用滑动时间窗口策略更新模型数据,选择触发机制以及模型的再学习机制为设计变量,实现模型的在线预测功能。对2000年电子通量监测数据和相关太阳风、地磁参数等实际数据进行的提前1~3天的预测实验,表明所建在线预测模型具有较高的预测性能,并具有一定的实用价值。 相似文献
102.
103.
邓超 《后勤工程学院学报》2009,25(3):39-43
为实现油料快速调拨运输,利用改进的遗传算法求解油料调拨优化问题,采用了一种受贪婪算法启发的新的交叉算子和变异算子,对比模拟退火算法等其他算法而言,具有较好的鲁棒性,能很好地解决油料调拨运输过程中多任务多地点的油料调拨运输问题。 相似文献
104.
105.
针对传统弹丸速度测量方法的局限,提出一种新的弹丸速度测试技术——数字化激光幕结合互相关速度测量算法的测试技术,并给出了激光总体测速方案、测速原理以及互相关测速方法,经靶场试验验证测试效果良好。 相似文献
106.
We consider the problem of nonparametric multi-product dynamic pricing with unknown demand and show that the problem may be formulated as an online model-free stochastic program, which can be solved by the classical Kiefer-Wolfowitz stochastic approximation (KWSA) algorithm. We prove that the expected cumulative regret of the KWSA algorithm is bounded above by where κ1, κ2 are positive constants and T is the number of periods for any T = 1, 2, … . Therefore, the regret of the KWSA algorithm grows in the order of , which achieves the lower bounds known for parametric dynamic pricing problems and shows that the nonparametric problems are not necessarily more difficult to solve than the parametric ones. Numerical experiments further demonstrate the effectiveness and efficiency of our proposed KW pricing policy by comparing with some pricing policies in the literature. 相似文献
107.
In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017 相似文献
108.
109.
The “gold‐mining” decision problem is concerned with the efficient utilization of a delicate mining equipment working in a number of different mines. Richard Bellman was the first to consider this type of a problem. The solution found by Bellman for the finite‐horizon, continuous‐time version of the problem with two mines is not overly realistic since he assumed that fractional parts of the same mining equipment could be used in different mines and this fraction could change instantaneously. In this paper, we provide some extensions to this model in order to produce more operational and realistic solutions. Our first model is concerned with developing an operational policy where the equipment may be switched from one mine to the other at most once during a finite horizon. In the next extension we incorporate a cost component in the objective function and assume that the horizon length is not fixed but it is the second decision variable. Structural properties of the optimal solutions are obtained using nonlinear programming. Each model and its solution is illustrated with a numerical example. The models developed here may have potential applications in other areas including production of items requiring the same machine or choosing a sequence of activities requiring the same resource. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 186–203, 2002; DOI 10.1002/nav.10008 相似文献
110.
提出了一种基于免疫粒子群优化算法的自抗扰大包线飞行控制器设计方法.针对传统的增益调参设计方法存在的工作量巨大与设计效率低的问题,利用自抗扰控制器进行大包线飞行控制器设计,并推导了适用于该方法的飞机非线性方程.由于自抗扰控制能够动态补偿对象模型的内扰和外扰,因此在很大的飞行区域内仅需一套控制器便可,从而避免了烦琐复杂的增益调参设计过程,并用免疫粒子群优化算法对自抗扰控制器参数进行了优化研究.仿真结果表明,所设计的自抗扰控制器具有优良的控制性能,并且控制器参数在较大的包线范围内不需要改变,从而简化了大包线飞行控制器设计. 相似文献