全文获取类型
收费全文 | 161篇 |
免费 | 31篇 |
国内免费 | 30篇 |
专业分类
222篇 |
出版年
2023年 | 1篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 1篇 |
2019年 | 4篇 |
2018年 | 2篇 |
2017年 | 10篇 |
2016年 | 20篇 |
2015年 | 4篇 |
2014年 | 10篇 |
2013年 | 10篇 |
2012年 | 23篇 |
2011年 | 16篇 |
2010年 | 6篇 |
2009年 | 16篇 |
2008年 | 20篇 |
2007年 | 13篇 |
2006年 | 19篇 |
2005年 | 7篇 |
2004年 | 8篇 |
2003年 | 3篇 |
2002年 | 3篇 |
2001年 | 3篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 2篇 |
1997年 | 5篇 |
1996年 | 5篇 |
1995年 | 1篇 |
1992年 | 1篇 |
1990年 | 2篇 |
排序方式: 共有222条查询结果,搜索用时 0 毫秒
71.
72.
The stochastic sequential assignment problem (SSAP) considers how to allocate available distinct workers to sequentially arriving tasks with stochastic parameters such that the expected total reward obtained from the sequential assignments is maximized. Implementing the optimal assignment policy for the SSAP involves calculating a new set of breakpoints upon the arrival of each task (i.e., for every time period), which is impractical for large‐scale problems. This article studies two problems that are concerned with obtaining stationary policies, which achieve the optimal expected reward per task as the number of tasks approaches infinity. The first problem considers independent and identically distributed (IID) tasks with a known distribution function, whereas in the second problem tasks are derived from r different unobservable distributions governed by an ergodic Markov chain. The convergence rate of the expected reward per task to the optimal value is also obtained for both problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
73.
介绍了在图形处理中,利用面向对象技术实现的平面图形对象拾取算法。与传统的以大量图像信息的存储为基础的位图存储方式下的图形对象拾取算法相比,本算法不但包括单个图形对象的拾取,而且也探讨了在复杂的图形组合下,如在图形重叠与覆盖的情况下进行多个图形对象拾取所需解决的算法难点。本算法对提高图像信息的存储效率和图形对象拾取的质量,对图像科学与面向对象技术的发展具有实际意义。 相似文献
74.
75.
It is known that the proportionate flow shop minimum makespan problem is solved optimally by any permutation job sequence. We show that the problem is at least ordinary NP‐hard when missing operations are allowed and present some solvable cases. We then consider the standard proportionate flow shop problem (with no missing operations) and show that the solution algorithms for a class of single‐machine due date assignment problems can be extended/generalized to the corresponding proportionate flow shop problems. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 98–106, 2015 相似文献
76.
77.
在对联合作战目标协同研究内容分析的基础上,提出了多任务部队与多作战目标的协同目标分配模型,其融合了目标综合价值、目标打击有效性、目标威胁适配度、目标类型匹配、目标距离匹配等因素。通过对各因素量化并将协同目标分配模型转换为指派问题进行求解,验证了分析方法的可行性。 相似文献
78.
We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016 相似文献
79.
无线网络中的路由与信道分配可极大地影响网络的性能.为了解决无线网状网络中的路由与信道分配问题,提出并研究了一种称为CRAG(基于博弈论的无线网状网络路由与信道分配联合优化)的方法.CRAG采用协同博弈的方式将网络中的每个节点模型化为一个弈者,每个弈者的策略为与其相关的路由与信道分配方案,收益函数为给定流量需求矩阵下的成功传输流量.弈者通过协同博弈来优化收益函数以最大化网络的吞吐量.基于NS3的仿真结果表明,CRAG在收敛性、时延、丢包率和吞吐量方面优于其他当前的算法,从而证明了协同博弈的方法可以用于无线网状网络的路由与信道分配联合优化,并有效地改进网络性能. 相似文献
80.