全文获取类型
收费全文 | 479篇 |
免费 | 10篇 |
出版年
2021年 | 5篇 |
2019年 | 14篇 |
2018年 | 9篇 |
2017年 | 11篇 |
2016年 | 11篇 |
2015年 | 11篇 |
2013年 | 79篇 |
2011年 | 5篇 |
2010年 | 7篇 |
2009年 | 4篇 |
2007年 | 6篇 |
2006年 | 7篇 |
2005年 | 11篇 |
2004年 | 8篇 |
2003年 | 5篇 |
2001年 | 4篇 |
2000年 | 9篇 |
1999年 | 6篇 |
1998年 | 5篇 |
1997年 | 9篇 |
1996年 | 12篇 |
1995年 | 4篇 |
1994年 | 10篇 |
1993年 | 6篇 |
1992年 | 7篇 |
1991年 | 14篇 |
1990年 | 8篇 |
1989年 | 12篇 |
1988年 | 6篇 |
1987年 | 11篇 |
1986年 | 9篇 |
1985年 | 11篇 |
1984年 | 9篇 |
1983年 | 7篇 |
1982年 | 6篇 |
1981年 | 8篇 |
1980年 | 10篇 |
1979年 | 8篇 |
1978年 | 8篇 |
1977年 | 8篇 |
1976年 | 9篇 |
1975年 | 6篇 |
1974年 | 11篇 |
1973年 | 8篇 |
1972年 | 9篇 |
1971年 | 13篇 |
1970年 | 3篇 |
1969年 | 6篇 |
1968年 | 5篇 |
1967年 | 3篇 |
排序方式: 共有489条查询结果,搜索用时 15 毫秒
141.
In the classical multiprocessor scheduling problem independent jobs must be assigned to parallel, identical machines with the objective of minimizing the makespan. This article explores the effect of assignment restrictions on the jobs for multiprocessor scheduling problems. This means that each job can only be processed on a specific subset of the machines. Particular attention is given to the case of processing times restricted to one of two values, 1 and λ, differing by at most 2. A matching based polynomial time ε‐approximation algorithm is developed that has a performance ratio tending to . This algorithm is shown to have the best possible performance, tending to 3/2, for processing times 1 and 2. For the special case of nested processing sets, i.e., when the sets of machines upon which individual jobs may be assigned are non‐overlapping, the behavior of list scheduling algorithms is explored. Finally, for assignment restrictions determined by just one characteristic of the machines, such as disc storage or memory constraint in the case of high performance computing, we contribute an algorithm that provides a 3/2 worst case bound and runs in time linear in the number of jobs. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
142.
This study presents power‐of‐two policies for a serial inventory system with constant demand rate and incremental quantity discounts at the most upstream stage. It is shown that an optimal solution is nested and follows a zero‐inventory ordering policy. To prove the effectiveness of power‐of‐two policies, a lower bound on the optimal cost is obtained. A policy that has a cost within 6% of the lower bound is developed for a fixed base planning period. For a variable base planning period, a 98% effective policy is provided. An extension is included for a system with price dependent holding costs. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
143.
144.
The one-on-one stochastic duel is extended to the general two-on-one duel for the first time. The state equations, win probabilities, mean value, and variance functions are derived. The case where one side has Erlang (2) firing times and the other is negative exponential is compared with the corresponding “Stochastic Lanchester” and Lanchester models to demonstrate their nonequivalence. 相似文献
145.
In this article we present three properties that will improve the performance of branch-and-bound algorithms for fixed-cost transportation problems. By applying Lagrangian relaxation we show that one can develop stronger up and down penalties than those traditionally used and also develop a strengthened penalty for nonbasic variables. We also show that it is possible to “look ahead” of a particular node and determine the solution at the next node without actually calculating it. We present computational evidence by comparing our developments with existing procedures. 相似文献
146.
A series of independent Bernoulli trials is considered in which either an outcome of type A or type B occurs at each trial. The series terminates when n outcomes of one type have occurred. Two observable random variables of interest are the total number of outcomes in the series and the number of outcomes of the “losing kind.” Two methods of approximation of the expectations of these random variables for large n are obtained and compared. The limiting distribution of the number of outcomes of the “losing kind” is considered when a beta distribution is assigned to p. 相似文献
147.
A simple and relatively efficient method for simulating one-dimensional and two-dimensional nonhomogeneous Poisson processes is presented The method is applicable for any rate function and is based on controlled deletion of points in a Poisson process whose rate function dominates the given rate function In its simplest implementation, the method obviates the need for numerical integration of the rate function, for ordering of points, and for generation of Poisson variates. 相似文献
148.
This paper is concerned with the statistical test plans contained in Military Standard 781C, “Reliability Design Qualification and Production Acceptance Tests: Exponential Distribution” and the selection and use of these plans. Modifications to the fixed-length test plans of MIL-STD-781C are presented which allow early-accept decisions to be made without sacrificing statistical validity. The proposed plans differ from the probability ratio sequential tests in the Standard in that rejection is permitted only after a fixed number of failures have been observed. 相似文献
149.
Sequential tests for the product of Poisson parameters based on the generalized incomplete modified Bessel (g.i.m.B.) distributions are given. Applications to reliability and biometry are indicated. 相似文献
150.