全文获取类型
收费全文 | 510篇 |
免费 | 91篇 |
国内免费 | 12篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 3篇 |
2021年 | 14篇 |
2020年 | 13篇 |
2019年 | 9篇 |
2018年 | 6篇 |
2017年 | 10篇 |
2016年 | 16篇 |
2015年 | 28篇 |
2014年 | 23篇 |
2013年 | 73篇 |
2012年 | 24篇 |
2011年 | 23篇 |
2010年 | 43篇 |
2009年 | 32篇 |
2008年 | 44篇 |
2007年 | 34篇 |
2006年 | 30篇 |
2005年 | 30篇 |
2004年 | 24篇 |
2003年 | 17篇 |
2002年 | 25篇 |
2001年 | 22篇 |
2000年 | 13篇 |
1999年 | 20篇 |
1998年 | 6篇 |
1997年 | 3篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 2篇 |
1990年 | 3篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1979年 | 1篇 |
1978年 | 3篇 |
1973年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有613条查询结果,搜索用时 871 毫秒
101.
采用叠加组播技术为XMSF提供多对多的通信服务,同时使用拥塞控制机制保证其网络服务质量。提出了一种新的组播拥塞控制模型,在MAX-PLUS代数基础上采用线性循环法分析计算了其吞吐量,经过仿真验证了该模型的可行性和灵活性。 相似文献
102.
In this paper, we extend the inventory lot‐size models to allow for inflation and fluctuating demand (which is more general than constant, increasing, decreasing, and log‐concave demand patterns). We prove that the optimal replenishment schedule not only exists but is also unique. Furthermore, we show that the total cost associated with the inventory system is a convex function of the number of replenishments. Hence, the search for the optimal number of replenishments is simplified to finding a local minimum. Finally, several numerical examples are provided to illustrate the results. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 144–158, 2001 相似文献
103.
BTT控制系统半实物仿真试验以BTT试验器为背景,配合BTT控制技术研究可全面验证导弹控制系统设计。给出了半实物仿真试验方案、方法及试验结果分析,试验结果表明BTT控制系统设计满足最小侧滑(近似零侧滑角)倾斜转弯的技术指标要求,半实物仿真试验方法正确。 相似文献
104.
在营房系统中,营房实力主要包括个人基本情况及住房情况、家属住房情况两大类的知识。营房住房标准分为:按标准住房、超标准住房、未达标准住房、无住房。结合营房实力数据的基本特点,充分利用了先进的数据仓库技术,在数据挖掘和商业智能服务等方面作了深入的探讨,通过营房实力知识对数据进行归类统计,提出了基于知识的统计系统,建立了营房住用多维数据模型和个人住房情况多维数据模型,实现了对营房住用情况和个人住房情况等营房数据的多维分析。 相似文献
105.
This paper studies a queueing system with a Markov arrival process with marked arrivals and PH‐distribution service times for each type of customer. Customers (regardless of their types) are served on a mixed first‐come‐first‐served (FCFS) and last‐come‐first‐served (LCFS) nonpreemptive basis. That is, when the queue length is N (a positive integer) or less, customers are served on an FCFS basis; otherwise, customers are served on an LCFS basis. The focus is on the stationary distribution of queue strings, busy periods, and waiting times of individual types of customers. A computational approach is developed for computing the stationary distribution of queue strings, the mean of busy period, and the means and variances of waiting times. The relationship between these performance measures and the threshold number N is analyzed in depth numerically. It is found that the variance of the virtual (actual) waiting time of an arbitrary customer can be reduced by increasing N. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 399–421, 2000 相似文献
106.
Consider a threshold control policy for an imperfect production system with only a work center handling both regular and rework jobs. An imperfect production system studied here, generates defect jobs by factors other than machine failures. A threshold control or (ω, s) policy sets the guideline for a work center to switch between regular and rework jobs. A production cycle begins with loading and processing of several batches of regular jobs with a lot size equal to s. The outcome of each completed regular job is an independent Bernoulli trial with three possibilities: good, rework, or scrap. Once the work center accumulates more than a threshold ω of rework jobs, it finishes the last batch of regular jobs and switches to rework jobs. The objective of this research is to find a threshold ω and a lot size s that maximize the average long‐term profit. The ultimate goal is to construct a simple algorithm to search for ω and s that can be implemented directly in production management systems, as a result of this work. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 273–301, 1999 相似文献
107.
美军用软件保障综合研究 总被引:1,自引:0,他引:1
本文主要叙述了美军用软件的维护与评估、软件保障组织和软件的保障方案及软件的保障研究与实践。 相似文献
108.
In this paper, a single‐machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a branch‐and‐bound algorithm to eliminate a high percentage of infeasible solutions. After combining this matrix with a branching strategy, a procedure to solve the problem is proposed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 760–780, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10039 相似文献
109.
We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
110.