全文获取类型
收费全文 | 10998篇 |
免费 | 1770篇 |
国内免费 | 1328篇 |
专业分类
电工技术 | 1746篇 |
综合类 | 1052篇 |
化学工业 | 185篇 |
金属工艺 | 114篇 |
机械仪表 | 464篇 |
建筑科学 | 229篇 |
矿业工程 | 124篇 |
能源动力 | 193篇 |
轻工业 | 75篇 |
水利工程 | 126篇 |
石油天然气 | 64篇 |
武器工业 | 140篇 |
无线电 | 1244篇 |
一般工业技术 | 810篇 |
冶金工业 | 354篇 |
原子能技术 | 22篇 |
自动化技术 | 7154篇 |
出版年
2024年 | 108篇 |
2023年 | 244篇 |
2022年 | 392篇 |
2021年 | 412篇 |
2020年 | 485篇 |
2019年 | 420篇 |
2018年 | 412篇 |
2017年 | 545篇 |
2016年 | 558篇 |
2015年 | 677篇 |
2014年 | 817篇 |
2013年 | 900篇 |
2012年 | 870篇 |
2011年 | 936篇 |
2010年 | 686篇 |
2009年 | 753篇 |
2008年 | 819篇 |
2007年 | 754篇 |
2006年 | 623篇 |
2005年 | 527篇 |
2004年 | 405篇 |
2003年 | 307篇 |
2002年 | 271篇 |
2001年 | 233篇 |
2000年 | 191篇 |
1999年 | 119篇 |
1998年 | 90篇 |
1997年 | 95篇 |
1996年 | 63篇 |
1995年 | 61篇 |
1994年 | 44篇 |
1993年 | 45篇 |
1992年 | 32篇 |
1991年 | 26篇 |
1990年 | 21篇 |
1989年 | 24篇 |
1988年 | 14篇 |
1987年 | 10篇 |
1986年 | 9篇 |
1985年 | 9篇 |
1984年 | 4篇 |
1983年 | 11篇 |
1982年 | 14篇 |
1981年 | 11篇 |
1980年 | 11篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 5篇 |
1975年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
171.
模式搜索方法是求解最优化问题的一种直接搜索方法,它只根据函数值信息来进行求优。但模式搜索对起始点非常敏感,对好的起始点,模式搜索可以搜索到全局最优点,但对某些起始点,模式搜索只能搜索到局部极值点。本文提出基于模式搜索的一个新方法,实验证明,它能搜索到全局最优。 相似文献
172.
本文基于对制造资源调度和发现过程的分析研究,建立实用的制造资源调度器模型和调度策略,然后采用蚂蚁算法对制造资源的调度快表做出优化,并做出有关的实验和数据分析。该方法能够有效地实现制造资源的作业的合理调度和实现分布式系统的负载平衡,提高了制造资源搜索的成功率。 相似文献
173.
Weilin Du 《Information Sciences》2008,178(15):3096-3109
Optimization in dynamic environments is important in real-world applications, which requires the optimization algorithms to be able to find and track the changing optimum efficiently over time. Among various algorithms for dynamic optimization, particle swarm optimization algorithms (PSOs) are attracting more and more attentions in recent years, due to their ability of keeping good balance between convergence and diversity maintenance. To tackle the challenges of dynamic optimization, several strategies have been proposed to enhance the performance of PSO, and have gained success on various dynamic optimization problems. But there still exist some issues in dynamic optimization which need to be studied carefully, i.e. the robustness of the algorithm to problems of various dynamic features. In this paper, a new multi-strategy ensemble particle swarm optimization (MEPSO) for dynamic optimization is proposed. In MEPSO, all particles are divided into two parts, denoted as part I and part II, respectively. Two new strategies, Gaussian local search and differential mutation, are introduced into these two parts, respectively. Experimental analyses reveal that the mechanisms used in part I can enhance the convergence ability of the algorithm, while mechanisms used in part II can extend the searching area of the particle population to avoid being trapped into the local optimum, and can enhance the ability of catching up with the changing optimum in dynamic environments. The whole algorithm has few parameters that need to be tuned, and all of them are not sensitive to problems. We compared MEPSO with other PSOs, including MQSO, PHPSO and Standard PSO with re-initialization, on moving peaks Benchmark and dynamic Rastrigin function. The experimental results show that MEPSO has pretty good performance on almost all testing problems adopted in this paper, and outperforms other algorithms when the dynamic environment is unimodal and changes severely, or has a great number of local optima as dynamic Rastrigin function does. 相似文献
174.
Emergency medical service (EMS) providers continually seek ways to improve system performance particularly the response time to incidents. The demand for ambulances fluctuate throughout the week, depending on the day of week, and even the time of day, therefore EMS operators can improve system performance by dynamic relocation/redeployment of ambulances in response to fluctuating demand patters. The objective of the model is to determine the minimum number of ambulances and their locations for each time cluster in which significant changes in demand pattern occur while meeting coverage requirement with a predetermined reliability. The model is further enhanced by calculating ambulance specific busy probabilities and validated by a comprehensive simulation model. Computational results on experimental data sets and data from an EMS agency are provided. 相似文献
175.
In this paper, we consider the single machine weighted tardiness scheduling problem with sequence-dependent setups. We present heuristic algorithms based on the beam search technique. These algorithms include classic beam search procedures, as well as the filtered and recovering variants. Previous beam search implementations use fixed beam and filter widths. We consider the usual fixed width algorithms, and develop new versions that use variable beam and filter widths. 相似文献
176.
The job shop scheduling problem (JSP) is one of the most notoriously intractable NP-complete optimization problems. Over the last 10–15 years, tabu search (TS) has emerged as an effective algorithmic approach for the JSP. However, the quality of solutions found by tabu search approach depends on the initial solution. To overcome this problem and provide a robust and efficient methodology for the JSP, the heuristics search approach combining simulated annealing (SA) and TS strategy is developed. The main principle of this approach is that SA is used to find the elite solutions inside big valley (BV) so that TS can re-intensify search from the promising solutions. This hybrid algorithm is tested on the standard benchmark sets and compared with the other approaches. The computational results show that the proposed algorithm could obtain the high-quality solutions within reasonable computing times. For example, 17 new upper bounds among the unsolved problems are found in a short time. 相似文献
177.
Decomposition heuristic to minimize total cost in a multi-level supply chain network 总被引:2,自引:0,他引:2
In this paper, the distribution planning model for the multi-level supply chain network is studied. Products which are manufactured at factory are delivered to customers through warehouses and distribution centers for the given customer demands. The objective function of suggested model is to minimize logistic costs such as replenishment cost, inventory holding cost and transportation cost. A mixed integer programming formulation and heuristics for practical use are suggested. Heuristics are composed of two steps: decomposition and post improving process. In the decomposition heuristics, the problems are solved optimally only considering the transportation route first by the minimum cost flow problem, and the replenishment plan is generated by applying the cost-saving heuristic which was originally suggested in the manufacturing assembly line operation, and integrating with the transportation plan. Another heuristic, in which the original model is segmented due to the time periods, and run on a rolling horizon based method, is suggested. With the post-improving process using tabu search method, the performances are evaluated, and it was shown that solutions can be computed within a reasonable computation time by the gap of about 10% in average from the lower bound of the optimal solutions. 相似文献
178.
Assignment of referees to football games is an important problem faced in professional football leagues. Despite its importance, the problem has received limited academic attention. This paper presents a model and analysis of the problem for fair referee assignments, and develops a constructive heuristic and a local search procedure for its solution. Results from an extensive computational study show that the methods are effective in solving the problem in a second of computation time and yielding an excellent solution quality. 相似文献
179.
An evaluation of new heuristics for the location of cross-docks distribution centers in supply chain network design 总被引:3,自引:0,他引:3
This paper addresses an evaluation of new heuristics solution procedures for the location of cross-docks and distribution centers in supply chain network design. The model is characterized by multiple product families, a central manufacturing plant site, multiple cross-docking and distribution center sites, and retail outlets which demand multiple units of several commodities. This paper describes two heuristics that generate globally feasible, near optimal distribution system design and utilization strategies utilizing the simulated annealing (SA) methodology. This study makes two important contributions. First, we continue the study of location planning for the cross-dock and distribution center supply chain network design problem. Second, we systematically evaluate the computational performance of this network design location model under more sophisticated heuristic control parameter settings to better understand interaction effects among the various factors comprising our experimental design, and present convergence results. The central idea of the paper is to evaluate the impact of geometric control mechanism vis-a-vis more sophisticated ones on solution time, quality, and convergence for two new heuristics. Our results suggest that integrating traditional simulated annealing with TABU search is recommended for this supply chain network design and location problem. 相似文献
180.
We study the problem of one-dimensional partitioning of nonuniform workload arrays, with optimal load balancing for heterogeneous systems. We look at two cases: chain-on-chain partitioning, where the order of the processors is specified, and chain partitioning, where processor permutation is allowed. We present polynomial time algorithms to solve the chain-on-chain partitioning problem optimally, while we prove that the chain partitioning problem is NP-complete. Our empirical studies show that our proposed exact algorithms produce substantially better results than heuristics, while solution times remain comparable. 相似文献