全文获取类型
收费全文 | 239篇 |
免费 | 102篇 |
国内免费 | 18篇 |
出版年
2023年 | 4篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 8篇 |
2019年 | 7篇 |
2018年 | 1篇 |
2017年 | 13篇 |
2016年 | 18篇 |
2015年 | 16篇 |
2014年 | 19篇 |
2013年 | 17篇 |
2012年 | 15篇 |
2011年 | 12篇 |
2010年 | 14篇 |
2009年 | 25篇 |
2008年 | 17篇 |
2007年 | 21篇 |
2006年 | 25篇 |
2005年 | 14篇 |
2004年 | 17篇 |
2003年 | 9篇 |
2002年 | 8篇 |
2001年 | 12篇 |
2000年 | 8篇 |
1999年 | 5篇 |
1998年 | 5篇 |
1997年 | 6篇 |
1996年 | 6篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 6篇 |
1992年 | 4篇 |
1991年 | 5篇 |
1990年 | 9篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有359条查询结果,搜索用时 140 毫秒
281.
由于各消防中队一般规模较小,对于较大规模的火灾需要多个消防队共同救护,此时若能够实现增援调度的最优化可以提高这些同时出现的火灾被全部扑灭的概率。利用多阶段动态规划对增援调度进行了研究,并分析了具体案例。通过分析得出此方法有助于改善消防资源分配状况,以实现最大程度地减小经济损失。 相似文献
282.
汪泽焱 《国防科技大学学报》2002,24(4):37-41
为了满足通信网络中一些特定业务对于多个网络指标性能的同时要求 ,研究了一类基于多目标决策的QoS路由算法。通过选取带宽作为约束条件 ,把时延和丢失率作为优化目标 ,建立了QoS路由选择的多目标非线性整数规划模型 ,并给出了一种求解模型的交互式算法。该算法通过逐步调整目标函数的上界 ,压缩目标函数的搜索空间来满足决策者的要求和网络条件。实例计算结果表明了算法的可行性 相似文献
283.
We propose two approximate dynamic programming methods to optimize the distribution operations of a company manufacturing a certain product at multiple production plants and shipping it to different customer locations for sale. We begin by formulating the problem as a dynamic program. Our first approximate dynamic programming method uses a linear approximation of the value function and computes the parameters of this approximation by using the linear programming representation of the dynamic program. Our second method relaxes the constraints that link the decisions for different production plants. Consequently, the dynamic program decomposes by the production plants. Computational experiments show that the proposed methods are computationally attractive, and in particular, the second method performs significantly better than standard benchmarks. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
284.
285.
This paper studies a periodic‐review pricing and inventory control problem for a retailer, which faces stochastic price‐sensitive demand, under quite general modeling assumptions. Any unsatisfied demand is lost, and any leftover inventory at the end of the finite selling horizon has a salvage value. The cost component for the retailer includes holding, shortage, and both variable and fixed ordering costs. The retailer's objective is to maximize its discounted expected profit over the selling horizon by dynamically deciding on the optimal pricing and replenishment policy for each period. We show that, under a mild assumption on the additive demand function, at the beginning of each period an (s,S) policy is optimal for replenishment, and the value of the optimal price depends on the inventory level after the replenishment decision has been done. Our numerical study also suggests that for a sufficiently long selling horizon, the optimal policy is almost stationary. Furthermore, the fixed ordering cost (K) plays a significant role in our modeling framework. Specifically, any increase in K results in lower s and higher S. On the other hand, the profit impact of dynamically changing the retail price, contrasted with a single fixed price throughout the selling horizon, also increases with K. We demonstrate that using the optimal policy values from a model with backordering of unmet demands as approximations in our model might result in significant profit penalty. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
286.
Passenger prescreening is a critical component of aviation security systems. This paper introduces the Multilevel Allocation Problem (MAP), which models the screening of passengers and baggage in a multilevel aviation security system. A passenger is screened by one of several classes, each of which corresponds to a set of procedures using security screening devices, where passengers are differentiated by their perceived risk levels. Each class is defined in terms of its fixed cost (the overhead costs), its marginal cost (the additional cost to screen a passenger), and its security level. The objective of MAP is to assign each passenger to a class such that the total security is maximized subject to passenger assignments and budget constraints. This paper shows that MAP is NP‐hard and introduces a Greedy heuristic that obtains approximate solutions to MAP that use no more than two classes. Examples are constructed using data extracted from the Official Airline Guide. Analysis of the examples suggests that fewer security classes for passenger screening may be more effective and that using passenger risk information can lead to more effective security screening strategies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
287.
面向返回编程(return oriented programming, ROP)攻击是网络攻击者突破操作系统安全防护、实现漏洞攻击的一种主要手段,ROP链是ROP攻击的重要组成部分。为检测网络流量中的ROP链,提出了一种能自动提取ROP链特征、具有良好泛化性能的智能检测方法。该方法采用顺序抽取的方式将被测流量分成多个序列,利用滑动窗口和数值量化将输入的一维流量数据转换为二维特征向量,基于卷积神经网络模型实现对ROP链的检测。不同于已有的静态检测方法,该方法不依赖程序内存地址的上下文信息,实现简单、部署方便,且具有优异的检测性能。实验结果表明,模型最高准确率为99.4%,漏报率为0.6%,误报率为0.4%,时间开销在0.1 s以内,对真实ROP攻击流量的漏报率为0.2%。 相似文献
288.
良好的测试性设计对系统维修性具有重要意义,测试性增长试验通过一系列测试性设计缺陷发现和纠正措施,可保证系统测试性指标达到设计要求。针对基于延缓纠正的测试性增长过程中的资源配置问题进行研究,基于增长试验目标是否明确和试验资源是否受限制问题构建资源优化配置模型,并提出一种基于拉格朗日松弛和本地搜索的快速优化算法。仿真结果表明:该模型能够有效指导测试性增长中的资源优化配置问题,所提混合优化方法能够高效、准确地求解整数规划问题。 相似文献
289.
随队支援干扰是现代空袭作战中重要的电子对抗手段,随队飞行过程中对干扰目标的选择是随队支援干扰飞机作战运用研究的重点和难点问题,详细分析了随队支援干扰飞机的作战阶段划分及主要作战行动,针对雷达网的探测距离和综合发现概率指标,建立了随队支援干扰下的计算模型,并主要尽可能地降低雷达网的综合发现概率,提出了基于动态规划的干扰目标选择辅助决策模型。最后,以某种作战背景为基础,进行了作战过程仿真和辅助决策结果分析,验证了该方法的可行性和有效性,该方法求得的结论也支持随队支援干扰飞机其他方面的作战运用研究。 相似文献
290.