全文获取类型
收费全文 | 331篇 |
免费 | 77篇 |
国内免费 | 8篇 |
出版年
2023年 | 2篇 |
2021年 | 7篇 |
2020年 | 8篇 |
2019年 | 5篇 |
2018年 | 4篇 |
2017年 | 7篇 |
2016年 | 13篇 |
2015年 | 18篇 |
2014年 | 11篇 |
2013年 | 72篇 |
2012年 | 18篇 |
2011年 | 20篇 |
2010年 | 14篇 |
2009年 | 18篇 |
2008年 | 22篇 |
2007年 | 25篇 |
2006年 | 9篇 |
2005年 | 14篇 |
2004年 | 14篇 |
2003年 | 15篇 |
2002年 | 15篇 |
2001年 | 9篇 |
2000年 | 8篇 |
1999年 | 16篇 |
1998年 | 8篇 |
1997年 | 9篇 |
1996年 | 4篇 |
1994年 | 2篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1972年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有416条查询结果,搜索用时 31 毫秒
221.
后向投影 (BP)算法是一种被广泛应用于冲激SAR的成像算法。当冲激SAR的发射信号是某一类冲激信号时 ,根据冲激SAR成像的特点 ,推导出BP算法的方位分辨率与成像积累角、信号中心频率的关系。仿真结果表明 ,在相当范围内 ,估计公式都是准确的 相似文献
222.
This paper presents a branch and bound algorithm for computing optimal replacement policies in a discrete‐time, infinite‐horizon, dynamic programming model of a binary coherent system with n statistically independent components, and then specializes the algorithm to consecutive k‐out‐of‐n systems. The objective is to minimize the long‐run expected average undiscounted cost per period. (Costs arise when the system fails and when failed components are replaced.) An earlier paper established the optimality of following a critical component policy (CCP), i.e., a policy specified by a critical component set and the rule: Replace a component if and only if it is failed and in the critical component set. Computing an optimal CCP is a optimization problem with n binary variables and a nonlinear objective function. Our branch and bound algorithm for solving this problem has memory storage requirement O(n) for consecutive k‐out‐of‐n systems. Extensive computational experiments on such systems involving over 350,000 test problems with n ranging from 10 to 150 find this algorithm to be effective when n ≤ 40 or k is near n. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 288–302, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10017 相似文献
223.
224.
Hag‐Soo Kim 《海军后勤学研究》2003,50(8):937-952
In the apparel industry, vendors often suffer from high mismatches in supply and demand. To cope with this problem, they procure the same style product from different suppliers with different manufacturing costs. Especially in the quick response environment, which allows vendors to monitor trends in customer demand and search for available suppliers through the electronic market, they have additional opportunities to improve their decision‐making. In this paper, we propose an analytical profit maximization model and develop efficient decision tools to help both the middle and lower level managers pursuing this strategy. Furthermore, we have shown how significantly the vendors' potential competitive edge can be improved by exploiting multiple supply options, even at the expense of high premium procurement costs for late orders. The effect is critical, especially in a highly competitive market, and it has important implications for the top managers. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
225.
In this paper we consider an inventory model in which the retailer does not know the exact distribution of demand and thus must use some observed demand data to forecast demand. We present an extension of the basic newsvendor model that allows us to quantify the value of the observed demand data and the impact of suboptimal forecasting on the expected costs at the retailer. We demonstrate the approach through an example in which the retailer employs a commonly used forecasting technique, exponential smoothing. The model is also used to quantify the value of information and information sharing for a decoupled supply chain in which both the retailer and the manufacturer must forecast demand. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 388–411, 2003 相似文献
226.
We consider a simple two‐stage supply chain with a single retailer facing i.i.d. demand and a single manufacturer with finite production capacity. We analyze the value of information sharing between the retailer and the manufacturer over a finite time horizon. In our model, the manufacturer receives demand information from the retailer even during time periods in which the retailer does not order. To analyze the impact of information sharing, we consider the following three strategies: (1) the retailer does not share demand information with the manufacturer; (2) the retailer does share demand information with the manufacturer and the manufacturer uses the optimal policy to schedule production; (3) the retailer shares demand information with the manufacturer and the manufacturer uses a greedy policy to schedule production. These strategies allow us to study the impact of information sharing on the manufacturer as a function of the production capacity, and the frequency and timing in which demand information is shared. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
227.
基于模糊数学的数据融合算法研究 总被引:1,自引:0,他引:1
针对当前单目标跟踪数据融合中存在的迭代求解计算量大,难以满足实时计算要求的问题,提出了一种将模糊数学和非负特征向量理论相结合的数据融合算法.该方法克服了卡尔曼滤波法、最小二乘法需要建立统一的测量方程,进行迭代求解、计算量大的问题.与传统方法相比,该方法能充分利用测量数据,提高目标跟踪精度,计算简便,便于工程实现. 相似文献
228.
We study the problem of designing a two‐echelon spare parts inventory system consisting of a central plant and a number of service centers each serving a set of customers with stochastic demand. Processing and storage capacities at both levels of facilities are limited. The manufacturing process is modeled as a queuing system at the plant. The goal is to optimize the base‐stock levels at both echelons, the location of service centers, and the allocation of customers to centers simultaneously, subject to service constraints. A mixed integer nonlinear programming model (MINLP) is formulated to minimize the total expected cost of the system. The problem is NP‐hard and a Lagrangian heuristic is proposed. We present computational results and discuss the trade‐off between cost and service. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
229.
Free riding in a multichannel supply chain occurs when one retail channel engages in the customer service activities necessary to sell a product, while another channel benefits from those activities by making the final sale. Although free riding is, in general, considered to have a negative impact on supply chain performance, certain recent industry practices suggest an opposite view: a manufacturer may purposely induce free riding by setting up a high‐cost, customer service‐oriented direct store to allow consumers to experience the product, anticipating their purchase at a retail store. This article examines how the free riding phenomenon affects a manufacturer's supply chain structure decision when there are fixed plus incremental variable costs for operating the direct store. We consider factors such as the effort required to find and buy the product at a retail store after visiting the direct store, the existence of competing products in the market, and the extent of consumer need to obtain direct‐store service. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
230.
This article studies two due window scheduling problems to minimize the weighted number of early and tardy jobs in a two‐machine flow shop, where the window size is externally determined. These new scheduling models have many practical applications in real life. However, results on these problems have rarely appeared in the literature because of a lack of structural and optimality properties for solving them. In this article, we derive several dominance properties and theorems, including elimination rules and sequencing rules based on Johnsos order, lower bounds on the penalty, and upper bounds on the window location, which help to significantly trim the search space for the problems. We further show that the problems are NP‐hard in the ordinary sense only. We finally develop efficient pseudopolynomial dynamic programming algorithms for solving the problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献