首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   461篇
  免费   11篇
  国内免费   1篇
  2019年   10篇
  2018年   14篇
  2017年   9篇
  2016年   12篇
  2015年   3篇
  2014年   10篇
  2013年   122篇
  2012年   5篇
  2010年   9篇
  2007年   6篇
  2005年   10篇
  2004年   5篇
  2003年   7篇
  2002年   12篇
  2000年   4篇
  1999年   7篇
  1998年   8篇
  1997年   11篇
  1996年   5篇
  1995年   4篇
  1994年   10篇
  1993年   14篇
  1992年   9篇
  1991年   10篇
  1990年   9篇
  1989年   7篇
  1988年   8篇
  1987年   10篇
  1986年   7篇
  1985年   7篇
  1984年   3篇
  1983年   3篇
  1982年   7篇
  1981年   6篇
  1980年   4篇
  1979年   6篇
  1978年   9篇
  1977年   4篇
  1976年   6篇
  1975年   5篇
  1974年   6篇
  1973年   4篇
  1972年   6篇
  1971年   4篇
  1970年   2篇
  1969年   5篇
  1968年   7篇
  1967年   3篇
  1966年   4篇
  1948年   2篇
排序方式: 共有473条查询结果,搜索用时 15 毫秒
361.
Distributions are studied which arise by considering independent and identically distributed random variables conditioned on events involving order statistics. It is shown that these distributions are negatively dependent in a very strong sense. Furthermore, bounds are found on the distribution functions. The conditioning events considered occur naturally in reliability theory as the time to system failure for k-out-of-n systems. An application to systems formed with “second-hand” components is given.  相似文献   
362.
Given point-to-point demand forecasts of transmission facilities for services such as voice or data transmission in each period of a finite planning horizon, a decision has to be made as to which types of transmission facilities—together with the amounts of transmission circuits—are to be installed, if any, on each link of the telecommunications network, in each period of the planning horizon. The availability of alternative transmission systems with significantly different costs and circuit capacities necessitates the determination of a minimum (discounted) cost facility installation scheme. This combinatoric choice problem is complicated by the availability of switching equipments enabling the transmission of some of the traffic through intermediary points. This possibility of alternately routing the traffic or the facility requirements of certain point pairs further complicates the problem while creating the opportunity to benefit from economies of scale. We present here a heuristic method for finding a good solution for the general problem; namely, we consider multiple transmission systems and multiple alternate routes. Numerical examples are given and computational experience is reported.  相似文献   
363.
364.
ABSTRACT

Following frustrating campaigns in Iraq and Afghanistan, Western interventions are becoming more limited, with troops being deployed for short bursts and residual peace-building tasks being left to others. Although this approach limits exposure for the intervening government, it struggles to achieve meaningful political change. Examining the comparatively successful British intervention in Sierra Leone (2000–02), this article identifies the conditions for effectiveness in these campaigns. It challenges the historiography of the case by framing armed confrontations and raids as enablers of politics rather than ends in themselves; indeed, in both the conduct and study of intervention, politics must reign supreme.  相似文献   
365.
Unmanned aerial vehicles (UAVs), increasingly vital to the success of military operations, operate in a complex and dynamic environment, sometimes in concert with manned aircraft. We present an extensible modeling framework for the solution to the dynamic resource management (DRM) problem, where airborne resources must be reassigned to time‐sensitive tasks in response to changes in battlespace conditions. The DRM problem is characterized by diverse tasks with time windows, heterogeneous resources with fuel‐ and payload‐capacity limitations, and multiple competing objectives. We propose an integer linear programing formulation for this problem, where mathematical feasibility is guaranteed. Although motivated by airborne military operations, the proposed general modeling framework is applicable to a wide array of settings, such as disaster relief operations. Additionally, land‐ or water‐based operations may be modeled within this framework, as well as any combination of manned and unmanned vehicles. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   
366.
367.
368.
369.
The National Football League (NFL) in the United States expanded to 32 teams in 2002 with the addition of a team in Houston. At that point, the league was realigned into eight divisions, each containing four teams. We describe a branch‐and‐cut algorithm for minimizing the sum of intradivisional travel distances. We consider first the case where any team can be assigned to any division. We also consider imposing restrictions, such as aligning the AFC (American Football Conference) and the NFC (National Football Conference) separately or maintaining traditional rivalries. We show that the alignment chosen by the NFL does not minimize the sum of intradivisional travel distances, but that it is close to optimal for an alignment that aligns the NFC and AFC separately and imposes some additional restrictions. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 683–701, 2003.  相似文献   
370.
A U‐line arranges tasks around a U‐shaped production line and organizes them into stations that can cross from one side of the line to the other. In addition to improving visibility and communication between operators on the line, which facilitates problem‐solving and quality improvement, U‐lines can reduce the total number of operators required on the line and make rebalancing the line easier compared to the traditional, straight production line. This paper studies the (type 1) U‐line balancing problem when task completion times are stochastic. Stochastic completion times occur when differences between operators cause completion times to vary somewhat and when machine processing times vary. A recursive algorithm is presented for finding the optimal solution when completion times have any distribution function. An equivalent shortest path network is also presented. An improvement for the special case of normally distributed task completion times is given. A computational study to determine the characteristics of instances that can be solved by the algorithms shows that they are able to solve instances of practical size (like the 114 Japanese and U.S. U‐lines studied in a literature review paper). © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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