全文获取类型
收费全文 | 199篇 |
免费 | 44篇 |
国内免费 | 5篇 |
出版年
2023年 | 1篇 |
2022年 | 3篇 |
2021年 | 1篇 |
2020年 | 4篇 |
2019年 | 5篇 |
2018年 | 1篇 |
2017年 | 5篇 |
2016年 | 9篇 |
2015年 | 6篇 |
2014年 | 11篇 |
2013年 | 10篇 |
2012年 | 14篇 |
2011年 | 7篇 |
2010年 | 14篇 |
2009年 | 15篇 |
2008年 | 17篇 |
2007年 | 19篇 |
2006年 | 19篇 |
2005年 | 8篇 |
2004年 | 19篇 |
2003年 | 7篇 |
2002年 | 6篇 |
2001年 | 8篇 |
2000年 | 8篇 |
1999年 | 4篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 7篇 |
1995年 | 5篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1989年 | 3篇 |
排序方式: 共有248条查询结果,搜索用时 15 毫秒
231.
In an accumulation game, a HIDER attempts to accumulate a certain number of objects or a certain quantity of material before a certain time, and a SEEKER attempts to prevent this. In a continuous accumulation game the HIDER can pile material either at locations $1, 2, …, n, or over a region in space. The HIDER will win (payoff 1) it if accumulates N units of material before a given time, and the goal of the SEEKER will win (payoff 0) otherwise. We assume the HIDER can place continuous material such as fuel at discrete locations i = 1, 2, …, n, and the game is played in discrete time. At each time k > 0 the HIDER acquires h units of material and can distribute it among all of the locations. At the same time, k, the SEEKER can search a certain number s < n of the locations, and will confiscate (or destroy) all material found. After explicitly describing what we mean by a continuous accumulation game on discrete locations, we prove a theorem that gives a condition under which the HIDER can always win by using a uniform distribution at each stage of the game. When this condition does not hold, special cases and examples show that the resulting game becomes complicated even when played only for a single stage. We reduce the single stage game to an optimization problem, and also obtain some partial results on its solution. We also consider accumulation games where the locations are arranged in either a circle or in a line segment and the SEEKER must search a series of adjacent locations. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 60–77, 2002; DOI 10.1002/nav.1048 相似文献
232.
We consider a two‐level system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an order‐up‐to level inventory policy over T periods and faces an external demand which is dynamic and known. A retailer's inventory should be raised to its maximum limit when replenished. The problem is to jointly decide on replenishment times and quantities of warehouse and retailers so as to minimize the total costs in the system. Unlike the case in the single level lot‐sizing problem, we cannot assume that the initial inventory will be zero without loss of generality. We propose a strong mixed integer program formulation for the problem with zero and nonzero initial inventories at the warehouse. The strong formulation for the zero initial inventory case has only T binary variables and represents the convex hull of the feasible region of the problem when there is only one retailer. Computational results with a state‐of‐the art solver reveal that our formulations are very effective in solving large‐size instances to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
233.
黄江桥 《中国人民武装警察部队学院学报》2010,26(2):50-52
分析了目前部队出租房消防管理存在的问题,提出了要把部队出租房纳入审批范畴,加强源头控制;明确工作职责,建立协作监管机制;提高思想认识,重视消防安全管理;落实各级责任,部门齐抓共管;健全监管机制,加强督促检查;加强宣传教育,把握舆论导向;坚持依法管理,提升服务水平。 相似文献
234.
支持向量顺序回归机是标准支持向量分类机的一个推广,它是一个凸的二次规划问题。本文根据l1范数与l2范数等价关系和优化问题的对偶原理,把凸的二次规划转化成线性规划。由此提了支持向量顺序回归机的线性规划算法,进一步用数值实验验证了此算法的可行性和有效性。并与支持向量顺序回归机相比,它的运行时间缩短了,而且误差i不超过支持向量顺序回归机; 相似文献
235.
浅议高校科研经费的管理与监督 总被引:1,自引:0,他引:1
针对高校科研经费成为高校资金重要来源和科研经费管理的现状,笔者就科研经费管理与监督工作现存问题、科研经费管理和科研经费监督工作问题对策进行了初步的探讨。 相似文献
236.
一般武器-目标分配问题,是使武器发挥最大效能而使目标遭受最大毁伤的最优化问题.遗传算法广泛用于解决最优化问题.提出一种具有贪心优化机制的局部搜索方法,以提高遗传算法的搜索效率,从而迅速找到全局最优解.应用于炮兵武器-目标分配问题的仿真试验结果表明,此算法比现有的其他搜寻算法具有更好的求解效率. 相似文献
237.
238.
周兢 《中国人民武装警察部队学院学报》2009,25(3):46-49
消防中介机构法制建设还存在很多问题,立法滞后,执法不严,必须加强法制建设,促进消防中介机构规范运行,以利于消防中介机构的健康发展。 相似文献
239.
王波 《中国人民武装警察部队学院学报》2009,25(11):64-67,71
武警学院研究生教育已开办六年,分析六年来研究生教育的基本情况、取得的成绩和存在的问题,对于今后一个时期的研究生教育具有现实指导作用。 相似文献
240.
The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016 相似文献