全文获取类型
收费全文 | 529篇 |
免费 | 112篇 |
国内免费 | 20篇 |
出版年
2023年 | 2篇 |
2022年 | 3篇 |
2021年 | 4篇 |
2020年 | 8篇 |
2019年 | 6篇 |
2018年 | 1篇 |
2017年 | 16篇 |
2016年 | 20篇 |
2015年 | 20篇 |
2014年 | 37篇 |
2013年 | 37篇 |
2012年 | 28篇 |
2011年 | 37篇 |
2010年 | 57篇 |
2009年 | 57篇 |
2008年 | 41篇 |
2007年 | 23篇 |
2006年 | 30篇 |
2005年 | 23篇 |
2004年 | 39篇 |
2003年 | 21篇 |
2002年 | 9篇 |
2001年 | 15篇 |
2000年 | 14篇 |
1999年 | 13篇 |
1998年 | 22篇 |
1997年 | 17篇 |
1996年 | 14篇 |
1995年 | 8篇 |
1994年 | 9篇 |
1993年 | 6篇 |
1992年 | 4篇 |
1991年 | 7篇 |
1990年 | 10篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有661条查询结果,搜索用时 296 毫秒
91.
深化以任职教育为主体的教学方法改革,是顺应当前武警部队职能任务多样化的必然要求。任职教育适应岗位任职能力的需要必须注重加强军事专业课教学方法的改革与探索。“贴近纳新”把贴近职能需要纳入教学理念、贴近任职实际纳入组教模式、贴近岗位实用纳入课题施教为着眼点,旨在适应任职教育岗位任职能力培养的需要。 相似文献
92.
王立新 《武警工程学院学报》2010,(4):93-95
通过对图书馆知识服务的内涵揭示,认为图书馆是知识服务的重要支撑机构。在创建学习型院校活动中,图书馆应从服务于院校发展的角度,顺应时代发展的要求,积极应对新的挑战,从文献服务转向知识服务,培养和造就一批高素质馆员队伍,推出个性化、专业化的知识服务,为建设学习型院校发挥积极作用。 相似文献
93.
自主创新学习,是院校深入落实科学发展观而对学员提出的新要求,其核心思想是着眼学员全面发展,突出学员主体地位,尊重学员首创精神,激发学员内在动力,增强人才培养工作的生机与活力。军校任职教育的学员大多在部队不同的岗位上任职多年,有丰富的基层工作经验,具备较强的自主创新学习能力。而自主创新学习必须抓住更新学习观念、注重学习方法、精选学习内容、讲求学习实效四个关键环节。 相似文献
94.
马志强 《武警工程学院学报》2010,(6):64-66
“三审制”传统的机制以及运作的惯例,已经无法适应时代发展的要求。在原先严肃但又有点呆板的审稿机制中,需要注入多元化的审稿方式。编者和审者在坚持“三审制”严肃性一面的同时,应多注意运作方式等的灵活性。 相似文献
95.
The nucleolus solution for cooperative games in characteristic function form is usually computed numerically by solving a sequence of linear programing (LP) problems, or by solving a single, but very large‐scale, LP problem. This article proposes an algebraic method to compute the nucleolus solution analytically (i.e., in closed‐form) for a three‐player cooperative game in characteristic function form. We first consider cooperative games with empty core and derive a formula to compute the nucleolus solution. Next, we examine cooperative games with nonempty core and calculate the nucleolus solution analytically for five possible cases arising from the relationship among the value functions of different coalitions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
96.
We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
97.
We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
98.
99.
提出了用小生境遗传模拟退火算法求解带复杂约束的非线性规划问题。首先分析了遗传算法"早熟"收敛以及局部搜索能力弱的不足,由此引入小生境以增加种群多样性,并抑制"早熟"收敛现象,同时引入模拟退火算法以增强局部搜索能力,改进进化后期收敛速度慢的不足,最后结合典型非线性规划算例验证了混合算法的效率、精度和可靠性。 相似文献
100.