排序方式: 共有88条查询结果,搜索用时 13 毫秒
1.
在等概率抽样群体的条件下,讨论了演化算法的隐合并行性,得到了算法每代隐含处理的模式长度不超过ls(0≤ls≤l)的不同模式期望数的精确表达,并估计了其上下界. 相似文献
2.
3.
Amy Ding 《Defense & Security Analysis》2007,23(4):359-377
The grand aim of all science is to cover the greatest number of empirical facts by logical deduction from the smallest number of hypotheses or axioms. Albert Einstein
Current problem: Border Emergency Solutions in response US Congress's response: Set immigration policies, a series of immigration reform bills and proposals. Government's response: Make an appropriation/budget for border issues: increase law enforcement personnel and needed resources, pay officers overtime, and build fences along the border. Scientists' response: Describe this complex problem mathematically and provide scientific solutions. 相似文献
4.
5.
6.
For computing an optimal (Q, R) or kindred inventory policy, the current literature provides mixed signals on whether or when it is safe to approximate a nonnormal lead‐time‐demand (“LTD”) distribution by a normal distribution. The first part of this paper examines this literature critically to justify why the issue warrants further investigations, while the second part presents reliable evidence showing that the system‐cost penalty for using the normal approximation can be quite serious even when the LTD‐distribution's coefficient of variation is quite low—contrary to the prevalent view of the literature. We also identify situations that will most likely lead to large system‐cost penalty. Our results indicate that, given today's technology, it is worthwhile to estimate an LTD‐distribution's shape more accurately and to compute optimal inventory policies using statistical distributions that more accurately reflect the LTD‐distributions' actual shapes. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
7.
在卫星星间测距模拟信号仿真及实际测试中,为提高测距模拟信号精度和系统可用带宽,提出基于边界拟合Remez算法的高精度分数时延滤波器的设计算法。该算法利用Farrow结构的多项式近似思想,采用多项式拟合Remez算法设计滤波器的冲激响应边界系数,通过多相分解实现分数时延滤波器组。该算法改善了当设计的滤波器阶数较高时冲激响应边界的不连续现象,进而降低了群时延误差,提高了精度。仿真结果表明,该算法设计的滤波器的分数时延精度得到了提高,同时系统可用带宽提高近一倍,实现时需使用的乘法器数目也有明显降低。 相似文献
8.
9.
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. 相似文献
10.