全文获取类型
收费全文 | 9973篇 |
免费 | 1502篇 |
国内免费 | 1227篇 |
专业分类
电工技术 | 788篇 |
综合类 | 902篇 |
化学工业 | 168篇 |
金属工艺 | 103篇 |
机械仪表 | 456篇 |
建筑科学 | 121篇 |
矿业工程 | 77篇 |
能源动力 | 117篇 |
轻工业 | 61篇 |
水利工程 | 79篇 |
石油天然气 | 57篇 |
武器工业 | 119篇 |
无线电 | 1176篇 |
一般工业技术 | 780篇 |
冶金工业 | 315篇 |
原子能技术 | 18篇 |
自动化技术 | 7365篇 |
出版年
2024年 | 91篇 |
2023年 | 181篇 |
2022年 | 302篇 |
2021年 | 311篇 |
2020年 | 342篇 |
2019年 | 336篇 |
2018年 | 311篇 |
2017年 | 447篇 |
2016年 | 484篇 |
2015年 | 589篇 |
2014年 | 715篇 |
2013年 | 848篇 |
2012年 | 801篇 |
2011年 | 867篇 |
2010年 | 647篇 |
2009年 | 732篇 |
2008年 | 785篇 |
2007年 | 735篇 |
2006年 | 600篇 |
2005年 | 490篇 |
2004年 | 390篇 |
2003年 | 303篇 |
2002年 | 255篇 |
2001年 | 219篇 |
2000年 | 177篇 |
1999年 | 108篇 |
1998年 | 95篇 |
1997年 | 92篇 |
1996年 | 63篇 |
1995年 | 58篇 |
1994年 | 43篇 |
1993年 | 43篇 |
1992年 | 33篇 |
1991年 | 29篇 |
1990年 | 18篇 |
1989年 | 24篇 |
1988年 | 17篇 |
1987年 | 9篇 |
1986年 | 10篇 |
1985年 | 9篇 |
1984年 | 6篇 |
1983年 | 11篇 |
1982年 | 14篇 |
1981年 | 11篇 |
1980年 | 11篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 6篇 |
1975年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
71.
A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests 总被引:1,自引:0,他引:1
Combinatorial optimization problems are usually modeled in a static fashion. In this kind of problems, all data are known in advance, i.e. before the optimization process has started. However, in practice, many problems are dynamic, and change while the optimization is in progress. For example, in the dynamic vehicle routing problem (DVRP), new orders arrive when the working day plan is in progress. In this case, routes must be reconfigured dynamically while executing the current simulation. The DVRP is an extension of a conventional routing problem, its main interest being the connection to many real word applications (repair services, courier mail services, dial-a-ride services, etc.). In this article, a DVRP is examined, and solving methods based on particle swarm optimization and variable neighborhood search paradigms are proposed. The performance of both approaches is evaluated using a new set of benchmarks that we introduce here as well as existing benchmarks in the literature. Finally, we measure the behavior of both methods in terms of dynamic adaptation. 相似文献
72.
This paper presents a social harmony search algorithm model for the cost optimization of composite floor system with discrete variables. The total cost function includes the costs of concrete, steel beam and shear studs. The design is based on AISC load and resistance factor design specifications and plastic design concepts. Here, six decision variables are considered for the objective function. In order to demonstrate the capabilities of the proposed model in optimizing composite floor system designs, two design examples taken from the literature are studied. It is shown that use of the presented model results in significant cost saving. Hence, it can be of practical value to structural designers. Also the proposed model is compared to the original harmony search, its recently developed variants, and other meta-heuristic algorithms to illustrate the superiority of the present method in convergence and leading to better solutions. In order to investigate the effects of beam spans and loadings on the cost optimization of composite floor system a parametric study is also conducted. 相似文献
73.
This paper describes a heuristic approach to the discovery of useful macro-operators (macros) in problem solving. The approach has been implemented in a program, MACLEARN, that has three parts: macro-proposer, static filter, and dynamic filter. Learning occurs during problem solving, so that performance improves in the course of a single problem trial. Primitive operators and macros are both represented within a uniform representational framework that is closed under composition. This means that new macros can be defined in terms of others, which leads to a definitional hierarchy. The representation also supports the transfer of macros to related problems. MACLEARN is embedded in a supporting system that carries out best-first search. Experiments in macro learning were conducted for two classes of problems: peg solitaire (generalized Hi-Q puzzle), and tile sliding (generalized Fifteen puzzle). The results indicate that MACLEARN'S filtering heuristics all improve search performance, sometimes dramatically. When the system was given practice on simpler training problems, it learned a set of macros that led to successful solutions of several much harder problems. 相似文献
74.
J. Dudley Williams Kim N. Holland David M. Jameson Reimar C. Bruening 《Journal of chemical ecology》1992,18(11):2107-2115
Yellowfin tuna enhance their hunting success in the vast pelagic environment by using their sense of smell to detect intact (uninjured) prey that are beyond visual range. However, the olfactory cues that tuna use would normally face huge and rapid dilution in the open ocean. We demonstrate that these prey odors are complexed within biologically derived lipid structures that probably delay the dilution of the amino acids to subthreshold concentrations and provide persistent arousal and search cues for the tuna. This may be the first demonstration of an extracorporeal biological function for liposomes. Tuna may also form chemical search images to maximize feeding efficiency. We demonstrate that the amino acid profiles of various prey species are consistent over time and between schools, which makes the formation of search images feasible. 相似文献
75.
Felix Baessler 《OR Spectrum》1992,14(1):11-18
Summary In this paper, we present a novel relaxation method for the integer programming problem:Ax=b,A {–1,0,+1}m×N,x {0,1}N, N>m. The report includes experimental results of problems with up tom=100 equations andN=400 variables. 相似文献
76.
This paper presents the analysis of a parallel formulation of depth-first search. At the heart of this parallel formulation is a dynamic work-distribution scheme that divides the work between different processors. The effectiveness of the parallel formulation is strongly influenced by the work-distribution scheme and the target architecture. We introduce the concept of isoefficiency function to characterize the effectiveness of different architectures and work-distribution schemes. Many researchers considered the ring architecture to be quite suitable for parallel depth-first search. Our analytical and experimental results show that hypercube and shared-memory architectures are significantly better. The analysis of previously known work-distribution schemes motivated the design of substantially improved schemes for ring and shared-memory architectures. In particular, we present a work-distribution algorithm that guarantees close to optimal performance on a shared-memory/-network-with-message-combining architecture (e.g. RP3). Much of the analysis presented in this paper is applicable to other parallel algorithms in which work is dynamically shared between different processors (e.g., parallel divide-and-conquer algorithms). The concept of isoefficiency is useful in characterizing the scalability of a variety of parallel algorithms.This work was supported by Army Research Office Grant No. DAAG29-84-K-0060 to the Artificial Intelligence Laboratory, and Office of Naval Research Grant N00014-86-K-0763 to the Computer Science Department at the University of Texas at Austin. 相似文献
77.
为了促进风电消纳以及提高电力系统的经济性,构建基于绿色证书交易机制的含风电场电力系统多目标动态环境经济调度(DEED)模型,提出一种基于反向学习混沌搜索的OLCS-MOEA/D算法的DEED调度求解方法。首先,采用广义反向学习初始化种群提高种群多样性,并引入基于Logistic映射的混沌搜索算法以增强算法局部搜索能力。然后,为了验证算法的性能,采用标准测试函数F1—F7进行测试,同时将该算法对模型进行求解,获得了比其他算法范围更广和分布均匀的Pareto解集前沿。最后,对基于绿色证书交易机制的动态环境经济调度与传统动态环境经济调度进行结果对比分析,通过仿真算例验证该模型和算法的有效性和优越性。 相似文献
78.
79.
80.