全文获取类型
收费全文 | 1711篇 |
免费 | 739篇 |
国内免费 | 170篇 |
出版年
2024年 | 14篇 |
2023年 | 19篇 |
2022年 | 30篇 |
2021年 | 32篇 |
2020年 | 40篇 |
2019年 | 41篇 |
2018年 | 41篇 |
2017年 | 102篇 |
2016年 | 139篇 |
2015年 | 116篇 |
2014年 | 160篇 |
2013年 | 139篇 |
2012年 | 156篇 |
2011年 | 142篇 |
2010年 | 126篇 |
2009年 | 152篇 |
2008年 | 113篇 |
2007年 | 136篇 |
2006年 | 140篇 |
2005年 | 112篇 |
2004年 | 114篇 |
2003年 | 68篇 |
2002年 | 73篇 |
2001年 | 73篇 |
2000年 | 49篇 |
1999年 | 50篇 |
1998年 | 40篇 |
1997年 | 35篇 |
1996年 | 34篇 |
1995年 | 18篇 |
1994年 | 29篇 |
1993年 | 18篇 |
1992年 | 22篇 |
1991年 | 15篇 |
1990年 | 19篇 |
1989年 | 10篇 |
1988年 | 3篇 |
排序方式: 共有2620条查询结果,搜索用时 31 毫秒
211.
212.
气控软体驱动器的结构特性对其运动和力学特性影响显著,目前气控软体驱动器支反力和倾角性能亟须提升.基于ABAQUS提供的脚本接口,采用Python语言开发脚本建立气控软体驱动器参数化仿真模型,将尺寸因子作为优化变量,联立Isight和ABAQUS,采用单因子试验方法确定倾角和支反力两个目标量的高敏感性影响因子.运用归一化... 相似文献
213.
This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
214.
A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem
The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
215.
We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
216.
217.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
218.
A. Garnaev 《海军后勤学研究》2007,54(1):109-114
This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λi (μi) for Player 1 (Player 2) such that pi(1 ? exp(?λixi)) (pi(1 ? exp(?μiyi))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort xi (yi) applied at point i where pi ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q1 and Player 2 gets q2 where q1 + q2 ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
219.
Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
220.
This paper proposes a kurtosis correction (KC) method for constructing the X? and R control charts for symmetrical long‐tailed (leptokurtic) distributions. The control charts are similar to the Shewhart control charts and are very easy to use. The control limits are derived based on the degree of kurtosis estimated from the actual (subgroup) data. It is assumed that the underlying quality characteristic is symmetrically distributed and no other distributional and/or parameter assumptions are made. The control chart constants are tabulated and the performance of these charts is compared with that of the Shewhart control charts. For the case of the logistic distribution, the exact control limits are derived and are compared with the KC method and the Shewhart method. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献