全文获取类型
收费全文 | 506篇 |
免费 | 9篇 |
专业分类
515篇 |
出版年
2021年 | 6篇 |
2020年 | 4篇 |
2019年 | 7篇 |
2017年 | 12篇 |
2016年 | 17篇 |
2015年 | 10篇 |
2014年 | 8篇 |
2013年 | 73篇 |
2012年 | 23篇 |
2011年 | 28篇 |
2010年 | 21篇 |
2009年 | 15篇 |
2008年 | 30篇 |
2007年 | 14篇 |
2006年 | 17篇 |
2005年 | 8篇 |
2004年 | 5篇 |
2002年 | 5篇 |
2001年 | 4篇 |
1999年 | 2篇 |
1998年 | 6篇 |
1997年 | 7篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 10篇 |
1992年 | 7篇 |
1991年 | 6篇 |
1990年 | 2篇 |
1989年 | 12篇 |
1988年 | 5篇 |
1987年 | 11篇 |
1986年 | 11篇 |
1985年 | 7篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 10篇 |
1979年 | 11篇 |
1978年 | 4篇 |
1977年 | 7篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1972年 | 12篇 |
1971年 | 3篇 |
1970年 | 3篇 |
1969年 | 9篇 |
1968年 | 7篇 |
1966年 | 3篇 |
排序方式: 共有515条查询结果,搜索用时 0 毫秒
241.
Joseph S. Martinich 《海军后勤学研究》1988,35(2):185-201
This article uses a vertex-closing approach to investigate the p-center problem. The optimal set of vertices to close are found in imbedded subgraphs of the original graph. Properties of these subgraphs are presented and then used to characterize the optimal solution, to establish a priori upper and lower bounds, to establish refined lower bounds, and to verify the optimality of solutions. These subgraphs form the foundation of two polynomial algorithms of complexity O(|E| log |E|) and O(|E|2). The algorithms are proven to converge to an optimum for special cases, and computational evidence is provided which suggests that they produce very good solutions more generally. Both algorithms perform very well on problems where p is large relative to the number of vertices n, specifically, when p/n ≥ 0.30. One of the algorithms is especially efficient for solving a sequence of problems on the same graph. 相似文献
242.
The optimal linear combination of control variates in the presence of asymptotically negligible bias
The optimal linear combination of control variates is well known when the controls are assumed to be unbiased. We derive here the optimal linear combination of controls in the situation where asymptotically negligible bias is present. The small-sample linear control which minimizes the mean square error (MSE) is derived. When the optimal asymptotic linear control is used rather than the optimal small-sample control, the degradation in MSE is c/n3, where n is the sample size and c is a known constant. This analysis is particulary relevant to the small-sample theory for control variates as applied to the steady-state estimation problem. Results for the method of multiple estimates are also given. 相似文献
243.
In this paper we present several 1‐median formulations on a tree network which incorporate dynamic evolution and/or uncertainty of node demands and transportation costs over a planning horizon. Dynamic evolution is modeled using linear demand functions for the nodes and linear length functions for the edges. Uncertainty is modeled with the use of multiple scenarios, where a scenario is a complete specification of the uncertain node demands and/or edge lengths. We formulate our objective using minimax regret like criteria. We use two different criteria, namely, robust deviation and relative robustness. We discuss what motivated the introduction of these objectives, as well as their relation to existing literature and decision making practices. For all of the models presented, we provide low‐order polynomial time algorithms. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 147–168, 1999 相似文献
244.
n periodic tasks are to be processed by a single machine, where each task i has a maximum request rate or periodicity Fi, a processing time Ei, a deadline Di, relative to each request of task i, a task-request interrupt overhead Ii, and a task-independent scheduling overhead S. Two scheduling strategies are considered for sequencing the execution of an arbitrary arrangement of task requests in time: the preemptive and the nonpreemptive earliest-deadline algorithms. Necessary and sufficient conditions are derived for establishing whether a given set of tasks can be scheduled by each scheduling strategy. The conditions are given in the form of limited simulations of a small number of well-defined task-request arrangements. If all simulations succeed, the schedule is feasible for the given set of tasks. If any simulation fails, the schedule is infeasible. While interrupt handling and scheduling overheads can be handled by such simulations, context switching overhead resulting from preemption cannot. A counterexample illustrates how the simulations fail to uncover unschedulable task sets when context switching overhead is considered. 相似文献
245.
本文以实验结果为依据,首先分析了塑料弹体影响弹丸膛内运动的物理性能,然后结合旋转弹丸的膛内运动特征,经过模拟试验,采用数学拟合法,初步建立旋转稳定弹塑料弹体工程设计计算的数学模型(包括结构尺寸设计计算、强度计算和内弹道计算)。 相似文献
246.
基于时间融合的雷达辐射源自动识别方法 总被引:2,自引:0,他引:2
雷达辐射源识别是雷达对抗信号处理中关键环节,也是电子目标识别的重要前提.介绍了Dempster组合规则和加权M-距离法、灰关联分析法等时间融合的雷达辐射源自动识别方法,提出了基于证据理论的单传感器时间融合算法,研究了单传感器在不同时间测量周期的证据综合过程,并给出仿真试验结果.随着噪声的增大,传感器单次时间融合的正确识别率下降很快,而采用基于D-S证据理论的单传感器时间融合方法却有较高的正确识别率,该算法大大降低了错误识别率.因此提出的算法是可行的. 相似文献
247.
A cycle time‐throughput (CT‐TH) curve, which quantifies the relationship of long‐run average cycle time to throughput rate, plays an important role in strategic planning for manufacturing systems. In this paper, a nonlinear regression metamodel supported by queueing theory is developed to represent the underlying CT‐TH curve implied by a manufacturing simulation model. To estimate the model efficiently, simulation experiments are built up sequentially using a multistage procedure. Extensive numerical experiments are presented to demonstrate the effectiveness of the proposed procedure. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
248.
249.
Machine maintenance is modeled in the setting of a single‐server queue. Machine deterioration corresponds to slower service rates and failure. This leads to higher congestion and an increase in customer holding costs. The decision‐maker decides when to perform maintenance, which may be done pre‐emptively; before catastrophic failures. Similar to classic maintenance control models, the information available to the decision‐maker includes the state of the server. Unlike classic models, the information also includes the number of customers in queue. Considered are both a repair model and a replacement model. In the repair model, with random replacement times, fixed costs are assumed to be constant in the server state. In the replacement model, both constant and variable fixed costs are considered. It is shown in general that the optimal maintenance policies have switching curve structure that is monotone in the server state. However, the switching curve policies for the repair model are not always monotone in the number of customers in the queue. Numerical examples and two heuristics are also presented. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
250.