全文获取类型
收费全文 | 3174篇 |
免费 | 471篇 |
国内免费 | 67篇 |
专业分类
化学 | 232篇 |
晶体学 | 6篇 |
力学 | 87篇 |
综合类 | 64篇 |
数学 | 1548篇 |
物理学 | 182篇 |
无线电 | 1593篇 |
出版年
2024年 | 11篇 |
2023年 | 47篇 |
2022年 | 75篇 |
2021年 | 84篇 |
2020年 | 91篇 |
2019年 | 106篇 |
2018年 | 91篇 |
2017年 | 123篇 |
2016年 | 121篇 |
2015年 | 138篇 |
2014年 | 224篇 |
2013年 | 195篇 |
2012年 | 195篇 |
2011年 | 205篇 |
2010年 | 199篇 |
2009年 | 212篇 |
2008年 | 223篇 |
2007年 | 217篇 |
2006年 | 178篇 |
2005年 | 155篇 |
2004年 | 118篇 |
2003年 | 104篇 |
2002年 | 106篇 |
2001年 | 95篇 |
2000年 | 82篇 |
1999年 | 62篇 |
1998年 | 41篇 |
1997年 | 35篇 |
1996年 | 32篇 |
1995年 | 24篇 |
1994年 | 10篇 |
1993年 | 17篇 |
1992年 | 13篇 |
1991年 | 6篇 |
1990年 | 5篇 |
1989年 | 5篇 |
1988年 | 15篇 |
1987年 | 4篇 |
1986年 | 3篇 |
1985年 | 16篇 |
1984年 | 12篇 |
1983年 | 5篇 |
1982年 | 4篇 |
1981年 | 4篇 |
1979年 | 2篇 |
1975年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有3712条查询结果,搜索用时 15 毫秒
31.
Richard O. LaMaire 《Queueing Systems》1992,11(4):357-375
We define and analyze anM/G/1/N vacation model that uses a service discipline that we call theE-limited with limit variation discipline. According to this discipline, the server provides service until either the system is emptied (i.e. exhausted) or a randomly chosen limit ofl customers has been served. The server then goes on a vacation before returning to service the queue again. The queue length distribution and the Laplace-Stieltjes transforms of the waiting time, busy period and cycle time distributions are found. Further, an expression for the mean waiting time is developed. Several previously analyzed service disciplines, including Bernoulli scheduling, nonexhaustive service and limited service, are special cases of the general varying limit discipline that is analyzed in this paper. 相似文献
32.
Multi-objective optimization using evolutionary algorithms identifies Pareto-optimal alternatives or their close approximation by means of a sequence of successive local improvement moves. While several successful applications to combinatorial optimization problems are known, studies of underlying problem structures are still scarce. 相似文献
33.
工件带到达时间的两阶段柔性流水作业的近似算法 总被引:1,自引:0,他引:1
研究了工件带到时间的两阶段柔性流水作业的排序问题,基于求解流水作业和平行机问题的算法思想,提出两个相应的近似算法H(R)和H(MR(?)),证明了这两个算法的最坏情况性能比分别为3-1/m和2/5-1/m,讨论了界的紧性,并利用数值模拟以分析算法与最优值的近似性能比. 相似文献
34.
This paper proposes a floating-point genetic algorithm (FPGA) to solve the unit commitment problem (UCP). Based on the characteristics of typical load demand, a floating-point chromosome representation and an encoding–decoding scheme are designed to reduce the complexities in handling the minimum up/down time limits. Strategic parameters of the FPGA are characterized in detail, i.e., the evaluation function and its constraints, population size, operation styles of selection, crossover operation and probability, mutation operation and probability. A dynamic combination scheme of genetic operators is formulated to explore and exploit the FPGA in the non-convex solution space and multimodal objective function. Experiment results show that the FPGA is a more effective technique among the various styles of genetic algorithms, which can be applied to the practical scheduling tasks in utility power systems. 相似文献
35.
This note outlines an algorithm for solving the complex ‘matrix Procrustes problem’. This is a least‐squares approximation over the cone of positive semi‐definite Hermitian matrices, which has a number of applications in the areas of Optimization, Signal Processing and Control. The work generalizes the method of Allwright (SIAM J. Control Optim. 1988; 26 (3):537–556), who obtained a numerical solution to the real‐valued version of the problem. It is shown that, subject to an appropriate rank assumption, the complex problem can be formulated in a real setting using a matrix‐dilation technique, for which the method of Allwright is applicable. However, this transformation results in an over‐parametrization of the problem and, therefore, convergence to the optimal solution is slow. Here, an alternative algorithm is developed for solving the complex problem, which exploits fully the special structure of the dilated matrix. The advantages of the modified algorithm are demonstrated via a numerical example. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
36.
In apparel industry, manufacturers developed standard allowed minutes (SAMs) databases on various manufacturing operations in order to facilitate better scheduling, while effective production schedules ensure smoothness of downstream operations. As apparel manufacturing environment is fuzzy and dynamic, rigid production schedules based on SAMs become futile in the presence of any uncertainty. In this paper, a fuzzification scheme is proposed to fuzzify the static standard time so as to incorporate some uncertainties, in terms of both job-specific and human related factors, into the fabric-cutting scheduling problem. A genetic optimisation procedure is also proposed to search for fault-tolerant schedules using genetic algorithms, such that makespan and scheduling uncertainties are minimised. Two sets of real production data were collected to validate the proposed method. Experimental results indicate that the genetically optimised fault-tolerant schedules not only improve the operation performance but also minimise the scheduling risks. 相似文献
37.
Labour scheduling plays an important and critical role in Sainsburys day to day operations and profitability. The integrated
workforce management solution for Sainsburys is an intelligent solution for the operational deployment of human resources,
integrated business forecasting, generation and calculation of workload and staff scheduling. The workforce management technology
has provided Sainsburys with a fully web-based and centralised system that produces optimised schedules for all employees
satisfying the forecasted demand of work with granularity of fifteen minutes. The system is configured to respect all operational
and business requirements as well as employee contractual constraints. This paper introduces the workforce management solution
system designed, developed and implemented for Sainsburys. We concentrate on two modelling structures, namely the work pattern
model and optimisation model, and briefly discuss the optimisation process. 相似文献
38.
Optimal production and rationing decisions in supply chains with information sharing 总被引:1,自引:0,他引:1
Boray Huang 《Operations Research Letters》2007,35(5):669-676
This paper considers a two-echelon capacitated supply chain with two non-identical retailers and information sharing. We characterize the optimal inventory policies. We also study the benefits of the optimal stock rationing policy over the first come first served (FCFS) and the modified echelon-stock rationing (MESR) policies. 相似文献
39.
We study the approximability of minimum total weighted tardiness with a modified objective which includes an additive constant. This ensures the existence of a positive lower bound for the minimum value. Moreover the new objective has a natural interpretation in just-in-time production systems. 相似文献
40.
We define events so as to reduce the number of events and decision variables needed for modeling batch-scheduling problems such as described in [15]. We propose a new MILP formulation based on this concept, defining non-uniform time periods as needed and decision variables that are not time-indexed. It can handle complicated multi-product/multi-stage machine processes, with production lines merging and diverging, and with minimum and maximum batch sizes. We compare it with earlier models and show that it can solve problems with small to medium demands relative to batch sizes in reasonable computer times. 相似文献