全文获取类型
收费全文 | 892篇 |
免费 | 251篇 |
国内免费 | 22篇 |
出版年
2022年 | 7篇 |
2021年 | 45篇 |
2020年 | 8篇 |
2019年 | 4篇 |
2018年 | 2篇 |
2017年 | 7篇 |
2016年 | 6篇 |
2015年 | 28篇 |
2014年 | 36篇 |
2013年 | 30篇 |
2012年 | 24篇 |
2011年 | 22篇 |
2010年 | 50篇 |
2009年 | 69篇 |
2008年 | 43篇 |
2007年 | 64篇 |
2006年 | 31篇 |
2005年 | 37篇 |
2004年 | 5篇 |
2002年 | 6篇 |
2001年 | 6篇 |
2000年 | 20篇 |
1999年 | 110篇 |
1998年 | 84篇 |
1997年 | 67篇 |
1996年 | 52篇 |
1995年 | 48篇 |
1994年 | 44篇 |
1993年 | 36篇 |
1992年 | 37篇 |
1991年 | 37篇 |
1990年 | 45篇 |
1989年 | 9篇 |
1988年 | 4篇 |
1987年 | 12篇 |
1986年 | 6篇 |
1985年 | 9篇 |
1983年 | 11篇 |
1982年 | 3篇 |
1978年 | 1篇 |
排序方式: 共有1165条查询结果,搜索用时 16 毫秒
901.
CALS工作与企业信息化紧密联系。本文分析了信息化相对落后企业的现状及原因,对企业如何开展CALS工作提出了具体做法,并就应重点处理的问题进行了阐述。 相似文献
902.
903.
临近空间飞行器应用前景及发展分析 总被引:5,自引:0,他引:5
文章以临近空间飞行器的应用前景及发展趋势为背景,综合近来国外的研究发展状况,介绍了临近空间飞行器的优势、军事应用,美国对临近空间飞行器的理解及发展目标和技术途径,并结合临近空间飞行器的发展趋势和我国的发展提出了建议。 相似文献
904.
在装备质量问题分析中,应考虑蝴蝶效应,特别要重视那些看上去,好象毫无相关的、微不足道的变化,也许它就是造成装备质量问题的主要原因;在装备科研、生产质量的管理和控制上应注重蝴蝶效应,发现并解决那些已经有苗头而处在可控制阶段的偏差是十分重要的。 相似文献
905.
906.
This study investigates a clustered coverage orienteering problem (CCOP), which is a generalization of the classical orienteering problem. The problem is widely motivated by the emerging unmanned techniques (eg, unmanned surface vehicles and drones) applied to environmental monitoring. Specifically, the unmanned surface vehicles (USVs) are used to monitor reservoir water quality by collecting samples. In the CCOP, the water sampling sites (ie, the nodes) are grouped into clusters, and a minimum number of nodes must be visited in each cluster. With each node representing a certain coverage area of the water, the objective of the CCOP is to monitor as much as possible the total coverage area in one tour of the USV, considering that overlapping areas provide no additional information. An integer programming model is first formulated through a linearization procedure that captures the overlapping feature. A two-stage exact algorithm is proposed to obtain an optimal solution to the problem. The efficiency and effectiveness of the two-stage exact algorithm are demonstrated through experiments on randomly generated instances. The algorithm can effectively solve instances with up to 60 sampling sites. 相似文献
907.
Motivated by challenges in the smartphone manufacturing industry, we develop a dynamic production ramp-up model that can be applied to economically satisfy nonstationary demand for short-life-cycle products by high-tech companies. Due to shorter life cycles and more rapid evolution of smartphones, production ramp-up has been increasingly critical to the success of a new smartphone. In the production ramp-up, the key challenge is to match the increasing capacity to nonstationary demand. The high-tech smartphone manufacturers are urged to jointly consider the effect of increasing capacity and decreasing demand. We study the production planning problem using a high-dimensional Markov decision process (MDP) model to characterize the production ramp-up. To address the curse of dimensionality, we refine Monte Carlo tree search (MCTS) algorithm and theoretically analyze its convergence and computational complexity. In a real case study, we find that the MDP model achieves revenue improvement by stopping producing the existing product earlier than the benchmark policy. In synthetic instances, we validate that the proposed MCTS algorithm saves computation time without loss of solution quality compared with traditional value iteration algorithm. As part of the Lenovo production solution, our MDP model enables high-tech smartphone manufacturers to better plan the production ramp-up. 相似文献
908.
We study optimal pricing for tandem queueing systems with finite buffers. The service provider dynamically quotes prices to incoming price sensitive customers to maximize the long-run average revenue. We present a Markov decision process model for the optimization problem. For systems with two stations, general-sized buffers, and two or more prices, we describe the structure of the optimal dynamic pricing policy and develop tailored policy iteration algorithms to find an optimal pricing policy. For systems with two stations but no intermediate buffer, we characterize conditions under which quoting either a high or a low price to all customers is optimal and provide an easy-to-implement algorithm to solve the problem. Numerical experiments are conducted to compare the developed algorithms with the regular policy iteration algorithm. The work also discusses possible extensions of the obtained results to both three-station systems and two-station systems with price and congestion sensitive customers using numerical analysis. 相似文献
909.
This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm. 相似文献
910.