全文获取类型
收费全文 | 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 毫秒
51.
In this paper, we analyze a discrete-time preemptive repeat priority queue with resampling. High-priority packets have preemptive
repeat priority, and interrupted low-priority packets are subjected to independent retransmission attempts. Both classes contain
packets with generally distributed transmission times. We show that the use of generating functions is beneficial for analyzing
the system contents and packet delay of both classes. The influence of the priority scheduling on the performance measures
is illustrated by some numerical examples.
This work has been supported by the Interuniversity Attraction Poles Programme–Belgian Science Policy. 相似文献
52.
Most successful heuristics for solving 1||∑wjTj are based on swap moves. We present an algorithm which improves the complexity of searching the swap neighborhood from O(n3) to O(n2). We show that this result also improves the complexity of the recently developed dynasearch heuristics. 相似文献
53.
54.
Eitan Altman 《Mathematical Methods of Operations Research》1993,37(2):151-170
We present in this paper several asymptotic properties of constrained Markov Decision Processes (MDPs) with a countable state space. We treat both the discounted and the expected average cost, with unbounded cost. We are interested in (1) the convergence of finite horizon MDPs to the infinite horizon MDP, (2) convergence of MDPs with a truncated state space to the problem with infinite state space, (3) convergence of MDPs as the discount factor goes to a limit. In all these cases we establish the convergence of optimal values and policies. Moreover, based on the optimal policy for the limiting problem, we construct policies which are almost optimal for the other (approximating) problems. Based on the convergence of MDPs with a truncated state space to the problem with infinite state space, we show that an optimal stationary policy exists such that the number of randomisations it uses is less or equal to the number of constraints plus one. We finally apply the results to a dynamic scheduling problem.This work was partially supported by the Chateaubriand fellowship from the French embassy in Israel and by the European Grant BRA-QMIPS of CEC DG XIII 相似文献
55.
The employment of the Zn(Se,Te) pseudo-graded contacting scheme to p-type ZnSe-based alloys contributes directly to the recent
demonstration of room temperature continuous-wave operation of II– VI green-blue laser diodes. Contact ohmicity is maintained
down to cryogenic temperatures which enabled the investigation of electrical transport properties associated with the p-type
nitrogen-doped ZnSe, Zn(S,Se), and (Zn,Mg)(S,Se). The observation of both persistent photoconductivity and a metastable population
of holes which are in thermodynamic equilibrium with hydrogenic acceptors having reduced activation energy suggests the presence
of a DX-like behavior for holes in p-type (Zn,Mg)(S,Se). 相似文献
56.
Hong Chen 《Queueing Systems》1989,5(4):281-293
We study a mixed problem of optimal scheduling and input and output control of a single server queue with multi-classes of customers. The model extends the classical optimal scheduling problem by allowing the general point processes as the arrival and departure processes and the control of the arrival and departure intensities. The objective of our scheduling and control problem is to minimize the expected discounted inventory cost over an infinite horizon, and the problem is formulated as an intensity control. We find the well-knownc is the optimal solution to our problem.Supported in part by NSF under grant ECS-8658157, by ONR under contract N00014-84-K-0465, and by a grant from AT&T Bell Laboratories.The work was done while the author was a postdoctoral fellow in the Division of Applied Sciences, Harvard University, Cambridge, Massachusetts 02138. 相似文献
57.
Hiroshi Konno 《Mathematical Programming》1988,41(1-3):185-193
We will consider a concave minimization problem associated with a series production system in which raw material is processed inm consecutive facilities. The products at some facility are either sent to the next facility or stocked in the warehouse. The amount of demand for the final products during periodi, i = 1,,n, are known in advance. Our problem is to minimize the sum of processing, holding and backlogging cost, all of which are assumed to be concave.The origin of this model is the classical economic lot size problem of Wagner and Whitin and was extensively studied by Zangwill. This model is very important from the theoretical as well as practical point of view and this is one of the very rare instances in which polynomial time algorithm has been constructed for concave minimization problems.The purpose of this paper is to extend the model further to the situation in which time lag is associated with processing at each facility. We will propose an efficient O(n
4
m) algorithm for this class of problems. 相似文献
58.
The construction of an expert-like system for machine scheduling called SCHEDULE is presented. Essential parts of SCHEDULE were developed by students in a laboratory course Operations Research on Microcomputers at the University of Karlsruhe, Germany. SCHEDULE consists of the components data base, knowledge base, inference engine, explanation facility, dialog component, and knowledge acquisition component. The knowledge base contains an algorithm base for solving different types of scheduling problems. To establish the rules of the knowledge base the well-known three-field classification of deterministic machine scheduling problems and the concept of the reduction digraph are exploited. Experiences gained during building and demonstrating SCHEDULE are reported. 相似文献
59.
In this article, we apply a novel time‐dependent discrete variable representation (TDDVR) method proposed by Barkakaty and Adhikari to investigate tunneling through an Eckart barrier. This semi‐classical method is theoretically rigorous and straightforward to implement. Among the TDDVR formulations, this report presents the first derivation of a rigorous form of quantum force (QF) for the present perspective. The validity of this semi‐classical approach is demanded based on the excellent agreement of the tunneling probability with the corresponding quantum results. © 2004 Wiley Periodicals, Inc. Int J Quantum Chem, 2004 相似文献
60.
《Operations Research Letters》2022,50(1):50-56
We address a novel truck scheduling problem arising in crossdocking logistics, in which inbound trucks carry items (pallets) which must be sorted and loaded onto outbound trucks. We minimize the utilisation of the warehouse by focusing on the synchronisation between the different related trucks. The problem is to assign the trucks to the doors of the warehouse and sequence them, in order to minimize the total time spent in the system by the pallets. We discuss the complexity of the problem, showing that even with a single door the problem is NP-hard in general, and discuss some special cases. 相似文献