全文获取类型
收费全文 | 491篇 |
免费 | 97篇 |
国内免费 | 9篇 |
出版年
2022年 | 4篇 |
2021年 | 18篇 |
2020年 | 3篇 |
2019年 | 13篇 |
2018年 | 13篇 |
2017年 | 8篇 |
2016年 | 12篇 |
2015年 | 13篇 |
2014年 | 17篇 |
2013年 | 83篇 |
2012年 | 5篇 |
2011年 | 18篇 |
2010年 | 21篇 |
2009年 | 29篇 |
2008年 | 13篇 |
2007年 | 21篇 |
2006年 | 15篇 |
2005年 | 20篇 |
2004年 | 4篇 |
2003年 | 4篇 |
2002年 | 5篇 |
2001年 | 8篇 |
2000年 | 5篇 |
1999年 | 36篇 |
1998年 | 27篇 |
1997年 | 16篇 |
1996年 | 24篇 |
1995年 | 16篇 |
1994年 | 16篇 |
1993年 | 16篇 |
1992年 | 13篇 |
1991年 | 9篇 |
1990年 | 14篇 |
1989年 | 8篇 |
1988年 | 7篇 |
1987年 | 5篇 |
1985年 | 5篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1979年 | 2篇 |
1975年 | 2篇 |
1974年 | 1篇 |
1973年 | 3篇 |
1972年 | 4篇 |
1971年 | 2篇 |
1970年 | 3篇 |
1969年 | 1篇 |
1968年 | 2篇 |
1967年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有597条查询结果,搜索用时 15 毫秒
211.
Many important problems in Operations Research and Statistics require the computation of nondominated (or Pareto or efficient) sets. This task may be currently undertaken efficiently for discrete sets of alternatives or for continuous sets under special and fairly tight structural conditions. Under more general continuous settings, parametric characterisations of the nondominated set, for example through convex combinations of the objective functions or ε‐constrained problems, or discretizations‐based approaches, pose several problems. In this paper, the lack of a general approach to approximate the nondominated set in continuous multiobjective problems is addressed. Our simulation‐based procedure only requires to sample from the set of alternatives and check whether an alternative dominates another. Stopping rules, efficient sampling schemes, and procedures to check for dominance are proposed. A continuous approximation to the nondominated set is obtained by fitting a surface through the points of a discrete approximation, using a local (robust) regression method. Other actions like clustering and projecting points onto the frontier are required in nonconvex feasible regions and nonconnected Pareto sets. In a sense, our method may be seen as an evolutionary algorithm with a variable population size. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
212.
213.
探讨了防空兵群指挥决策的重要地位,依据现代高技术条件下防空兵群作战指挥的决策支持需求,研究并设计了防空兵群作战指挥决策支持系统的基本结构,重点研究了系统的人-机交互技术,阐述了Agent的元模型,详细论述了基于Agent的分布实时群体联盟体系,并对Agent的通信语言ACL消息结构进行分析且应用于联盟体系的通信传输,为构建防空兵群作战指挥决策支持系统的人机交互子系统提供技术准备。 相似文献
214.
推力调节是整体式固液火箭冲压发动机研究的一项关键技术.基于发动机推力调节工作原理,推导了一种推力调节方法,数字仿真结果证明了该方法的可行性. 相似文献
215.
Ebru K. Bish Thin‐Yin Leong Chung‐Lun Li Jonathan W. C. Ng David Simchi‐Levi 《海军后勤学研究》2001,48(5):363-385
We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP‐hard and develop a heuristic algorithm based on formulating the problem as an assignment problem. The effectiveness of the heuristic is analyzed from both worst‐case and computational points of view. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 363–385, 2001 相似文献
216.
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 相似文献
217.
David H. Ucko 《战略研究杂志》2016,39(1):29-61
Rather than win hearts and minds, authoritarian counterinsurgency is said to rely heavily on coercion. It has a reputation for effectiveness, if also for its amorality. Still, the research into authoritarian counterinsurgency is surprisingly lacking. By distilling common features from key cases, this article concludes that this approach goes beyond the indiscriminate violence that typically captures the imagination. Like their democratic counterparts but differently, authoritarian regimes also engage in mobilisation, create narratives, and turn military advantage into political gain. The analysis explains how these tasks are undertaken and, by contradistinction, sheds light on more liberal approaches as well. 相似文献
218.
David M. Barnes 《Journal of Military Ethics》2016,15(1):58-64
Case summary, by James Cook (Case Study Editor):In the final issue of the 2015 volume of the Journal of Military Ethics, we published a case study entitled “Coining an Ethical Dilemma: The Impunity of Afghanistan’s Indigenous Security Forces”, written by Paul Lushenko. The study detailed two extra-judicial killings (EJKs) by Afghan National Police (ANP) personnel in an area stabilized and overseen by a US-led Combined Task Force (CTF). To deter further EJKs following the first incident, the CTF’s commander reported the incidents up his chain of command and used the limited tools at his disposal to influence local indigenous officials directly. Apparently, the ANP unit took no notice. In his commentary on the case study, Paul Robinson considered moral compromise in war more generally. Coalition troops in Afghanistan, for instance, have encountered not just EJKs but also sexual abuse of minors, killing of non-combatants, kidnapping, torture, and widespread corruption. What should the soldier on the ground do if indigenous personnel violate Laws of Armed Conflict (LOAC) with impunity? Refusing to serve will not right or prevent moral wrongs, while staying on to fight the good but futile fight will mire the soldier in moral compromise. “?… [S]oldiers faced with this dilemma have no good options. The systemic failings surrounding them mean that it is probable that nothing they do will help”. In a concluding note, I suggested that while an individual soldier may indeed have no good options, as Paul Robinson suggests, that soldier’s military and nation at large are obliged to do what they can. At least, they must keep to the moral high ground so as not to give indigenous security forces an excuse to misbehave, and determine the nature of crimes such as EJKs: are they outlaw acts or in fact endorsed by the indigenous culture and perhaps even government? Below Colonel Dave Barnes, himself a veteran of Operation Enduring Freedom, analyzes Paul Lushenko’s case study at “?…?the local, tactical level: If a commander is in this situation – where her unit witnesses an EJK or other war crime – what should she do?” 相似文献
219.
对计算流体动力学(CFD)在液体火箭发动机中的应用情况进行了全面的回顾与分析,提出了今后的发展趋势与方向。 相似文献
220.
几何凸集中递归关系的建立是求解问题的关键。本文对一个定理中递归关系的建立给出了容易理解的详细表述,然后利用生成函数法求其解。 相似文献