全文获取类型
收费全文 | 558篇 |
免费 | 42篇 |
国内免费 | 4篇 |
出版年
2021年 | 13篇 |
2020年 | 7篇 |
2019年 | 4篇 |
2017年 | 14篇 |
2016年 | 13篇 |
2015年 | 15篇 |
2014年 | 18篇 |
2013年 | 61篇 |
2012年 | 23篇 |
2011年 | 30篇 |
2010年 | 34篇 |
2009年 | 24篇 |
2008年 | 34篇 |
2007年 | 15篇 |
2006年 | 19篇 |
2005年 | 10篇 |
2004年 | 7篇 |
2003年 | 5篇 |
2002年 | 4篇 |
2001年 | 7篇 |
1999年 | 6篇 |
1998年 | 10篇 |
1997年 | 11篇 |
1996年 | 3篇 |
1995年 | 8篇 |
1994年 | 7篇 |
1993年 | 12篇 |
1992年 | 7篇 |
1991年 | 8篇 |
1990年 | 5篇 |
1989年 | 14篇 |
1988年 | 4篇 |
1987年 | 12篇 |
1986年 | 11篇 |
1985年 | 7篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 5篇 |
1977年 | 6篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1972年 | 12篇 |
1971年 | 4篇 |
1970年 | 4篇 |
1969年 | 10篇 |
1968年 | 7篇 |
1966年 | 3篇 |
排序方式: 共有604条查询结果,搜索用时 0 毫秒
61.
Orienteering is a sport in which start and end points are specified along with other locations. These other locations have associated scores. Competitors seek to visit, in a fixed amount of time, a subset of these locations on the way from the start point to the end point in order to maximize the total score. An effective center-of-gravity heuristic is presented that outperforms heuristics from the literature. 相似文献
62.
Joseph Y.‐T. Leung 《海军后勤学研究》2002,49(4):422-431
We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020 相似文献
63.
Nathaniel L. Moir 《Small Wars & Insurgencies》2017,28(6):909-946
This article assesses Bernard Fall’s concept of Vietnamese Revolutionary Warfare in Indochina between 1953 and 1958. It also investigates differences in the conceptualization of Revolutionary Warfare between Fall and proponents of French military doctrine known as la guerre révolutionnaire. The last component of the article considers limits of Fall’s influence on counterinsurgency doctrine. 相似文献
64.
师范生具有大学生和准教师的双重身份,因此对于他们教育自传的研究是十分必要的.师范生的教育自传中对于教师具象的描写,提供了评价教师的依据.研究旨在分析师范生的教育自传,了解他们眼中的好老师形象.使得师范生能够理解好老师的评价标准,从而为从事教师职业起到一定的促进作用. 相似文献
65.
间歇采样转发干扰以及改进的重复转发间歇采样干扰是对线性调频雷达的有效干扰样式,但其形成的假目标幅度较小,能量损失较大。针对这些不足,提出了一种间歇采样累加干扰,该方法通过将数字储频后离散采样信号的幅值进行累加,在获得干扰幅度的同时实现信号的最大相干性。通过理论分析可知,信号脉内周期性变化会对干扰信号产生影响,因此又通过对累加信号幅度较低部分进行幅度倍乘和对间歇采样信号取绝对值后累加,得到2种改进方案:倍乘调整间歇采样累加干扰和绝对值间歇采样累加干扰。最后通过仿真实验,证明了间歇采样累加干扰是对线性调频雷达的一种有效干扰,能够产生较好的欺骗和覆盖干扰效果,并且假目标幅度较大,工程实现简单,节省功率。 相似文献
66.
67.
68.
69.
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 相似文献
70.
We consider a loss system with a fixed budget for servers. The system owner's problem is choosing the price, and selecting the number and quality of the servers, in order to maximize profits, subject to a budget constraint. We solve the problem with identical and different service rates as well as with preemptive and nonpreemptive policies. In addition, when the policy is preemptive, we prove the following conservation law: the distribution of the total service time for a customer entering the slowest server is hyperexponential with expectation equal to the average service rate independent of the allocation of the capacity. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 81–97, 2015 相似文献