全文获取类型
| 收费全文 | 915篇 |
| 免费 | 0篇 |
专业分类
| 915篇 |
出版年
| 2021年 | 14篇 |
| 2019年 | 29篇 |
| 2018年 | 19篇 |
| 2017年 | 20篇 |
| 2016年 | 20篇 |
| 2015年 | 20篇 |
| 2014年 | 11篇 |
| 2013年 | 166篇 |
| 2011年 | 8篇 |
| 2009年 | 9篇 |
| 2008年 | 8篇 |
| 2007年 | 11篇 |
| 2006年 | 11篇 |
| 2005年 | 15篇 |
| 2004年 | 16篇 |
| 2003年 | 10篇 |
| 2002年 | 8篇 |
| 2000年 | 14篇 |
| 1999年 | 10篇 |
| 1998年 | 12篇 |
| 1997年 | 24篇 |
| 1996年 | 19篇 |
| 1994年 | 18篇 |
| 1993年 | 7篇 |
| 1992年 | 11篇 |
| 1991年 | 22篇 |
| 1990年 | 12篇 |
| 1989年 | 19篇 |
| 1988年 | 12篇 |
| 1987年 | 21篇 |
| 1986年 | 16篇 |
| 1985年 | 16篇 |
| 1984年 | 12篇 |
| 1983年 | 15篇 |
| 1982年 | 13篇 |
| 1981年 | 13篇 |
| 1980年 | 16篇 |
| 1979年 | 17篇 |
| 1978年 | 14篇 |
| 1977年 | 15篇 |
| 1976年 | 14篇 |
| 1975年 | 12篇 |
| 1974年 | 18篇 |
| 1973年 | 18篇 |
| 1972年 | 15篇 |
| 1971年 | 19篇 |
| 1970年 | 9篇 |
| 1969年 | 11篇 |
| 1968年 | 10篇 |
| 1967年 | 8篇 |
排序方式： 共有915条查询结果，搜索用时 0 毫秒
211.
This paper addresses optimal power allocation in a wireless communication network under uncertainty. The paper introduces a framework for optimal transmit power allocation in a wireless network where both the useful and interference coefficients are random. The new approach to power control is based on a stochastic programming formulation with probabilistic SIR constraints. This allows to state the power allocation problem as a convex optimization problem assuming normally or log‐normally distributed communication link coefficients. Numerical examples illustrate the performance of the optimal stochastic power allocation. A distributed algorithm for the decentralized solution of the stochastic power allocation problem is discussed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
212.
Command and Control (C2) in a military setting can be epitomized in battles‐of‐old when commanders would seek high ground to gain superior spatial‐temporal information; from this vantage point, decisions were made and relayed to units in the field. Although the fundamentals remain, technology has changed the practice of C2; for example, enemy units may be observed remotely, with instruments of varying positional accuracy. A basic problem in C2 is the ability to track an enemy object in the battlespace and to forecast its future position; the (extended) Kalman filter provides a straightforward solution. The problem changes fundamentally if one assumes that the moving object is headed for an (unknown) location, or waypoint. This article is concerned with the new problem of estimation of such a waypoint, for which we use Bayesian statistical prediction. The computational burden is greater than an ad hoc regression‐based estimate, which we also develop, but the Bayesian approach has a big advantage in that it yields both a predictor and a measure of its variability. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
213.
214.
An important aspect of supply chain management is dealing with demand and supply uncertainty. The uncertainty of future supply can be reduced if a company is able to obtain advance capacity information (ACI) about future supply/production capacity availability from its supplier. We address a periodic‐review inventory system under stochastic demand and stochastic limited supply, for which ACI is available. We show that the optimal ordering policy is a state‐dependent base‐stock policy characterized by a base‐stock level that is a function of ACI. We establish a link with inventory models that use advance demand information (ADI) by developing a capacitated inventory system with ADI, and we show that equivalence can only be set under a very specific and restrictive assumption, implying that ADI insights will not necessarily hold in the ACI environment. Our numerical results reveal several managerial insights. In particular, we show that ACI is most beneficial when there is sufficient flexibility to react to anticipated demand and supply capacity mismatches. Further, most of the benefits can be achieved with only limited future visibility. We also show that the system parameters affecting the value of ACI interact in a complex way and therefore need to be considered in an integrated manner. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
215.
Strengthening the United States' ability to prevent adversaries from smuggling nuclear materials into the country is a vital and ongoing issue. The prospect of additional countries, such as Iran, obtaining the know‐how and equipment to produce these special nuclear materials in the near future underscores the need for efficient and effective inspection policies at ports and border crossings. In addition, the reduction of defense and homeland security budgets in recent years has made it increasingly important to accomplish the interdiction mission with fewer funds. Addressing these complications, in this article, we present a novel two‐port interdiction model. We propose using prior inspection data as a low‐cost way of increasing overall interdiction performance. We provide insights into two primary questions: first, how should a decision maker at a domestic port use detection data from the foreign port to improve the overall detection capability? Second, what are potential limitations to the usefulness of prior inspection data—is it possible that using prior data actually harms decision making at the domestic port? We find that a boundary curve policy (BCP) that takes into account both foreign and domestic inspection data can provide a significant improvement in detection probability. This BCP also proves to be surprisingly robust, even if adversaries are able to infiltrate shipments during transit. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 433‐448, 2013 相似文献
216.
217.
In this article, a distribution system is studied where the sum of transportation and inventory costs is to be minimized. The inventory holding cost is assumed to be the same for all retailers. A fixed partition (FP) periodic policy is proposed with tight asymptotic worst‐case performance of 3/2 with respect to the best possible policy. This bound cannot be improved in the class of FP periodic policies. In partition‐based PB policies, the retailers are first partitioned into sets and then the sets are grouped in such a way that sets of retailers within a group are served together at selected times. A PB periodic, policy is presented with tight worst‐case asymptotic performance of with respect to the best possible policy. This latter performance improves the worst‐case asymptotic performance of of the previously best known policy for this problem. We also show that the proposed PB periodic policy has the best worst‐case asymptotic performance within the class of PB policies. Finally, practical heuristics inspired by the analyzed policies are designed and tested. The asymptotic worst–case performances of the heuristics are shown to be the same of those of the analyzed policies. Computational results show that the heuristics suggested are less than 6.4% on average from a lower bound on the optimal cost when 50 or more retailers are involved. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 00: 000–000, 2013 相似文献
218.
Nathan A. Jennings 《Small Wars & Insurgencies》2013,24(2):313-334
This essay explores how federalized Texas Rangers, in the form of scout companies and larger mounted rifle regiments, provided controversial, and ultimately cost-effective, versatility to the US Army during its campaign in Northern Mexico between 1846 and 1848. It argues that their contributions centered on three tactical tasks that enhanced the invading army's maneuvers: reconnaissance, direct assault, and counterguerrilla patrolling. Each of these actions reflected a distinctive skill-set at which the auxiliaries excelled, marking them as exceptionally multifunctional assets. The Texans' augmentation coincided with, and was necessitated by, the evolving stages of the war in Northern Mexico, beginning with the American army's initial invasion, then transitioning to the assault on Monterrey, and finally ending with a troubled occupation where the rangers' brutality both enabled and undermined American pacification efforts. 相似文献
219.
220.