全文获取类型
收费全文 | 543篇 |
免费 | 162篇 |
国内免费 | 37篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 5篇 |
2021年 | 19篇 |
2020年 | 9篇 |
2019年 | 11篇 |
2018年 | 6篇 |
2017年 | 24篇 |
2016年 | 33篇 |
2015年 | 14篇 |
2014年 | 34篇 |
2013年 | 63篇 |
2012年 | 27篇 |
2011年 | 34篇 |
2010年 | 30篇 |
2009年 | 33篇 |
2008年 | 39篇 |
2007年 | 33篇 |
2006年 | 37篇 |
2005年 | 43篇 |
2004年 | 36篇 |
2003年 | 32篇 |
2002年 | 28篇 |
2001年 | 19篇 |
2000年 | 14篇 |
1999年 | 22篇 |
1998年 | 20篇 |
1997年 | 10篇 |
1996年 | 10篇 |
1995年 | 8篇 |
1994年 | 9篇 |
1993年 | 8篇 |
1992年 | 5篇 |
1991年 | 4篇 |
1990年 | 18篇 |
1989年 | 3篇 |
排序方式: 共有742条查询结果,搜索用时 0 毫秒
1.
一种运用遗传算法确定船舶航向控制模糊规则的方法 总被引:6,自引:1,他引:5
为了克服船舶航向控制模糊规则确定过程中的盲目性,引入一种与之相适应的遗传算法,以使结果成为某种意义下的最优解,从而从根本上解决这一重要问题.文中运用Matlab的C语言MEX-文件技术,将遗传算法源代码与Matlab直接结合起来,利用后者的强大建模能力,建立起完整的仿真模型.仿真结果表明,船舶的航向控制能力得到明显改善. 相似文献
2.
目前微小卫星正在积极地发展中,脉冲等离子体推力器是其推进系统的一个重要发展方向,为了能够将PPT成功地运用于空间,需对其羽流进行研究.将DSMC(Direct Simulation Monte-Carlo)/PIC(Particle in Cell)流体混合算法与一维MHD放电模型相结合,一体化模拟NASA Glenn PPT羽流,对不同出口偏转角的羽流场进行模拟,并与实验结果进行了比较.计算结果显示引入出口速度的偏转角提高了模型的羽流扩散能力,羽流的扩散角是影响羽流的一个主要因素. 相似文献
3.
4.
5.
We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
6.
采用低中频架构设计了一种0.18μm CMOS工艺的GPS/BDS双模可重构接收机射频前端,能在GPS L1模式或BDS B1模式下工作。通过频率自适应电路调整中频滤波器的时间常数,降低其频率不确定度;压控振荡器中加入4位开关电容阵列,以提高频率调谐范围和相位噪声性能;通过硬件复用的方式降低系统功耗。测试结果表明,在1.8 V电源电压下,功耗37.8 m W,电压增益为103 d B,GPS L1和BDS B1波段噪声系数均小于3.2 d B。 相似文献
7.
Magnetic resonance imaging and other multifunctional diagnostic facilities, which are considered as scarce resources of hospitals, typically provide services to patients with different medical needs. This article examines the admission policies during the appointment management of such facilities. We consider two categories of patients: regular patients who are scheduled in advance through an appointment system and emergency patients with randomly generated demands during the workday that must be served as soon as possible. According to the actual medical needs of patients, regular patients are segmented into multiple classes with different cancelation rates, no‐show probabilities, unit value contributions, and average service times. Management makes admission decisions on whether or not to accept a service request from a regular patient during the booking horizon to improve the overall value that could be generated during the workday. The decisions should be made by considering the cancelation and no‐show behavior of booked patients as well as the emergency patients that would have to be served because any overtime service would lead to higher costs. We studied the optimal admission decision using a continuous‐time discrete‐state dynamic programming model. Identifying an optimal policy for this discrete model is analytically intractable and numerically inefficient because the state is multidimensional and infinite. We propose to study a deterministic counterpart of the problem (i.e., the fluid control problem) and to develop a time‐based fluid policy that is shown to be asymptotically optimal for large‐scale problems. Furthermore, we propose to adopt a mixed fluid policy that is developed based on the information obtained from the fluid control problem. Numerical experiments demonstrate that this improved policy works effectively for small‐scale problems. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 287–304, 2016 相似文献
8.
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 相似文献
9.
In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
10.