首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   160篇
  免费   26篇
  国内免费   10篇
  2021年   2篇
  2020年   2篇
  2019年   3篇
  2018年   3篇
  2017年   11篇
  2016年   8篇
  2015年   7篇
  2014年   7篇
  2013年   17篇
  2012年   7篇
  2011年   12篇
  2010年   7篇
  2009年   13篇
  2008年   5篇
  2007年   17篇
  2006年   15篇
  2005年   13篇
  2004年   10篇
  2003年   10篇
  2002年   2篇
  2001年   4篇
  1999年   5篇
  1998年   2篇
  1996年   1篇
  1995年   3篇
  1994年   2篇
  1993年   2篇
  1992年   3篇
  1990年   2篇
  1989年   1篇
排序方式: 共有196条查询结果,搜索用时 15 毫秒
191.
数据库中关联规则的并行/分布式采掘技术   总被引:1,自引:0,他引:1  
高效的并行/分布式采掘方法是数据库中关联规则发现技术的重要的研究方向,首先给出了关联规则的并行/分布式采掘的相关描述,针对关联规则并行/分布式采掘的基本思想,分析算法中可以改进效能的环节,提出生成更少候选集、局部剪枝、减少通讯量和优化扫描等提高性能和降低复杂度的方法。  相似文献   
192.
The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016  相似文献   
193.
Uprising tensions during 2010 in eastern and southeastern regions of Turkey provoked arguments about the necessity for a State of Emergency (SOE; ‘Ola?anüstü Hal’ in Turkish) declaration in those regions, with a belief of enduring political sustainability. The discussion is inflamed by a speech of the Nationalist Movement Party’s leader about the suggestion to announce a SOE ruling after the death of 24 Turkish soldiers in Hakkari (a city in the southeast of Turkey) in an attack of the PKK (Kurdistan Workers’ Party) on the 19 October 2011. Although a new announcement of SOE did not take place, the discussion itself induced the idea behind this paper which is to provide a quantitative analysis of the SOE in Turkey. In fact, the SOE ruling is not a new concept for Turkey and it has been implemented in 13 cities in the eastern and southeastern regions from 1987 to 2002. Although there have been many discussions about the costs of these 15 years of the SOE ruling in terms of military expenditure and, thus, on the national budget, there is a lack of quantitative analytical examination of the economic and social costs of it. Difference-in-differences analysis reveals negative spillover impacts of the SOE, especially on the forced migration, unemployment, and educational investments. The results also show that SOE ruling is an important factor for the underdevelopment of the eastern and southeastern regions in Turkey and, thus, a new SOE will bring enormous inequalities, both economically and socially, and an intensification of the ethnic tensions in Turkey.  相似文献   
194.
Common due date problems have been extensively discussed in the scheduling literature. Initially, these problems discussed finding a common due date for a set of jobs on a single machine. These single machine problems were later extended to finding the common due date on a set of parallel machines. This paper further extends the single machine problem to finding multiple common due dates on a single machine. For a basic and important class of penalty functions, we show that this problem is comparable to the parallel machine problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 293–298, 2001  相似文献   
195.
The Selection Allocation Problem (SAP) is a single period decision problem which involves selecting profit‐maximizing (or cost‐minimizing) activities from various distinct groups, and determining the volume of those activities. The activities in each group are selected subject to the availability of that group's resource, which is provided by either pooling or blending raw inputs from several potential sources. Imbedded in the decision process is the additional task of determining how much raw input is to be allocated to each group to form the resource for that group. Instances of this problem can be found in many different areas, such as in tool selection for flexible manufacturing systems, facility location, and funding for social services. Our goal in this paper is to identify and exploit special structures in the (SAP) and use those structures to develop an efficient solution procedure. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 707–725, 1999  相似文献   
196.
自适应采样数粒子滤波算法   总被引:2,自引:0,他引:2  
基于统计决策规则提出自适应采样数粒子滤波算法,在定义综合性能风险函数的基础上,推导出粒子数与滤波误差方差之间的关系式,使得在跟踪过程中,可以根据目标的机动情况在线调节粒子数,以使跟踪性能达到最优。在Matlab仿真平台下进行了闪烁噪声下的机动目标跟踪实验,结果表明,自适应采样数粒子滤波算法是一种有效的机动目标跟踪方法,跟踪性能较基本粒子滤波算法提高了3.7倍。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号