全文获取类型
收费全文 | 804篇 |
免费 | 137篇 |
国内免费 | 7篇 |
专业分类
化学 | 92篇 |
晶体学 | 1篇 |
力学 | 4篇 |
综合类 | 50篇 |
数学 | 508篇 |
物理学 | 293篇 |
出版年
2024年 | 1篇 |
2023年 | 7篇 |
2022年 | 38篇 |
2021年 | 34篇 |
2020年 | 7篇 |
2019年 | 26篇 |
2018年 | 19篇 |
2017年 | 39篇 |
2016年 | 35篇 |
2015年 | 30篇 |
2014年 | 67篇 |
2013年 | 81篇 |
2012年 | 48篇 |
2011年 | 49篇 |
2010年 | 51篇 |
2009年 | 56篇 |
2008年 | 42篇 |
2007年 | 63篇 |
2006年 | 42篇 |
2005年 | 24篇 |
2004年 | 34篇 |
2003年 | 19篇 |
2002年 | 24篇 |
2001年 | 15篇 |
2000年 | 19篇 |
1999年 | 7篇 |
1998年 | 9篇 |
1997年 | 6篇 |
1996年 | 9篇 |
1995年 | 10篇 |
1994年 | 7篇 |
1993年 | 6篇 |
1992年 | 5篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1985年 | 6篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1978年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有948条查询结果,搜索用时 15 毫秒
71.
Linn I. Sennott 《Mathematical Methods of Operations Research》1997,45(1):45-62
The Approximating Sequence Method for computation of average cost optimal stationary policies in denumerahle state Markov decision chains, introduced in Sennott (1994), is reviewed. New methods for verifying the assumptions are given. These are useful for models with multidimensional state spaces that satisfy certain mild structural properties. The results are applied to four problems in the optimal routing of packets to parallel queues. Numerical results are given for one of the models. 相似文献
72.
73.
We present an OR-based approach to support a milk collection problem in a special branch of dairy industry. The annual growth of the sector and the continuous imbalance between milk supply and demand, has urged the sector to look for a different approach to their daily milk collection problem. Specific details of the problem environment (i.e., the continuous production on supply level and the delivery conditions on demand level) gave rise to choose for a short- to medium-term planning approach. The proposed decision support system has to be considered as an efficient tool for generating stable milk collection plans which in turn also serves as an effective starting point for the vehicle routing problem. From a computational point of view it turned out that the application of Special Ordered Sets type 1 (SOS1) was very useful. Although it appears from literature that the computational advantage of SOS1 is restricted to supplementary model conditions, this study shows that these conditions are not necessarily needed. 相似文献
74.
分析研究了慢跳频/M进制频率键控(SFH/MFSK)通信系统在存在瑞利(Rayleigh)衰落和莱斯(Rician)衰落的多径延时短波信道上的性能,导出了其准确的比特差错率的表达式,表明多径干扰数及其强度对系统性能的影响.同时给出了它们的数值结果和性能曲线. 相似文献
75.
H. KamedaY. Zhang 《Mathematical and Computer Modelling》1995,22(10-12)
Optimal static routing problems in open BCMP queueing networks with state-independent arrival and service rates are studied. They include static routing problems in communication networks and optimal static load balancing problems in distributed computer systems. We consider an overall optimal policy that is the routing policy whereby the overall mean response (or sojourn) time of a job is minimized. We obtain the routing decisions of the overall optimal policy and show that they may not be unique, but that the utilization of each service center is uniquely determined by the overall optimal policy. We also consider an individually optimal policy whereby jobs are routed so that each job may feel that its own expected response time is minimized if it knows the mean delay time for each path. 相似文献
76.
Effective routing of vehicles remains a focal goal of all modern enterprises, thriving for excellence in project management with minimal investment and operational costs. This paper proposes a metaheuristic methodology for solving a practical variant of the well-known Vehicle Routing Problem, called Heterogeneous Fixed Fleet VRP (HFFVRP). Using a two-phase construction heuristic, called GEneralized ROute Construction Algorithm (GEROCA), the proposed metaheuristic approach enhances its flexibility to easily adopt various operational constraints. Via this approach, two real-life distribution problems faced by a dairy and a construction company were tackled and formulated as HFFVRP. Computational results on the aforementioned case studies show that the proposed metaheuristic approach (a) consistently outperforms previous published metaheuristic approaches we have developed to solve the HFFVRP, and (b) substantially improves upon the current practice of the company. The key result that impressed both companies’ management was the improvement over the bi-objective character of their problems: the minimization of the total distribution cost as well as the minimization of the number of the given heterogeneous number of vehicles used. 相似文献
77.
A class of service stage Petri net models whose equilibrium probabilities satisfy local balance equations is presented. Examples of their applicability include bus oriented multiprocessor interconnections, the classical dining philosophers problem and the alternating bit protocol. The natural topological space for embedding the state transition lattice for this class of SSPN is shown to be a multidimensional toroidal manifold. 相似文献
78.
Hande Yaman 《Mathematical Programming》2006,106(2):365-390
We consider the vehicle routing problem where one can choose among vehicles with different costs and capacities to serve the
trips. We develop six different formulations: the first four based on Miller-Tucker-Zemlin constraints and the last two based
on flows. We compare the linear programming bounds of these formulations. We derive valid inequalities and lift some of the
constraints to improve the lower bounds. We generalize and strengthen subtour elimination and generalized large multistar
inequalities. 相似文献
79.
In this paper, we develop and analyze a simple algorithm for scheduling variable length messages in WDM networks with a passive star coupler. We base our schemes on a star topology with centralized control and use a scheduling algorithm similar to the process management in UNIX system. Every node and message have a scheduling priority associated with them. By comparing our algorithm with random select algorithm, we find that significant improvement in performance can be achieved with very little extra cost. 相似文献
80.
AbstractThis paper considers the garbage collection problem in which vehicles with multiple compartments are used to collect the garbage. The vehicles are considered to be Alternative Fuel-powered Vehicles (AFVs). Compared with the traditional fossil fuel powered vehicles, the AFVs have limited fuel tank capacity. In addition, AFVs are allowed to refuel only at the depot. We provide a mathematical formulation and develop two solution approaches to solve the problem. The first approach is based on the saving algorithm, while the second is based on the ant colony system (ACS) metaheuristic. New problem instances have been generated to evaluate the performance of the proposed algorithms. 相似文献