全文获取类型
收费全文 | 721篇 |
免费 | 296篇 |
国内免费 | 59篇 |
出版年
2024年 | 6篇 |
2023年 | 14篇 |
2022年 | 16篇 |
2021年 | 22篇 |
2020年 | 31篇 |
2019年 | 41篇 |
2018年 | 30篇 |
2017年 | 75篇 |
2016年 | 73篇 |
2015年 | 40篇 |
2014年 | 78篇 |
2013年 | 71篇 |
2012年 | 67篇 |
2011年 | 61篇 |
2010年 | 46篇 |
2009年 | 62篇 |
2008年 | 40篇 |
2007年 | 34篇 |
2006年 | 58篇 |
2005年 | 40篇 |
2004年 | 37篇 |
2003年 | 19篇 |
2002年 | 19篇 |
2001年 | 15篇 |
2000年 | 11篇 |
1999年 | 12篇 |
1998年 | 9篇 |
1997年 | 3篇 |
1996年 | 6篇 |
1995年 | 8篇 |
1994年 | 4篇 |
1993年 | 6篇 |
1992年 | 4篇 |
1991年 | 6篇 |
1990年 | 6篇 |
1989年 | 6篇 |
排序方式: 共有1076条查询结果,搜索用时 15 毫秒
161.
给出了Hilbert空间中拟非扩张映像族公共不动点的一个杂交投影算法,使用修正的杂交投影迭代算法,证明了一个强收敛定理,扩展了文献的结果。 相似文献
162.
阐述电磁防护工作中仿生研究所需要涉及的学科类型和基本内容,对所做工作在整个仿生领域中进行大致的定位;提出生物一电子研究的对等模型、总体构成和实现基础,细化具体研究的方向、设想和防护模式,并从原型实现的工程角度介绍实施策略,使得复杂电磁干扰环境下控制系统板卡及芯片级防护的仿生构想在技术上成为可能。 相似文献
163.
164.
165.
We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap. 相似文献
166.
167.
基于模糊均值聚类算法的图像分割 总被引:2,自引:0,他引:2
将图像直方图统计特性引入到FCM聚类算法的目标函数中,用混合粒子群优化算法对目标函数进行全局最优求解,提高了图像分割的运算速度。 相似文献
168.
介绍了环形杠杆供弹机构的工作原理及其在实际使用中常见的问题,建立了机构的动力学模型,对模型进行动态求解,模拟了机构的工作过程。借助求解结果,针对问题产生的原因进行了动力学分析,在理论上找到了问题产生的根源。在此基础上建立了机构的最优化数学模型,给出了优化方案,最后对优化方案和现有结构进行了比较。 相似文献
169.
针对SMP机群,探讨了分别利用单机优化、OpenMP与MPI从指令级、共享存储级与分布主存级三个层次上改善矩阵并行乘Fox算法性能的方法。并通过调用数学函数库与混合编程的方式,在深腾6800上进行了实验,取得了相当满意的数值效果。 相似文献
170.
Consider a project during the life cycle of which there are cash payouts and in‐flows. To better meet his financial commitments, the project owner would like to meet all deadlines without running out of cash. We show that the cash availability objective is similar to the total weighted flowtime used to measure work‐in‐progress performance in the scheduling and inventory control literatures. In this article we provide several specialized solution methods for the problem of minimizing total weighted flowtime in an arbitrary acyclic project network, subject to activity release times and due dates, where the activity weights may be positive or negative and represent cash in‐ and out‐flows. We describe the structure of an optimal solution and provide several efficient algorithms and their complexity based on mincost and maxflow formulations. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献