首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   264篇
  免费   5篇
  269篇
  2019年   8篇
  2018年   10篇
  2017年   4篇
  2016年   5篇
  2015年   5篇
  2014年   8篇
  2013年   71篇
  2012年   2篇
  2011年   3篇
  2009年   4篇
  2007年   2篇
  2005年   3篇
  2004年   3篇
  2003年   8篇
  2002年   5篇
  2001年   2篇
  2000年   4篇
  1998年   3篇
  1997年   5篇
  1996年   3篇
  1995年   3篇
  1994年   3篇
  1993年   6篇
  1992年   3篇
  1991年   6篇
  1990年   4篇
  1989年   4篇
  1988年   7篇
  1987年   4篇
  1986年   6篇
  1985年   3篇
  1984年   3篇
  1983年   3篇
  1982年   1篇
  1981年   1篇
  1980年   5篇
  1979年   3篇
  1978年   2篇
  1977年   1篇
  1976年   4篇
  1975年   2篇
  1974年   6篇
  1973年   4篇
  1972年   5篇
  1971年   5篇
  1970年   3篇
  1969年   6篇
  1968年   3篇
  1966年   1篇
  1948年   1篇
排序方式: 共有269条查询结果,搜索用时 0 毫秒
31.
Chen and Bhattacharyya [Exact confidence bounds for an exponential parameter under hybrid censoring, Commun Statist Theory Methods 17 (1988), 1857–1870] considered a hybrid censoring scheme and obtained the exact distribution of the maximum likelihood estimator of the mean of an exponential distribution along with an exact lower confidence bound. Childs et al. [Exact likelihood inference based on Type‐I and Type‐II hybrid censored samples from the exponential distribution, Ann Inst Statist Math 55 (2003), 319–330] recently derived an alternative simpler expression for the distribution of the MLE. These authors also proposed a new hybrid censoring scheme and derived similar results for the exponential model. In this paper, we propose two generalized hybrid censoring schemes which have some advantages over the hybrid censoring schemes already discussed in the literature. We then derive the exact distribution of the maximum likelihood estimator as well as exact confidence intervals for the mean of the exponential distribution under these generalized hybrid censoring schemes. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
32.
33.
A system of two parallel queues where the arrivals from a single stream of customers join the shorter queue is considered. Arrivals form a homogeneous Poisson stream and the service times in each of the two queues are independent exponential variates. By treating one of the queues as bounded, the steady-state probability vector for the system can be expressed in a modified matrix-geometric form and can be computed efficiently. Computational procedures for the sojourn time distribution and characteristics of the departure stream are developed. Some numerical results are presented, and based on these results an efficient approximation scheme for the model is developed which can be readily extended to systems with more than two parallel queues.  相似文献   
34.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015  相似文献   
35.
This article examines the tradition of Italian neorealism and the importance it has for films depicting guerrilla insurgencies. It looks in particular at the two films by Roberto Rossellini Rome Open City and Paisa as well as the later film by Nanni Loy Four Days in Naples. It then proceeds to locate Gillo Pontecorvo's iconic film The Battle of Algiers within this neorealist tradition and examines the degree to which the director succeeded in continuing the basic traditions of neorealism into the context of the Algerian war of Independence. The article concludes that while this film remains of great interest it should be situated in the period when it was produced and is in many ways radically disconnected from many insurgent movements of the present day.  相似文献   
36.
37.
38.
We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998  相似文献   
39.
In this article, we examine the problem of producing a spanning Eulerian subgraph in an undirected graph. After the ?-completeness of the general problem is established, we present polynomial-time algorithms for both the maximization and minimization versions where instances are defined on a restricted class of graphs referred to as series-parallel. Some novelties in the minimization case are discussed, as are heuristic ideas.  相似文献   
40.
Book Reviews     
Strategic Air Defense. Edited by Stephen J. Cimbala. Scholarly Resources, Wilmington, DE (1989), ISBN 0–8420–2285–6, $40.00

NATO's Defence of the North. Brassey's Atlantic Commentaries No. 1. Edited by Eric Grove. Brassey's, London (1989), ISBN 0–08–037339–9, £7.50

Maritime Strategy and the Balance of Power: Britain and America in the Twentieth Century. Edited by John B. Hattendorf and Robert S. Jordan. Macmillan, London (1989), ISBN 0–333–43789–6, £45.00

Superpowers at Sea: an Assessment of the Naval Arms Race. By Richard Fieldhouse and Shunji Taoka. SIPRI, Oxford (1989), ISBN 0–19–829135–3

Security at Sea: Naval Arms Control. Edited by Richard Fieldhouse. Oxford University Press, Oxford (1990), ISBN 0–19–829130–2, £25.00

Strategy in the Southern Oceans: a South American View. By Virginia Gamba‐Stonehouse. Pinter, London (1989), ISBN 0–86187–017–4, £30.00

The Defence Industrial Base and the West. Edited by D. G. Haglund. Routledge, London (1989), ISBN 0–415–00923–5, £30.00

Defense and Détente: US and West German Perspectives on Defense Policy. Edited by Joseph I. Coffey and Klaus von Schubert. Westview Press, Boulder, CO, ISBN 0–8133–7722–6, $36.50  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号