全文获取类型
收费全文 | 9537篇 |
免费 | 1515篇 |
国内免费 | 1257篇 |
专业分类
电工技术 | 763篇 |
综合类 | 913篇 |
化学工业 | 145篇 |
金属工艺 | 96篇 |
机械仪表 | 395篇 |
建筑科学 | 116篇 |
矿业工程 | 76篇 |
能源动力 | 115篇 |
轻工业 | 60篇 |
水利工程 | 80篇 |
石油天然气 | 56篇 |
武器工业 | 117篇 |
无线电 | 1208篇 |
一般工业技术 | 754篇 |
冶金工业 | 333篇 |
原子能技术 | 17篇 |
自动化技术 | 7065篇 |
出版年
2024年 | 98篇 |
2023年 | 195篇 |
2022年 | 313篇 |
2021年 | 308篇 |
2020年 | 363篇 |
2019年 | 341篇 |
2018年 | 320篇 |
2017年 | 461篇 |
2016年 | 476篇 |
2015年 | 581篇 |
2014年 | 682篇 |
2013年 | 807篇 |
2012年 | 779篇 |
2011年 | 826篇 |
2010年 | 621篇 |
2009年 | 683篇 |
2008年 | 762篇 |
2007年 | 697篇 |
2006年 | 556篇 |
2005年 | 473篇 |
2004年 | 363篇 |
2003年 | 280篇 |
2002年 | 255篇 |
2001年 | 213篇 |
2000年 | 172篇 |
1999年 | 97篇 |
1998年 | 84篇 |
1997年 | 82篇 |
1996年 | 58篇 |
1995年 | 56篇 |
1994年 | 42篇 |
1993年 | 40篇 |
1992年 | 29篇 |
1991年 | 25篇 |
1990年 | 17篇 |
1989年 | 24篇 |
1988年 | 14篇 |
1987年 | 9篇 |
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 毫秒
111.
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. 相似文献
112.
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. 相似文献
113.
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. 相似文献
114.
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. 相似文献
115.
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. 相似文献
116.
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. 相似文献
117.
Most search techniques within ILP require the evaluation of a large number of inconsistent clauses. However, acceptable clauses
typically need to be consistent, and are only found at the “fringe” of the search space. A search approach is presented, based
on a novel algorithm called QG (Quick Generalization). QG carries out a random-restart stochastic bottom-up search which efficiently
generates a consistent clause on the fringe of the refinement graph search without needing to explore the graph in detail.
We use a Genetic Algorithm (GA) to evolve and re-combine clauses generated by QG. In this QG/GA setting, QG is used to seed
a population of clauses processed by the GA. Experiments with QG/GA indicate that this approach can be more efficient than
standard refinement-graph searches, while generating similar or better solutions.
Editors: Ramon Otero, Simon Colton. 相似文献
118.
Elisa Bertino Giovanna Guerrini Marco Mesiti 《Journal of Intelligent Information Systems》2008,30(1):55-92
Measuring the structural similarity between an XML document and a DTD has many relevant applications that range from document
classification and approximate structural queries on XML documents to selective dissemination of XML documents and document
protection. The problem is harder than measuring structural similarity among documents, because a DTD can be considered as
a generator of documents. Thus, the problem is to evaluate the similarity between a document and a set of documents. An effective
structural similarity measure should face different requirements that range from considering the presence and absence of required
elements, as well as the structure and level of the missing and extra elements to vocabulary discrepancies due to the use
of synonymous or syntactically similar tags. In the paper, starting from these requirements, we provide a definition of the
measure and present an algorithm for matching a document against a DTD to obtain their structural similarity. Finally, experimental
results to assess the effectiveness of the approach are presented. 相似文献
119.
In this paper, an Adaptive Hierarchical Ant Colony Optimization (AHACO) has been proposed to resolve the traditional machine
loading problem in Flexible Manufacturing Systems (FMS). Machine loading is one of the most important issues that is interlinked
with the efficiency and utilization of FMS. The machine loading problem is formulated in order to minimize the system unbalance
and maximize the throughput, considering the job sequencing, optional machines and technological constraints. The performance
of proposed AHACO has been tested over a number of benchmark problems taken from the literature. Computational results indicate
that the proposed algorithm is more effective and produces promising results as compared to the existing solution methodologies
in the literature. The evaluation and comparison of system efficiency and system utilization justifies the supremacy of the
algorithm. Further, results obtained from the proposed algorithm have been compared with well known random search algorithm
viz. genetic algorithm, simulated annealing, artificial Immune system, simple ant colony optimization, tabu search etc. In
addition, the algorithm has been tested over a randomly generated problem set of varying complexities; the results validate
the robustness and scalability of the algorithm utilizing the concepts of ‘heuristic gap’ and ANOVA analysis. 相似文献
120.