全文获取类型
收费全文 | 505篇 |
免费 | 187篇 |
国内免费 | 28篇 |
出版年
2023年 | 3篇 |
2022年 | 3篇 |
2021年 | 4篇 |
2020年 | 9篇 |
2019年 | 9篇 |
2018年 | 4篇 |
2017年 | 29篇 |
2016年 | 41篇 |
2015年 | 32篇 |
2014年 | 43篇 |
2013年 | 50篇 |
2012年 | 28篇 |
2011年 | 29篇 |
2010年 | 22篇 |
2009年 | 35篇 |
2008年 | 34篇 |
2007年 | 31篇 |
2006年 | 42篇 |
2005年 | 38篇 |
2004年 | 48篇 |
2003年 | 23篇 |
2002年 | 18篇 |
2001年 | 21篇 |
2000年 | 20篇 |
1999年 | 11篇 |
1998年 | 13篇 |
1997年 | 11篇 |
1996年 | 9篇 |
1995年 | 6篇 |
1994年 | 8篇 |
1993年 | 11篇 |
1992年 | 12篇 |
1991年 | 7篇 |
1990年 | 10篇 |
1989年 | 5篇 |
1988年 | 1篇 |
排序方式: 共有720条查询结果,搜索用时 46 毫秒
81.
一种新的分布事务处理模型和算法 总被引:1,自引:0,他引:1
王韬 《军械工程学院学报》1998,(4)
分布事务处理是分布式数据库管理系统设计中的一项关键技术。为保证分布事务的原子性,对基本分布事务处理模型和加工协议进行改进,提出了一种新的分布事务处理机制,并给出了其在分布式工程数据库管理系统dEDBMS中的实现方法。 相似文献
82.
83.
远程反舰导弹弹道规划研究 总被引:5,自引:0,他引:5
以保证远程反舰导弹迅速捕捉目标为出发点,以远程反舰导弹的作战需求为牵引,论述了对远程反舰导弹进行弹道规划的重要意义;从战术和技术两个方面探索了对远程反舰导弹进行弹道规划的主要依据、基本原则、规划思路和基本方法。 相似文献
84.
Pirja Heiskanen 《海军后勤学研究》2001,48(3):210-225
In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001 相似文献
85.
后方油库整体生存概率分析计算 总被引:1,自引:1,他引:0
针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。 相似文献
86.
Fangruo Chen 《海军后勤学研究》2000,47(5):422-439
Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000 相似文献
87.
Kurt M. Bretthauer 《海军后勤学研究》2000,47(1):1-17
In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000 相似文献
88.
In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000 相似文献
89.
We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998 相似文献
90.