全文获取类型
收费全文 | 543篇 |
免费 | 12篇 |
出版年
2021年 | 13篇 |
2019年 | 10篇 |
2018年 | 8篇 |
2017年 | 5篇 |
2016年 | 10篇 |
2014年 | 9篇 |
2013年 | 81篇 |
2012年 | 5篇 |
2009年 | 11篇 |
2007年 | 16篇 |
2005年 | 4篇 |
2004年 | 7篇 |
2003年 | 9篇 |
2002年 | 13篇 |
2001年 | 7篇 |
2000年 | 7篇 |
1999年 | 5篇 |
1998年 | 10篇 |
1997年 | 11篇 |
1996年 | 10篇 |
1995年 | 9篇 |
1994年 | 8篇 |
1993年 | 12篇 |
1992年 | 10篇 |
1991年 | 14篇 |
1990年 | 14篇 |
1989年 | 21篇 |
1988年 | 17篇 |
1987年 | 13篇 |
1986年 | 17篇 |
1985年 | 7篇 |
1984年 | 8篇 |
1983年 | 6篇 |
1982年 | 11篇 |
1981年 | 10篇 |
1980年 | 10篇 |
1979年 | 11篇 |
1978年 | 11篇 |
1977年 | 10篇 |
1976年 | 6篇 |
1975年 | 6篇 |
1974年 | 10篇 |
1973年 | 9篇 |
1972年 | 4篇 |
1971年 | 8篇 |
1970年 | 8篇 |
1969年 | 8篇 |
1968年 | 3篇 |
1967年 | 6篇 |
1948年 | 4篇 |
排序方式: 共有555条查询结果,搜索用时 15 毫秒
451.
In this paper we study strategies for better utilizing the network capacity of Internet Service Providers (ISPs) when they are faced with stochastic and dynamic arrivals and departures of customers attempting to log‐on or log‐off, respectively. We propose a method in which, depending on the number of modems available, and the arrival and departure rates of different classes of customers, a decision is made whether to accept or reject a log‐on request. The problem is formulated as a continuous time Markov Decision Process for which optimal policies can be readily derived using techniques such as value iteration. This decision maximizes the discounted value to ISPs while improving service levels for higher class customers. The methodology is similar to yield management techniques successfully used in airlines, hotels, etc. However, there are sufficient differences, such as no predefined time horizon or reservations, that make this model interesting to pursue and challenging. This work was completed in collaboration with one of the largest ISPs in Connecticut. The problem is topical, and approaches such as those proposed here are sought by users. © 2001 John Wiley & Sons, Inc., Naval Research Logistics 48:348–362, 2001 相似文献
452.
An efficient algorithm for determining the optimal arrival schedule for customers in a stochastic service system is developed. All customers arrive exactly when scheduled, and service times are modeled as iid Erlang random variables. Costs are incurred at a fixed rate per unit of time each customer waits for service, and an additional cost is incurred for every unit of time the server operates beyond a scheduled closing time. The objective is to minimize total operating cost. This type of problem arises in many operational contexts including transportation, manufacturing, and appointment‐based services. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 549–559, 1999 相似文献
453.
Given a positive integer R and a weight for each vertex in a graph, the maximum-weight connected graph problem (MCG) is to find a connected subgraph with R vertices that maximizes the sum of their weights. MCG has applications to communication network design and facility expansion. The constrained MCG (CMCG) is MCG with a constraint that one predetermined vertex must be included in the solution. In this paper, we introduce a class of decomposition algorithms for MCG. These algorithms decompose MCG into a number of small CMCGs by adding vertices one at a time and building a partial graph. They differ in the ordering of adding vertices. Proving that finding an ordering that gives the minimum number of CMCGs is NP-complete, we present three heuristic algorithms. Experimental results show that these heuristics are very effective in reducing computation and that different orderings can significantly affect the number of CMCGs to be solved. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 817–837, 1998 相似文献
454.
Raymond K. Cheung 《海军后勤学研究》1998,45(8):769-789
We consider a routing policy that forms a dynamic shortest path in a network with independent, positive and discrete random arc costs. When visiting a node in the network, the costs for the arcs going out of this node are realized, and then the policy will determine which node to visit next with the objective of minimizing the expected cost from the current node to the destination node. This paper proposes an approach, which mimics the classical label-correcting approach, to compute the expected path cost. First, we develop a sequential implementation of this approach and establish some properties about the implementation. Next, we develop stochastic versions of some well-known label-correcting methods, including the first-in-first-out method, the two-queue method, the threshold algorithms, and the small-label-first principle. We perform numerical experiments to evaluate these methods and observe that fast methods for deterministic networks can become very slow for stochastic networks. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 769–789, 1998 相似文献
455.
We describe the development of a heuristic algorithm for determining efficient 2-dimensional packings in cargo aircraft where cargo placement constraints are critically important in determining the feasibility of packing locations. We review the performance of a new algorithm versus some traditional ones for aircraft loading. The algorithm is also tested in a more generalized setting where there exist no additional constraints on items, to suggest applicability in other environments. The new algorithm has been used worldwide in the Automated Air Load Planning System (AALPS) for cargo aircraft loading, with much success. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 751–768, 1998 相似文献
456.
The G/G/R machine repair problem with M operating machines, S warm standby spares, and R repairmen is studied as a diffusion process. The steady-state equations are formulated as diffusion equations subject to two reflecting barriers. The approximate diffusion parameters of the diffusion equations are obtained (1) under the assumption that the input characteristics of the problem are defined only by their first two moments rather than their probability distribution function, (2) under the assumption of heavy traffic approximation, that is, when queues of failed machines in the repair stage are almost always nonempty, and (3) using well-known asymptotic results from renewal theory. Expressions for the probability density functions of the number of failed machines in the system are obtained. A study of the derived approximate results, compared to some of the exact results, suggests that the diffusion approach provides a useful method for solving complex machine-repair problems. 相似文献
457.
Ilmari Käihkö 《Defence Studies》2018,18(2):147-166
At the core of waging war and strategy is the creation, control and use of force. This article investigates the volunteer battalions that mobilized in Ukraine during the spring of 2014. It contextualizes the volunteer phenomenon and focuses on the state strategies to establish control over these militias. As ambiguous entities arising from a situation characterized by rapid social change – revolution and war – the volunteer battalions threatened existing hierarchies and questioned state authority. The situation was exacerbated by the war, which deviated from the expectations of Ukrainian combatants and Western military observers alike. The state nevertheless enjoyed a modicum of success in reining in the militias through four strategies of undermining, co-option, incorporation and coercion. While predominantly integrated into a more rigid category of paramilitary forces, the volunteers continue to play a role in both the Ukrainian society and security sector to the unforeseeable future. 相似文献
458.
A carrier battle group is operating in an area where it is subject to attack by enemy aircraft. It is anticipated that air raids will occur in large waves. The uncertain time between raids is available for the replenishment of supplies. We consider the problem of how best to schedule ammunition replenishment during this period. The theory of Gittins indices provides the technical background to the development of a range of models which yield a hierarchy of index-based heuristics for replenishment. One such heuristic is assessed computationally in a more realistic scenario than is explicitly allowed for by the models. 相似文献
459.
In this article we present a stochastic model for determining inventory rotation policies for a retail firm which must stock many hundreds of distinctive items having uncertain heterogeneous sales patterns. The model develops explicit decision rules for determining (1) the length of time that an item should remain in inventory before the decision is made on whether or not to rotate the item out of inventory and (2) the minimum sales level necessary for retaining the item in inventory. Two inventory rotation policies are developed, the first of which maximizes cumulative expected sales over a finite planning horizon and the second of which maximizes cumulative expected profit. We also consider the statistical behavior of items having uncertain, discrete, and heterogeneous sales patterns using a two-period prediction methodology where period 1 is used to accumulate information on individual sales rates and this knowledge is then used, in a Bayesian context, to make sales predictions for period 2. This methodology assumes that over an arbitrary time interval sales for each item are Poisson with unknown but stationary mean sales rates and the mean sales rates are distributed gamma across all items. We also report the application of the model to a retail firm which stocks many hundreds of distinctive unframed poster art titles. The application provides some useful insights into the behavior of the model as well as some interesting aspects pertaining to the implementation of the results in a “real-world” situation. 相似文献
460.