全文获取类型
收费全文 | 295篇 |
免费 | 219篇 |
国内免费 | 17篇 |
出版年
2023年 | 4篇 |
2022年 | 2篇 |
2021年 | 6篇 |
2020年 | 9篇 |
2019年 | 3篇 |
2018年 | 6篇 |
2017年 | 17篇 |
2016年 | 18篇 |
2015年 | 20篇 |
2014年 | 21篇 |
2013年 | 32篇 |
2012年 | 26篇 |
2011年 | 24篇 |
2010年 | 12篇 |
2009年 | 17篇 |
2008年 | 14篇 |
2007年 | 13篇 |
2006年 | 22篇 |
2005年 | 31篇 |
2004年 | 17篇 |
2003年 | 7篇 |
2002年 | 13篇 |
2001年 | 11篇 |
2000年 | 17篇 |
1999年 | 10篇 |
1998年 | 14篇 |
1997年 | 1篇 |
1995年 | 62篇 |
1994年 | 80篇 |
1991年 | 1篇 |
1990年 | 1篇 |
排序方式: 共有531条查询结果,搜索用时 31 毫秒
111.
We introduce a multi‐period tree network maintenance scheduling model and investigate the effect of maintenance capacity restrictions on traffic/information flow interruptions. Network maintenance refers to activities that are performed to keep a network operational. For linear networks with uniform flow between every pair of nodes, we devise a polynomial‐time combinatorial algorithm that minimizes flow disruption. The spiral structure of the optimal maintenance schedule sheds insights into general network maintenance scheduling. The maintenance problem on linear networks with a general flow structure is strongly NP‐hard. We formulate this problem as a linear integer program, derive strong valid inequalities, and conduct a polyhedral study of the formulation. Polyhedral analysis shows that the relaxation of our linear network formulation is tight when capacities and flows are uniform. The linear network formulation is then extended to an integer program for solving the tree network maintenance scheduling problem. Preliminary computations indicate that the strengthened formulations can solve reasonably sized problems on tree networks and that the intuitions gained from the uniform flow case continue to hold in general settings. Finally, we extend the approach to directed networks and to maintenance of network nodes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
112.
This study addresses cyclic scheduling in robotic flowshops with bounded work‐in‐process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2‐cyclic robotic flowshop scheduling problems for various WIP levels. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 1–16, 2011 相似文献
113.
科学工作流管理系统(Scientific Workflow Management Systems,SWfMS)为科学家提供一个管理大规模复杂科学计算的有效平台,通过管理复杂应用程序对海量科学数据进行管理、分析、仿真和可视化以帮助科学家进行科学发现.本文首先对科学工作流(Scientific Workflow,SWF)... 相似文献
114.
针对效用网格下基于优先级因子的工作流时间-费用优化问题,基于工作流的同步完成特征对任务进行分层并提出三种实时调度算法:基于逆向分层的sufferage(BLSuff)、基于逆向分层的min-min(BLMin)及基于逆向分层的min-max(BLMax)。算法设计基于优先级因子的衡量标准对时间与费用同时进行优化,并为任务设置期望完成时间以达到充分利用费用优化空间进行费用优化的目标。实验结果表明这三种算法在各种优先级因子下都能对工作流的执行时间与执行费用进行较好的优化。 相似文献
115.
116.
This paper presents a new methodology to solve the cyclic preference scheduling problem for hourly workers. The focus is on nurse rostering but is applicable to any organization in which the midterm scheduling decision must take into account a complex of legal, institutional, and preferential constraints. The objective is to strike a balance between satisfying individual preferences and minimizing personnel costs. The common practice is to consider each planning period independently and to generate new rosters at the beginning of each. To reduce some of the instability in the process, there is a growing trend toward cyclic schedules, which are easier to manage and are generally perceived to be more equitable. To address this problem, a new integer programming model is presented that combines the elements of both cyclic and preference scheduling. To find solutions, a branch‐and‐price algorithm is developed that makes use of several branching rules and an extremely effective rounding heuristic. A unique feature of the formulation is that the master problem contains integer rather than binary variables. Computational results are reported for problem instances with up to 200 nurses. Most were solved within 10 minutes and many within 3 minutes when a double aggregation approach was applicable. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
117.
In the classical multiprocessor scheduling problem independent jobs must be assigned to parallel, identical machines with the objective of minimizing the makespan. This article explores the effect of assignment restrictions on the jobs for multiprocessor scheduling problems. This means that each job can only be processed on a specific subset of the machines. Particular attention is given to the case of processing times restricted to one of two values, 1 and λ, differing by at most 2. A matching based polynomial time ε‐approximation algorithm is developed that has a performance ratio tending to . This algorithm is shown to have the best possible performance, tending to 3/2, for processing times 1 and 2. For the special case of nested processing sets, i.e., when the sets of machines upon which individual jobs may be assigned are non‐overlapping, the behavior of list scheduling algorithms is explored. Finally, for assignment restrictions determined by just one characteristic of the machines, such as disc storage or memory constraint in the case of high performance computing, we contribute an algorithm that provides a 3/2 worst case bound and runs in time linear in the number of jobs. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
118.
建立了观炮间隔修正的数学模型,使用本模型可以消除目前舰炮指挥仪公式系中未考虑舰艇摇摆对观炮间隔修正产生的射击误差。 相似文献
119.
本文介绍了一种优化的多变量函数产生器的设计思想,详尽论述了多变量函数快速插值算法、消除冗余断点搜索的思想以及搜索次数为1的断点搜索策略。实用表明,该产生器高效可行,比一般的多变量函数产生器减少计算量一半左右,有效地缩短了仿真问题的求解时间。 相似文献
120.
张金槐 《国防科技大学学报》1994,16(3):68-79
本文研究工程实践中应用Kalman滤波时出现的滤波异常现象。文中从滤波异常的检测出发,由此构成动力学噪声方差阵的自适应估计。对于常用的衰减记忆滤波,提出了衰减因子的自适应确定方法,对于未知的动力学噪声和观测噪声的方差阵,运用Bayes-ML估计方法给出了递推估算方案。对于构造自适应滤波的技术途径,提出了一些看法。 相似文献