全文获取类型
收费全文 | 231篇 |
免费 | 65篇 |
国内免费 | 23篇 |
出版年
2024年 | 1篇 |
2023年 | 4篇 |
2022年 | 4篇 |
2021年 | 4篇 |
2020年 | 7篇 |
2019年 | 6篇 |
2018年 | 6篇 |
2017年 | 18篇 |
2016年 | 24篇 |
2015年 | 16篇 |
2014年 | 29篇 |
2013年 | 22篇 |
2012年 | 25篇 |
2011年 | 17篇 |
2010年 | 12篇 |
2009年 | 22篇 |
2008年 | 17篇 |
2007年 | 17篇 |
2006年 | 20篇 |
2005年 | 10篇 |
2004年 | 9篇 |
2003年 | 6篇 |
2002年 | 5篇 |
2001年 | 6篇 |
2000年 | 1篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 2篇 |
排序方式: 共有319条查询结果,搜索用时 15 毫秒
251.
252.
由于各消防中队一般规模较小,对于较大规模的火灾需要多个消防队共同救护,此时若能够实现增援调度的最优化可以提高这些同时出现的火灾被全部扑灭的概率。利用多阶段动态规划对增援调度进行了研究,并分析了具体案例。通过分析得出此方法有助于改善消防资源分配状况,以实现最大程度地减小经济损失。 相似文献
253.
引入价格因素,针对网络资源分配提出PE-EMRA网络资源分配模型,并给出算法实现。PE-EMRA模型综合考虑带宽、缓冲等多种网络资源,调节并限制各业务类流量,使系统总效率最大化。该方法可有效提高资源利用率,提供服务质量保证,并具有配置灵活、实现代价小等特点。 相似文献
254.
255.
This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms. 相似文献
256.
257.
战场环境中多无人机任务分配的航路预估是一个具有多路径和实时性双重要求的路径规划问题。采用概率路标图方法对多无人机多任务的航路预估问题开展研究,将航路预估分为离线学习和在线查询两个阶段。通过将战场中威胁的影响转化为各路标间航段的风险代价,提出了基于代价变换的概率路标图方法,当战场态势发生变化时,在不需重构路标图的条件下可以通过局部航段风险代价的调整快速规划出新的预估航路。根据规划条件采取不同的采样策略,可以在规划时间和航路质量之间实现协调以满足不同的战术要求。仿真结果表明该方法是一种快速有效的航路预估方法。 相似文献
258.
针对集中式多输入多输出(collocated multiple-input multiple-output, CMIMO)雷达在实际探测过程中,未有效结合目标雷达散射截面(radar cross section, RCS)高动态变化特性导致雷达跟踪精度不高甚至失跟的问题,提出一种基于目标RCS高动态特性的CMIMO雷达功率资源自适应分配方法。考虑到目标RCS特征的角度敏感性,利用目标运动状态的可预测性动态获取实际观测角度,从而完成跟踪帧的极化方式优选;在此基础上构建包含功率与RCS的多目标跟踪误差后验克拉美罗下界,将其作为目标函数进行优化,利用内点惩罚法求解该凸优化问题即可实现RCS高动态情况下的功率优化分配。实验结果表明:该方法可结合目标不同方向RCS动态分集特性实现功率的有效分配,相比于传统RCS模型分配方案,有效解决了分配方案与实际跟踪场景之间的失配问题,从而提升了CMIMO雷达的多目标跟踪性能。 相似文献
259.
A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017 相似文献
260.
良好的测试性设计对系统维修性具有重要意义,测试性增长试验通过一系列测试性设计缺陷发现和纠正措施,可保证系统测试性指标达到设计要求。针对基于延缓纠正的测试性增长过程中的资源配置问题进行研究,基于增长试验目标是否明确和试验资源是否受限制问题构建资源优化配置模型,并提出一种基于拉格朗日松弛和本地搜索的快速优化算法。仿真结果表明:该模型能够有效指导测试性增长中的资源优化配置问题,所提混合优化方法能够高效、准确地求解整数规划问题。 相似文献