全文获取类型
收费全文 | 9759篇 |
免费 | 633篇 |
国内免费 | 507篇 |
专业分类
电工技术 | 447篇 |
综合类 | 793篇 |
化学工业 | 153篇 |
金属工艺 | 106篇 |
机械仪表 | 512篇 |
建筑科学 | 178篇 |
矿业工程 | 60篇 |
能源动力 | 159篇 |
轻工业 | 49篇 |
水利工程 | 68篇 |
石油天然气 | 41篇 |
武器工业 | 48篇 |
无线电 | 840篇 |
一般工业技术 | 745篇 |
冶金工业 | 42篇 |
原子能技术 | 26篇 |
自动化技术 | 6632篇 |
出版年
2024年 | 32篇 |
2023年 | 57篇 |
2022年 | 96篇 |
2021年 | 90篇 |
2020年 | 155篇 |
2019年 | 141篇 |
2018年 | 115篇 |
2017年 | 216篇 |
2016年 | 230篇 |
2015年 | 308篇 |
2014年 | 427篇 |
2013年 | 644篇 |
2012年 | 538篇 |
2011年 | 659篇 |
2010年 | 435篇 |
2009年 | 671篇 |
2008年 | 717篇 |
2007年 | 746篇 |
2006年 | 674篇 |
2005年 | 542篇 |
2004年 | 503篇 |
2003年 | 464篇 |
2002年 | 389篇 |
2001年 | 308篇 |
2000年 | 268篇 |
1999年 | 202篇 |
1998年 | 203篇 |
1997年 | 189篇 |
1996年 | 125篇 |
1995年 | 99篇 |
1994年 | 96篇 |
1993年 | 70篇 |
1992年 | 71篇 |
1991年 | 42篇 |
1990年 | 34篇 |
1989年 | 39篇 |
1988年 | 45篇 |
1987年 | 25篇 |
1986年 | 22篇 |
1985年 | 32篇 |
1984年 | 47篇 |
1983年 | 27篇 |
1982年 | 21篇 |
1981年 | 20篇 |
1980年 | 18篇 |
1979年 | 12篇 |
1978年 | 7篇 |
1977年 | 11篇 |
1976年 | 9篇 |
1975年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
101.
Given two processes, each having a total-ordered set ofn elements, we present a distributed algorithm for finding median of these 2n elements using no more than logn +O(logn) messages, but if the elements are distinct, only logn +O(1) messages will be required. The communication complexity of our algorithm is better than the previously known result which takes 2 logn messages. 相似文献
102.
The problem of path planning for an automaton moving in a two-dimensional scene filled with unknown obstacles is considered. The automaton is presented as a point; obstacles can be of an arbitrary shape, with continuous boundaries and of finite size; no restriction on the size of the scene is imposed. The information available to the automaton is limited to its own current coordinates and those of the target position. Also, when the automaton hits an obstacle, this fact is detected by the automaton's tactile sensor. This information is shown to be sufficient for reaching the target or concluding in finite time that the target cannot be reached. A worst-case lower bound on the length of paths generated by any algorithm operating within the framework of the accepted model is developed; the bound is expressed in terms of the perimeters of the obstacles met by the automaton in the scene. Algorithms that guarantee reaching the target (if the target is reachable), and tests for target reachability are presented. The efficiency of the algorithms is studied, and worst-case upper bounds on the length of generated paths are produced.Supported in part by the National Science Foundation Grant DMC-8519542. 相似文献
103.
104.
105.
乐光学 《组合机床与自动化加工技术》2003,(11):18-21
研究了企业产品制造的调度问题 ,并建立了调度的最小模型。引入效率函数 ,运用遗传退火进化算法实现了调度决策的优化 ;提出了将遗传退火算法和分派规则相结合的调度策略和动态编码的方法 ,放宽了约束条件 ,提高了搜索效率和速度 ,保证其全局收敛性。 相似文献
106.
We have designed Particle-in-Cell algorithms for emerging architectures. These algorithms share a common approach, using fine-grained tiles, but different implementations depending on the architecture. On the GPU, there were two different implementations, one with atomic operations and one with no data collisions, using CUDA C and Fortran. Speedups up to about 50 compared to a single core of the Intel i7 processor have been achieved. There was also an implementation for traditional multi-core processors using OpenMP which achieved high parallel efficiency. We believe that this approach should work for other emerging designs such as Intel Phi coprocessor from the Intel MIC architecture. 相似文献
107.
A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs
In recent years growing interest in local distributed algorithms has widely been observed. This results from their high resistance to errors and damage, as well as from their good performance, which is independent of the size of the network. A local deterministic distributed algorithm finding an approximation of a Minimum Dominating Set in planar graphs has been presented by Lenzen et al., and they proved that the algorithm returns a 130-approximation of the Minimum Dominating Set. In this article we will show that the algorithm is two times more effective than was previously assumed, and we prove that the algorithm by Lenzen et al. outputs a 52-approximation to a Minimum Dominating Set. Therefore the gap between the lower bound and the approximation ratio of the best yet local deterministic distributed algorithm is reduced by half. 相似文献
108.
In order to reduce logistic costs, the scheduling of logistic tasks and resources for fourth party logistics (4PL) is studied. Current scheduling models only consider costs and finish times of each logistic resource or task. Not generally considered are the joint cost and time between two adjacent activities for a resource to process and two sequential activities of a task for two different resources to process are ignored. Therefore, a multi-objective scheduling model aiming at minimizing total operation costs, finishing time and tardiness of all logistic tasks in a 4PL is proposed. Not only are the joint cost and time of logistic activities between two adjacent activities and two sequential activities included but the constraints of resource time windows and due date of tasks are also considered. An improved nondominated sorting genetic algorithm (NSGA-II) is presented to solve the model. The validity of the proposed model and algorithm are verified by a corresponding case study. 相似文献
109.
In this paper, we develop a parallel algorithm for the solution of an integrated topology control and routing problem in Wireless Sensor Networks (WSNs). After presenting a mixed-integer linear optimization formulation for the problem, for its solution, we develop an effective parallel algorithm in a Master–Worker model that incorporates three parallelization strategies, namely low-level parallelism, domain decomposition, and multiple search (both cooperative and independent) in a single Master–Worker framework. 相似文献
110.
《Computer Speech and Language》2014,28(2):543-571
Speech output technology is finding widespread application, including in scenarios where intelligibility might be compromised – at least for some listeners – by adverse conditions. Unlike most current algorithms, talkers continually adapt their speech patterns as a response to the immediate context of spoken communication, where the type of interlocutor and the environment are the dominant situational factors influencing speech production. Observations of talker behaviour can motivate the design of more robust speech output algorithms. Starting with a listener-oriented categorisation of possible goals for speech modification, this review article summarises the extensive set of behavioural findings related to human speech modification, identifies which factors appear to be beneficial, and goes on to examine previous computational attempts to improve intelligibility in noise. The review concludes by tabulating 46 speech modifications, many of which have yet to be perceptually or algorithmically evaluated. Consequently, the review provides a roadmap for future work in improving the robustness of speech output. 相似文献