首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   633篇
  免费   19篇
  2021年   12篇
  2019年   25篇
  2018年   18篇
  2017年   13篇
  2016年   13篇
  2015年   15篇
  2014年   14篇
  2013年   122篇
  2009年   9篇
  2007年   7篇
  2006年   5篇
  2005年   10篇
  2004年   10篇
  2003年   10篇
  2002年   8篇
  2001年   6篇
  2000年   10篇
  1999年   5篇
  1998年   8篇
  1997年   19篇
  1996年   9篇
  1995年   5篇
  1994年   12篇
  1993年   6篇
  1992年   6篇
  1991年   16篇
  1990年   8篇
  1989年   11篇
  1988年   14篇
  1987年   16篇
  1986年   13篇
  1985年   7篇
  1984年   6篇
  1983年   11篇
  1982年   8篇
  1981年   6篇
  1980年   10篇
  1979年   14篇
  1978年   7篇
  1977年   9篇
  1976年   10篇
  1975年   9篇
  1974年   12篇
  1973年   14篇
  1972年   9篇
  1971年   10篇
  1970年   10篇
  1969年   9篇
  1968年   7篇
  1967年   5篇
排序方式: 共有652条查询结果,搜索用时 15 毫秒
531.
In this article we consider a single-server, bulk-service queueing system in which the waiting room is of finite capacity. Arrival process is Poisson and all the arrivals taking place when the waiting room is full are lost. The service times are generally distributed independent random variables and the distribution is depending on the batch size being served. Using renewal theory, we derive the time-dependent solution for the system-size probabilities at arbitrary time points. Also we give expressions for the distribution of virtual waiting time in the queue at any time t.  相似文献   
532.
The orienteering problem involves the selection of a path between an origin and a destination which maximizes total score subject to a time restriction. In previous work we presented an effective heuristic for this NP-hard problem that outperformed other heuristics from the literature. In this article we describe and test a significantly improved procedure. The new procedure is based on four concepts—center of gravity, randomness, subgravity, and learning. These concepts combine to yield a procedure which is much faster and which results in more nearly optimal solutions than previous procedures.  相似文献   
533.
This article is devoted to an MCDM problem connected with locational analysis. The MCDM problem can be formulated so as to minimize the distance between a facility and a given set of points. The efficient points of this problem are candidates for optimal solutions to many location problems. We propose an algorithm to find all efficient points when distance is measured by any polyhedral norm.  相似文献   
534.
535.
The problems of labor staffing and scheduling have received substantial attention in the literature. We introduce two new models of the labor staffing and scheduling problems that avoid the limitations of existing models. Collectively, the models have five important attributes. First, both models ensure the delivery of a minimally acceptable level of service in all periods. Second, one model can identify the least expensive way of delivering a specified aggregate level of customer service (the labor staffing problem and a form of labor scheduling problem). Third, the other model can identify the highest level of service attainable with a fixed amount of labor (the other form of the labor scheduling problem). Fourth, the models enable managers to identify the pareto relationship between labor costs and customer service. Fifth, the models allow a degree of control over service levels that is unattainable with existing models. Because of these attributes, which existing models largely do not possess, we expect these models to have broad applicability in a wide range of organizations operating in both competitive and noncompetitive environments. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 719–740, 1997  相似文献   
536.
Existing models in multistage service systems assume full information on the state of downstream stages. In this paper, we investigate how much the lack of such information impacts jobs' waiting time in a two‐stage system with two types of jobs at the first stage. The goal is to find the optimal control policy for the server at the first stage to switch between type‐1 and type‐2 jobs, while minimizing the long‐run average number of jobs in the system. We identify control policies and corresponding conditions under which having no or partial information, the system can still capture the most benefit of having full information.  相似文献   
537.
In the mid-2000s, the United States Army was embroiled in counterinsurgency missions in Iraq and Afghanistan that required deeper understanding of local social systems. The Army turned to systems thinking and design thinking to model and understand the world, define problems, and develop approaches to strategic and operational challenges. However, the Army’s approach as expressed in publications and doctrine encourages the development of complicated, unsupported, and unfalsifiable hypotheses. The risk is that the Army will act on incorrect assumptions and develop plans that are fragile.  相似文献   
538.
Norway, Sweden and Finland have proclaimed a willingness to cooperate militarily in a future crisis or conflict despite their diverging alliance affiliation. This article assesses their ability to do so through various elements affecting their interoperability, with Arctic Challenge, a multinational military exercise, as an empirical basis. The analysis finds that the NATO/non-NATO-divide has a negative impact on the trilateral defence cooperation, especially on exchange of information and aspects related to command and control. At the same time, Finland and Sweden have become largely NATO-standardized through their active partnership with the Alliance. This has affected interoperability aspects, such as communication, culture, and the compatibility of technical solutions, in a positive manner. Through agreements with the Alliance, as well as domestic legal changes, the two NATO-partners have facilitated receiving military assistance from Norway and other NATO-members during a crisis. Other agreements between the Nordic countries, however, have been limited to peacetime.  相似文献   
539.
Do Private Military and Security Companies (PMSCs) impact peace duration after civil war? I argue that the role these organisations play in a conflict can impact post-conflict stability. Specifically, I suggest that variance in services provided by PMSCs can influence rebels’ calculations about relative capabilities. These calculations then contribute to the probability for civil war recurrence. Building on the bargaining framework, with a focus on information and commitment problems, this article demonstrates that PMSCs participating in armed combat operations can jeopardise the stability of peace following civil war. Three case narratives (Angola, Sierra Leone and Croatia) are used to probe the theoretical argument and results are illustrative – PMSCs serving as force multipliers contribute to an increase in the probability for conflict recurrence.  相似文献   
540.
Many observers anticipate “arms races” between states seeking to deploy artificial intelligence (AI) in diverse military applications, some of which raise concerns on ethical and legal grounds, or from the perspective of strategic stability or accident risk. How viable are arms control regimes for military AI? This article draws a parallel with the experience in controlling nuclear weapons, to examine the opportunities and pitfalls of efforts to prevent, channel, or contain the militarization of AI. It applies three analytical lenses to argue that (1) norm institutionalization can counter or slow proliferation; (2) organized “epistemic communities” of experts can effectively catalyze arms control; (3) many military AI applications will remain susceptible to “normal accidents,” such that assurances of “meaningful human control” are largely inadequate. I conclude that while there are key differences, understanding these lessons remains essential to those seeking to pursue or study the next chapter in global arms control.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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