全文获取类型
收费全文 | 200篇 |
免费 | 41篇 |
国内免费 | 14篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 4篇 |
2021年 | 6篇 |
2020年 | 10篇 |
2019年 | 2篇 |
2018年 | 4篇 |
2017年 | 8篇 |
2016年 | 3篇 |
2015年 | 10篇 |
2014年 | 9篇 |
2013年 | 14篇 |
2012年 | 10篇 |
2011年 | 17篇 |
2010年 | 17篇 |
2009年 | 20篇 |
2008年 | 18篇 |
2007年 | 16篇 |
2006年 | 10篇 |
2005年 | 9篇 |
2004年 | 9篇 |
2003年 | 1篇 |
2002年 | 1篇 |
2001年 | 7篇 |
2000年 | 5篇 |
1999年 | 5篇 |
1998年 | 7篇 |
1997年 | 8篇 |
1996年 | 4篇 |
1995年 | 1篇 |
1994年 | 3篇 |
1992年 | 1篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有255条查询结果,搜索用时 15 毫秒
21.
22.
We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
23.
24.
火灾风险评估是降低火灾损失的有效方法。利用模糊层次分析法,建立了高层建筑火灾风险评估体系,并应用于具体高层建筑的火灾风险评估中。评估结果与实际情况取得了较好的一致性,从而为高层建筑火灾风险评估提供了一种简便可行的方法。 相似文献
25.
We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable. 相似文献
26.
在网络端到端延迟的测量中,常用的方法大多是通过发送探测包来直接得到端到端的时延值.由于存在时钟不同步的问题,所以测量结果的误差较大.针对此问题,在Sue B.Moon提出方法的基础上进一步改进,提出了一种基于算法估计的软件方法,该方法更好地解决了收发时钟不同步的问题,提高了测量的精度. 相似文献
27.
28.
介绍了一种μV级微弱电信号测量的实现方法,给出了测量放大电路的具体设计以及信号采集与处理软件流程图.与传统测量方法相比,此测量方法所使用的仪器体积小,重构测量系统方便,可直接由计算机对信号进行分析,是目前信号测量的主要发展方向. 相似文献
29.
This study investigates the statistical process control application for monitoring queue length data in M/G/1 systems. Specifically, we studied the average run length (ARL) characteristics of two different control charts for detecting changes in system utilization. First, the nL chart monitors the sums of successive queue length samples by subgrouping individual observations with sample size n. Next is the individual chart with a warning zone whose control scheme is specified by two pairs of parameters, (upper control limit, du) and (lower control limit, dl), as proposed by Bhat and Rao (Oper Res 20 (1972) 955–966). We will present approaches to calculate ARL for the two types of control charts using the Markov chain formulation and also investigate the effects of parameters of the control charts to provide useful design guidelines for better performance. Extensive numerical results are included for illustration. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
30.
根据石油化工企业生产特点,阐述了石油化工企业火灾现场特点、火灾事故调查的重点内容、调查采取的方法和技术以及事故调查当中的注意事项,为开展好石油化工企业火灾调查工作提供参考。 相似文献