首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   224篇
  免费   3篇
  2023年   1篇
  2020年   2篇
  2019年   5篇
  2018年   1篇
  2017年   8篇
  2016年   10篇
  2015年   6篇
  2014年   11篇
  2013年   51篇
  2012年   4篇
  2011年   4篇
  2010年   6篇
  2009年   7篇
  2008年   4篇
  2007年   2篇
  2006年   3篇
  2005年   4篇
  2004年   3篇
  2003年   6篇
  2002年   5篇
  2001年   1篇
  2000年   1篇
  1999年   2篇
  1998年   7篇
  1997年   6篇
  1996年   4篇
  1995年   6篇
  1994年   5篇
  1993年   3篇
  1992年   5篇
  1991年   3篇
  1990年   3篇
  1989年   5篇
  1988年   6篇
  1987年   4篇
  1986年   5篇
  1985年   4篇
  1981年   3篇
  1980年   2篇
  1979年   1篇
  1976年   2篇
  1974年   1篇
  1973年   1篇
  1971年   1篇
  1970年   1篇
  1968年   1篇
  1967年   1篇
排序方式: 共有227条查询结果,搜索用时 78 毫秒
211.
212.
213.
214.
215.
216.
217.
Some books which have fallen within Defense & Security Analysis's fields of interest have paved the way for further studies, either because they have opened up a new era for enquiry and research, or because they have introduced new approaches and methodologies to existing areas. Other volumes have had impact, but have, in their turn, owed an intellectual debt to an earlier work. Again, there are many books and studies on defense which have become forgotten or which were unappreciated at the time of their publication, but which have immediate relevance to today's problems. This section is designed to review books that fall within these categories with a view to highlighting how and why they deserve serious attention.  相似文献   
218.
We consider the problem of placing sensors across some area of interest. The sensors must be placed so that they cover a fixed set of targets in the region, and should be deployed in a manner that allows sensors to communicate with one another. In particular, there exists a measure of communication effectiveness for each sensor pair, which is determined by a concave function of distance between the sensors. Complicating the sensor location problem are uncertainties related to sensor placement, for example, as caused by drifting due to air or water currents to which the sensors may be subjected. Our problem thus seeks to maximize a metric regarding intrasensor communication effectiveness, subject to the condition that all targets must be covered by some sensor, where sensor drift occurs according to a robust (worst‐case) mechanism. We formulate an approximation approach and develop a cutting‐plane algorithm to solve this problem, comparing the effectiveness of two different classes of inequalities. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 582–594, 2015  相似文献   
219.
220.
In a multifunction radar, the maximum number of targets that can be managed or tracked is an important performance measure. Interleaving algorithms developed to operate radars exploit the dead‐times between the transmitted and the received pulses to allocate new tracking tasks that might involve transmitting or receiving pulses, thus increasing the capacity of the system. The problem of interleaving N targets involves a search among N! possibilities, and suboptimal solutions are usually employed to satisfy the real‐time constraints of the radar system. In this paper, we present new tight 0–1 integer programming models for the radar pulse interleaving problem and develop effective solution methods based on Lagrangian relaxation techniques. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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