全文获取类型
收费全文 | 886篇 |
免费 | 19篇 |
出版年
2021年 | 11篇 |
2019年 | 18篇 |
2018年 | 8篇 |
2017年 | 19篇 |
2016年 | 17篇 |
2015年 | 16篇 |
2014年 | 19篇 |
2013年 | 165篇 |
2012年 | 8篇 |
2010年 | 9篇 |
2009年 | 14篇 |
2007年 | 16篇 |
2006年 | 9篇 |
2005年 | 10篇 |
2004年 | 13篇 |
2003年 | 11篇 |
2002年 | 14篇 |
2000年 | 8篇 |
1999年 | 9篇 |
1998年 | 17篇 |
1997年 | 15篇 |
1996年 | 13篇 |
1995年 | 7篇 |
1994年 | 21篇 |
1993年 | 23篇 |
1992年 | 16篇 |
1991年 | 21篇 |
1990年 | 15篇 |
1989年 | 28篇 |
1988年 | 25篇 |
1987年 | 23篇 |
1986年 | 26篇 |
1985年 | 19篇 |
1984年 | 11篇 |
1983年 | 10篇 |
1982年 | 15篇 |
1981年 | 14篇 |
1980年 | 11篇 |
1979年 | 16篇 |
1978年 | 18篇 |
1977年 | 7篇 |
1976年 | 11篇 |
1975年 | 9篇 |
1974年 | 15篇 |
1973年 | 10篇 |
1972年 | 12篇 |
1971年 | 11篇 |
1970年 | 14篇 |
1969年 | 10篇 |
1967年 | 9篇 |
排序方式: 共有905条查询结果,搜索用时 46 毫秒
71.
This article details several procedures for using path control variates to improve the accuracy of simulation-based point and confidence-interval estimators of the mean completion time of a stochastic activity network (SAN). Because each path control variate is the duration of the corresponding directed path in the network from the source to the sink, the vector of selected path controls has both a known mean and a known covariance matrix. This information is incorporated into estimation procedures for both normal and nonnormal responses. To evaluate the performance of these procedures experimentally, we examine the bias, variance, and mean square error of the controlled point estimators as well as the average half-length and coverage probability of the corresponding confidence-interval estimators for a set of SANs in which the following characteristics are systematically varied: (a) the size of the network (number of nodes and arcs); (b) the topology of the network; (c) the percentage of activities with exponentially distributed durations; and (d) the relative dominance of the critical path. The experimental results show that although large improvements in accuracy can be achieved with some of these procedures, the confidence-interval estimators for normal responses may suffer serious loss of coverage probability in some applications. 相似文献
72.
Cumulative search-evasion games (CSEGs) are two-person zero-sum search-evasion games where play proceeds throughout some specified period without interim feedback to either of the two players. Each player moves according to a preselected plan. If (Xt, Yt,) are the positions of the two players at time t, then the game's payoff is the sum over t from 1 to T of A(Xt, Yt, t). Additionally, all paths must be “connected.” That is, the finite set of positions available for a player in any time period depends on the position selected by that player in the previous time period. One player attempts to select a mixed strategy over the feasible T-time period paths to maximize the expected payoff. The other minimizes. Two solution procedures are given. One uses the Brown-Robinson method of fictitious play and the other linear programming. An example problem is solved using both procedures. 相似文献
73.
74.
A generalization of the equi-partitioning problem, termed the 2D-Partition Problem, is formulated. The motivation is an aircraft maintenance scheduling problem with the following characteristics. The complete maintenance overhaul of a single aircraft requires the completion of some 350 tasks. These tasks require a varying number of technicians working at the same time. For large subsets of these 350 tasks, the constraining resource is physical space—tasks must be completed in a physical space of limited size such as the cockpit. Furthermore, there is no precedence relationship among the tasks. For each subset, the problem is to schedule the tasks to minimize makespan. Let m denote the maximum number of technicians that can work at the same time in the physical area under consideration. We present optimization algorithms for m = 2 and 3. © 1996 John Wiley & Sons, Inc. 相似文献
75.
In an endeavor to broaden the application of scheduling models to decisions involving the use of a manager's time we use simulation to investigate the performance of a number of simple algorithms (including eight priority rules and a construction heuristic) in a dynamic setting with tasks arriving (randomly) and scheduling decisions being made, over time. We compare these simple methods relative to a bound that uses an adjacent pairwise interchange algorithm. We model uncertainty in task durations, and costs being incurred for early and tardy task completion (representative of JIT settings). In addition to evaluating the efficacy of the scheduling rules and various preemption strategies (using ANOVA), we highlight the managerial implications of the effects of eight environmental parameters. © 1996 John Wiley & Sons, Inc. 相似文献
76.
In Turner and Holmes [8] a model for evasive vehicle movement along a fixed track is developed within the mathematical framework of a two-state semi-Markov process. They derive a number of analytical properties of the model. In this article we address problems concerning the estimation of parameters in the model and the construction of data-based prediction equations. 相似文献
77.
Methodology for the optimal selection of a mixture of components for the attainment of a required performance level is developed. This accommodates both cost and stochastic variation and is applied to gasoline blending. © 1994 John Wiley & Sons, Inc. 相似文献
78.
J. S. Dagpunar 《海军后勤学研究》1994,41(7):1029-1037
A system undergoes minimal repair during [0, T] with a failure replacement on first failure during [T, a], or a planned replacement if the system is still functioning at elapsed time a. Repairs and replacements are not necessarily instantaneous. An expression is obtained for the asymptotic expected cost rate, and sufficient conditions are obtained for the optimum T* > 0. Several special cases are considered. A numerical investigation for a Weibull distributed time to first failure compares this elapsed-time policy with replacement on failure only, and also a policy based on system operating time or age. It is found that in many cases the elapsed-time-based policy is only marginally worse than one based on system age, and may therefore be preferred in view of its administrative convenience. © 1994 John Wiley & Sons, Inc. 相似文献
79.
We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
80.
The importance of subset selection in multiple regression has been recognized for more than 40 years and, not surprisingly, a variety of exact and heuristic procedures have been proposed for choosing subsets of variables. In the case of polynomial regression, the subset selection problem is complicated by two issues: (1) the substantial growth in the number of candidate predictors, and (2) the desire to obtain hierarchically well‐formulated subsets that facilitate proper interpretation of the regression parameter estimates. The first of these issues creates the need for heuristic methods that can provide solutions in reasonable computation time; whereas the second requires innovative neighborhood search approaches that accommodate the hierarchical constraints. We developed tabu search and variable neighborhood search heuristics for subset selection in polynomial regression. These heuristics are applied to a classic data set from the literature and, subsequently, evaluated in a simulation study using synthetic data sets. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献