全文获取类型
收费全文 | 2420篇 |
免费 | 170篇 |
国内免费 | 48篇 |
专业分类
化学 | 311篇 |
晶体学 | 6篇 |
力学 | 87篇 |
综合类 | 49篇 |
数学 | 1857篇 |
物理学 | 328篇 |
出版年
2024年 | 1篇 |
2023年 | 19篇 |
2022年 | 42篇 |
2021年 | 62篇 |
2020年 | 30篇 |
2019年 | 52篇 |
2018年 | 53篇 |
2017年 | 63篇 |
2016年 | 57篇 |
2015年 | 60篇 |
2014年 | 132篇 |
2013年 | 137篇 |
2012年 | 107篇 |
2011年 | 130篇 |
2010年 | 145篇 |
2009年 | 178篇 |
2008年 | 192篇 |
2007年 | 193篇 |
2006年 | 125篇 |
2005年 | 105篇 |
2004年 | 65篇 |
2003年 | 70篇 |
2002年 | 60篇 |
2001年 | 59篇 |
2000年 | 67篇 |
1999年 | 54篇 |
1998年 | 52篇 |
1997年 | 43篇 |
1996年 | 37篇 |
1995年 | 39篇 |
1994年 | 34篇 |
1993年 | 28篇 |
1992年 | 22篇 |
1991年 | 17篇 |
1990年 | 10篇 |
1989年 | 6篇 |
1988年 | 24篇 |
1987年 | 16篇 |
1986年 | 6篇 |
1985年 | 18篇 |
1984年 | 12篇 |
1983年 | 6篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1975年 | 1篇 |
排序方式: 共有2638条查询结果,搜索用时 31 毫秒
31.
In single-objective optimization it is possible to find a global optimum, while in the multi-objective case no optimal solution is clearly defined, but several that simultaneously optimize all the objectives. However, the majority of this kind of problems cannot be solved exactly as they have very large and highly complex search spaces. Recently, meta-heuristic approaches have become important tools for solving multi-objective problems encountered in industry as well as in the theoretical field. Most of these meta-heuristics use a population of solutions, and hence the runtime increases when the population size grows. An interesting way to overcome this problem is to apply parallel processing. This paper analyzes the performance of several parallel paradigms in the context of population-based multi-objective meta-heuristics. In particular, we evaluate four alternative parallelizations of the Pareto simulated annealing algorithm, in terms of quality of the solutions, and speedup. 相似文献
32.
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. 相似文献
33.
给定一组工件的加工时间与工期,要求确定这些工件在一台机器上的加.工排列,使相应的总延误达到最小,这就是总延误问题.该问题在近年已被证明是NP困难的.由Wilkermn和Irwin(1971),林勋(1983)等所研究的顺时安排法能得到相邻交换意义下的局部解.在本文中,我们进一步证明该算法能得到前移邻域意义下的局部解,并确定了该算法的性能比. 相似文献
34.
Summary The RHF and geometry optimization sections of the ab initio quantum chemistry code, GAMESS, have been optimized for a network of parallel microprocessors, Inmos T800-20 transputers, using both indirect and direct SCF techniques. The results indicate great scope for implementation of such codes on small parallel computer systems, very high efficiencies having been achieved, particularly in the cases of direct SCF and geometry optimization with large basis sets.The work, although performed upon one particular parallel system, the Meiko Computing Surface, is applicable to a wide range of parallel systems with both shared and distributed memory. 相似文献
35.
36.
带到达时间的单机排序中的资源分配问题 总被引:1,自引:0,他引:1
讨论两个单机排序的资源分配问题1|rj,pj=bj-ajuj,Cmax≤|∑uj和1|rj,prec,pj=bj-ajuj C max≤|∑uj并给出求其最优资源分配的多项式算法. 相似文献
37.
A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsible for many of the advances in constraint programming for scheduling in the past few years. Empirical results validate our approach and show, in particular, that creating and solving a subproblem containing only the activities with direct impact on the cost function and then using this solution in the main search, significantly increases the number of problems that can be solved to optimality while significantly decreasing the search time. 相似文献
38.
姜波 《新疆大学学报(理工版)》2004,21(3):325-328
无线资源管理是CDMA蜂窝移动通信系统保证业务质量(QoS)和提高频谱利用率的关键技术,本文提出了CDMA系统中无线资源管理算法的一般模型,阐述了三种重要的无线资源管理算法,即功率控制算法、呼叫接纳控制算法和分组调度算法的主要研究情况,并分析了目前研究中仍然存在和需要解决的问题。 相似文献
39.
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS (PART I:EQUAL TIMES AND COSTS) 总被引:1,自引:0,他引:1
Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O(n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented. 相似文献
40.
Lufthansa Technical Training GmbH (LTT) performs training courses for Lufthansa Technik AG as well as for several other international airlines. Courses of about 670 different types are offered of which several hundred take place each year. The course scheduling problem faced by LTT is to construct a yearly schedule which maximizes the profit margin incurred while meeting a variety of complex precedence, temporal, and resource-related constraints. A “good” operational schedule should also meet a number of additional subordinate objectives. We formalize the problem and develop a heuristic scheme along with several priority rules, as well as a local search algorithm to determine well-suited weights for weighted composite rules. The operational planning situation of 1996 served as our major test instance; additional test instances were constructed by modifying this data. Several computational experiments were carried out to evaluate the performance of the algorithms. It turned out that the best so-found schedule is substantially better in terms of the profit margin incurred than the solution manually constructed by LTT. 相似文献