全文获取类型
收费全文 | 557篇 |
免费 | 203篇 |
国内免费 | 66篇 |
出版年
2023年 | 6篇 |
2022年 | 6篇 |
2021年 | 17篇 |
2020年 | 15篇 |
2019年 | 14篇 |
2018年 | 10篇 |
2017年 | 25篇 |
2016年 | 38篇 |
2015年 | 16篇 |
2014年 | 38篇 |
2013年 | 52篇 |
2012年 | 46篇 |
2011年 | 43篇 |
2010年 | 23篇 |
2009年 | 51篇 |
2008年 | 37篇 |
2007年 | 42篇 |
2006年 | 46篇 |
2005年 | 39篇 |
2004年 | 35篇 |
2003年 | 36篇 |
2002年 | 32篇 |
2001年 | 28篇 |
2000年 | 15篇 |
1999年 | 14篇 |
1998年 | 14篇 |
1997年 | 11篇 |
1996年 | 17篇 |
1995年 | 10篇 |
1994年 | 14篇 |
1993年 | 5篇 |
1992年 | 18篇 |
1991年 | 3篇 |
1990年 | 6篇 |
1989年 | 3篇 |
1988年 | 1篇 |
排序方式: 共有826条查询结果,搜索用时 15 毫秒
671.
Data envelopment analysis (DEA) is a method for measuring the efficiency of peer decision making units (DMUs). This tool has been utilized by a number of authors to examine two‐stage processes, where all the outputs from the first stage are the only inputs to the second stage. The current article examines and extends these models using game theory concepts. The resulting models are linear, and imply an efficiency decomposition where the overall efficiency of the two‐stage process is a product of the efficiencies of the two individual stages. When there is only one intermediate measure connecting the two stages, both the noncooperative and centralized models yield the same results as applying the standard DEA model to the two stages separately. As a result, the efficiency decomposition is unique. While the noncooperative approach yields a unique efficiency decomposition under multiple intermediate measures, the centralized approach is likely to yield multiple decompositions. Models are developed to test whether the efficiency decomposition arising from the centralized approach is unique. The relations among the noncooperative, centralized, and standard DEA approaches are investigated. Two real world data sets and a randomly generated data set are used to demonstrate the models and verify our findings. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
672.
为了满足JPEG2000遥感图像实时压缩设备的实时性要求,提出了一种基于并行机制的“零时间”数据搬移策略。通过对EBC算法结构进行拆分,并采用EDMA方式进行数据搬移,使得算法运算与数据搬移过程完全并行,搬移时间等效为零。实验结果表明,采用新的数据搬移策略后,编码效率可以提升到100%,EBC算法实现的总时间可缩短46%以上。该搬移机制已成功应用于JPEG2000星载遥感图像实时压缩系统中,系统的实时性达到了设计要求。 相似文献
673.
Optimal operating policies and corresponding managerial insight are developed for the decision problem of coordinating supply and demand when (i) both supply and demand can be influenced by the decision maker and (ii) learning is pursued. In particular, we determine optimal stocking and pricing policies over time when a given market parameter of the demand process, though fixed, initially is unknown. Because of the initially unknown market parameter, the decision maker begins the problem horizon with a subjective probability distribution associated with demand. Learning occurs as the firm monitors the market's response to its decisions and then updates its characterization of the demand function. Of primary interest is the effect of censored data since a firm's observations often are restricted to sales. We find that the first‐period optimal selling price increases with the length of the problem horizon. However, for a given problem horizon, prices can rise or fall over time, depending on how the scale parameter influences demand. Further results include the characterization of the optimal stocking quantity decision and a computationally viable algorithm. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 303–325, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10013 相似文献
674.
675.
676.
677.
多目标数据关联的神经网络方法 总被引:1,自引:0,他引:1
数据关联是多目标跟踪的关键问题。基于 Hopfield神经网络的 JPDA是解决这一关键问题的有效方法之一 ,但此方法的难点在于优化系数的整定。提出一种改进算法 ,用于解决优化系数在线自适应整定问题。首先重新构造了李雅普诺夫能量函数 ,接着引入变化的优化系数因子 ,并给出了优化系数求解的迭代公式 ;最后对已有和改进的算法进行了仿真研究。结果表明改进的方法和原有的方法相比 ,一方面具有在线整定优化系数的功能 ,另一方面可以获得和原有算法非常接近的估计误差。 相似文献
678.
679.
680.