全文获取类型
收费全文 | 311篇 |
免费 | 127篇 |
国内免费 | 16篇 |
出版年
2023年 | 1篇 |
2022年 | 3篇 |
2021年 | 7篇 |
2020年 | 3篇 |
2019年 | 9篇 |
2018年 | 3篇 |
2017年 | 29篇 |
2016年 | 32篇 |
2015年 | 20篇 |
2014年 | 39篇 |
2013年 | 47篇 |
2012年 | 16篇 |
2011年 | 19篇 |
2010年 | 18篇 |
2009年 | 20篇 |
2008年 | 17篇 |
2007年 | 20篇 |
2006年 | 17篇 |
2005年 | 23篇 |
2004年 | 22篇 |
2003年 | 9篇 |
2002年 | 9篇 |
2001年 | 13篇 |
2000年 | 10篇 |
1999年 | 4篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1996年 | 8篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1993年 | 4篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1990年 | 5篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1987年 | 1篇 |
排序方式: 共有454条查询结果,搜索用时 15 毫秒
1.
2.
In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
3.
4.
通过对国内自动消防设施设备存在问题的归纳,结合城市消防远程监控系统实际功能的实现,从监控终端、通信网络、信息中心三个方面提高系统的容错能力,阐述了实际建设和调试过程中的解决办法,并对系统的可靠性和安全性进行了讨论。 相似文献
5.
6.
针对防空导弹体系建模的复杂性,探讨研究防空导弹体系的Agent建模方法.提出了基于G/A矩阵的Agent建模方法步骤,通过分析角色之间的关系描述了Agent组织结构,给出了角色类和Agent类的统一定义,并建立了Agent结构框架和类实现模型,最后构建了基于FIPA规范的MAS综合集成框架.该方法的提出,为防空导弹体系的进一步建模提供了方法依据. 相似文献
7.
We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
8.
通过对传统的聚氯乙烯生物填料进行配方调整改性及新型结构设计,研制出一种新型生物填料。分析了填料的润湿性能、挂膜速度、比表面积及填料的抗冲击性能,考察了新型生物填料用于船舶生活污水处理的效果。研究表明,新型PVC生物填料比表面积大、润湿性能好、抗冲击性能好、挂膜速度快,研制的新型填料一体化船舶生活污水处理装置可以在船舶上推广应用。 相似文献
9.
Magnetic resonance imaging and other multifunctional diagnostic facilities, which are considered as scarce resources of hospitals, typically provide services to patients with different medical needs. This article examines the admission policies during the appointment management of such facilities. We consider two categories of patients: regular patients who are scheduled in advance through an appointment system and emergency patients with randomly generated demands during the workday that must be served as soon as possible. According to the actual medical needs of patients, regular patients are segmented into multiple classes with different cancelation rates, no‐show probabilities, unit value contributions, and average service times. Management makes admission decisions on whether or not to accept a service request from a regular patient during the booking horizon to improve the overall value that could be generated during the workday. The decisions should be made by considering the cancelation and no‐show behavior of booked patients as well as the emergency patients that would have to be served because any overtime service would lead to higher costs. We studied the optimal admission decision using a continuous‐time discrete‐state dynamic programming model. Identifying an optimal policy for this discrete model is analytically intractable and numerically inefficient because the state is multidimensional and infinite. We propose to study a deterministic counterpart of the problem (i.e., the fluid control problem) and to develop a time‐based fluid policy that is shown to be asymptotically optimal for large‐scale problems. Furthermore, we propose to adopt a mixed fluid policy that is developed based on the information obtained from the fluid control problem. Numerical experiments demonstrate that this improved policy works effectively for small‐scale problems. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 287–304, 2016 相似文献
10.