全文获取类型
收费全文 | 345篇 |
免费 | 13篇 |
国内免费 | 1篇 |
出版年
2021年 | 5篇 |
2020年 | 3篇 |
2019年 | 15篇 |
2018年 | 9篇 |
2017年 | 8篇 |
2016年 | 5篇 |
2015年 | 3篇 |
2014年 | 6篇 |
2013年 | 56篇 |
2012年 | 3篇 |
2011年 | 3篇 |
2010年 | 7篇 |
2009年 | 3篇 |
2007年 | 7篇 |
2005年 | 7篇 |
2004年 | 6篇 |
2002年 | 9篇 |
2000年 | 3篇 |
1999年 | 7篇 |
1998年 | 9篇 |
1997年 | 7篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1994年 | 8篇 |
1993年 | 11篇 |
1992年 | 6篇 |
1991年 | 10篇 |
1990年 | 7篇 |
1989年 | 9篇 |
1988年 | 6篇 |
1987年 | 8篇 |
1986年 | 8篇 |
1985年 | 7篇 |
1984年 | 6篇 |
1982年 | 6篇 |
1981年 | 7篇 |
1980年 | 4篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1977年 | 3篇 |
1976年 | 6篇 |
1975年 | 4篇 |
1974年 | 5篇 |
1973年 | 4篇 |
1972年 | 4篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 3篇 |
1966年 | 4篇 |
1948年 | 2篇 |
排序方式: 共有359条查询结果,搜索用时 15 毫秒
21.
22.
A linear-programming-based method for determining whether or not n demand points are on a hemisphere
Whenever n demand points are located on a hemisphere, spherical location problems can be solved easily using geometrical methods or mathematical programming. A method based on a linear programming formulation with four constraints is presented to determine whether n demand points are on a hemisphere. The formulation is derived from a modified minimax spherical location problem whose Karush-Kuhn-Tucker conditions are the constraints of the linear program. © 1993 John Wiley & Sons, Inc. 相似文献
23.
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. 相似文献
24.
Jobs with known processing times and due dates have to be processed on a machine which is subject to a single breakdown. The moment of breakdown and the repair time are independent random variables. Two cases are distinguished with reference to the processing time preempted by the breakdown (no other preemptions are allowed): (i) resumption without time losses and (ii) restart from the beginning. Under certain compatible conditions, we find the policies which minimize stochastically the number of tardy jobs. 相似文献
25.
We consider a one-machine scheduling problem with earliness and tardiness penalties. All jobs are assigned a common due date and the objective is to minimize the total penalty due to job earliness and tardiness. We are interested in finding the optimal combination of the common due-date value and the job sequence. Despite the fact that this problem in general is very hard to solve, we prove that there exists at least a common property for all optimal solutions: The first job in an optimal sequence is one of the longest jobs. We also prove that this property holds for a general class of unimodal penalty functions. 相似文献
26.
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. 相似文献
27.
This article addresses deterministic, nonpreemptive scheduling of n jobs with unequal release times on a single machine to minimize the sum of job completion times. This problem is known to be NP-hard. The article compares six available lower bounds in the literature and shows that the lower bound based on the optimal solution to the preemptive version of the problem is the dominant lower bound. 相似文献
28.
A search is conducted for a target moving in discrete time among a finite number of cells according to a known Markov process. The searcher must choose one cell in which to search in each time period. The set of cells available for search depends upon the cell chosen in the last time period. The problem is to find a search path, i.e., a sequence of search cells, that either maximizes the probability of detection or minimizes the mean number of time periods required for detection. The search problem is modelled as a partially observable Markov decision process and several approximate solutions procedures are proposed. © 1995 John Wiley & Sons, Inc. 相似文献
29.
30.
Let p(⩾0.5) denote the probability that team A beats B in a single game. The series continues until either A or B wins n games. Assuming that these games are independent replications, we study some features of the distribution of Xn, the number of games played in the series. It is shown that Xn is unimodal, has an IFRA distribution, and is stochastically decreasing in p. Close approximations to its mode, mean, and variance are given. Finally, it is shown that the maximum-likelihood estimator of p based on Xn is unique. 相似文献