全文获取类型
收费全文 | 737篇 |
免费 | 21篇 |
出版年
2019年 | 16篇 |
2018年 | 9篇 |
2017年 | 25篇 |
2016年 | 15篇 |
2015年 | 17篇 |
2014年 | 20篇 |
2013年 | 173篇 |
2012年 | 7篇 |
2011年 | 10篇 |
2010年 | 10篇 |
2009年 | 14篇 |
2008年 | 8篇 |
2007年 | 6篇 |
2006年 | 12篇 |
2005年 | 15篇 |
2004年 | 14篇 |
2003年 | 7篇 |
2002年 | 13篇 |
2000年 | 9篇 |
1999年 | 8篇 |
1998年 | 13篇 |
1997年 | 8篇 |
1996年 | 11篇 |
1995年 | 7篇 |
1994年 | 18篇 |
1993年 | 17篇 |
1992年 | 13篇 |
1991年 | 16篇 |
1990年 | 10篇 |
1989年 | 16篇 |
1988年 | 17篇 |
1987年 | 18篇 |
1986年 | 17篇 |
1985年 | 13篇 |
1984年 | 8篇 |
1983年 | 9篇 |
1982年 | 7篇 |
1981年 | 11篇 |
1980年 | 6篇 |
1979年 | 9篇 |
1978年 | 12篇 |
1976年 | 7篇 |
1975年 | 8篇 |
1974年 | 8篇 |
1973年 | 8篇 |
1972年 | 9篇 |
1971年 | 5篇 |
1970年 | 10篇 |
1969年 | 6篇 |
1967年 | 7篇 |
排序方式: 共有758条查询结果,搜索用时 15 毫秒
41.
This paper reconsiders the classical model for selling an asset in which offers come in daily and a decision must then be made as to whether or not to sell. For each day the item remains unsold a continuation (or maintenance cost) c is incurred. The successive offers are assumed to be independent and identically distributed random variables having an unknown distribution F. The model is considered both in the case where once an offer is rejected it may not be recalled at a later time and in the case where such recall of previous offers is allowed. 相似文献
42.
The general problem we are concerned with here is the estimation of Pθ(C) where C is some fixed event and Pθ is unknown in some class. The various available estimation procedures seem to involve the choice of some random probability measure. In particular we consider this problem when C is a disk in R2 centered at o and Pθ is restricted to be bivariate normal. Details concerning the implementation of the estimation procedures and a Monte Carlo study are discussed for this case. This particular problem arises when we are concerned with assessing the accuracy of a targeting procedure. 相似文献
43.
The problem is to protect a set of t targets by n perfect interceptors against an attack by m perfect weapons. If the defender solves for an optimal preallocated preferential defense and associated game value assuming m1 attackers, and the attacker knows the assumption of the defender and utilizes m2 attackers, he may be able to achieve significantly more damage than had the defender assumed that there would be m2 attackers. The article treats the robustness of preallocated preferential defense to assumptions about the size of the attack and presents results of an alternative approach. 相似文献
44.
Lisa J. Campbell 《Low Intensity Conflict & Law Enforcement》2002,11(2):299-315
Since the global war on terror began, the pursuit of Al Qaeda is widely considered as warfare and not the pursuit of criminals. In light of counter-terrorism being redefined as war, the criteria applied for tracking militaries of conventional enemies may also be applicable to Al Qaeda. Intelligence analysts have long used the nine order-of-battle (OB) criteria as part of the estimative process for conventional, or nation-state, enemies. Applying OB criteria to Al Qaeda may assist intelligence analysts in knowing the enemy and identifying changes that will allow for predictive analysis. Many elements of Al Qaeda's OB prior to the events of 11 September were viewed as clutter and not significant changes that might have otherwise alerted intelligence analysts to the impending attack. This essay suggests how one might go about applying the nine OB criteria to analysis of Al Qaeda. Although more difficult and requiring modification, using an analytical procedure that has been tested successfully over many years is a logical step in the war on Al Qaeda. If all OB changes are tracked and analyzed using a systematic approach as outlined in this essay, Al Qaeda attacks may be predicted and/or curtailed in the future. 相似文献
45.
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. 相似文献
46.
A new class of nonparametric reliability models is introduced and studied. A distribution is said to be better at age s than at age t (sBt) if the residual lifetime at age s is stochastically greater than or equal to the residual lifetime at age t. Applications to various forms of replacement policies, including the cannibalization of failed systems, are noted. For fixed s < t, the problem of estimating a survival curve assumed to belong to the sBt class is addressed using recursive methods. An sBt estimator is derived in closed form, and its uniform strong consistency at an optimal rate of convergence is demonstrated. A simulation study strongly supports the claim that the sBt estimator tends to outperform the empirical survivor function in small- and moderate-size samples. © 1993 John Wiley & Sons, Inc. 相似文献
47.
48.
In this article we consider a project scheduling problem where there are cash flows throughout the life of the project and where shorter activity durations can be attained by incurring greater direct costs. In particular, the objective of this problem is to determine the activity durations and a schedule of activity start times so that the net present value of cash flows is maximized. We formulate this problem as a mixed-integer nonlinear program which is amenable to solution using the generalized Benders decomposition technique developed by Geoffrion. We test the algorithm on 140 project scheduling problems, the largest of which contains 30 nodes and 64 activities. Our computational results are quite encouraging inasmuch as 123 of the 140 problems require less than 1 CPU second of solution time. © 1993 John Wiley & Sons, Inc. 相似文献
49.
This article introduces a new conceptual and methodological framework for the use of decision makers and their interactions with the computer in bicriterion decision making. The new method, called the multirun interactive method, attempts to estimate the prior of the decision maker on his uncertain preference nature using the minimum cross-entropy principle. A computational study is performed with four hypothesized prior distributions under various interaction conditions. Other important aspects related to the method, such as implementation of the method, decision making under certainty, decision making with multiple decision makers, and bicriterion integer programming, are also discussed. 相似文献
50.
We show that the deterministic nonpreemptive scheduling problem with earliness and tardiness penalties can be solved in polynomial time for certain forms of an objective function provided that a certain optimization problem can be solved. We give instances where this problem has a solution and show that this generalizes several results from the literature. These results do not require symmetric penalization and the penalty functions need only be lower semicontinuous. 相似文献