全文获取类型
收费全文 | 331篇 |
免费 | 77篇 |
国内免费 | 8篇 |
出版年
2023年 | 2篇 |
2021年 | 7篇 |
2020年 | 8篇 |
2019年 | 5篇 |
2018年 | 4篇 |
2017年 | 7篇 |
2016年 | 13篇 |
2015年 | 18篇 |
2014年 | 11篇 |
2013年 | 72篇 |
2012年 | 18篇 |
2011年 | 20篇 |
2010年 | 14篇 |
2009年 | 18篇 |
2008年 | 22篇 |
2007年 | 25篇 |
2006年 | 9篇 |
2005年 | 14篇 |
2004年 | 14篇 |
2003年 | 15篇 |
2002年 | 15篇 |
2001年 | 9篇 |
2000年 | 8篇 |
1999年 | 16篇 |
1998年 | 8篇 |
1997年 | 9篇 |
1996年 | 4篇 |
1994年 | 2篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1972年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有416条查询结果,搜索用时 31 毫秒
351.
We consider a single-machine scheduling problem in which all jobs have the same due date and penalties are assessed for both early and late completion of jobs. However, earliness and tardiness are penalized at different rates. The scheduling objective is to minimize either the weighted sum of absolute deviations (WSAD) or the weighted sum of squared deviations (WSSD). For each objective we consider two versions of the problem. In the unconstrained version an increase in the due date does not yield any further decrease in the objective function. We present a constructive algorithm for the unconstrained WSAD problem and show that this problem is equivalent to the two-parallel, nonidentical machine, mean flow-time problem. For the unconstrained WSSD and the constrained WSAD and WSSD problems we propose implicit enumeration procedures based on several dominance conditions. We also report on our computational experience with the enumeration procedures. 相似文献
352.
353.
针对现有短波频率优选方法中数据处理过程复杂、输入参数条件苛刻、工程实现难度较大等不足,结合电离层变化特性,提出了一种基于球状模型的泛克里金法,应用于短波频率的重构。利用短波频率管理系统中大量的实测频率数据,构建了符合频率数据变化特征的基于球状模型的变异函数,建立了反映沿经度、纬度及水平方向通信频率变化剧烈程度的漂移表达式。随机选取多个样本数据,通过交叉重构法对短波频率数据进行重构。实验结果表明,基于球状模型的泛克里金法具有较高的频率重构精度,能够应用于短波通信频率的重构,特别是满足军事通信方面对短波频率优选手段的需求。 相似文献
354.
355.
This paper analyzes how the equilibrium outcome of social conflict between factions is strategically altered by third-party intervention. We consider an intervening third party that commits financial support to one of two contending factions for reducing its cost in conflict. Within the framework of three-player sequential-move games, we investigate the questions as follows. What is the optimal intervention intensity in terms of the third party’s financial support? Is there a first-mover advantage in conflict when there is third-party intervention? Fighting against all odds, will the unsupported faction have a chance to prevail when its opponent receives third-party support? What is the optimal timing of third-party intervention? The analysis in the paper has implications for the conditions under which the strategic intervention of a third party may or may not break a conflict between factions. 相似文献
356.
357.
This article considers the empty vehicle redistribution problem in a hub‐and‐spoke transportation system, with random demands and stochastic transportation times. An event‐driven model is formulated, which yields the implicit optimal control policy. Based on the analytical results for two‐depot systems, a dynamic decomposition procedure is presented which produces a near‐optimal policy with linear computational complexity in terms of the number of spokes. The resulting policy has the same asymptotic behavior as that of the optimal policy. It is found that the threshold‐type control policy is not usually optimal in such systems. The results are illustrated through small‐scale numerical examples. Through simulation the robustness of the dynamic decomposition policy is tested using a variety of scenarios: more spokes, more vehicles, different combinations of distribution types for the empty vehicle travel times and loaded vehicle arrivals. This shows that the dynamic decomposition policy is significantly better than a heuristics policy in all scenarios and appears to be robust to the assumptions of the distribution types. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
358.
359.
We propose a dynamic escape route system for emergency evacuation of a naval ship. The system employs signals that adapt to the causative contingency and the crew's physical distribution about the ship. A mixed‐integer nonlinear programming model, with underlying network structure, optimizes the evacuation process. The network's nodes represent compartments, closures (e.g., doors and hatches) and intersections, while arcs represent various types of passageways. The objective function integrates two potentially conflicting factors: average evacuation time and the watertight and airtight integrity of the ship after evacuation. A heuristic solves the model approximately using a sequence of mixed‐integer linear approximating problems. Using data for a Spanish frigate, with standard static routes specified by the ship's designers, computational tests show that the dynamic system can reduce average evacuation times, nearly 23%, and can improve a combined measure of ship integrity by up to 50%. In addition, plausible design changes to the frigate yield further, substantial improvements. Published 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008 相似文献
360.