全文获取类型
收费全文 | 515篇 |
免费 | 145篇 |
国内免费 | 32篇 |
出版年
2024年 | 2篇 |
2023年 | 1篇 |
2022年 | 5篇 |
2021年 | 4篇 |
2020年 | 10篇 |
2019年 | 15篇 |
2018年 | 10篇 |
2017年 | 33篇 |
2016年 | 32篇 |
2015年 | 28篇 |
2014年 | 32篇 |
2013年 | 80篇 |
2012年 | 34篇 |
2011年 | 48篇 |
2010年 | 34篇 |
2009年 | 46篇 |
2008年 | 36篇 |
2007年 | 45篇 |
2006年 | 40篇 |
2005年 | 26篇 |
2004年 | 32篇 |
2003年 | 18篇 |
2002年 | 18篇 |
2001年 | 17篇 |
2000年 | 14篇 |
1999年 | 6篇 |
1998年 | 5篇 |
1997年 | 3篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 4篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1975年 | 1篇 |
排序方式: 共有692条查询结果,搜索用时 31 毫秒
561.
562.
563.
Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work 下载免费PDF全文
We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016 相似文献
564.
Validation of a strategy for harbor defense based on the use of a min‐max algorithm receding horizon control law 下载免费PDF全文
We present a validation of a centralized feedback control law for robotic or partially robotic water craft whose task is to defend a harbor from an intruding fleet of water craft. Our work was motivated by the need to provide harbor defenses against hostile, possibly suicidal intruders, preferably using unmanned craft to limit potential casualties. Our feedback control law is a sample‐data receding horizon control law, which requires the solution of a complex max‐min problem at the start of each sample time. In developing this control law, we had to deal with three challenges. The first was to develop a max‐min problem that captures realistically the nature of the defense‐intrusion game. The second was to ensure the solution of this max‐min problem can be accomplished in a small fraction of the sample time that would be needed to control a possibly fast moving craft. The third, to which this article is dedicated, was to validate the effectiveness of our control law first through computer simulations pitting a computer against a computer or a computer against a human, then through the use of model hovercraft in a laboratory, and finally on the Chesapeake Bay, using Yard Patrol boats. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 247–259, 2016 相似文献
565.
Motivated by applications to service systems, we develop simple engineering approximation formulas for the steady‐state performance of heavily loaded G/GI/n+GI multiserver queues, which can have non‐Poisson and nonrenewal arrivals and non‐exponential service‐time and patience‐time distributions. The formulas are based on recently established Gaussian many‐server heavy‐traffic limits in the efficiency‐driven (ED) regime, where the traffic intensity is fixed at ρ > 1, but the approximations also apply to systems in the quality‐and‐ED regime, where ρ > 1 but ρ is close to 1. Good performance across a wide range of parameters is obtained by making heuristic refinements, the main one being truncation of the queue length and waiting time approximations to nonnegative values. Simulation experiments show that the proposed approximations are effective for large‐scale queuing systems for a significant range of the traffic intensity ρ and the abandonment rate θ, roughly for ρ > 1.02 and θ > 2.0. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 187–217, 2016 相似文献
566.
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 相似文献
567.
We study an admission control model in revenue management with nonstationary and correlated demands over a finite discrete time horizon. The arrival probabilities are updated by current available information, that is, past customer arrivals and some other exogenous information. We develop a regret‐based framework, which measures the difference in revenue between a clairvoyant optimal policy that has access to all realizations of randomness a priori and a given feasible policy which does not have access to this future information. This regret minimization framework better spells out the trade‐offs of each accept/reject decision. We proceed using the lens of approximation algorithms to devise a conceptually simple regret‐parity policy. We show the proposed policy achieves 2‐approximation of the optimal policy in terms of total regret for a two‐class problem, and then extend our results to a multiclass problem with a fairness constraint. Our goal in this article is to make progress toward understanding the marriage between stochastic regret minimization and approximation algorithms in the realm of revenue management and dynamic resource allocation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 433–448, 2016 相似文献
568.
569.
570.
针对已有评估方法存在的不足,提出一种基于Vague集的防空武器系统机动能力评估新方法。分析了影响防空武器系统机动能力评估的指标因素,给出了各评价指标的模糊值表示及指标权重的计算方法,该方法能有效避免传统的专家打分法造成的主观偏差。在此基础上,建立了基于Vague集的防空武器系统机动能力综合评价模型,给出了评价其优劣的排序方法。最后通过实例分析验证,该方法评估结果准确,对指挥员科学决策具有一定的参考价值。 相似文献