全文获取类型
收费全文 | 270篇 |
免费 | 80篇 |
国内免费 | 22篇 |
出版年
2021年 | 6篇 |
2020年 | 7篇 |
2019年 | 8篇 |
2018年 | 3篇 |
2017年 | 11篇 |
2016年 | 13篇 |
2015年 | 14篇 |
2014年 | 15篇 |
2013年 | 12篇 |
2012年 | 28篇 |
2011年 | 37篇 |
2010年 | 10篇 |
2009年 | 26篇 |
2008年 | 17篇 |
2007年 | 16篇 |
2006年 | 22篇 |
2005年 | 24篇 |
2004年 | 18篇 |
2003年 | 10篇 |
2002年 | 15篇 |
2001年 | 12篇 |
2000年 | 8篇 |
1999年 | 11篇 |
1998年 | 8篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1994年 | 2篇 |
1993年 | 5篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 2篇 |
排序方式: 共有372条查询结果,搜索用时 296 毫秒
311.
We present, analyze, and compare three random search methods for solving stochastic optimization problems with uncountable feasible regions. Our adaptive search with resampling (ASR) approach is a framework for designing provably convergent algorithms that are adaptive and may consequently involve local search. The deterministic and stochastic shrinking ball (DSB and SSB) approaches are also convergent, but they are based on pure random search with the only difference being the estimator of the optimal solution [the DSB method was originally proposed and analyzed by Baumert and Smith]. The three methods use different techniques to reduce the effects of noise in the estimated objective function values. Our ASR method achieves this goal through resampling of already sampled points, whereas the DSB and SSB approaches address it by averaging observations in balls that shrink with time. We present conditions under which the three methods are convergent, both in probability and almost surely, and provide a limited computational study aimed at comparing the methods. Although further investigation is needed, our numerical results suggest that the ASR approach is promising, especially for difficult problems where the probability of identifying good solutions using pure random search is small. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
312.
Covering models assume that a point is covered if it is within a certain distance from a facility and not covered beyond that distance. In gradual cover models it is assumed that a point is fully covered within a given distance from a facility, then cover gradually declines, and the point is not covered beyond a larger distance. Gradual cover models address the discontinuity in cover which may not be the correct approach in many situations. In the stochastic gradual cover model presented in this article it is assumed that the short and long distances employed in gradual cover models are random variables. This refinement of gradual cover models provides yet a more realistic depiction of actual behavior in many situations. The maximal cover model based on the new concept is analyzed and the single facility location cover problem in the plane is solved. Computational results illustrating the effectiveness of the solution procedures are presented. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
313.
射击策略的选择在随机格斗中是一重要战术问题,当一方武器面临多个武器目标时,如何确定射击目标顺序的研究,显然是具有实际意义的。依据发射间隔服从负指数分布的多对一随机格斗中最优策略应满足的条件,推出求解此类多对一格斗最优策略的方法。进而研究了射击间隔服从此类分布的多对二随机格斗中处于劣势一方的射击策略选择问题,得出寻求最优射击策略的一般方法。 相似文献
314.
The signature of a system with independent and identically distributed (i.i.d.) component lifetimes is a vector whose ith element is the probability that the ith component failure is fatal to the system. System signatures have been found to be quite useful tools in the study and comparison of engineered systems. In this article, the theory of system signatures is extended to versions of signatures applicable in dynamic reliability settings. It is shown that, when a working used system is inspected at time t and it is noted that precisely k failures have occurred, the vector s [0,1]n‐k whose jth element is the probability that the (k + j)th component failure is fatal to the system, for j = 1,2,2026;,n ‐ k, is a distribution‐free measure of the design of the residual system. Next, known representation and preservation theorems for system signatures are generalized to dynamic versions. Two additional applications of dynamic signatures are studied in detail. The well‐known “new better than used” (NBU) property of aging systems is extended to a uniform (UNBU) version, which compares systems when new and when used, conditional on the known number of failures. Sufficient conditions are given for a system to have the UNBU property. The application of dynamic signatures to the engineering practice of “burn‐in” is also treated. Specifically, we consider the comparison of new systems with working used systems burned‐in to a given ordered component failure time. In a reliability economics framework, we illustrate how one might compare a new system to one successfully burned‐in to the kth component failure, and we identify circumstances in which burn‐in is inferior (or is superior) to the fielding of a new system. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
315.
针对考虑随机回放的卫星数传调度问题,从置换空间到调度解空间的映射方法和置换空间的搜索算法两方面进行了研究.提出了一种时间窗优先的置换序列映射算法,并证明该映射算法可以将置换序列映射到调度解空间上的最优解.提出了一种遗传随机搜索算法,基于有记忆功能的随机邻域搜索,在置换空间上搜索产生优化调度的置换序列.仿真计算表明,遗传随机搜索算法可以增强遗传算法的局部搜索能力,在搜索结果上平均获得了2.72%的改进. 相似文献
316.
In urban rail transit systems of large cities, the headway and following distance of successive trains have been compressed as much as possible to enhance the corridor capacity to satisfy extremely high passenger demand during peak hours. To prevent train collisions and ensure the safety of trains, a safe following distance of trains must be maintained. However, this requirement is subject to a series of complex factors, such as the uncertain train braking performance, train communication delay, and driver reaction time. In this paper, we propose a unified mathematical framework to analyze the safety‐oriented reliability of metro train timetables with different corridor capacities, that is, the train traffic density, and determine the most reliable train timetable for metro lines in an uncertain environment. By employing a space‐time network representation in the formulations, the reliability‐based train timetabling problem is formulated as a nonlinear stochastic programming model, in which we use 0‐1 variables to denote the time‐dependent velocity and position of all involved trains. Several reformulation techniques are developed to obtain an equivalent mixed integer programming model with quadratic constraints (MIQCP) that can be solved to optimality by some commercial solvers. To improve the computational efficiency of the MIQCP model, we develop a dual decomposition solution framework that decomposes the primal problem into several sets of subproblems by dualizing the coupling constraints across different samples. An exact dynamic programming combined with search space reduction strategies is also developed to solve the exact optimal solutions of these subproblems. Two sets of numerical experiments, which involve a relatively small‐scale case and a real‐world instance based on the operation data of the Beijing subway Changping Line are implemented to verify the effectiveness of the proposed approaches. 相似文献
317.
On allocating one active redundancy to coherent systems with dependent and heterogeneous components' lifetimes 下载免费PDF全文
This article studies coherent systems of heterogenous and statistically dependent components' lifetimes. We present a sufficient and necessary condition for a stochastically longer system lifetime resulted by allocating a single active redundancy. For exchangeable components' lifetimes, allocating the redundancy to the component with more minimal path sets is proved to produce a more reliable system, and for systems with stochastic arrangement increasing components' lifetimes and symmetric structure with respect to two components, allocating the redundancy to the weaker one brings forth a larger reliability. Several numerical examples are presented to illustrate the theoretical results as well. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 335–345, 2016 相似文献
318.
319.
320.
以考虑随机扰动的超声速二元机翼为研究对象,采用Kapitaniak方法对超声速二元机翼的随机混沌特性进行研究.采用三阶活塞理论推导超声速二元机翼的非线性气动力和气动力矩,建立考虑随机扰动、具有俯仰立方非线性的机翼2自由度运动微分方程,并将其写成4维状态方程的形式;采用中心流形方法对系统进行降维,将系统状态方程从4维降为... 相似文献