全文获取类型
收费全文 | 240篇 |
免费 | 102篇 |
国内免费 | 18篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 8篇 |
2019年 | 5篇 |
2018年 | 1篇 |
2017年 | 14篇 |
2016年 | 17篇 |
2015年 | 16篇 |
2014年 | 21篇 |
2013年 | 16篇 |
2012年 | 15篇 |
2011年 | 11篇 |
2010年 | 10篇 |
2009年 | 25篇 |
2008年 | 18篇 |
2007年 | 20篇 |
2006年 | 24篇 |
2005年 | 13篇 |
2004年 | 21篇 |
2003年 | 8篇 |
2002年 | 8篇 |
2001年 | 10篇 |
2000年 | 9篇 |
1999年 | 5篇 |
1998年 | 4篇 |
1997年 | 6篇 |
1996年 | 6篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 6篇 |
1992年 | 5篇 |
1991年 | 5篇 |
1990年 | 12篇 |
1989年 | 4篇 |
1988年 | 1篇 |
排序方式: 共有360条查询结果,搜索用时 15 毫秒
91.
针对红外观测站部署问题,在研究观测站位置对定位精度影响的基础上,提出了基于粒子群优化的观测站部署算法。首先对ECEF坐标系下的CRLB矩阵进行推导;然后将观测站优化部署问题抽象为非线性规划模型,并将红外传感器联合定位的CRLB作为目标函数;最后采用粒子群优化算法求解该模型,避免了传统的非线性规划算法需要求解目标函数梯度的难题。结果表明,本文的部署算法具有一定的理论依据和工程意义;可以为实际红外观测站的静态部署和动态部署提供参考。 相似文献
92.
We consider the burglar problem in which a burglar can either retire or choose among different types of burglaries, with each type having its own success probability and reward distribution. Some general structural results are established and, in the case of exponentially distributed reward distributions, a solution technique is presented. The burglar problem's relationship to a stochastic knapsack problem with a random exponentially distributed knapsack capacity is shown. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 359–364, 2014 相似文献
93.
In this article, we address a stochastic generalized assignment machine scheduling problem in which the processing times of jobs are assumed to be random variables. We develop a branch‐and‐price (B&P) approach for solving this problem wherein the pricing problem is separable with respect to each machine, and has the structure of a multidimensional knapsack problem. In addition, we explore two other extensions of this method—one that utilizes a dual‐stabilization technique and another that incorporates an advanced‐start procedure to obtain an initial feasible solution. We compare the performance of these methods with that of the branch‐and‐cut (B&C) method within CPLEX. Our results show that all B&P‐based approaches perform better than the B&C method, with the best performance obtained for the B&P procedure that includes both the extensions aforementioned. We also utilize a Monte Carlo method within the B&P scheme, which affords the use of a small subset of scenarios at a time to estimate the “true” optimal objective function value. Our experimental investigation reveals that this approach readily yields solutions lying within 5% of optimality, while providing more than a 10‐fold savings in CPU times in comparison with the best of the other proposed B&P procedures. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 131–143, 2014 相似文献
94.
Constructing a strict total order for alternatives characterized by multiple criteria: An extension
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Akram Dehnokhalaji Pekka J. Korhonen Murat Köksalan Nasim Nasrabadi Diclehan Tezcaner Öztürk Jyrki Wallenius 《海军后勤学研究》2014,61(2):155-163
The problem of finding a strict total order for a finite set of multiple criteria alternatives is considered. Our research extends previous work by us, which considered finding a partial order for a finite set of alternatives. We merge the preference information extracted from the preference cones and corresponding polyhedral sets, with the information derived from pairwise comparisons of two alternatives, yielding a preference matrix. This preference matrix is used as input to an integer programming model to obtain a strict total order that provides a transitive ranking for the set of alternatives. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 155–163, 2014 相似文献
95.
依据境界之间的拓扑数据,采用拓扑分析、边界追踪、边界闭环构建、边界约束下的凸分解、区域填充和边界符号化等技术手段,提出了OpenGL渲染环境下军用数字地图政区的构建方法.通过具体的软件开发和真实数据的测试,证明该方法生成政区准确、符号美观,可适用于不同比例尺下数字地图的显示.该算法具有较强的通用性,遵循国军标的相关规定,已经在相关数字地图软件中得以应用. 相似文献
96.
可能性决策能较好地应对军事领域常常出现的概率难以获得,或者强调“出奇制胜”而有意规避概率风险的情形,是解决知识不完备情况下敌对行动预测的有力手段。从可能性理论基本公理体系出发,结合动态规划方法,提出并证明可能性决策的最优化定理,给出多步条件下可能性决策的实现算法,结合危机条件下敌对行动预测的范例和仿真分析,与传统概率风险决策进行比较,体现可能性决策的优越性,为该方法的推广应用创造条件。 相似文献
97.
This article examines a problem faced by a firm procuring a material input or good from a set of suppliers. The cost to procure the material from any given supplier is concave in the amount ordered from the supplier, up to a supplier‐specific capacity limit. This NP‐hard problem is further complicated by the observation that capacities are often uncertain in practice, due for instance to production shortages at the suppliers, or competition from other firms. We accommodate this uncertainty in a worst‐case (robust) fashion by modeling an adversarial entity (which we call the “follower”) with a limited procurement budget. The follower reduces supplier capacity to maximize the minimum cost required for our firm to procure its required goods. To guard against uncertainty, the firm can “protect” any supplier at a cost (e.g., by signing a contract with the supplier that guarantees supply availability, or investing in machine upgrades that guarantee the supplier's ability to produce goods at a desired level), ensuring that the anticipated capacity of that supplier will indeed be available. The problem we consider is thus a three‐stage game in which the firm first chooses which suppliers' capacities to protect, the follower acts next to reduce capacity from unprotected suppliers, and the firm then satisfies its demand using the remaining capacity. We formulate a three‐stage mixed‐integer program that is well‐suited to decomposition techniques and develop an effective cutting‐plane algorithm for its solution. The corresponding algorithmic approach solves a sequence of scaled and relaxed problem instances, which enables solving problems having much larger data values when compared to standard techniques. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
98.
99.
100.
肖人庆 《国防科技大学学报》1990,12(4):43-50
本文介绍在机器人力反馈依从控制器多机系统中采用程序设计语言C 与分布式库函数相结合实现分布式程序设计的方法,论述了分布式库函数形式,支持分布式库函数设计的多机操作系统功能及其在设计过程中应予以重视的某些问题,并给出了分布式程序设计的一个简例。 相似文献