全文获取类型
收费全文 | 575篇 |
免费 | 8篇 |
出版年
2021年 | 6篇 |
2020年 | 4篇 |
2019年 | 9篇 |
2018年 | 9篇 |
2017年 | 14篇 |
2016年 | 14篇 |
2015年 | 10篇 |
2014年 | 12篇 |
2013年 | 102篇 |
2012年 | 22篇 |
2011年 | 27篇 |
2010年 | 21篇 |
2009年 | 15篇 |
2008年 | 29篇 |
2007年 | 15篇 |
2006年 | 17篇 |
2005年 | 8篇 |
2004年 | 6篇 |
2003年 | 5篇 |
2002年 | 4篇 |
1998年 | 7篇 |
1997年 | 7篇 |
1995年 | 8篇 |
1994年 | 6篇 |
1993年 | 12篇 |
1992年 | 8篇 |
1991年 | 7篇 |
1989年 | 14篇 |
1988年 | 5篇 |
1987年 | 12篇 |
1986年 | 11篇 |
1985年 | 9篇 |
1984年 | 4篇 |
1983年 | 5篇 |
1982年 | 6篇 |
1981年 | 8篇 |
1980年 | 10篇 |
1979年 | 11篇 |
1978年 | 4篇 |
1977年 | 7篇 |
1976年 | 8篇 |
1975年 | 7篇 |
1974年 | 3篇 |
1973年 | 5篇 |
1972年 | 12篇 |
1971年 | 3篇 |
1970年 | 4篇 |
1969年 | 9篇 |
1968年 | 7篇 |
1966年 | 3篇 |
排序方式: 共有583条查询结果,搜索用时 15 毫秒
61.
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 相似文献
62.
Who did it? Attribution is fundamental. Human lives and the security of the state may depend on ascribing agency to an agent. In the context of computer network intrusions, attribution is commonly seen as one of the most intractable technical problems, as either solvable or not solvable, and as dependent mainly on the available forensic evidence. But is it? Is this a productive understanding of attribution? — This article argues that attribution is what states make of it. To show how, we introduce the Q Model: designed to explain, guide, and improve the making of attribution. Matching an offender to an offence is an exercise in minimising uncertainty on three levels: tactically, attribution is an art as well as a science; operationally, attribution is a nuanced process not a black-and-white problem; and strategically, attribution is a function of what is at stake politically. Successful attribution requires a range of skills on all levels, careful management, time, leadership, stress-testing, prudent communication, and recognising limitations and challenges. 相似文献
63.
64.
65.
计算了一类二次Hamilton微分系统的一阶Mel’nikov函数,通过此方法对该系统在三次多项式扰动下分岔的极限环个数进行了估计。 相似文献
66.
67.
介绍了可以用扩展可靠性框图表示的系统的可靠性参数的仿真算法。首先,对扩展可靠性框图进行了介绍,提出了利用树状结构来描述扩展可靠性框图的结构。其次,对基于扩展可靠性框图的系统行为进行了分析。然后,依据离散事件系统仿真思想,分别给出了计算可修系统可靠性参数的仿真算法与不可修系统可靠性参数的仿真算法。最后,给出了计算实例。该仿真算法不仅可以对状态独立系统进行可靠性参数计算,而且可以对具有冷储备关系以及冷储备嵌套关系的状态相关系统进行可靠性参数计算,具有很强的通用性与实用性。 相似文献
68.
69.
We consider the problem of nonparametric multi-product dynamic pricing with unknown demand and show that the problem may be formulated as an online model-free stochastic program, which can be solved by the classical Kiefer-Wolfowitz stochastic approximation (KWSA) algorithm. We prove that the expected cumulative regret of the KWSA algorithm is bounded above by where κ1, κ2 are positive constants and T is the number of periods for any T = 1, 2, … . Therefore, the regret of the KWSA algorithm grows in the order of , which achieves the lower bounds known for parametric dynamic pricing problems and shows that the nonparametric problems are not necessarily more difficult to solve than the parametric ones. Numerical experiments further demonstrate the effectiveness and efficiency of our proposed KW pricing policy by comparing with some pricing policies in the literature. 相似文献
70.
D J L Moore 《Whitehall Papers》2013,80(1):13-22
Abstract David Moore analyses the role of the Treasury in detemining and controlling defence policy and expenditure, and the place of the MoD within this function. 相似文献