全文获取类型
收费全文 | 924篇 |
免费 | 91篇 |
国内免费 | 22篇 |
专业分类
化学 | 49篇 |
力学 | 21篇 |
综合类 | 16篇 |
数学 | 844篇 |
物理学 | 107篇 |
出版年
2023年 | 3篇 |
2022年 | 24篇 |
2021年 | 34篇 |
2020年 | 22篇 |
2019年 | 21篇 |
2018年 | 18篇 |
2017年 | 41篇 |
2016年 | 47篇 |
2015年 | 27篇 |
2014年 | 53篇 |
2013年 | 60篇 |
2012年 | 42篇 |
2011年 | 40篇 |
2010年 | 35篇 |
2009年 | 71篇 |
2008年 | 62篇 |
2007年 | 56篇 |
2006年 | 55篇 |
2005年 | 50篇 |
2004年 | 35篇 |
2003年 | 25篇 |
2002年 | 34篇 |
2001年 | 19篇 |
2000年 | 10篇 |
1999年 | 12篇 |
1998年 | 19篇 |
1997年 | 23篇 |
1996年 | 18篇 |
1995年 | 15篇 |
1994年 | 6篇 |
1993年 | 8篇 |
1992年 | 6篇 |
1991年 | 5篇 |
1990年 | 2篇 |
1989年 | 4篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 5篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 4篇 |
1981年 | 4篇 |
1980年 | 5篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1973年 | 2篇 |
排序方式: 共有1037条查询结果,搜索用时 46 毫秒
41.
M. A. Mosquera I. García-Jurado M. G. Fiestras-Janeiro 《Annals of Operations Research》2008,158(1):183-188
In this note we deal with inventory games as defined in Meca et al. (Math. Methods Oper. Res. 57:483–491, 2003). In that context we introduce the property of immunity to coalitional manipulation, and demonstrate that the SOC-rule (Share the Ordering Cost) is the unique allocation rule for inventory games which satisfies
this property.
The authors acknowledge the financial support of Ministerio de Educación y Ciencia, FEDER and Xunta de Galicia through projects SEJ2005-07637-C02-02 and PGIDIT06PXIC207038PN. 相似文献
42.
在网络的任意点求解绝对中心等特殊点是网络流研究的一个难点.在目前最小费用理论的基础上引入平面几何理论,把网络等效于几何图形,建立了数学模型.通过求解,得出了网络间的最佳连接点,从而确定出盲竖井的位置.最后以云南锡业集团个旧东区两个生产平台之间的连接为一算例,得出了理想的结果,验证了该方法的有效可行性. 相似文献
43.
具有交易成本的证券投资组合选择:一种求解方法 总被引:3,自引:0,他引:3
本研究一类带交易成本证券投资组合选择的求解,在风险不超过某个阈值的假设下,我们给出一种求解方法,最后本通过实例计算表明该方法是有效的。 相似文献
44.
人力资源成本预算与控制的理论分析 总被引:6,自引:0,他引:6
本的分析是人力资源成本管理体系研究的一部分,着重于探讨在人力资源成本管理体系中,人力资源成本的预算与控制与该体系中其他几部分之间的关系,研究人力资源成本管理实践中成本预算与控制的理论基础,并提出一些新的思路。 相似文献
45.
The job-shop scheduling problem (JSP) is one of the hardest problems (NP-complete problem). In a lot of cases, the combination of goals and resource exponentially increases search space. The objective of resolution of such a problem is generally, to maximize the production with a lower cost and makespan. In this paper, we explain how to modify the objective function of genetic algorithms to treat the multi-objective problem and to generate a set of diversified “optimal” solutions in order to help decision maker. We are interested in one of the problems occurring in the production workshops where the list of demands is split into firm (certain) jobs and predicted jobs. One wishes to maximize the produced quantity, while minimizing as well as possible the makespan and the production costs. Genetic algorithms are used to find the scheduling solution of the firm jobs because they are well adapted to the treatment of the multi-objective optimization problems. The predicted jobs will be inserted in the real solutions (given by genetic algorithms). The solutions proposed by our approach are compared to the lower bound of the cost and makespan in order to prove the quality and robustness of our proposed approach. 相似文献
46.
We study the coordinated scheduling problem of hybrid batch production on a single batching machine and two-stage transportation connecting the production, where there is a crane available in the first-stage transportation that transports jobs from the warehouse to the machine and there is a vehicle available in the second-stage transportation to deliver jobs from the machine to the customer. As the job to be carried out is big and heavy in the steel industry, it is reasonable assumed that both the crane and the vehicle have unit capacity. The batching machine processes a batch of jobs simultaneously. Each batch occur a setup cost. The objective is to minimize the sum of the makespan and the total setup cost. We prove that this problem is strongly NP-hard. A polynomial time algorithm is proposed for a case where the job transportation times are identical on the crane or the vehicle. An efficient heuristic algorithm for the general problem is constructed and its tight worst-case bound is analyzed. In order to further verify the performance of the proposed heuristics, we develop a lower bound on the optimal objective function. Computational experiments show that the heuristic algorithm performs well on randomly generated problem instances. 相似文献
47.
Scheduling with setup times or setup costs plays a crucial role in todays modern manufacturing and service environments where reliable products/services are to be delivered on time. Scheduling activities profoundly depend on the times/costs required to prepare the facility for performing the activities. However, the vast majority of existing scheduling literature ignores this fact. We define and emphasize the importance, applications, and benefits of explicitly considering setup times/costs in scheduling research. Moreover, a review of the latest research on scheduling problems with setup times/costs is provided. 相似文献
48.
Nicolas Fournier 《Journal of Functional Analysis》2009,256(8):2542-2560
We consider the spatially homogeneous Landau equation of kinetic theory, and provide a differential inequality for the Wasserstein distance with quadratic cost between two solutions. We deduce some well-posedness results. The main difficulty is that this equation presents a singularity for small relative velocities. Our uniqueness result is the first one in the important case of soft potentials. Furthermore, it is almost optimal for a class of moderately soft potentials, that is for a moderate singularity. Indeed, in such a case, our result applies for initial conditions with finite mass, energy, and entropy. For the other moderately soft potentials, we assume additionally some moment conditions on the initial data. For very soft potentials, we obtain only a local (in time) well-posedness result, under some integrability conditions. Our proof is probabilistic, and uses a stochastic version of the Landau equation, in the spirit of Tanaka [H. Tanaka, Probabilistic treatment of the Boltzmann equation of Maxwellian molecules, Z. Wahrsch. Verw. Geb. 46 (1) (1978-1979) 67-105]. 相似文献
49.
In this paper, we propose a design method of guaranteed cost controllers for uncertain large-scale systems with time delays in subsystem interconnections using delayed feedback. Using the Lyapunov method, a linear matrix inequality (LMI) optimization problem is formulated to design a delayed feedback controller which minimizes the upper bound of a given quadratic cost function. A numerical example is included to illustrate the design procedures.Communicated by Q. C. ZhaoThe authors thank the Associate Editor and three anonymous referees for careful reading and useful suggestions. 相似文献
50.
Anna Ja?kiewicz Andrzej S. Nowak 《Journal of Mathematical Analysis and Applications》2006,316(2):495-509
We consider Markov control processes with Borel state space and Feller transition probabilities, satisfying some generalized geometric ergodicity conditions. We provide a new theorem on the existence of a solution to the average cost optimality equation. 相似文献