首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   266篇
  免费   104篇
  国内免费   17篇
  2023年   2篇
  2022年   5篇
  2021年   8篇
  2020年   10篇
  2019年   12篇
  2018年   5篇
  2017年   22篇
  2016年   25篇
  2015年   21篇
  2014年   29篇
  2013年   49篇
  2012年   15篇
  2011年   12篇
  2010年   12篇
  2009年   7篇
  2008年   10篇
  2007年   12篇
  2006年   16篇
  2005年   16篇
  2004年   18篇
  2003年   8篇
  2002年   8篇
  2001年   12篇
  2000年   9篇
  1999年   9篇
  1998年   8篇
  1997年   5篇
  1996年   2篇
  1995年   1篇
  1994年   5篇
  1993年   5篇
  1992年   2篇
  1991年   1篇
  1990年   2篇
  1988年   4篇
排序方式: 共有387条查询结果,搜索用时 15 毫秒
31.
We model an infinitely repeated Tullock contest, over the sharing of some given resource, between two ethnic groups. The resource is allocated by a composite state institution according to relative ethnic control; hence the ethnic groups contest the extent of institutional ethnic bias. The contest yields the per-period relative influence over institutions, which partly spills over into the next period, by affecting relative conflict efficiency. Our model generates non-monotone evolution of both conflict and distribution. Results suggest that external interventions, when effective in reducing current conflict and protecting weaker groups, may end up sowing the seeds of greater future conflict.  相似文献   
32.
In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
33.
从舰船结构塑性动力响应的工程背景出发,简要介绍了该问题当前的研究进展.主要评述了国内外学者所关注的一些基本问题和研究方法,主要包括解析法、近似法、数值法等,以及冲击载荷作用下梁、板、板架、壳体等结构塑性动力响应的研究进展.  相似文献   
34.
几类C4ISR系统模型的可用性和局限性   总被引:4,自引:1,他引:3  
对几类C4ISR系统模型进行了深入考察,分析了各类模型的特点和适用范围,对其可用性和局限性进行了详细的论述.  相似文献   
35.
In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001  相似文献   
36.
后方油库整体生存概率分析计算   总被引:1,自引:1,他引:0  
针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。  相似文献   
37.
Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000  相似文献   
38.
In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000  相似文献   
39.
机动受限的舰艇防御声自导鱼雷是常见的作战态势之一,而对抗武器的选择和使用就是此时保证舰艇安全的关键。对此在分析作战态势的基础上选择火箭诱杀弹作为对抗武器,并建立其数学及仿真模型,在设定的战术背景下运用蒙特卡洛法进行仿真,对采用不同的发射数量、发射时机,以及不同的对抗武器时舰艇的生存概率进行了比较,理论验证了机动受限时舰艇选择火箭诱杀弹对抗声自导鱼雷的有效性,同时提出了其使用过程中值得注意的战术问题,为部队实际应用武器提供了理论依据。  相似文献   
40.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号