全文获取类型
收费全文 | 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条查询结果,搜索用时 0 毫秒
91.
目前国家不断推进的国产自主可控信息系统建设,其核心国产计算机系统由于技术成熟度低、市场推广晚等原因,暴露出可靠性低、稳定性差的问题,直接导致系统功能无法成功应用。围绕国产化计算机系统的并行冗余架构开展研究,通过计算机系统架构的软硬件设计,以及高速缓存一致性架构、高速互联总线和三状态转换机制方法的应用,基于国产CPU 并行冗余计算机系统,可以有效消除备份计算机系统进行当班切换时,存在的切换时间延时和切换过程数据丢失的问题。通过试验验证,该系统可以完成计算机系统中CPU处理器和功能桥片故障模式的容错处理,并保障信息数据的完整性和实时性,有效提高设备中计算机系统的工作可靠性与稳定性。 相似文献
92.
为减小物资生产与配送不协调造成的成本及生产资源浪费,建立了考虑推动式生产调度的物资配送优化模型,并针对标准模拟退火算法受随机因素影响易陷入局部最优的缺点,设计带有回火与缓冷操作的改进模拟退火算法对模型求解,确定了优化的车辆配送路线以及物资生产计划。对比实验结果表明:相对于单纯的物资配送优化模型,考虑推动式生产调度的配送优化模型,能够有效减小物资滞留时间以及配送延误成本;相较于标准模拟退火算法,改进算法搜索到了更优解,且计算结果的标准差减小了93.42%,稳定性更好;同时,改进模拟退火算法具有较低的偏差率,在中小规模算例中求解质量较高,平均偏差率在0.5%以内。 相似文献
93.
Routing problems: A bibliography 总被引:1,自引:0,他引:1
This bibliography contains 500 references on four classical routing problems: the Traveling Salesman Problem, the Vehicle Routing Problem, the Chinese Postman Problem, and the Rural Postman Problem. References are presented alphabetically under a number of subheadings. 相似文献
94.
The paper examines the inventory routing problem from the perspective of the present value of the cash flow associated with the distribution of a commodity such as propane. We analyze this problem for both deterministic and stochastic customer demands and validate our results on data from a real life distribution operation of propane. The analysis based on the present value of the cash flow indicates that optimization of propane deliveries based on efficiency/cost criteria alone will generate inferior solutions and it would be more advantageous for the company to set deliveries for a large percentage of the customers based on the present value of cash flow. In addition, in the case of stochastic demands, deliveries based on the cash flow consideration will tend to reduce the number of stockouts (i.e. improve both profit and service). 相似文献
95.
96.
97.
Christian Prins 《Journal of Mathematical Modelling and Algorithms》2002,1(2):135-150
The basic Vehicle Routing Problem (VRP) consists of computing a set of trips of minimum total cost, to deliver fixed amounts of goods to customers with a fleet of identical vehicles. Few papers address the case with several types of vehicles (heterogeneous fleet). Most of them assume an unlimited number of vehicles of each type, to dimension the fleet from a strategic point of view. This paper tackles the more realistic tactical or operational case, with a fixed number of vehicles of each type, and the optional possibility for each vehicle to perform several trips. It describes several heuristics, including a very efficient one that progressively merges small starting trips, while ensuring that they can be performed by the fleet. This heuristic seeks to minimize the number of required vehicles as a secondary objective. It outperforms classical VRP heuristics, can easily handle various constraints, and gives very good initial solutions for a tabu search method. The real case of a French manufacturer of furniture with 775 destination stores is presented. 相似文献
98.
We present an introductory review of recent work on the control of open queueing networks. We assume that customers of different types arrive at a network and pass through the system via one of several possible routes; the set of routes available to a customer depends on its type. A route through the network is an ordered set of service stations: a customer queues for service at each station on its route and then leaves the system. The two methods of control we consider are the routing of customers through the network, and the sequencing of service at the stations, and our aim is to minimize the number of customers in the system. We concentrate especially on the insights which can be obtained from heavy traffic analysis, and in particular from Harrison's Brownian network models. Our main conclusion is that in many respects dynamic routingsimplifies the behaviour of networks, and that under good control policies it may well be possible to model the aggregate behaviour of a network quite straightforwardly.Supported by SERC grant GR/F 94194. 相似文献
99.
Designing delivery districts for the vehicle routing problem with stochastic demands 总被引:4,自引:0,他引:4
Dag Haugland Sin C. Ho Gilbert Laporte 《European Journal of Operational Research》2007,180(3):997-1010
This paper considers the problem of designing districts for vehicle routing problems with stochastic demands. In particular, demands are assumed to be uncertain at the time when the districts are made, and these are revealed only after the districting decisions are determined. Tabu search and multistart heuristics for this stochastic districting problem are developed and compared. Computational results show that tabu search is superior over multistart. 相似文献
100.
Masakiyo Miyazawa 《Queueing Systems》1997,25(1-4):45-75
We consider characterizations of departure functions in Markovian queueing networks with batch movements and state-dependent
routing in discrete-time and in continuous-time. For this purpose, the notion of structure-reversibility is introduced, which
means that the time-reversed dynamics of a queueing network corresponds with the same type of queueing network. The notion
is useful to derive a traffic equation. We also introduce a multi-source model, which means that there are different types
of outside sources, to capture a wider range of applications. Characterizations of the departure functions are obtained for
any routing mechanism of customers satisfying a recurrent condition. These results give a unified view to queueing network
models with linear traffic equations. Furthermore, they enable us to consider new examples as well as show limited usages
of this kind of queueing networks.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献